论文信息 - Representation of Finite Utterances and the Automatic Parsing of Texts

Representation of Finite Utterances and the Automatic Parsing of Texts

We describe the use of finite state automata for the description of natural languages. We demonstrate the use of this model of grammar through linguistically varied examples, from time adverbials and sentential determiners to elementary sentences of a lexicon-grammar.

M. Gross | Maurice Gross

[1] Maurice Gross,et al. Notes du cours de syntaxe , 1976 .

[2] Christian Leclère,et al. La structure des phrases Simples en francais: Constructions Intransitives , 1979 .

[3] A. M. Ramer. Mathematical Methods in Linguistics , 1992 .

[4] G. Harman. Generative Grammars without Transformation Rules: A Defense of Phrase Structure , 1963 .

[5] Jean-Paul Boons. Métaphore et baisse de la redondance , 1971 .

[6] Inn-Chull Choi. A Comparability Study on SNUCREPT and TOEIC , 1995 .

[7] Christian Leclère,et al. Organisation du lexique-grammaire des verbes français , 1990 .

[8] Emmanuel Roche,et al. Une représentation par automate fini des textes et des propriétés transformationnelles des verbes , 1993 .

[9] Robert J. Fouser. Problems and Prospects in Third Language Acquisition Research , 1995 .

[10] William A. Woods,et al. Computational Linguistics Transition Network Grammars for Natural Language Analysis , 2022 .

[11] Gilbert Harman. Generative Grammars Without Transformation Rules , 1987 .

[12] Dominique Perrin,et al. Finite Automata , 1958, Philosophy.

[13] Maurice Gross,et al. La structure des phrases simples en français , 1976 .