Sciweavers

4 search results - page 1 / 1
» Induction of Greedy Controllers for Deterministic Treebank P...
Sort
View
EMNLP
2004
13 years 6 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
AAAI
1994
13 years 6 months ago
Inducing Deterministic Prolog Parsers from Treebanks: A Machine Learning Approach
or untagged treebanks. ' When trained on an untagged This paper presents a method for constructing deterministic Prolog parsers from corpora of parsed sentences. Our approach ...
John M. Zelle, Raymond J. Mooney
AAAI
2007
13 years 7 months ago
Ungreedy Methods for Chinese Deterministic Dependency Parsing
Deterministic dependency parsing has often been regarded as an efficient parsing algorithm while its parsing accuracy is a little lower than the best results reported by more comp...
Xiangyu Duan, Jun Zhao, Bo Xu
ACL
2006
13 years 6 months ago
A Best-First Probabilistic Shift-Reduce Parser
Recently proposed deterministic classifierbased parsers (Nivre and Scholz, 2004; Sagae and Lavie, 2005; Yamada and Matsumoto, 2003) offer attractive alternatives to generative sta...
Kenji Sagae, Alon Lavie