Sciweavers

1242 search results - page 34 / 249
» The Theory of Grammar Constraints
Sort
View
COLING
2010
13 years 2 months ago
An Efficient Shift-Reduce Decoding Algorithm for Phrased-Based Machine Translation
In statistical machine translation, decoding without any reordering constraint is an NP-hard problem. Inversion Transduction Grammars (ITGs) exploit linguistic structure and can w...
Yang Feng, Haitao Mi, Yang Liu, Qun Liu
EVOW
2009
Springer
14 years 2 months ago
Elevated Pitch: Automated Grammatical Evolution of Short Compositions
Abstract. A system for automatic composition using grammatical evolution is presented. Compositions are created under the constraints of a generative grammar, and under the bias of...
John Reddin, James McDermott, Michael O'Neill
ACL
2006
13 years 8 months ago
Clavius: Bi-Directional Parsing for Generic Multimodal Interaction
We introduce a new multi-threaded parsing algorithm on unification grammars designed specifically for multimodal interaction and noisy environments. By lifting some traditional co...
Frank Rudzicz
EACL
1989
ACL Anthology
13 years 8 months ago
Expressing generalizations in unification-based grammar formalisms
This paper shows how higher levels of generalization can be introduced into unification grammars by exploiting methods for typing grammatical objects. We discuss the strategy of u...
Marc Moens, Jonathan Calder, Ewan Klein, Mike Reap...
ACL
2009
13 years 5 months ago
Asynchronous Binarization for Synchronous Grammars
Binarization of n-ary rules is critical for the efficiency of syntactic machine translation decoding. Because the target side of a rule will generally reorder the source side, it ...
John DeNero, Adam Pauls, Dan Klein