Finite state lazy operations in NLP

Authors:
Franck Guingne;Florent Nicart
Affiliations:
L. I. F. A. R. Université de Rouen, Faculté des Sciences et des Techniques, Mont Saint Aignan Cedex, France and Xerox Research Center Europe, Meylan;L. I. F. A. R. Université de Rouen, Faculté des Sciences et des Techniques, Mont Saint Aignan Cedex, France and Xerox Research Center Europe, Meylan
Venue:
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Year:
2002

Citing 7
Cited 1

Algorithms for finding patterns in strings

Handbook of theoretical computer science (vol. A)
Automata, Languages, and Machines

Automata, Languages, and Machines
A Rational Design for a Weighted Finite-State Transducer Library

WIA '97 Revised Papers from the Second International Workshop on Implementing Automata
On some applications of finite-state automata theory to natural language processing

Natural Language Engineering
Regular expressions for language engineering

Natural Language Engineering
Constructing lexical transducers

COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
The proper treatment of optimality in computational phonology: plenary talk

FSMNLP '09 Proceedings of the International Workshop on Finite State Methods in Natural Language Processing

Implementation concepts in vaucanson 2

CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.01

Visualization

Abstract

Finite state networks can represent dictionaries and lexical relations. Traditional finite-state operations like composition can produce huge networks with prohibitive computation space and time. For a subset of finite state operations, these drawbacks can be avoided by using virtual networks, which rely on structures that are partially built on demand. This paper addresses the implementation of virtual network operations in xfst (XEROX Finite State Technology software). The example of "priority union" which is particularly useful in NLP, is developed.