An Efficient A* Search Algorithm for Statistical Machine Translation (2001)
Cached
Download Links
| Venue: | In Data-Driven Machine Translation Workshop |
| Citations: | 22 - 4 self |
BibTeX
@INPROCEEDINGS{Och01anefficient,
author = {Franz Josef Och and Nicola Ueffing and Hermann Ney},
title = {An Efficient A* Search Algorithm for Statistical Machine Translation},
booktitle = {In Data-Driven Machine Translation Workshop},
year = {2001},
pages = {55--62}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper, we describe an efficient A* search algorithm for statistical machine translation. In contrary to beamsearch or greedy approaches it is possible to guarantee the avoidance of search errors with A*. We develop various sophisticated admissible and almost admissible heuristic functions. Especially our newly developped method to perform a multi-pass A* search with an iteratively improved heuristic function allows us to translate even long sentences. We compare the A* search algorithm with a beam-search approach on the Hansards task. 1
Citations
| 892 | Mathematics of Statistical Machine Translation: Parameter Estimation - Brown, Pietra, et al. - 1993 |
| 341 | Improved statistical alignment models - Och, Ney - 2000 |
| 205 | Improved alignment models for statistical machine translation - Och, Tillmann, et al. - 1999 |
| 155 | HMM-based word alignment in statistical translation - Vogel, Ney, et al. - 1996 |
| 132 | Problem-Solving Methods in Artificial Intelligence - Nilsson, Machines, et al. - 1971 |
| 38 | Statistical machine translation, Final report, JHU workshop - Al-Onaizan, Curin, et al. - 1999 |
| 6 | Word Re-Ordering and Dynamic Programming based Search Algorithms for Statistical Machine Translation - Tillmann - 2001 |
| 5 | Diskrete Mathematik - Aigner - 1993 |
