33 search results - page 1 / 7 » A Probabilistic Context-free Grammar for Disambiguation in M... |
COLING
2002
14 years 9 months ago
2002
We present a novel disambiguation method for unification-based grammars (UBGs). In contrast to other methods, our approach obviates the need for probability models on the UBG side...
117
click to vote
ICDT
2010
ACM
15 years 25 days ago
2010
ACM
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
69
Voted
EACL
1993
ACL Anthology
14 years 10 months ago
1993
ACL Anthology
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...
COLING
1996
14 years 10 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
IJCNLP
2004
Springer
15 years 2 months ago
2004
Springer
This paper presents an iterative CKY parsing algorithm for probabilistic contextfree grammars (PCFG). This algorithm enables us to prune unnecessary edges produced during parsing,...