Results 1  10
of
251
A Faster Parsing Algorithm for Lexicalized TreeAdjoining Grammars
, 2000
"... This paper points out some computational inefficiencies of standard TAG parsing algorithms when applied to LTAGs. We propose a novel algorithm with an asymptotic improvement, from O(n ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
This paper points out some computational inefficiencies of standard TAG parsing algorithms when applied to LTAGs. We propose a novel algorithm with an asymptotic improvement, from O(n
Abstract A Faster Parsing Algorithm for Lexicalized TreeAdjoining Grammars
"... This paper points out some computational inefficiencies of standard TAG parsing algorithms when applied to LTAGs. We propose a novel algorithm with an asymptotic improvement, from to ¤¦¥¨§���������¥�§����������� � , where § is the input length and ���� � are grammar constants that are independent of ..."
Abstract
 Add to MetaCart
This paper points out some computational inefficiencies of standard TAG parsing algorithms when applied to LTAGs. We propose a novel algorithm with an asymptotic improvement, from to ¤¦¥¨§���������¥�§����������� � , where § is the input length and ���� � are grammar constants that are independent
Combining Supertagging and Lexicalized TreeAdjoining Grammar Parsing
"... In this paper we study various reasons and mechanisms for combining Supertagging with Lexicalized TreeAdjoining Grammar (LTAG) parsing. Because of the highly lexicalized nature of the LTAG formalism, we experimentally show that notions other than sentence length play a factor in observed parse time ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
In this paper we study various reasons and mechanisms for combining Supertagging with Lexicalized TreeAdjoining Grammar (LTAG) parsing. Because of the highly lexicalized nature of the LTAG formalism, we experimentally show that notions other than sentence length play a factor in observed parse
Parsing English with a Link Grammar
, 1991
"... We define a new formal grammatical system called a link grammar . A sequence of words is in the language of a link grammar if there is a way to draw links between words in such a way that (1) the local requirements of each word are satisfied, (2) the links do not cross, and (3) the words form a conn ..."
Abstract

Cited by 437 (4 self)
 Add to MetaCart
connected graph. We have encoded English grammar into such a system, and written a program (based on new algorithms) for efficiently parsing with a link grammar. The formalism is lexical and makes no explicit use of constituents and categories. The breadth of English phenomena that our system handles
Parsing Strategies with 'Lexicalized' Grammars: Application to Tree Adjoining Grammars
 IN PROCEEDINGS OF THE 12 TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL LINGUISTICS (COLING'88
, 1988
"... In this paper we present a general parsing strategy that arose from the development of an Earicytype parsing algorithm for TAGs (Schabes and Joshi 1988) and from recent linguistic work in TAGs (Abeille 1988). In our approach ..."
Abstract

Cited by 126 (18 self)
 Add to MetaCart
In this paper we present a general parsing strategy that arose from the development of an Earicytype parsing algorithm for TAGs (Schabes and Joshi 1988) and from recent linguistic work in TAGs (Abeille 1988). In our approach
Tree Parsing with Synchronous TreeAdjoining Grammars
, 2011
"... Restricting the input or the output of a grammarinduced translation to a given set of trees plays an important role in statistical machine translation. The problem for practical systems is to find a compact (and in particular, finite) representation of said restriction. For the class of synchronous ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
of synchronous treeadjoining grammars, partial solutions to this problem have been described, some being restricted to the unweighted case, some to the monolingual case. We introduce a formulation of this class of grammars which is effectively closed under input and output restrictions to regular tree languages
TreeAdjoining Grammar Parsing and Boolean Matrix Multiplication
, 1994
"... this paper we restate the TAG parsing problem as a search problem and relate it to the wellknown computational problem of Boolean matrix multiplication. This is done in such a way that time upper bounds for TAG parsing can be transferred to time upper bounds for the latter problem. More precisely, ..."
Abstract

Cited by 22 (2 self)
 Add to MetaCart
this paper we restate the TAG parsing problem as a search problem and relate it to the wellknown computational problem of Boolean matrix multiplication. This is done in such a way that time upper bounds for TAG parsing can be transferred to time upper bounds for the latter problem. More precisely
Statistical Parsing Algorithms for Lexicalized Tree Adjoining Grammars
"... The goal of this dissertation is twofold: to develop the theory of probabilistic Tree Adjoining Grammars (TAGs) and to present some practical results in the form of efficient parsing and estimation algorithms for probabilistic TAGs. The overall goal of developing the theory of probabilistic TAGs is ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The goal of this dissertation is twofold: to develop the theory of probabilistic Tree Adjoining Grammars (TAGs) and to present some practical results in the form of efficient parsing and estimation algorithms for probabilistic TAGs. The overall goal of developing the theory of probabilistic TAGs
A Lexicalized TreeAdjoining Grammar for Vietnamese
"... In this paper, we present the first sizable grammar built for Vietnamese using LTAG, developed over the past two years, named vnLTAG. This grammar aims at modelling written language and is general enough to be both application and domainindependent. It can be used for the morphosyntactic tagging ..."
Abstract
 Add to MetaCart
and syntactic parsing of Vietnamese texts, as well as text generation. We then present a robust parsing scheme using vnLTAG and a parser for the grammar. We finish with an evaluation using a test suite. 1.
Bidirectional Parsing Of Lexicalized Tree Adjoining Grammars
, 1991
"... In this paper a bidirectional parser for Lexicalized Tree Adjoining Grammars will be presented. The algorithm takes advantage of a peculiar characteristic of Lexicalized TAGs, i.e. that each elementary tree is associated with a lexical item, called its anchor. The algorithm employs a mixed strategy: ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
In this paper a bidirectional parser for Lexicalized Tree Adjoining Grammars will be presented. The algorithm takes advantage of a peculiar characteristic of Lexicalized TAGs, i.e. that each elementary tree is associated with a lexical item, called its anchor. The algorithm employs a mixed strategy
Results 1  10
of
251