Shake-and-bake machine translation

Beaven, John L.

doi:10.3115/992133.992164

Cited by 13 publications

(10 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(Hutchins and Somers, 1992). lexicalist approach which relates bags of lexical signs, as in Shake-and-Bake MT (Beaven, 1992;Whitelock, 1992), our transfer approach operates on the level of semantic representations produced by various analysis steps. The output of transfer is a semantic representation for the target language which is input to the generator and speech synthesis to produce the target language utterance.…”

Section: Introductionmentioning

confidence: 99%

Semantic-based transfer

Dorna

Emele

1996

Proceedings of the 16th Conference on Computational Linguistics -

View full text Add to dashboard Cite

This article presents a new semanticbased transfer approach developed and applied within the Verbmobil Machine Translation project. We give an overview of the declarative transfer formalism together with its procedural realization. Our approach is discussed and compared with several other approaches from the MT literature. The results presented in this article have been implemented and integrated into the Verbmobil system.

show abstract

Section: Introductionmentioning

confidence: 99%

Semantic-based transfer

Dorna

Emele

1996

Proceedings of the 16th Conference on Computational Linguistics -

View full text Add to dashboard Cite

show abstract

“…They are at the basis of the generation component of the statistical machine translation models proposed by Brown et al (1990). Bags of complex lexical signs have also been used in the machine translation approach described by Beaven (1992) and Whitelock (1992), called shake-and-bake. As already mentioned, bags are a very succinct representation of finite languages, since they allow encoding of more than exponentially many strings in the size of a bag itself.…”

Section: Representations Of Finite Languagesmentioning

confidence: 99%

“…These include bags of words (Brown et al, 1990) and bags of complex lexical representations (Beaven, 1992;Brew, 1992;Whitelock, 1992), word lattices (Knight & Hatzivassiloglou, 1995;Langkilde & Knight, 1998;Bangalore & Rambow, 2000), and non-recursive context-free grammars (Langkilde, 2000). As will be discussed in detail in Section 2, word lattices and non-recursive context-free grammars allow encoding of precedence constraints and choice among different words, but they both lack a primitive for representing strings that are realized by combining a collection of words in an arbitrary order.…”

Section: Introductionmentioning

confidence: 99%

IDL-Expressions: A Formalism for Representing and Parsing Finite Languages in Natural Language Processing

Nederhof¹,

Satta²

2004

jair

View full text Add to dashboard Cite

We propose a formalism for representation of finite languages, referred to as the class of IDL-expressions, which combines concepts that were only considered in isolation in existing formalisms. The suggested applications are in natural language processing, more specifically in surface natural language generation and in machine translation, where a sentence is obtained by first generating a large set of candidate sentences, represented in a compact way, and then filtering such a set through a parser. We study several formal properties of IDL-expressions and compare this new formalism with more standard ones. We also present a novel parsing algorithm for IDL-expressions and prove a non-trivial upper bound on its time complexity.

show abstract

“…9 Another non-interlingual non-transfer approach is Shake-and-Bake MT (Beaven 1992;Whitelock 1992) which overgenerates TL sentences and symbolically constrains the output by "parsing it." It differs from GHMT in two ways: (1) Shake-and-Bake is a purely symbolic approach and (2) etc.…”

Section: Handling Translation Divergencesmentioning

confidence: 99%

Symbolic-to-statistical hybridization: extending generation-heavy machine translation

Habash

Dorr

Monz

2009

Machine Translation

View full text Add to dashboard Cite

The last few years have witnessed an increasing interest in hybridizing surface-based statistical approaches and rule-based symbolic approaches to machine translation (MT). Much of that work is focused on extending statistical MT systems with symbolic knowledge and components. In the brand of hybridization discussed here, we go in the opposite direction: adding statistical bilingual components to a symbolic system. Our base system is Generation-heavy machine translation (GHMT), a primarily symbolic asymmetrical approach that addresses the issue of Interlingual MT resource poverty in source-poor/target-rich language pairs by exploiting symbolic and statistical target-language resources. GHMT's statistical components are limited to target-language models, which arguably makes it a simple form of a hybrid system. We extend the hybrid nature of GHMT by adding statistical bilingual components. We also describe the details of retargeting it to Arabic-English MT. The morphological richness of Arabic brings several challenges to the hybridization task. We conduct an extensive evaluation of multiple system variants. Our evaluation shows that this new variant of GHMT-a primarily symbolic system extended with monolingual and bilingual statistical components-has a higher degree of grammaticality than a phrase-based statistical MT system, where grammaticality is measured in terms of correct verb-argument realization and long-distance dependency translation.

show abstract

Shake-and-bake machine translation

Abstract: Este ~trtfculo presenta un nuevo planteamiento para la traduccidn autom£tica (TA), tlamado Shake-and-Bake (refrito), que aprovecha re

Cited by 13 publications

References 9 publications

Semantic-based transfer

Semantic-based transfer

IDL-Expressions: A Formalism for Representing and Parsing Finite Languages in Natural Language Processing

Symbolic-to-statistical hybridization: extending generation-heavy machine translation

Contact Info

Product

Resources

About