A compression algorithm using integrated record information for translation dictionaries

Information Sciences

Volumn 165, Issue 3-4, 2004, Pages 171-186

  Kadoya, Y ^a   Fuketa, M ^a   Atlam, El Sayed ^a   Morita, K ^a   Sumitomo, T ^a   Aoe, J ^a  

^a UNIVERSITY OF TOKUSHIMA   (Japan)

Author keywords

Dictionary search; Double array; Individual dictionaries compound words; Natural language dictionaries; Natural language processing system; Trie structure

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DATA COMPRESSION; DATABASE SYSTEMS; ENCODING (SYMBOLS); GLOSSARIES; NATURAL LANGUAGE PROCESSING SYSTEMS;

DICTIONARY SEARCH; INDIVIDUAL DICTIONARIES COMPOUND WORDS; NATURAL LANGUAGE DICTIONARIES; TRIE STRUCTURE;

DATA PROCESSING;

EID: 5144222837     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2003.07.018     Document Type: Article

References (33)

1. Aho A.V., Corasick M.J. Efficient string matching: an aid to bibliographic search. Commun. ACM. 18(6):1975;333-340.
2. Aho A.V., Hopcroft J.E., Ullman J.D. Data Structures and Algorithms. 1983;Addison-Wesley, Reading, MA. pp. 163-169.
3. Aho A.V., Sethi R., Ullman J.D. Compilers Principles, Techniques and Tools. 1986;Addison-Wesley, Reading, MA. (Chapter 2).
4. Ai-Suwaiyel M., Horowitz E. Algorithms for Trie compaction. ACM Trans. Database Syst. 9(2):1984;243-263.
5. Aoe J. A method for improving string pattern matching machines. IEEE Trans. Software Eng. SE-10(1):1984;116-120.
6. Aoe J., Morimoto K., Shishibori M., Park Ki-H. A Trie compaction method for a large set of keys. IEEE Trans. Knowledge Data. KDE-10(9):1996;116-120.
7. Aoe J. A fast digital search algorithm using a double-array structure. Trans., IEICE J. 71-D(9):1988;1592-1600. (in Japanese).
8. Aoe J. An efficient digital search algorithm by using a double-array structure. IEEE Trans. Software Eng. SE-15(9):1989;1066-1077.
9. Aoe J. A practical method for compressing sparse matrices with invariant entries. Int. J. Comput. Math. 12(2):1982;97-111.
10. Aoe J., Morimoto K., Hase M. An algorithm of compressing common suffixes for Trie structures. Trans., IEICE J. 75-D-II(4):1992;. (in Japanese).
11. Aoe J., Morimoto K., Sato T. An efficient implementation of Trie structure. Software-Pract. Experience. 22(9):1992;695-721.
12. Enbody R.J., Du H.C. Dynamic hashing schemes. ACM Comput. Surveys. 20(20):1988;85-113.
13. Electronic Dictionary Research EDR Version 2.0, An explanatory leaflet, Japan Electronic Dictionary Laboratory, 1999.
14. Fagin R., Nievergelt J., Pippenge N., Strong H.R. Extensible hashing - a fast access method for dynamic files. ACM Trans. Database Syst. 4(9):1979;315-344.
15. Fredkin E. Trie memory. Commun. ACM. 3(9):1960;490-500.
16. Fredman M.L., Komlos J., Szemeredi E. Storing a sparse table with. O(1) worst case access time Commun. ACM. 31(3):1984;538-544.
17. N. Hiroshi, Thesaurus Dictionary. The National Institute for Japanese Language, 1996.
18. Iida T., Nakamura Y. A cancellation method for different character of katakana by using transformation rules and prohibition rules. Trans., IEICE. 35(11):1994;2276-2282. (in Japanese).
19. Ikehara S. Japanese Vocabulary Systems. 1997;Iwanami.
20. Jonge W.D., Tanenbaum A.S., Reit R.P. Two access methods using compact binary trees. IEEE Trans. Software Eng. SE-13(7):1987;799-810.
21. Knuth D.E. The art of computer programming 3. Sort. Search. 1973;481-505.
22. Kubota J., Shouda Y., Kawai M., Tamagawa R. Combination method of katakana spelling: a detection method of katakana spelling by graph comparison and pre-classification. Trans., IEICE. 35(12):1994;2745-2751.
23. Litwin W.A., Roussopolulos N., Levy G., Hong W. Trie hashing with controlled load. IEEE Trans. Software Eng. SE-17(7):1991;678-691.
24. Mainichi Newspaper Publishing Company: CD - Mainichi Newspaper, Nichigai Association, 1994-1998.
25. Maly K. Compressed Tries. Commun. ACM. 19(7):1976;409-415.
26. T. Matsukawa, J. Nakamura, M. Nagao, An algorithm of word clustering from co-occurrence data using DM decomposition and statical estimation, Research report; Information Processing Society of Japan, 1989, 89-NL-72-8.
27. K. Morimoto, J. Aoe, A method for building morphological and co-occurrence dictionaries by Trie structures, Research report; Information Processing Society of Japan, 1991, 91-NL-85-3 (in Japanese).
28. Nagao M., Tuji J., Yamagami A., Tatebe S. Data-structure of a large japanese dictionary and morphological analysis by using it. J. Inf. Process. Soc. Jpn. 19(6):1978;514-521. (in Japanese).
29. A. Nakajima, R. Sugimura, Japanese morphological analyzer with TRIE structure dictionary and graph stack for local ambiguity packing, in: 39th National Conference on Information Processing Society of Japan, 1F-4, 1989 (in Japanese).
30. Peterson J.L. Computer Programs for Spelling Correction. Lecture Notes in Computer Science. 1980;Springer-Verlag, New York.
31. Shishibori M., Tsuda K., Aoe J. A method for the expansion and contraction of texts size by using the string replacement algorithm. J. Inf. Process. Soc. Jpn. J. 77-DII(2):1994;380-387. (in Japanese).
32. Standish T.A. Data Structure Techniques. 1980;Addison-Wesley, Reading, MA. (Chapter 3).
33. Tarjan R.E., Yao A.C. Storing a sparse table. Commun. ACM. 2(11):1979;606-611.