84 search results - page 1 / 17 » Evolutionary Parsing for a Probabilistic Context Free Gramma... |
RSCTC
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...
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,...
72
Voted
COLING
2010
14 years 4 months ago
2010
This paper presents a first efficient implementation of a weighted deductive CYK parser for Probabilistic Linear ContextFree Rewriting Systems (PLCFRS), together with context-summ...
117
click to vote
ICDT
2010
ACM
15 years 24 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...
ACL
1998
14 years 10 months ago
1998
We present an empirical study of the applicability of Probabilistic Lexicalized Tree Insertion Grammars (PLTIG), a lexicalized counterpart to Probabilistic Context-Free Grammars (...