Sciweavers

27 search results - page 3 / 6
» Feature Forest Models for Probabilistic HPSG Parsing
Sort
View
NAACL
2010
13 years 3 months ago
Context-free reordering, finite-state translation
We describe a class of translation model in which a set of input variants encoded as a context-free forest is translated using a finitestate translation model. The forest structur...
Christopher Dyer, Philip Resnik
EMNLP
2008
13 years 7 months ago
Online Large-Margin Training of Syntactic and Structural Translation Features
Minimum-error-rate training (MERT) is a bottleneck for current development in statistical machine translation because it is limited in the number of weights it can reliably optimi...
David Chiang, Yuval Marton, Philip Resnik
EMNLP
2004
13 years 7 months ago
Max-Margin Parsing
We present a novel discriminative approach to parsing inspired by the large-margin criterion underlying support vector machines. Our formulation uses a factorization analogous to ...
Ben Taskar, Dan Klein, Mike Collins, Daphne Koller...
EMNLP
2007
13 years 7 months ago
Fast and Robust Multilingual Dependency Parsing with a Generative Latent Variable Model
We use a generative history-based model to predict the most likely derivation of a dependency parse. Our probabilistic model is based on Incremental Sigmoid Belief Networks, a rec...
Ivan Titov, James Henderson
ICML
2000
IEEE
13 years 10 months ago
Discriminative Reranking for Natural Language Parsing
This paper considers approaches which rerank the output of an existing probabilistic parser. The base parser produces a set of candidate parses for each input sentence, with assoc...
Michael Collins