A compression method using link-trie structure for natural language dictionaries

Author

Oono, Masato ; Fuketa, Masako ; Inada, Yutaka ; Murakami, Yo ; Aoe, Jun-Ichi

Author_Institution

Dept. of Inf. Sci. & Intell. Syst., Univ. of Tokushima, Tokushima, Japan

fYear

2006

Firstpage

1

Lastpage

4

Abstract

A trie structure is a key search method that is frequently used in the field of natural language systems and database systems. Morita presented an efficient data structure for collocation information using trie structure. This structure stores two basic words into a trie and defines link information by a link function. This paper presents how to apply Morita´s method into general key-set and compress trie. Presented method divides a key into several parts and defines link information between keys. From simulation results, it turned out that presented method is 30% smaller than Conventional method in space capacity.

Keywords

database management systems; dictionaries; natural language processing; Morita method; collocation information; compression method; data structure; database systems; link-trie structure; natural language dictionaries; Data engineering; Deductive databases; Dictionaries; Electronic mail; Information retrieval; Intelligent structures; Intelligent systems; Natural languages; Search methods; Systems engineering and theory;

fLanguage

English

Publisher

ieee

Conference_Titel

Computing & Informatics, 2006. ICOCI '06. International Conference on

Conference_Location

Kuala Lumpur

Print_ISBN

978-1-4244-0219-9

Electronic_ISBN

978-1-4244-0220-5

Type

conf

DOI

10.1109/ICOCI.2006.5276556

Filename

5276556