ISSN:
1432-0770
Source:
Springer Online Journal Archives 1860-2000
Topics:
Biology
,
Computer Science
,
Physics
Notes:
Abstract Given a finite set of strings of elements (e.g. “words” or “syllables” written in terms of “letters”, which may be true alphabetic symbols, or markers for features which put together form the “word” describing an object), the problem is posed of memorizing the strings not in lexicographic order, but by grouping them into classes, each of which can be taken as an entry into a multilayered, fast-access memory; this is equivalent to memorizing, rather than the strings, the structural rules which characterize them. This problem is solved by means of a heuristic algorithm, which gives results that stay invariant under arbitrary permutations of the elements; heuristics may affect optimality, not exactness of the solution, and provides considerable gains in computing costs. The exposition, for convenience of the reader, is self-contained, although this work is part of a more general program on form and language analysis.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00289167
Permalink