Sciweavers

555 search results - page 31 / 111
» Decompositions of Grammar Constraints
Sort
View
CPAIOR
2005
Springer
14 years 3 months ago
A Search-Infer-and-Relax Framework for Integrating Solution Methods
Abstract. We present an algorithmic framework for integrating solution methods that is based on search, inference, and relaxation and their interactions. We show that the following...
John N. Hooker
EACL
2003
ACL Anthology
13 years 11 months ago
Describing Syntax with Star-Free Regular Expressions
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...
Anssi Yli-Jyrä
COLING
2010
13 years 4 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 4 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 11 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