A Lexicalized Tree Adjoining Grammar for French and its Relevance to Language Teaching

We present a computational grammar for French written in the formalism of lexicalized Tree Adjoining Grammars. This can be viewed as a data-base consisting of both a sizable lexicon (3000 words) and the corresponding syntactic structures. A parser has also been designed which is currently being used for analysing and disambiguating a large range of French sentences provided by the user. A similar lexical grammar has been designed for English with approximately the same linguistic coverage. We are currently working on a transfer system that matches the corresponding entries in both languages. Although we do not present any proper educational tool, we aim at exploring the possible uses of our system for teaching French to English speaking students.

[1]  Joseph A. Goguen,et al.  Discrete-Time Machines in Closed Monoidal Categories. I , 1975, J. Comput. Syst. Sci..

[2]  Merryanna L. Swartz,et al.  Issues for Tutoring Knowledge in Foreign Language Intelligent Tutoring Systems , 1992 .

[3]  Michael B. Twidale,et al.  Conceptual Modelling in Error Analysis in Computer-Assisted Language Learning Systems , 1992 .

[4]  Maurice Gross,et al.  Lexicon - Grammar The Representation of Compound Words , 1986, COLING.

[5]  Laurence Danlos.  Support verb constructions: linguistic properties, representation, translation , 1992 .

[6]  Anne Abeillé,et al.  Lexical and Syntactic Rules in a Tree Adjoining Grammar , 1990, ACL.

[7]  M. Gross.  Les bases empiriques de la notion de predicat semantique (The Empirical Foundations of the Notion of Semantic Predicate). , 1981 .

[8]  Aravind K. Joshi,et al.  Lexicalized TAGs, Parsing and Lexicons , 1989, HLT.

[9]  Anne Abeillé,et al.  Parsing Idioms in Lexicalized TAGs , 1989, EACL.

[10]  Aravind K. Joshi,et al.  An Earley-Type Parsing Algorithm for Tree Adjoining Grammars , 1988, ACL.

[11]  Anne Abeillé,et al.  Parsing French with Tree Adjoining Grammar: some linguistic accounts , 1988, COLING.

[12]  Stuart M. Shieber,et al.  Synchronous Tree-Adjoining Grammars , 1990, COLING.

[13]  Aravind K. Joshi,et al.  Parsing Strategies with ‘Lexicalized’ Grammars: Application to Tree Adjoining Grammars , 1988, COLING.

[14]  Anne Abeillé,et al.  A Lexicalized Tree Adjoining Grammar for English , 1990 .

[15]  A. Abeillé,et al.  Une grammaire lexicalisée d'arbres adjoints pour le français : application à l'analyse automatique , 1991 .

[16]  Maurice Gross,et al.  Une classification des phrases « figées » du français , 1982 .

[17]  Aravind K. Joshi,et al.  Feature Structures Based Tree Adjoining Grammars , 1988, COLING.

[18]  Brian MacWhinney,et al.  The Competition Model and Foreign Language Acquisition , 1992 .

[19]  Aravind K. Joshi,et al.  A study of tree adjoining grammars , 1987 .

[20]  Aravind K. Joshi,et al.  Tree Adjunct Grammars , 1975, J. Comput. Syst. Sci..

[21]  J. Giry-Schneider,et al.  Les nominalisations en français : l'opérateur "faire" dans le lexique , 1978 .

[22]  M. Maratsos,et al.  The internal language of children's syntax : The ontogenesis and representation of syntactic categories , 1980 .

[23]  Michael P Maratsos,et al.  The internal language of children's syntax: The nature and ontogenesis of syntactic categories , 1980 .

[24]  Aravind K. Joshi,et al.  Using Lexicalized Tags for Machine Translation , 1990, COLING.

[25]  Aravind K. Joshi,et al.  The Relevance of Tree Adjoining Grammar to Generation , 1987 .