论文信息 - Building Automata on Schemata and Acceptability Tables: Application to French Data Adverbials

Building Automata on Schemata and Acceptability Tables: Application to French Data Adverbials

This paper presents a lexical finite states automaton to parse French Date Adverbials. To build this automaton, I have developed an original model of representation (Schemata and Acceptability Tables), the computation and use of which I will explain in this paper.

Denis Maurel

[1] Denis Maurel. Reconnaissance des séquences de mots par automate. Cas des adverbes de date du français , 1989 .

[2] Max Silberztein,et al. Dictionnaires électroniques et analyse automatique de textes : le système intex , 1993 .

[3] Kenneth Ward Church. A Finite-State Parser for Use in Speech Recognition , 1983, ACL.

[4] Mehryar Mohri. Compact Representations by Finite-State Transducers , 1994, ACL.

[5] Martin Kay,et al. Regular Models of Phonological Rule Systems , 1994, CL.

[6] Maurice Gross,et al. Grammaire transformationnelle du francais: syntaxe du nom , 1979 .

[7] Denis Maurel,et al. Computation of French Temporal Expressions to Query Databases , 1995, NLDB.

[8] Mehryar Mohri. Analyse et representation par automates de structures syntaxiques composees. Application aux completives , 1993 .

[9] Eric Laporte. Méthodes algorithmiques et lexicales de phonétisation de textes : applications au français , 1988 .

[10] Rebecca N. Wright,et al. Finite-State Approximation of Phrase Structure Grammars , 1991, ACL.

[11] Zellig S. Harris,et al. Mathematical structures of language , 1968, Interscience tracts in pure and applied mathematics.

[12] Maurice Gross,et al. Electronic Dictionaries and Automata in Computational Linguistics , 1987, Lecture Notes in Computer Science.

[13] Lauri Karttunen,et al. Two-Level Morphology with Composition , 1992, COLING.