Sciweavers

573 search results - page 10 / 115
» Probabilistic Parsing Strategies
Sort
View
EMNLP
2006
13 years 10 months ago
Extremely Lexicalized Models for Accurate and Fast HPSG Parsing
This paper describes an extremely lexicalized probabilistic model for fast and accurate HPSG parsing. In this model, the probabilities of parse trees are defined with only the pro...
Takashi Ninomiya, Takuya Matsuzaki, Yoshimasa Tsur...
EMNLP
2006
13 years 10 months ago
Loss Minimization in Parse Reranking
We propose a general method for reranker construction which targets choosing the candidate with the least expected loss, rather than the most probable candidate. Different approac...
Ivan Titov, James Henderson
AAAI
1994
13 years 10 months ago
L* Parsing: A General Framework for Syntactic Analysis of Natural Language
We describe a new algorithm for table-driven parsing with context-free grammars designed to support efficient syntactic analysis of natural language. The algorithm provides a gene...
Eric K. Jones, Linton M. Miller
ACL
2006
13 years 10 months ago
Hybrid Parsing: Using Probabilistic Models as Predictors for a Symbolic Parser
In this paper we investigate the benefit of stochastic predictor components for the parsing quality which can be obtained with a rule-based dependency grammar. By including a chun...
Kilian A. Foth, Wolfgang Menzel
EACL
1993
ACL Anthology
13 years 10 months ago
A Probabilistic Context-free Grammar for Disambiguation in Morphological Parsing
One of the major problems one is faced with when decomposing words into their constituent parts is ambiguity: the generation of multiple analyses for one input word, many of which...
Josée S. Heemskerk