scispace - formally typeset
Search or ask a question
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
More filters
Book
31 Jul 1993
TL;DR: The aim of this monograph is to clarify the role of notation in the development of grammar and to provide a framework for the subsequent development of formal grammar-based criticism.
Abstract: Foreword by Fernando Pereira. Preface. 1. Context-Free Grammars. 2. Bunch Notation. 3. Grammar Interpretations. 4. Recursive Descent. 5. Grammar Transformations. 6. Recursive Ascent. 7. Parse Forest. 8. Attribute Grammars. 9. LR Parsers. 10. Some Notes. References. Index.

38 citations

Journal Article
TL;DR: The paper discusses some classes of contextual grammars---mainly those with "maximal use of selectors"---giving some arguments that these Grammars can be considered a good model for natural language syntax, and some ideas for associating a structure to the generated words, in the form of a tree, or of a dependence relation.
Abstract: The paper discusses some classes of contextual grammars---mainly those with "maximal use of selectors"---giving some arguments that these grammars can be considered a good model for natural language syntax.A contextual grammar produces a language starting from a finite set of words and interatively adding contexts to the currently generated words, according to a selection procedure: each context has associated with it a selector, a set of words; the context is adjoined to any occurrence of such a selector in the word to be derived. In grammars with maximal use of selectors, a context is adjoined only to selectros for which no superword is a selector. Maximality can be defined either locally or globally (with respect to all selectors in the grammar). The obtained families of languages are incomparable with that of Chomsky context-free languages (and with other families of languages that contain linear languages and that are not "too large"; see Section 5) and have a series of properties supporting the assertion that these grammars are a possible adequate model for the syntax of natural languages. They are able to straightforwardly describe all the usual restrictions appearing in natural (and artificial) languages, which lead to the non-context-freeness of these languages: reduplication, crossed dependencies, and multiple agreements; however, there are center-embedded constructions that cannot be covered by these grammars.While these assertions concern only the weak generative capacity of contextual grammars, some ideas are also proposed for associating a structure to the generated words, in the form of a tree, or of a dependence relation (as considered in descrpitive linguistics and also similar to that in link grammars).

38 citations

Journal ArticleDOI
TL;DR: The well-known parsing algorithm for context-free grammars due to Valiant (1975) is analyzed and extended to handle the more general Boolean Grammars, which are context- free grammar augmented with conjunction and negation operators in the rules.

38 citations

Journal ArticleDOI
TL;DR: The goal is to make it possible for linguistically untrained programmers to write linguistically correct application grammars encoding the semantics of special domains, and the type system of GF guarantees that grammaticality is preserved.
Abstract: The Grammatical Framework GF is a grammar formalism designed for multilingual grammars. A multilingual grammar has a shared representation, called abstract syntax, and a set of concrete syntaxes that map the abstract syntax to different languages. A GF grammar consists of modules, which can share code through inheritance, but which can also hide information to achieve division of labour between grammarians working on different modules. The goal is to make it possible for linguistically untrained programmers to write linguistically correct application grammars encoding the semantics of special domains. Such programmers can rely on resource grammars, written by linguists, which play the role of standard libraries. Application grammarians use resource grammars through abstract interfaces, and the type system of GF guarantees that grammaticality is preserved. The ongoing GF resource grammar project provides resource grammars for ten languages. In addition to their use as libraries, resource grammars serve as an experiment showing how much grammar code can be shared between different languages.

38 citations

Book ChapterDOI
26 Mar 2015
TL;DR: This article reviews the main classes of probabilistic grammars and points to some active areas of research.
Abstract: Formal grammars are widely used in speech recognition, language translation, and language understanding systems. Grammars rich enough to accommodate natural language generate multiple interpretations of typical sentences. These ambiguities are a fundamental challenge to practical application. Grammars can be equipped with probability distributions, and the various parameters of these distributions can be estimated from data (e.g., acoustic representations of spoken words or a corpus of hand-parsed sentences). The resulting probabilistic grammars help to interpret spoken or written language unambiguously. This article reviews the main classes of probabilistic grammars and points to some active areas of research.

38 citations


Network Information
Related Topics (5)
Graph (abstract data type)
69.9K papers, 1.2M citations
85% related
Parsing
21.5K papers, 545.4K citations
85% related
Time complexity
36K papers, 879.5K citations
84% related
Semantics
24.9K papers, 653K citations
82% related
Tree (data structure)
44.9K papers, 749.6K citations
81% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202315
202225
20217
20205
20196
201811