Sciweavers

116 search results - page 5 / 24
» An Efficient Parsing Algorithm for Tree Adjoining Grammars
Sort
View
ACL
2010
13 years 5 months ago
A Tree Transducer Model for Synchronous Tree-Adjoining Grammars
A characterization of the expressive power of synchronous tree-adjoining grammars (STAGs) in terms of tree transducers (or equivalently, synchronous tree substitution grammars) is...
Andreas Maletti
COLING
1999
13 years 7 months ago
Semiring Parsing
languages into a general system for describing parsers. Eachparser performs abstract computations using theoperations ofasemiring. Thesystem allows asingle, simple representation t...
Joshua Goodman
ACL
2001
13 years 9 months ago
Guided Parsing of Range Concatenation Languages
The theoretical study of the range concatenation grammar [RCG] formalism has revealed many attractive properties which may be used in NLP. In particular, range concatenation langu...
François Barthélemy, Pierre Boullier...
CI
2005
99views more  CI 2005»
13 years 7 months ago
Automatically Generating Tree Adjoining Grammars from Abstract Specifications
TRACT SPECIFICATIONS FEI XIA AND MARTHA PALMER Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA 19104 K. VIJAY-SHANKER Department of Com...
Fei Xia, Martha Palmer, K. Vijay-Shanker
ACL
2009
13 years 5 months ago
Extending a Surface Realizer to Generate Coherent Discourse
We present a discourse-level Tree Adjoining Grammar which tightly integrates syntax and discourse levels, including a representation for discourse entities. We show that this tech...
Eva Banik