Results 181 to 190 of about 21,874 (220)
Some of the next articles are maybe not open access.
LFG and Tree-Adjoining Grammar
2023This chapter gives an introduction to Tree-Adjoining Grammar (TAG) and draws some comparisons with Lexical Functional Grammar (LFG). It is primarily aimed at those familiar with LFG who are looking to learn about TAG and see where the two formalisms differ\slash overlap, but the comparisons will also be of interest to those coming from a TAG ...
openaire +1 more source
Combining Contextual Grammars and Tree Adjoining Grammars
Grammars, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Lexical ambiguity in tree adjoining grammars
Information Processing Letters, 1990zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dey, Pradip +2 more
openaire +1 more source
2010
In this section we introduce TAG. Besides giving the definition of the formalism, we briefly mention the linguistic principles underlying TAG in order to give an idea of the way TAG is used for natural language processing. The formal definitions are taken from (Kallmeyer, 2009).
openaire +1 more source
In this section we introduce TAG. Besides giving the definition of the formalism, we briefly mention the linguistic principles underlying TAG in order to give an idea of the way TAG is used for natural language processing. The formal definitions are taken from (Kallmeyer, 2009).
openaire +1 more source
Tree-Adjoining Grammars and Genetic Programming
2015A significant recent addition to the repertoire of grammar-based approaches to genetic programming (GP) is the use of tree-adjunct and tree-adjoining grammars (TAG). A TAG is a tree-generating grammar, and as such is a natural representation for GP and for computer programs.
Anthony Brabazon +2 more
openaire +1 more source
Parsing Tree Adjoining Grammars
2010This chapter treats different parsing techniques for TAG. We will extend the standard algorithms for CFG, i.e., present a CYK parser, different types of Earley algorithms and LR parsing for TAG.
openaire +1 more source
Phase theory and Tree Adjoining Grammar
Lingua, 2006Abstract The phase-based approach to grammatical derivation and one rooted in the Tree Adjoining Grammar (TAG) formalism share the idea that the derivation of a complex sentence is divided into separate derivations of local domains. These approaches differ, however, in their treatment of syntactic dependencies spanning across such local domains ...
openaire +1 more source
Parallel parsing of Tree Adjoining Grammars on the Connection Machine
International Journal of Parallel Programming, 1992Tree adjoining grammars (TAGs) were introduced by \textit{A. K. Joshi}, \textit{L. S. Levy}, \textit{M. Takahashi} (1975) mainly as a formalism for natural language specification. The expressive power of TAG formal languages proved to be situated strictly between context-free and context-sensitive languages.
Palis, Michael A., Wei, David S. L.
openaire +1 more source
The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-Free Tree Grammars
Journal of Logic, Language and Information, 2010Context-free tree grammars have rules that allow to replace a non-terminal node in a tree by a whole tree. They are widely used in different areas in computer science. (Non-strict) tree adjoining grammars, originating from the examination of natural languages, only allow the restricted replacement of a node in a tree by a complete tree drawn from a ...
Kepser, Stephan, Rogers, Jim
openaire +1 more source
On the relation between multi-depth grammars and tree adjoining grammars
1999Summary: Multi-depth grammars were introduced for describing some non-context free features of programming languages. They generate a hierarchy of languages, have intesting closure properties, are simpler than other grammar formalisms and have a very natural accepting device, called multi-pushdown automaton.
CHERUBINI, ALESSANDRA +1 more
openaire +2 more sources