Multi-tape Automata with Symbol Classes

2006 ◽  
pp. 126-136 ◽  
Author(s):  
F. Nicart ◽  
J. -M. Champarnaud ◽  
T. Csáki ◽  
T. Gaál ◽  
A. Kempe
Keyword(s):  
Symbol Classes

LABELLING MULTI-TAPE AUTOMATA WITH CONSTRAINED SYMBOL CLASSES

2007 ◽  
Vol 18 (04) ◽  
pp. 847-858
Author(s):  
FLORENT NICART ◽  
JEAN-MARC CHAMPARNAUD ◽  
TIBOR CSÁKI ◽  
TAMÁS GAÁL ◽  
ANDRÉ KEMPE
Keyword(s):  
Natural Language Processing ◽  
Natural Language ◽  
Language Processing ◽  
Constraint Satisfaction ◽  
Performance Test ◽  
Constraint Satisfaction Problem ◽  
Finite State Automata ◽  
New Model ◽  
Finite State ◽  
Symbol Classes

Rational relations are a powerful model used in many domains such as natural language processing. In this article, we propose a new model of finite state automata: multi-tape automata with symbol classes and identity or non-identity constraints. This model generalizes classical multi-tape automata, as well as automata and transducers with extended alphabet. We define this model in terms of a constraint satisfaction problem and discuss a problem occurring when handling the projection operation. Finally, we describe its implementation and results of a performance test.

Sign in / Sign up

Export Citation Format

Share Document