Sciweavers

2836 search results - page 66 / 568
» Parsing Algorithms and Metrics
Sort
View
ACL
2010
13 years 5 months ago
Hierarchical A* Parsing with Bridge Outside Scores
Hierarchical A (HA) uses of a hierarchy of coarse grammars to speed up parsing without sacrificing optimality. HA prioritizes search in refined grammars using Viterbi outside cost...
Adam Pauls, Dan Klein
COLING
2010
13 years 2 months ago
Two Methods for Extending Hierarchical Rules from the Bilingual Chart Parsing
This paper studies two methods for training hierarchical MT rules independently of word alignments. Bilingual chart parsing and EM algorithm are used to train bitext correspondenc...
Martin Cmejrek, Bowen Zhou
EMNLP
2011
12 years 7 months ago
Lexical Generalization in CCG Grammar Induction for Semantic Parsing
We consider the problem of learning factored probabilistic CCG grammars for semantic parsing from data containing sentences paired with logical-form meaning representations. Tradi...
Tom Kwiatkowski, Luke S. Zettlemoyer, Sharon Goldw...
LREC
2010
180views Education» more  LREC 2010»
13 years 9 months ago
Parsing to Stanford Dependencies: Trade-offs between Speed and Accuracy
We investigate a number of approaches to generating Stanford Dependencies, a widely used semantically-oriented dependency representation. We examine algorithms specifically design...
Daniel Cer, Marie-Catherine de Marneffe, Daniel Ju...
NLP
2000
13 years 11 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman