Abstract
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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Church K. W. (1983): “A finite-State Parser for Use in Speech Recognition”, ACL 83, the MIT Press.
Gross M. (1977): Grammaire transformationnelle du français: syntaxe du nom, Larousse, Paris (Reprint: Cantilène, Malakoff, 1986).
Gross M., Perrin D.(1989): “Electronic Dictionnaries and Automata in Computationnal Linguistics”, Lecture Notes in Computer Science, 377, Springer.
Harris Z. S. (1968): Mathematical Structures of Language, Interscience Publishers.
KarttunenL., Kaplan R. M., ZaenenA. (1992): “Two-level Morphology with Composition”, COL1NG 92.
Kaplan R. M., Kay M. (1994) “Regular Models of Phonological Rule systems”, Computational Linguistics 20.
Laporte E. (1988): Méthodes algorithmiques et lexicales de phonétisation de textes: applications au français, Doctoral dissertation in Computer Science, University Paris 7.
Le Bidois G. (1935): Syntaxe du français moderne, Paris, Picard.
Maurel D. (1989): Reconnaissance de séquences de mots par automate, adverbes de date du Français, Doctoral dissertation in Computer Science, University Paris 7.
Maurel D. (1990): “Recognizing sequences of words by automata; the case of French adverbials of date”, International Conference on Computational Lexicography, Balatonfüred, Hungary.
Maurel D. (1992): “Preanalysis of French adverbials of date”, 4th European Workshop Semantics of Time, Space, and Movement and Spacio-temporal reasoning, University of Toulouse, France.
Maurel D., Mohri M. (1994): “French Temporal Expressions: Recognition, Parsing and Real Computation”, 10 OED Conference, Waterloo, Ontario, Canada.
Maurel D., Mohri M. (1995): “Computation of French Temporal Expressions to query database”, NLDB'95.
Mohri M. (1993): Analyse et représentation par automates de structures syntaxiques composées, Doctoral dissertation in Computer Science, University Paris 7.
Mehryar Mohri, 1994. Compact Representations by Finite-State Transducers. In Proceedings of the 32nd Annual Meeting of the Association for Computational Linguistics (ACL 94).
Pereira F., Wright R. N. (1991): “Finite-State Approximation of Phrase Structure Grammars”, Proceedings of the 29st Meeting of the Association for Computational Linguistics.
Revuz D. (1991): Dictionnaires et lexiques — Méthodes et algorithmes, Doctoral dissertation in Computer Science, University Paris 7.
Roche E. (1993): Analyse syntaxique transformationnelle de français par transducteurs et lexique-grammaires, Doctoral dissertation in Computer Science, University Paris 7.
Silberztein M. (1993): Dictionnaires électroniques et analyse automatique de textes — Le système INTEX, Paris, Masson.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maurel, D. (1997). Building automaton on schemata and acceptability tables. In: Raymond, D., Wood, D., Yu, S. (eds) Automata Implementation. WIA 1996. Lecture Notes in Computer Science, vol 1260. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63174-7_7
Download citation
DOI: https://doi.org/10.1007/3-540-63174-7_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63174-3
Online ISBN: 978-3-540-69205-8
eBook Packages: Springer Book Archive