Sciweavers

223 search results - page 15 / 45
» Information-based Case Grammar
Sort
View
EMNLP
2004
14 years 11 months ago
Induction of Greedy Controllers for Deterministic Treebank Parsers
Most statistical parsers have used the grammar induction approach, in which a stochastic grammar is induced from a treebank. An alternative approach is to induce a controller for ...
Tom Kalt
TAPD
1998
81views more  TAPD 1998»
14 years 11 months ago
A Generalized CYK Algorithm for Parsing Stochastic CFG
We present a bottom-up parsing algorithm for stochastic context-free grammars that is able (1) to deal with multiple interpretations of sentences containing compoundwords; (2) to ...
Jean-Cédric Chappelier, Martin Rajman
83
Voted
ACL
2006
14 years 11 months ago
Factoring Synchronous Grammars by Sorting
Synchronous Context-Free Grammars (SCFGs) have been successfully exploited as translation models in machine translation applications. When parsing with an SCFG, computational comp...
Daniel Gildea, Giorgio Satta, Hao Zhang
ACL
1990
14 years 10 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
72
Voted
ACL
2004
14 years 11 months ago
Minimal Recursion Semantics as Dominance Constraints: Translation, Evaluation, and Analysis
We show that a practical translation of MRS descriptions into normal dominance constraints is feasible. We start from a recent theoretical translation and verify its assumptions o...
Ruth Fuchss, Alexander Koller, Joachim Niehren, St...