An Efficient Digital Search Algorithm by Using a Double-Array Structure
IEEE Transactions on Software Engineering
Designing a Portable Natural Language Database Query System
ACM Transactions on Database Systems (TODS)
Efficient string matching: an aid to bibliographic search
Communications of the ACM
Computer Algorithms: Key Search Strategies
Computer Algorithms: Key Search Strategies
A Trie Compaction Algorithm for a Large Set of Keys
IEEE Transactions on Knowledge and Data Engineering
COLING '86 Proceedings of the 11th coference on Computational linguistics
Backtracking-free dictionary access method for Japanese morphological analysis
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
| Hi-index | 0.01 |
This paper presents an efficient dictionary structure of Part-of-Speech(POS) Tagging for Japanese/Korean by extending Aho and Corasick's pattern matching machine. The proposed method is a simple and fast algorithm to find all possible morphemes in an input sentence and in a single pass, and it stores the relations of grammatical connectivity of neighboring morphemes into the output functions. Therefore, the proposed method can reduce both costs of the dictionary lookup and the connection check to find the most suitable word segmentation. From the simulation results, it turns out that the proposed method was 21.8% faster (CPU time) than the general approach using the trie structure. Concerning the number of candidates for checking connections, it was 27.4% less than that of the original morphological analysis.