84 search results - page 13 / 17 » Evolutionary Parsing for a Probabilistic Context Free Gramma... |
CEC
2010
IEEE
13 years 8 months ago
2010
IEEE
Unsupervised grammar induction is one of the most difficult works of language processing. Its goal is to extract a grammar representing the language structure using texts without a...
TCS
2008
13 years 7 months ago
2008
Several mathematical distances between probabilistic languages have been investigated in the literature, motivated by applications in language modeling, computational biology, syn...
ACL
2010
13 years 5 months ago
2010
Learning a tree substitution grammar is very challenging due to derivational ambiguity. Our recent approach used a Bayesian non-parametric model to induce good derivations from tr...
ACL
2012
11 years 10 months ago
2012
Most previous studies in computerized deception detection have relied only on shallow lexico-syntactic patterns. This paper investigates syntactic stylometry for deception detecti...
ACL
1998
13 years 9 months ago
1998
Much of the power of probabilistic methods in modelling language comes from their ability to compare several derivations for the same string in the language. An important starting...