Sciweavers

17 search results - page 1 / 4
» The Use of Shared Forests in Tree Adjoining Grammar Parsing
Sort
View
EACL
1993
ACL Anthology
13 years 6 months ago
The Use of Shared Forests in Tree Adjoining Grammar Parsing
We study parsing of tree adjoining grammars with particular emphasis on the use of shared forests to represent all the parse trees deriving a well-formed string. We show that ther...
K. Vijay-Shanker
ACL
1989
13 years 6 months ago
The Structure of Shared Forests in Ambiguous Parsing
The Context-Free backbone of some natural language analyzers produces all possible CF parses as some kind of shared forest, from which a single tree is to be chosen by a disambigu...
Sylvie Billot, Bernard Lang
ACL
2009
13 years 2 months ago
A Polynomial-Time Parsing Algorithm for TT-MCTAG
This paper investigates the class of TreeTuple MCTAG with Shared Nodes, TTMCTAG for short, an extension of Tree Adjoining Grammars that has been proposed for natural language proc...
Laura Kallmeyer, Giorgio Satta
ACL
2007
13 years 6 months ago
A Symbolic Approach to Near-Deterministic Surface Realisation using Tree Adjoining Grammar
Surface realisers divide into those used in generation (NLG geared realisers) and those mirroring the parsing process (Reversible realisers). While the first rely on grammars not...
Claire Gardent, Eric Kow
ACL
1990
13 years 6 months ago
Deterministic Left to Right Parsing of Tree Adjoining Languages
We define a set of deterministic bottom-up left to right parsers which analyze a subset of Tree Adjoining Languages. The LR parsing strategy for Context Free Grammars is extended ...
Yves Schabes, K. Vijay-Shanker