Sciweavers

50 search results - page 4 / 10
» Coordination in Tree Adjoining Grammars: Formalization and I...
Sort
View
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
ACL
1990
13 years 8 months ago
Licensing and Tree Adjoining Grammar in Government Binding Parsing
This paper presents an implemented, psychologicallyplausible parsing model for Government Binding theory grammars. I make use of two main ideas: (1) a generalization of the licens...
Robert Frank
DEXA
2007
Springer
126views Database» more  DEXA 2007»
13 years 11 months ago
Compiling Declarative Specifications of Parsing Algorithms
Abstract. The parsing schemata formalism allows us to describe parsing algorithms in a simple, declarative way by capturing their fundamenntics while abstracting low-level detail. ...
Carlos Gómez-Rodríguez, Jesús...
ACL
1998
13 years 8 months ago
Conditions on Consistency of Probabilistic Tree Adjoining Grammars
Much of the power of probabilistic methods in modelling language comes from their ability to compare several derivations for the same string in the language. An important starting...
Anoop Sarkar
ACL
1990
13 years 8 months ago
An Efficient Parsing Algorithm for Tree Adjoining Grammars
In the literature, Tree Adjoining Grammars (TAGs) are propagated to be adequate for natural language description -- analysis as well as generation. In this paper we concentrate on...
Karin Harbusch