17 search results - page 3 / 4 » Conditions on Consistency of Probabilistic Tree Adjoining Gr... |
104
click to vote
UAI
2004
15 years 2 months ago
2004
We introduce a probabilistic formalism subsuming Markov random fields of bounded tree width and probabilistic context free grammars. Our models are based on a representation of Bo...
CLIN
2003
15 years 2 months ago
2003
A statistical estimator attempts to guess an unknown probability distribution by analyzing a sample from this distribution. One desirable property of an estimator is that its gues...
128
click to vote
ACL
2009
14 years 11 months ago
2009
We present a novel approach to parse web search queries for the purpose of automatic tagging of the queries. We will define a set of probabilistic context-free rules, which genera...
WADS
1989
Springer
15 years 5 months ago
1989
Springer
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
118
click to vote
COLING
2002
15 years 1 months ago
2002
Parsli is a finite-state (FS) parser which can be tailored to the lexicon, syntax, and semantics of a particular application using a hand-editable declarative lexicon. The lexicon...