Proceedings of the 35th Annual Meeting on Association for Computational Linguistics - 1997
DOI: 10.3115/976909.979664
|View full text |Cite
|
Sign up to set email alerts
|

Decoding algorithm in statistical machine translation

Abstract: Decoding algorithm is a crucial part in statistical machine translation. We describe a stack decoding algorithm in this paper. We present the hypothesis scoring method and the heuristics used in our algorithm. We report several techniques deployed to improve the performance of the decoder. We also introduce a simplified model to moderate the sparse data problem and to speed up the decoding process. We evaluate and compare these techniques/models in our statistical machine translation system.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
50
0

Year Published

2004
2004
2018
2018

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 64 publications
(51 citation statements)
references
References 3 publications
0
50
0
Order By: Relevance
“…Second, hypotheses with different C can be stored in the same list. In order to properly compare the hypothesis that covers different parts of the source sentence, estimation (usually heuristic) of the contribution to the score of the parts, that are not yet covered, can be introduced [50]. Third, in order to reduce the computational cost of the algorithm, re-ordering restrictions must be introduced.…”
Section: Non-monotone Searchmentioning
confidence: 99%
“…Second, hypotheses with different C can be stored in the same list. In order to properly compare the hypothesis that covers different parts of the source sentence, estimation (usually heuristic) of the contribution to the score of the parts, that are not yet covered, can be introduced [50]. Third, in order to reduce the computational cost of the algorithm, re-ordering restrictions must be introduced.…”
Section: Non-monotone Searchmentioning
confidence: 99%
“…With the exception of the greedy algorithm [4], the rest of them use the concept of partial translation hypothesis to perform the search [1][8] [12]. In a partial translation hypothesis, some of the source words have been used to generate a target prefix.…”
Section: Decoding Algorithmsmentioning
confidence: 99%
“…c.Expand the 'max' cell to the largest possible rectangle regions (R start , R end , C start ,C end ) under two constraints: (1). all the cells in the expanded region accord with the evaluation function ; (2). all the cells should not be marked.…”
Section: -1 Extracting Directly Through Ibm Word-based Modelmentioning
confidence: 99%
“…We use the HMM-based alignment model introduced in [8]. For a source phrase that ranges from position 1 j to 2 j in sentence, we can get the corresponding target phrase's beginning position and ending position to extract the phrase translation. Just like the method described in 2-1, a given factor that prevents the length of the phrase pairs differ greatly is needed.…”
Section: -3 Extracting Phrase Pairs From Hmm Word Alignment Modelmentioning
confidence: 99%
See 1 more Smart Citation