270 search results - page 5 / 54 » Effective natural language parsing with probabilistic gramma... |
177
click to vote
POPL
2004
ACM
15 years 10 months ago
2004
ACM
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
EACL
2009
ACL Anthology
15 years 10 months ago
2009
ACL Anthology
EACL
2009
ACL Anthology
15 years 10 months ago
2009
ACL Anthology
119
click to vote
ICDT
2010
ACM
15 years 27 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...
COLING
1996
14 years 11 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...