182 search results - page 16 / 37 » Context-Free Valence Grammars - Revisited |
CORR
1999
Springer
14 years 9 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...
COLING
1990
14 years 10 months ago
1990
In machine translation, parsing of long English sentences still causes some problems, whereas for short sentences a good machine translation system usually can generate readable t...
155
click to vote
CP
2009
Springer
15 years 10 months ago
2009
Springer
We investigate the global GRAMMAR constraint over restricted classes of context free grammars like deterministic and unambiguous context-free grammars. We show that detecting disen...
ACL
2010
14 years 7 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...
NAACL
2010
14 years 7 months ago
2010
The use of well-nested linear context-free rewriting systems has been empirically motivated for modeling of the syntax of languages with discontinuous constituents or relatively f...