Per-Node Optimization of Finite-State Mechanisms for Natural Language (2003)
| Venue: | Processing,” Computational Linguistics and Intelligent Text Processing, Lecture Notes in Computer Science N 2588 |
| Citations: | 4 - 0 self |
BibTeX
@INPROCEEDINGS{Troussov03per-nodeoptimization,
author = {Er Troussov and Nikolay Glushnev},
title = {Per-Node Optimization of Finite-State Mechanisms for Natural Language},
booktitle = {Processing,” Computational Linguistics and Intelligent Text Processing, Lecture Notes in Computer Science N 2588},
year = {2003},
pages = {223--227},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. Finite-state processing is typically based on structures that allow for efficient indexing and sequential search. However, this “rigid ” framework has several disadvantages when used in natural language processing, especially for non-alphabetical languages. The solution is to systematically introduce polymorphic programming techniques that are adapted to particular cases. In this paper we describe the structure of a morphological dictionary implemented with finite-state automata using variable or polymorphic node formats. Each node is assigned a format from a predefined set reflecting its utility in corpora processing as measured by a number of graph theoretic metrics and statistics. Experimental results demonstrate that this approach permits a 52 % increase in the performance of dictionary look-up. 1
Citations
No citations identified.
