Fast and compact updating algorithms of a double-array structure

Information Sciences

Volumn 159, Issue 1-2, 2004, Pages 53-67

  Morita, Kazuhiro ^a   Atlam, El Sayed ^a,b   Fuketa, Masao ^a   Tsuda, Kazuhiko ^a   Aoe, Jun Ichi ^a  

^a UNIVERSITY OF TOKUSHIMA   (Japan)

^b Tanta University   (Egypt)

Author keywords

Dictionary; Digital search; Information retrieval; Key retrieval strategies; Natural language processing

Indexed keywords

ALGORITHMS; BIBLIOGRAPHIES; COMPUTER SIMULATION; DATA STRUCTURES; DATABASE SYSTEMS; GLOSSARIES; NATURAL LANGUAGE PROCESSING SYSTEMS; PARALLEL PROCESSING SYSTEMS;

DIGITAL SEARCH; DYNAMIC RETRIEVAL METHODS;

INFORMATION RETRIEVAL;

EID: 0348233329     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(03)00189-0     Document Type: Article

References (10)

1. Aho A., Corasick M. Efficient string matching: an aid to bibliographic search. Communication of ACM. 18(6):1975;333-340.
2. Aho A.V., Sethi R., Ullman J.D. Compilers - Principles, Techniques, and Tools. 1986;Addison-Wesley, Reading, MA. Chapter 3 and 4.
3. Aoe J. A fast digital search algorithm using a double-array structure. IECE Transactions. J71-D(4):1988;1592-1600.
4. Aoe J. An efficient digital search algorithm by using a double-array structure. IEEE Transactions on Software Engineering. SE-15(9):1989;1066-1077.
5. Aoe J., Morimoto K., Shishibori M., Park K.-H. A trie compaction algorithm for a large set of keys. IEEE Transactions on Knowledge and Data Engineering. 8(3):1996;476-491.
6. Fredkin E. Trie memory. Communication of ACM. 3(9):1960;490-500.
7. Japan Electronic Dictionary Research Institute, Ltd., EDR Electronic Dictionary, 1996.
8. D.E. Knuth, The Art of Computer Programming, 1973 [Chapter 6].
9. M.E. Lesk, Lex-a lexical analyzer generator, CSTR 39, Bell Lab., N.J., 1975, pp. 1-13.
10. Peterson J.L. Computer Programs for Spelling Correction. Lecture Notes in Computer Science. 1980;Springer-Verlag, New York.