20
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

A link trie structure of storing multiple attribute relationships for natural language dictionaries

, , &
Pages 463-476 | Received 14 Sep 1998, Published online: 19 Mar 2007

References

  • Kirkpatrick , B. 1987 . Roget's Thesaurus of English Words and Phrases New Edition , Longman .
  • Makino , H and Kizawa , M . 1981 . An Automatic Translation System of Non-segmented Kana Sentences into Kanji-Kana Sentences and its Homonym Analysis . Transactions of the IPSJ , 22 ( 1 ) : 59 – 67 . in Japanese
  • Koizumi T. Funaki M. Honda K. Nitta Y. Tsukamoto H. “Dictionary about Usage of Japanese Basic Verbs” (in Japanese) Taisyukan-Syoten 1989
  • Nagao , M. , Tsuji , J. and Nakamura , J. 1986 . Machine Translation from Japanese into English . Proceeding of the IEEE , 74 ( 7 ) : 993 – 1012 .
  • Ohshima , Y. , Abe , M. , Yuura , K and Takeiehi , N. 1986 . A Disambiguation Method in Kana-to-Kanji Conversion Using Case Frame Grammar . Transactions of the IPSJ , 27 ( 7 ) : 679 – 687 . in Japanese
  • Kita , K. , Kawabata , T. and Saito , H. 1991 . “ GLR parsing in hidden Markov Model ” . In Generalized LR parsing , Edited by: Tomita , M. 153 – 164 . Kluwer Academic Publishers .
  • Kirschning , I. , Tomabechi , H. , Koyama , M. and Aoe , J. 1996 . The Time-Slicing Paradigm-A Connectionist Method for Continuous Speech Recognition . International Journal of Information Sciences , 93 ( 8 ) : 133 – 158 .
  • Morimoto , K. , Iriguchi , H. and Aoe , J. 1993 . A Retrieval Algorithm of Dictionaries by Using Two Trie Structures . Trans. IEICE , J76-D-II ( 11 ) : 2374 – 2383 . in Japanese
  • Aoe , J , Morimoto , K. , Shishibori , M. and Park , K.-H. 1996 . A Trie Compaction Algorithm for a Large Set of Keys . IEEE Transactions on Knowledge and Data Engineering , 8 ( 3 ) : 476 – 491 .
  • Ai-Suwaiyel , M. and Horowitz , E. 1984 . Algorithms for trie compaction . ACM Trans. Database Syst. , 9 ( 2 ) : 243 – 263 .
  • Fredkin , E. 1960 . Trie memory . Commun. ACM. , 3 ( 9 ) : 490 – 500 .
  • Knuth , D. E. 1973 . The Art of Computer Programming , Vol. 3 , 481 – 505 . Reading, Mass : Addison-Wesley . Sorting and Searching
  • Tarjan , R. E. and Yao , A. C. 1979 . Storing a sparse table . Commun. ACM , 22 ( 11 ) : 606 – 611 .
  • Aho , A. V. , Hopcroft , J. E. and Ullman , J. D. 1983 . Data Structures and Algorithms , 163 – 169 . Reading, Mass : Addison-Wesley .
  • Aoe , J. 1988 . A fast digital search algorithm using a double-array structure . Trans. IEICE , J71-D ( 9 ) : 1592 – 1600 . in Japanese
  • Aoe , J. 1989 . An efficient digital search algorithm by using a double-array structure . IEEE Trans. Software Eng. , SE-15 ( 9 ) : 1066 – 1077 .
  • Aoe , J. , Morimoto , K. and Hase , M. 1992 . An algorithm of compressing common suffixes for trie structures . Trans. IEICE , J75-D-II ( 4 ) in Japanese
  • Aoe , J. , Morimoto , K. and Sato , T. 1992 . An efficient implementation of trie structure . Software-Pract and Expr. , 22 ( 9 ) : 695 – 721 .
  • Morimoto K. Aoe J. A method for building morphological and cooccurrence dictionaries by trie structures” (in Japanese) Research report; Information Processing Society of Japan, 91-NL-85-3 1991
  • Japanese Electronic Dictionary Research Institute, Ltd.)(in Japanese 1993 Specification for EDR Electronic Dictionary
  • Mc Arthur , T. 1981 . Longman Lexicon of Contemporary English , Longman .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.