Sciweavers

213 search results - page 8 / 43
» Experiments with Learning Parsing Heuristics
Sort
View
82
Voted
EMNLP
2010
14 years 7 months ago
Turbo Parsers: Dependency Parsing by Approximate Variational Inference
We present a unified view of two state-of-theart non-projective dependency parsers, both approximate: the loopy belief propagation parser of Smith and Eisner (2008) and the relaxe...
André F. T. Martins, Noah A. Smith, Eric P....
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
15 years 3 months ago
Evolving problem heuristics with on-line ACGP
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees. ...
Cezary Z. Janikow
79
Voted
ACL
2012
13 years 2 days ago
Selective Sharing for Multilingual Dependency Parsing
We present a novel algorithm for multilingual dependency parsing that uses annotations from a diverse set of source languages to parse a new unannotated language. Our motivation i...
Tahira Naseem, Regina Barzilay, Amir Globerson
58
Voted
ACL
1996
14 years 11 months ago
Fast Parsing Using Pruning and Grammar Specialization
We show how a general grammar may be automatically adapted for fast parsing of utterances from a specific domain by means of constituent pruning and grammar specialization based o...
Manny Rayner, David M. Carter
EMNLP
2009
14 years 7 months ago
Bilingually-Constrained (Monolingual) Shift-Reduce Parsing
Jointly parsing two languages has been shown to improve accuracies on either or both sides. However, its search space is much bigger than the monolingual case, forcing existing ap...
Liang Huang, Wenbin Jiang, Qun Liu