Properties of stochastic syntax-directed translation schemata

Maryanski, Fred J.; Thomason, Michael G.

doi:10.1007/bf00989665

Cited by 10 publications

(7 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are also extensions of stochastic context-free grammars for translation: stochastic syntax-directed translation schemata [104] and head transducer models were proposed in [86], [87].…”

Section: B Stochastic Context-free Grammarsmentioning

confidence: 99%

Probabilistic finite-state machines - part II

Vidal

Thollard

Higuera

et al. 2005

IEEE Trans. Pattern Anal. Machine Intell.

View full text Add to dashboard Cite

Section: B Stochastic Context-free Grammarsmentioning

confidence: 99%

Probabilistic finite-state machines - part II

Vidal

Thollard

Higuera

et al. 2005

IEEE Trans. Pattern Anal. Machine Intell.

View full text Add to dashboard Cite

“…Stochastic Inversion Transduction Grammars (SITG) can be viewed as a restricted Stochastic Context-Free Syntax-Directed Transduction Scheme (Aho & Ullman, 1972;Maryanski & Thomason, 1979;Casacuberta, 1995). SITGs can be used to carry out a simultaneous parsing of both the input string and the output string.…”

Section: Introductionmentioning

confidence: 99%

Stochastic inversion transduction grammars for obtaining word phrases for phrase-based statistical machine translation

Lafuente

Benedí

2006

Proceedings of the Workshop on Statistical Machine Translation - StatMT '06

View full text Add to dashboard Cite

An important problem that is related to phrase-based statistical translation models is the obtaining of word phrases from an aligned bilingual training corpus. In this work, we propose obtaining word phrases by means of a Stochastic Inversion Translation Grammar. Experiments on the shared task proposed in this workshop with the Europarl corpus have been carried out and good results have been obtained.

show abstract

“…A weighted transduction is recognizable by a weighted pushdown transducer iff it is algebraic [20] or equivalently iff it is recognizable by a weighted simple syntax-directed translation [1,14]. A weighted pushdown automaton (PDA) is a pushdown transducer where…”

Section: Pushdown Automata and Transducersmentioning

confidence: 99%

A Pushdown Transducer Extension for the OpenFst Library

Allauzen

Riley

2012

Implementation and Application of Automata

View full text Add to dashboard Cite

Abstract. Pushdown automata are devices that can efficiently represent context-free languages, have natural weighted versions, and combine naturally with finite automata. We describe a pushdown transducer extension to OpenFst, a weighted finite-state transducer library. We present several weighted pushdown algorithms, some with clear finite-state analogues, describe their library usage and give some applications of these methods to recognition, parsing and translation.

show abstract

Properties of stochastic syntax-directed translation schemata

Cited by 10 publications

References 11 publications

Probabilistic finite-state machines - part II

Probabilistic finite-state machines - part II

Stochastic inversion transduction grammars for obtaining word phrases for phrase-based statistical machine translation

A Pushdown Transducer Extension for the OpenFst Library

Contact Info

Product

Resources

About