Per-node optimization of finite-state mechanisms for natural language processing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2588, Issue , 2003, Pages 221-224

  Troussov, Alexander ^a   O'Donovan, Brian ^a   Koskenniemi, Seppo ^b   Glushnev, Nikolay ^a  

^a IBM RESEARCH   (Ireland)

^b IBM Software Group   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; GRAPH THEORY; INDEXING (MATERIALS WORKING); TEXT PROCESSING;

FINITE STATE; GRAPH-THEORETIC; NATURAL LANGUAGE PROCESSING; PROGRAMMING TECHNIQUE; SEQUENTIAL SEARCH;

NATURAL LANGUAGE PROCESSING SYSTEMS;

EID: 35248846500     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36456-0_22     Document Type: Article

References (3)

1. Kiraz, G.: Compressed storage of sparse finite-state transducers. In O. Boldt, H. Jurgensen, and L. Robbins, editors, Workshop on Implementing Automata WIA99 - Pre-Proceedings, Potsdam, July, 1999.
2. Goctz, T., Wunsch, H.: An Abstract Machine Approach to Finite State Transduction over Large Character Sets. Finite State Methods in Natural Language Processing 2001. ESSLLI Workshop, August 20-24, Helsinki.
3. Ciura, M. G., Deorowicz, S.: How to squeeze a lexicon. Software Practice and Experience, vol. 31, n. 11, pp. 1077-1090, 2001.