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
05 Oct 2011
TL;DR: This paper demonstrates how existing distributional learning techniques for context-free grammars can be adapted to simple context- free tree Grammars in a straightforward manner once the necessary notions and properties for string languages have been redefined for trees.
Abstract: This paper demonstrates how existing distributional learning techniques for context-free grammars can be adapted to simple context-free tree grammars in a straightforward manner once the necessary notions and properties for string languages have been redefined for trees. Distributional learning is based on the decomposition of an object into a substructure and the remaining structure, and on their interrelations. A corresponding learning algorithm can emulate those relations in order to determine a correct grammar for the target language.
20 citations
TL;DR: An efficient, O(n), parsing algorithm for languages generated by dynamically programmed grammars, so-called DPLL(k) grammARS, is presented and can be used for analysis of complex trend functions describing the behaviour of an industrial equipment.
20 citations
10 Aug 1998
TL;DR: In this article, a precompilation technique for wide-coverage lexicalized grammars is described, which allows some of the computation associated with different structures to be shared.
Abstract: In wide-coverage lexicalized grammars many of the elementary structures have substructures in common. This means that in conventional parsing algorithms some of the computation associated with different structures is duplicated. In this paper we describe a precompilation technique for such grammars which allows some of this computation to be shared. In our approach the elementary structures of the grammar are transformed into finite state automata which can be merged and minimised using standard algorithms, and then parsed using an automaton-based parser. We present algorithms for constructing automata from elementary structures, merging and minimising them, and string recognition and parse recovery with the resulting grammar.
20 citations
01 Jun 1998
TL;DR: Most results from LR parsing can be extended to positional grammars while preserving its well known efficiency, thanks to this analogy.
Abstract: Positional grammars naturally extend context-free grammars for string languages to grammars for visual languages by considering new relations in addition to string concatenation. Thanks to this analogy, most results from LR parsing can be extended to positional grammars while preserving its well known efficiency. The positional grammar model is the underlying formalism of the VLCC (Visual Language Compiler-Compiler) system for the automatic generation of visual programming environments. VLCC inherits and extends to the visual field, concepts and techniques of compiler generation tools like YACC. Due to their nature, the positional grammars are a very suitable formalism for processing languages integrating visual and textual constructs.
20 citations
24 Aug 2008
TL;DR: An open-source parsing environment (Tubingen Linguistic Parsing Architecture, TuLiPA) is presented which uses Range Concatenation Grammar (RCG) as a pivot formalism, thus opening the way to the parsing of several mildly context-sensitive formalisms.
Abstract: In this paper, we present an open-source parsing environment (Tubingen Linguistic Parsing Architecture, TuLiPA) which uses Range Concatenation Grammar (RCG) as a pivot formalism, thus opening the way to the parsing of several mildly context-sensitive formalisms. This environment currently supports tree-based grammars (namely Tree-Adjoining Grammars (TAG) and Multi-Component Tree-Adjoining Grammars with Tree Tuples (TT-MCTAG)) and allows computation not only of syntactic structures, but also of the corresponding semantic representations. It is used for the development of a tree-based grammar for German.
20 citations