• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to project page

1994 Fiscal Year Final Research Report Summary

A Fast Retrieval Algorithm of Trie Structures for a Large Set of Keys

Research Project

Project/Area Number 04650317
Research Category

Grant-in-Aid for General Scientific Research (C)

Allocation TypeSingle-year Grants
Research Field 情報工学
Research InstitutionThe University of Tokushima

Principal Investigator

AOE Junichi  The University of Tokushima, Faculty of Engineering, Professor, 工学部, 教授 (90108853)

Project Period (FY) 1992 – 1994
KeywordsNatural Language Processing Systems / Dictionary Retrieval / Key Searching / Trie Structures / Data Structures
Research Abstract

In natural language processing, it needs to build a huge size dictionary. Thus, a fast and compact date stracture is required to develope practical natural language processing syatems : a automatic sentence, or document, a generation system, an automatic proof reading system, a machine translation system, a word processing system, and so on. A trie structure is a good technique that can search the longest applicable key and all prefix keys for a given string, but it takes a huge space for a large set of keys.
This project porposed a compaction algorithm of trie structures and a fast retrieval algorithm even if a large set of keys. The approach proposed in this project is analyzed by theoretical evaluation and the evaluation is supported by a variety of sets of keys : EDR Japanese dictionaries, English dictionaries and compound words.
The idea presented can apply to dictionaries of many natural language processing systems, so a more practical evaluation should be done in the future research.

  • Research Products

    (8 results)

All Other

All Publications (8 results)

  • [Publications] K.Morimoto,J.Aoe: "A Method of Compressing Trie Structures" Software-Practice & Experience-. 24. 265-288 (1994)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] K-I,Park,J.Aoe: "Automatic Key Search Algorithm Selection" Information Retrieval. 28. 13-25 (1994)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] J.Aoe,K.Morimoto: "A Trie Compaction Algorithm for a Lanre Set of Keys" IEEE Trans.Know-ledge & Data Engineering. (発表予定). (1995)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] J.Aoe: "Computer Algorithms-String Patterm Matching" IEEE Computer Society Press, 285 (1994)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] K.Morimoto, J.Aoe and H.Iriguchi18GB01 : A Method of Compressing Trie Structures: Software Practice & Experience. Vol.24, No.3. 265-288 (1994)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] K-I,Park K.Morimoto and J.Aoe: "Automatic Key Search Algorithm Selection Using Expert Knowledge" Information Retrieval. Vol.28, No.3. 13-25 (1994)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] J.Aoe, K.Morimoto and M.Shishibori: "A Trie Compaction Algorithms for Large Set of Keys" IEEE Transactions on Knowledge and Data Engineering. (1995)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] J.Aoe: "Computer Algorithms-String Pattern Maching-" IEEE Computer Society Press. 1-286 (1994)

    • Description
      「研究成果報告書概要(欧文)」より

URL: 

Published: 1996-04-15  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi