By Topic

An efficient dictionary access method for morphological analysis

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Ando, K. ; Dept. of Inf. Sci. & Intelligent Syst., Tokushima Univ., Japan ; Tsuji, T. ; Fuketa, M. ; Aoe, J.-I.

Proposes an efficient dictionary access method for morphological analysis of oriental languages by extending Aho and Corasick's (1990) pattern matching machine. The proposed method is a simple and efficient algorithm to find all possible substrings in an input sentence and during a single pass. It stores the relations of grammatical connectivity of adjacent words into the output functions. Therefore, the costs of checking connections between the adjacent words can be reduced by using the connectivity relations. Furthermore, the method of constructing the grammatical connectivity relations is described. Finally, the proposed method is verified by theoretical analysis and an experimental estimation is supported by a computer simulation with a 100,000-word dictionary. From the simulation results, it turns out that the proposed method is 49.9% faster (in CPU time) than the traditional trie approach. In addition, the number of candidates for checking connections was 25.5% less than that of the original morphological analysis

Published in:

Systems, Man, and Cybernetics, 1998. 1998 IEEE International Conference on  (Volume:3 )

Date of Conference:

11-14 Oct 1998