Results 181 to 190 of about 21,526 (215)
SemTAG: a platform for semantic construction with Tree Adjoining Grammars
, 2007 Yannick Parmentier
openalex +1 more source
Lagrangian Based Approaches for Lexicalized Tree Adjoining Grammar Parsing
, 2018 Caio Corro
openalex +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
1997
In this paper, we will describe a tree generating system called tree-adjoining grammar (TAG) and state some of the recent results about TAGs. The work on TAGs is motivated by linguistic considerations. However, a number of formal results have been established for TAGs, which we believe, would be of interest to researchers in formal languages and ...
Yves Schabes, Aravind K. Joshi
openaire +2 more sources
In this paper, we will describe a tree generating system called tree-adjoining grammar (TAG) and state some of the recent results about TAGs. The work on TAGs is motivated by linguistic considerations. However, a number of formal results have been established for TAGs, which we believe, would be of interest to researchers in formal languages and ...
Yves Schabes, Aravind K. Joshi
openaire +2 more sources
Lexical ambiguity in tree adjoining grammars
Information Processing Letters, 1990Abstract These are at least two ways of handling lexical ambiguity in a tree adjoining grammar. One of them seems to be computationally intractable. The other is computationally efficient. This paper describes these two methods with algorithms and their analyses.
Barrett R. Bryant, P. Dey, Tadao Takaoka
openaire +2 more sources
Combining contextual grammars and tree adjoining grammars
Grammars, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
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 +2 more sources
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 +2 more sources
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 +2 more sources
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 +2 more sources
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 +2 more sources
WORD ORDER VARIATION AND TREE‐ADJOINING GRAMMAR
Computational Intelligence, 1994In many head‐final languages such as German, Hindi, Japanese, and Korean, but also in some other languages such as Russian, arguments of a verb can occur in any order. Furthermore, arguments can occur outside of their clause (“long‐distance scrambling”).
Young-Suk Lee, Owen Rambow
openaire +2 more sources