ScholarLens Back to search
2006•Unpublished venueOpen access

The weak generative capacity of linear tree-adjoining grammars

David Chiang

Open full text 2 citations

Abstract

Linear tree-adjoining grammars (TAGs), by analogy with linear context-free grammars, are tree-adjoining grammars in which at most one symbol in each elementary tree can be rewritten (adjoined or substituted at). Uemura et al. (1999), calling these grammars simple linear TAGs (SL-TAGs), show that they generate a class of languages incommensurate with the context-free languages, and can be recognized in O(n4) time.

Open-access reader

About this research paper

What this paper is about

Linear tree-adjoining grammars (TAGs), by analogy with linear context-free grammars, are tree-adjoining grammars in which at most one symbol in each elementary tree can be rewritten (adjoined or substituted at). Uemura et al. (1999), calling these grammars simple linear TAGs (SL-TAGs), show that they generate a class of languages incommensurate with the context-free languages, and can be recognized in O(n4) time.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Linear tree-adjoining grammars (TAGs), by analogy with linear context-free grammars, are tree-adjoining grammars in which at most one symbol in each elementary tree can be rewritten (adjoined or substituted at). Uemura et al. (1999), calling these grammars simple linear TAGs (SL-TAGs), show that they generate a class of languages incommensurate with the context-free languages, and can be recognized in O(n4) time.

Key concepts: Tree-adjoining grammar, Indexed grammar, L-attributed grammar, Rule-based machine translation, Embedded pushdown automaton, Context-free grammar, Tree (set theory), Context-sensitive grammar

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
The weak generative capacity of linear tree-adjoining grammars — Research Paper | ScholarLens