Results 1  10
of
136
Single Tree Grammars
, 1992
"... A contextfree grammar is a singletree grammar (STG) if every nonterminal symbol has at most one production rule whose right hand side contains nonterminal symbols. Various properties of this class of grammars are studied. Although most properties of STG's are undecidable, every linear STG ..."
Abstract
 Add to MetaCart
A contextfree grammar is a singletree grammar (STG) if every nonterminal symbol has at most one production rule whose right hand side contains nonterminal symbols. Various properties of this class of grammars are studied. Although most properties of STG's are undecidable, every linear
On Inferring Linear SingleTree Languages
 Journal of HigherOrder and Symbolic Computation
, 1998
"... We consider the inferability of linear singletree languages. We are able to show that if the terminal productions of the corresponding grammars obey a simple restriction, then the languages generated are inferable from positive samples only. Moreover, we solve an open problem posed by Greibach, Shi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We consider the inferability of linear singletree languages. We are able to show that if the terminal productions of the corresponding grammars obey a simple restriction, then the languages generated are inferable from positive samples only. Moreover, we solve an open problem posed by Greibach
Taxonomy of xml schema languages using formal language theory
 EXTREME MARKUP LANGUAGES
, 2001
"... On the basis of regular tree grammars, we present a formal framework for XML schema languages. This framework helps to describe, compare, and implement such schema languages in a rigorous manner. Our main results are as follows: (1) a simple framework to study three classes of tree languages (local, ..."
Abstract

Cited by 234 (6 self)
 Add to MetaCart
On the basis of regular tree grammars, we present a formal framework for XML schema languages. This framework helps to describe, compare, and implement such schema languages in a rigorous manner. Our main results are as follows: (1) a simple framework to study three classes of tree languages (local
Principles and implementation of deductive parsing
 JOURNAL OF LOGIC PROGRAMMING
, 1995
"... We present a system for generating parsers based directly on the metaphor of parsing as deduction. Parsing algorithms can be represented directly as deduction systems, and a single deduction engine can interpret such deduction systems so as to implement the corresponding parser. The method generaliz ..."
Abstract

Cited by 190 (5 self)
 Add to MetaCart
generalizes easily to parsers for augmented phrase structure formalisms, such as definiteclause grammars and other logic grammar formalisms, and has been used for rapid prototyping of parsing algorithms for a variety of formalisms including variants of treeadjoining grammars, categorial grammars
Graph Grammars and Tree Transducers
 Proc. CAAP 94
, 1994
"... . Regular tree grammars can be used to generate graphs, by generating expressions that denote graphs. Topdown and bottomup tree transducers are a tool for proving properties of such graph generating tree grammars. 1 Introduction The most wellknown way of generating graphs is to replace a sub ..."
Abstract

Cited by 22 (3 self)
 Add to MetaCart
. Regular tree grammars can be used to generate graphs, by generating expressions that denote graphs. Topdown and bottomup tree transducers are a tool for proving properties of such graph generating tree grammars. 1 Introduction The most wellknown way of generating graphs is to replace a
Supertagging: An Approach to Almost Parsing
 Computational Linguistics
, 1999
"... this paper, we have proposed novel methods for robust parsing that integrate the flexibility of linguistically motivated lexical descriptions with the robustness of statistical techniques. Our thesis is that the computation of linguistic structure can be localized if lexical items are associated wit ..."
Abstract

Cited by 168 (23 self)
 Add to MetaCart
distributions of supertag cooccurrences collected from a corpus of parses. We have explored these ideas in the context of Lexicalized TreeAdjoining Grammar (LTAG) framework. The supertags in LTAG combine both phrase structure information and dependency information in a single representation. Supertag
Macro Tree Transducers, Attribute Grammars, and MSO Definable Tree Translations
 Inform. and Comput
, 1998
"... A characterization is given of the class of tree translations definable in monadic second order logic (MSO), in terms of macro tree transducers. The first main result is that the MSO definable tree translations are exactly those tree translations realized by macro tree transducers (MTTs) with reg ..."
Abstract

Cited by 58 (23 self)
 Add to MetaCart
) with regular lookahead that are single use restricted. For this the single use restriction known from attribute grammars is generalized to MTTs. Since MTTs are closed under regular lookahead, this implies that every MSO definable tree translation can be realized by an MTT. The second main result
Tree Unification Grammar
, 1989
"... Tree Unification Grammar is a declarative unificationbased linguistic framework. The basic grammar staures of this framework arc partial descriptions of trees, and the framework requires only a single grammar rule to combine these partial descriptions. Using this framework, constraints associated w ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Tree Unification Grammar is a declarative unificationbased linguistic framework. The basic grammar staures of this framework arc partial descriptions of trees, and the framework requires only a single grammar rule to combine these partial descriptions. Using this framework, constraints associated
Unifying Synchronous TreeAdjoining Grammars and
 In Proceedings of the 11th Conference of the European Chapter of the Association for Computational Linguistics (EACL2006
, 2006
"... We place synchronous treeadjoining grammars and tree transducers in the single overarching framework of bimorphisms, continuing the unification of synchronous grammars and tree transducers initiated by Shieber (2004). Along the way, we present a new definition of the treeadjoining grammar d ..."
Abstract
 Add to MetaCart
We place synchronous treeadjoining grammars and tree transducers in the single overarching framework of bimorphisms, continuing the unification of synchronous grammars and tree transducers initiated by Shieber (2004). Along the way, we present a new definition of the treeadjoining grammar
Random Access to GrammarCompressed Strings
, 2011
"... Let S be a string of length N compressed into a contextfree grammar S of size n. We present two representations of S achieving O(log N) random access time, and either O(n · αk(n)) construction time and space on the pointer machine model, or O(n) construction time and space on the RAM. Here, αk(n) is ..."
Abstract

Cited by 31 (3 self)
 Add to MetaCart
), where occ is the number of occurrences of P in S. Finally, we are able to generalize our results to navigation and other operations on grammarcompressed trees. All of the above bounds significantly improve the currently best known results. To achieve these bounds, we introduce several new techniques
Results 1  10
of
136