Topic
Tree-adjoining grammar
About: Tree-adjoining grammar is a research topic. Over the lifetime, 2491 publications have been published within this topic receiving 57813 citations.
Papers published on a yearly basis
Papers
More filters
Book•
01 Jan 1994
TL;DR: This chapter discusses the basic theory of rigid grammars, a theorem of finite elasticity, and the learnability theorem, which describes the structure of grammar according to k-valued and least-valued values.
Abstract: 1. Introduction 2. Learnability theorem 3. A theorem of finite elasticity 4. Classical categorial grammar 5. Basic theory of rigid grammars 6. Learning from structures I: rigid, k-valued, and least-valued grammar 7. Learning from structures II: Subclasses of the optimal grammars 8. Learning from strings 9. Variations 10. Conclusions Appendix.
50 citations
TL;DR: This work investigates this type of graph grammar and shows that the use of edge labels (together with the NCE feature) is responsible for some new properties, and proves that the class of (boundary) eNCE languages properly contains the closure of theclass of ( boundary) NLC languages under node relabelings.
49 citations
TL;DR: Four different kinds of grammars that can define crossing dependencies in human language are compared here and some results relevant to the viability of mildly context sensitive analyses and some open questions are reviewed.
49 citations
Posted Content•
TL;DR: In this paper, an account for coordination can be constructed using the derivation structures in a lexicalized tree adjoining grammar (LTAG) that preserves the notion of fixed constituency in the LTAG lexicon while providing the flexibility needed for coordination.
Abstract: In this paper we show that an account for coordination can be constructed using the derivation structures in a lexicalized Tree Adjoining Grammar (LTAG). We present a notion of derivation in LTAGs that preserves the notion of fixed constituency in the LTAG lexicon while providing the flexibility needed for coordination phenomena. We also discuss the construction of a practical parser for LTAGs that can handle coordination including cases of non-constituent coordination.
49 citations