Volume: 18, Issue: 4(2007)
pp. 847-858 DOI: 10.1142/S0129054107005017
|
|
Abstract |
Full Text (PDF, 681KB)
|
References
|
 |
| Title: |
LABELLING MULTI-TAPE AUTOMATA WITH CONSTRAINED SYMBOL CLASSES |
| Author(s): |
FLORENT NICART
LLI–IRISA, ENSSAT, 6 rue de Kérampont, 22305 Lannion Cedex, FranceJEAN-MARC CHAMPARNAUD
LITIS (Université de Rouen), Avenue de l'Université, 76800 Saint Etienne du Rouvray, FranceTIBOR CSÁKI
Department of Computer Science, Institute of Mathematics and Informatics, University of Debrecen, H-4010, Debrecen, HungaryTAMÁS GAÁL
Xerox Research Centre Europe – Grenoble Laboratory, 6 chemin de Maupertuis, 38240 Meylan, FranceANDRÉ KEMPE
This co-author changed affiliation after completing his contribution to this paper and can now be reached at Yahoo! Search Technologies, 17 rue Guillaume Tell, 75017 Paris.
Xerox Research Centre Europe – Grenoble Laboratory, 6 chemin de Maupertuis, 38240 Meylan, France
|
| History: |
Received 2 November 2006
Accepted 7 April 2007
|
| Abstract: |
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. |
|
|
