Results 191 to 200 of about 29,707 (219)

Efficient Algorithms for Recognizing Weighted Tree-Adjoining Languages

Conference on Empirical Methods in Natural Language Processing, 2023
The class of tree-adjoining languages can be characterized by various two-level formalisms, consisting of a context-free grammar (CFG) or pushdown automaton (PDA) controlling another CFG or PDA.
Alexandra Butoi, Tim Vieira, Ryan Cotterell, David Chiang   +3 more
semanticscholar   +1 more source

An analysis of clausal coordination using synchronous tree adjoining grammar

Journal of Logic and Computation, 2018
This paper presents a novel analysis of clausal coordination with shared arguments using synchronous tree adjoining grammar (STAG), a pairing of a tree adjoining grammar (TAG) for syntax and a TAG for semantics.
Chung-hye Han, Sara Williamson, Logan Born, Anoop Sarkar   +3 more
semanticscholar   +1 more source

Using synchronous tree adjoining grammar to model the typology of bound variable pronouns

Journal of Logic and Computation, 2015
This paper presents a novel analysis of bound variable anaphora using Synchronous Tree Adjoining Grammar (STAG), a pairing of a Tree Adjoining Grammar (TAG) for syntax and a TAG for semantics.
D. Storoshenko, Chung-hye Han
semanticscholar   +1 more source

Proposing TAGbank as a Corpus of Tree-Adjoining Grammar Derivations

arXiv.org
The development of lexicalized grammars, particularly Tree-Adjoining Grammar (TAG), has significantly advanced our understanding of syntax and semantics in natural language processing (NLP).
Jungyeul Park
semanticscholar   +1 more source

Tree-Adjoining Grammars

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

Lexical ambiguity in tree adjoining grammars

Information Processing Letters, 1990
Abstract 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

Tree Adjoining Grammars

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

Tree-Adjoining Grammars and Genetic Programming

2015
A 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, Michael O'Neill, Seán McGarraghy   +2 more
openaire   +2 more sources

Parsing Tree Adjoining Grammars

2010
This 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

Phase theory and Tree Adjoining Grammar

Lingua, 2006
Abstract 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