54 search results - page 3 / 11 » Efficient Context-Free Grammar Constraints |
135
click to vote
ICDT
2010
ACM
15 years 3 months 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...
107
click to vote
NAACL
2010
14 years 9 months ago
2010
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
COLING
1990
15 years 28 days 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...
ACL
2010
14 years 9 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...
108
click to vote
ACL
2010
14 years 9 months ago
2010
We present cdec, an open source framework for decoding, aligning with, and training a number of statistical machine translation models, including word-based models, phrase-based m...