A study of tree adjoining grammars
A study of tree adjoining grammars
An Earley-type parsing algorithm for Tree Adjoining Grammars
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
Parsing strategies with 'lexicalized' grammars: application to tree adjoining grammars
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Parsing idioms in lexicalized TAGs
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
Lexical and syntactic rules in a Tree Adjoining Grammar
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Using lexicalized tags for machine translation
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Parsing strategies with 'lexicalized' grammars: application to tree adjoining grammars
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Structure sharing in lexicalized tree-adjoining grammars
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
An evaluation of lexicalization in parsing
HLT '89 Proceedings of the workshop on Speech and Natural Language
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
On Using Semi-Dyck Sets To Analyse Coupled-Context-Free Languages
Fundamenta Informaticae
Parsing models for identifying multiword expressions
Computational Linguistics
| Hi-index | 0.00 |
We present the first sizable grammar written for TAG. We present the linguistic coverage of our grammar, and explain the linguistic reasons which lead us to choose the particular representations. We show that TAG formalism provides sufficient constraints for handling most of the linguistic phenomena, with minimal linguistic stipulations. We first state the basic structures needed for parsing French, with a particular emphasis on TAG's extended domain of locality that enables us to state complex sub-categorization phenomena in a natural way. We then give a detailed analysis of sentential complements, because it has lead us to introduce substitution in the formalism, and because TAG makes interesting predictions. We discuss the different linguistic phenomena corresponding to adjunction and to substitution respectively. We then move on to support verb constructions, which are represented in a TAG in a simpler way than the usual double analysis. It is the first time support verb constructions are handled in a parser. We lastly give an overview of the treatment of adverbs, and suggest a treatment of idioms which make them fall into the same representations as 'free' structures.