GENERATION OF EQUIFREQUENT GROUPS OF WORDS USING A GENETIC ALGORITHM

Genetic algorithms are a class of non-deterministic algorithms that derive from Darwinian evolution and that provide good, though not necessarily optimal, solutions to combinatorial problems. We describe their application to the identification of characteristics that occur approximately equifrequent...

Full description

Saved in:
Bibliographic Details
Published in:Journal of documentation 1994-09, Vol.50 (3), p.213-232
Main Authors: ROBERTSON, ALEXANDER M., WILLETT, PETER
Format: Article
Language:English
Subjects:
Automatic text analysis
Exact sciences and technology
Genetic algorithms
Information and communication sciences
Information processing and retrieval
Information retrieval. Man machine relationship
Information science. Documentation
Sciences and techniques of general use
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Genetic algorithms are a class of non-deterministic algorithms that derive from Darwinian evolution and that provide good, though not necessarily optimal, solutions to combinatorial problems. We describe their application to the identification of characteristics that occur approximately equifrequently in a database, using two different methods for the creation of the chromosome data structures that lie at the heart of a genetic algorithm. Experiments with files of English and Turkish text suggest that the genetic algorithm developed here can produce results superior to those produced by existing non-deterministic algorithms; however, the results are inferior to those produced by an existing deterministic algorithm.
ISSN:0022-0418
1758-7379
DOI:10.1108/eb026931