84 search results - page 7 / 17 » Evolutionary Parsing for a Probabilistic Context Free Gramma... |
ACL
2010
13 years 5 months ago
2010
Linear Context-Free Rewriting Systems (LCFRSs) are a grammar formalism capable of modeling discontinuous phrases. Many parsing applications use LCFRSs where the fan-out (a measure...
ACL
1989
13 years 8 months ago
1989
The Context-Free backbone of some natural language analyzers produces all possible CF parses as some kind of shared forest, from which a single tree is to be chosen by a disambigu...
CORR
1999
Springer
13 years 7 months ago
1999
Springer
The paper describes an extensive experiment in inside-outside estimation of a lexicalized probabilistic context free grammar for German verbnal clauses. Grammar and formalism feat...
LATA
2010
Springer
14 years 2 months ago
2010
Springer
We extend stochastic context-free grammars such that the probability of applying a production can depend on the length of the subword that is generated from the application and sho...
ACL
2012
11 years 10 months ago
2012
We present a Bayesian nonparametric model for estimating tree insertion grammars (TIG), building upon recent work in Bayesian inference of tree substitution grammars (TSG) via Dir...