An algorithm for dynamic processing of dawg's

SCOPE: Algorithms, Information storage and retrieval. A trie is a search tree obtained by merging the common suffixes of the key set. It has the advantage that all keys as prefixes of an input string can be retrieved with high speed. When the size of the key set is enlarged, however, a problem arise...

Full description

Saved in:

Bibliographic Details
Published in:	International journal of computer mathematics Vol. 54; no. 3-4; pp. 155 - 173
Main Authors:	Park, Ki-Hong, Aoe, Jun-Ichi, Morimoto, Katsushi, Shishibori, Masami
Format:	Journal Article
Language:	English
Published:	Abingdon Gordon and Breach Science Publishers S.A 01.01.1994 Taylor and Francis
Subjects:	Algorithms Applied sciences Computer science; control theory; systems Computing Reviews (CR) Categories DAWG Exact sciences and technology F.2.2[Nonnumerical Algorithms and problems] General aspects General Terms H.3.3 [Information search and Retrieval] Information and communication sciences Information processing and retrieval Information retrieval. Graph Information science. Documentation Logical and linguistic tools Natural language dictionary Performance E.1 Data Structure[Graphs] Retrieval algorithm Sciences and techniques of general use Theoretical computing Trie structure Dictionaries Suffix inerging Tree(graph) Information retrieval Natural language Data structure Dynamic method Search algorithm
ISSN:	0020-7160, 1029-0265
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!