Sciweavers

54 search results - page 8 / 11
» Efficient Context-Free Grammar Constraints
Sort
View
ACL
2009
13 years 6 months ago
A Gibbs Sampler for Phrasal Synchronous Grammar Induction
We present a phrasal synchronous grammar model of translational equivalence. Unlike previous approaches, we do not resort to heuristics or constraints from a word-alignment model,...
Phil Blunsom, Trevor Cohn, Chris Dyer, Miles Osbor...
COLING
2010
13 years 3 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
NLP
2000
13 years 12 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman
ACL
1990
13 years 9 months ago
Structural Disambiguation with Constraint Propagation
We present a new grammatical formalism called Constraint Dependency Grammar (CDG) in which every grammatical rule is given as a constraint on wordto-word modifications. CDG parsin...
Hiroshi Maruyama
ICDAR
1995
IEEE
13 years 12 months ago
Efficient analysis of complex diagrams using constraint-based parsing
This paper describes substantial advances in the analysis (parsing) of diagrams using constraint grammars. The addition of set types to the grammar and spatial indexing of the dat...
Robert P. Futrelle, Nikos Nikolakis