Cube Pruning

We present an efficient, novel two-pass approach to mitigate the computational impact resulting from online intersection of an n-gram language model (LM) and a probabilistic synchronous context-free grammar (PSCFG) for …...

Approximate search algorithms, such as cube pruning in syntactic machine translation, rely on the language model to estimate probabili- ties of sentence fragments. We contribute two changes that trade between …...

We propose a new algorithm to approximately extract top-scoring hypotheses from a hyper- graph when the score includes an N–gram language model. In the popular cube prun- ing algorithm, every …...

The combinatorial space of translation derivations in phrase-based statistical ma- chine translation is given by the intersec- tion between a translation lattice and a tar- get language model. We replace …...

In this paper, we apply a synchronous-graph- grammar-based approach to SemEval-2016 Task 8, Meaning Representation Parsing. In particular, we learn Synchronous Hyperedge Replacement Grammar (SHRG) rules from aligned pairs of …...