English
Related papers

Related papers: Anchoring a Lexicalized Tree-Adjoining Grammar for…

200 papers

We argue in this paper that many common adverbial phrases generally taken to signal a discourse relation between syntactically connected units within discourse structure, instead work anaphorically to contribute relational meaning, with…

Computation and Language · Computer Science 2007-05-23 Bonnie Webber , Matthew Stone , Aravind Joshi , Alistair Knott

Multiple (simple) context-free tree grammars are investigated, where "simple" means "linear and nondeleting". Every multiple context-free tree grammar that is finitely ambiguous can be lexicalized; i.e., it can be transformed into an…

Formal Languages and Automata Theory · Computer Science 2017-07-13 Joost Engelfriet , Andreas Maletti , Sebastian Maneth

We present a new framework for compositional distributional semantics in which the distributional contexts of lexemes are expressed in terms of anchored packed dependency trees. We show that these structures have the potential to capture…

Computation and Language · Computer Science 2016-08-26 David Weir , Julie Weeds , Jeremy Reffin , Thomas Kober

The precise formulation of derivation for tree-adjoining grammars has important ramifications for a wide variety of uses of the formalism, from syntactic analysis to semantic interpretation and statistical language modeling. We argue that…

cmp-lg · Computer Science 2009-09-25 Yves Schabes , Stuart M. Shieber

In this paper we present a fully lexicalized grammar formalism as a particularly attractive framework for the specification of natural language grammars. We discuss in detail Feature-based, Lexicalized Tree Adjoining Grammars (FB-LTAGs), a…

cmp-lg · Computer Science 2008-02-03 B. Srinivas , Dania Egedi , Christy Doran , Tilman Becker

The derivation trees of a tree adjoining grammar provide a first insight into the sentence semantics, and are thus prime targets for generation systems. We define a formalism, feature-based regular tree grammars, and a translation from…

Computation and Language · Computer Science 2015-03-13 Sylvain Schmitz , Joseph Le Roux

In codeswitching contexts, the language of a syntactic head determines the distribution of its complements. Mahootian 1993 derives this generalization by representing heads as the anchors of elementary trees in a lexicalized TAG. However,…

cmp-lg · Computer Science 2008-02-03 Shahrzad Mahootian , Beatrice Santorini

We address the issue of how to associate frequency information with lexicalized grammar formalisms, using Lexicalized Tree Adjoining Grammar as a representative framework. We consider systematically a number of alternative probabilistic…

cmp-lg · Computer Science 2008-02-03 John Carroll , David Weir

Since the early Sixties and Seventies it has been known that the regular and context-free languages are characterized by definability in the monadic second-order theory of certain structures. More recently, these descriptive…

cmp-lg · Computer Science 2016-08-31 James Rogers

This document describes a sizable grammar of English written in the TAG formalism and implemented for use with the XTAG system. This report and the grammar described herein supersedes the TAG grammar described in an earlier 1995 XTAG…

Computation and Language · Computer Science 2012-08-27 XTAG Research Group

Using feature-based Tree Adjoining Grammar (TAG), this paper presents linguistically motivated analyses of constructions claimed to require multi-component adjunction. These feature-based TAG analyses permit parsing of these constructions…

cmp-lg · Computer Science 2008-02-03 B. A. Hockey , B. Srinivas

With a growing need for robust and general discourse structures in many downstream tasks and real-world applications, the current lack of high-quality, high-quantity discourse trees poses a severe shortcoming. In order the alleviate this…

Computation and Language · Computer Science 2022-10-19 Patrick Huber , Giuseppe Carenini

Semantic theories of natural language associate meanings with utterances by providing meanings for lexical items and rules for determining the meaning of larger units given the meanings of their parts. Meanings are often assumed to combine…

cmp-lg · Computer Science 2008-02-03 Mary Dalrymple , John Lamping , Fernando Pereira , Vijay Saraswat

Discourse relations bind smaller linguistic elements into coherent texts. However, automatically identifying discourse relations is difficult, because it requires understanding the semantics of the linked sentences. A more subtle challenge…

Computation and Language · Computer Science 2015-04-29 Yangfeng Ji , Jacob Eisenstein

In a lexicalized grammar formalism such as Lexicalized Tree-Adjoining Grammar (LTAG), each lexical item is associated with at least one elementary structure (supertag) that localizes syntactic and semantic dependencies. Thus a parser for a…

cmp-lg · Computer Science 2008-02-03 Aravind K. Joshi , B. Srinivas

Discourse information, as postulated by popular discourse theories, such as RST and PDTB, has been shown to improve an increasing number of downstream NLP tasks, showing positive effects and synergies of discourse with important real-world…

Computation and Language · Computer Science 2020-12-18 Patrick Huber , Giuseppe Carenini

Different from other sequential data, sentences in natural language are structured by linguistic grammars. Previous generative conversational models with chain-structured decoder ignore this structure in human language and might generate…

Artificial Intelligence · Computer Science 2018-01-04 Ganbin Zhou , Ping Luo , Rongyu Cao , Yijun Xiao , Fen Lin , Bo Chen , Qing He

The development of lexicalized grammars, particularly Tree-Adjoining Grammar (TAG), has significantly advanced our understanding of syntax and semantics in natural language processing (NLP). While existing syntactic resources like the Penn…

Computation and Language · Computer Science 2025-04-15 Jungyeul Park

Dialogue discourse parsing aims to uncover the internal structure of a multi-participant conversation by finding all the discourse~\emph{links} and corresponding~\emph{relations}. Previous work either treats this task as a series of…

Computation and Language · Computer Science 2023-06-28 Ta-Chung Chi , Alexander I. Rudnicky

This note presents a method of interpreting the tree adjoining languages as the natural third step in a hierarchy that starts with the regular and the context-free languages. The central notion in this account is that of a higher-order…

cmp-lg · Computer Science 2008-02-03 Uwe Moennich
‹ Prev 1 2 3 10 Next ›