English
Related papers

Related papers: Proposing TAGbank as a Corpus of Tree-Adjoining Gr…

200 papers

Tree adjoining grammars (TAGs) provide an ample tool to capture syntax of many Indian languages. Tamil represents a special challenge to computational formalisms as it has extensive agglutinative morphology and a comparatively difficult…

Computation and Language · Computer Science 2017-04-20 Vijay Krishna Menon , S Rajendran , M Anandkumar , K P Soman

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

The formalism of synchronous tree-adjoining grammars, a variant of standard tree-adjoining grammars (TAG), was intended to allow the use of TAGs for language transduction in addition to language specification. In previous work, the…

cmp-lg · Computer Science 2008-02-03 Stuart M. Shieber

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

Syntactic parsing is essential in natural-language processing, with constituent structure being one widely used description of syntax. Traditional views of constituency demand that constituents consist of adjacent words, but this poses…

Computation and Language · Computer Science 2024-10-14 Lukas Mielczarek

Treebank translation is a promising method for cross-lingual transfer of syntactic dependency knowledge. The basic idea is to map dependency arcs from a source treebank to its target translation according to word alignments. This method,…

Computation and Language · Computer Science 2019-09-06 Zhang Meishan , Zhang Yue , Fu Guohong

Model structure and complexity selection remains a challenging problem in system identification, especially for parametric non-linear models. Many Evolutionary Algorithm (EA) based methods have been proposed in the literature for estimating…

Systems and Control · Electrical Eng. & Systems 2020-07-01 Dhruv Khandelwal , Maarten Schoukens , Roland Tóth

Head-driven phrase structure grammar (HPSG) enjoys a uniform formalism representing rich contextual syntactic and even semantic meanings. This paper makes the first attempt to formulate a simplified HPSG by integrating constituent and…

Computation and Language · Computer Science 2020-05-06 Junru Zhou , Hai Zhao

In this paper we show that an account for coordination can be constructed using the derivation structures in a lexicalized Tree Adjoining Grammar (LTAG). We present a notion of derivation in LTAGs that preserves the notion of fixed…

cmp-lg · Computer Science 2008-02-03 Anoop Sarkar , Aravind Joshi

Treebanks are important linguistic resources, which are structured and annotated corpora with rich linguistic annotations. These resources are used in Natural Language Processing (NLP) applications, supporting linguistic analyses, and are…

Computation and Language · Computer Science 2024-09-24 Kengatharaiyer Sarveswaran

This paper addresses issues in automated treebank construction. We show how standard part-of-speech tagging techniques extend to the more general problem of structural annotation, especially for determining grammatical functions and…

cmp-lg · Computer Science 2008-02-03 Thorsten Brants , Wojciech Skut , Brigitte Krenn

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

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

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

This paper introduces a new web-based software tool for annotating text, Text Annotation Graphs, or TAG. It provides functionality for representing complex relationships between words and word phrases that are not available in other…

Computation and Language · Computer Science 2018-03-02 Angus G. Forbes , Kristine Lee , Gus Hahn-Powell , Marco A. Valenzuela-Escárcega , Mihai Surdeanu

Many tasks in natural language processing require the extraction of relationship information for a given condition, such as event argument extraction, relation extraction, and task-oriented semantic parsing. Recent works usually propose…

Computation and Language · Computer Science 2023-05-29 I-Hung Hsu , Kuan-Hao Huang , Shuning Zhang , Wenxin Cheng , Premkumar Natarajan , Kai-Wei Chang , Nanyun Peng

Finding simple, non-recursive, base noun phrases is an important subtask for many natural language processing applications. While previous empirical methods for base NP identification have been rather complex, this paper instead proposes a…

cmp-lg · Computer Science 2007-05-23 Claire Cardie , David Pierce

This paper presents a novel treebank-driven approach to comparing syntactic structures in speech and writing using dependency-parsed corpora. Adopting a fully inductive, bottom-up method, we define syntactic structures as delexicalized…

Computation and Language · Computer Science 2026-02-24 Kaja Dobrovoljc

The central role of the lexicon in Meaning-Text Theory (MTT) and other dependency-based linguistic theories cannot be replicated in linguistic theories based on context-free grammars (CFGs). We describe Tree Adjoining Grammar (TAG) as a…

cmp-lg · Computer Science 2008-02-03 Owen Rambow , Aravind Joshi
‹ Prev 1 2 3 10 Next ›