统计机器翻译中一种高效的A*搜索算法

Proceedings of the workshop on Data-driven methods in machine translation - Pub Date : 2001-07-07 DOI:10.3115/1118037.1118045

F. Och, Nicola Ueffing, H. Ney

{"title":"统计机器翻译中一种高效的A*搜索算法","authors":"F. Och, Nicola Ueffing, H. Ney","doi":"10.3115/1118037.1118045","DOIUrl":null,"url":null,"abstract":"In this paper, we describe an efficient A* search algorithm for statistical machine translation. In contrary to beam-search or greedy approaches it is possible to guarantee the avoidance of search errors with A*. We develop various so-phisticated 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.","PeriodicalId":288328,"journal":{"name":"Proceedings of the workshop on Data-driven methods in machine translation -","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"128","resultStr":"{\"title\":\"An Efficient A* Search Algorithm for Statistical Machine Translation\",\"authors\":\"F. Och, Nicola Ueffing, H. Ney\",\"doi\":\"10.3115/1118037.1118045\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we describe an efficient A* search algorithm for statistical machine translation. In contrary to beam-search or greedy approaches it is possible to guarantee the avoidance of search errors with A*. We develop various so-phisticated 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.\",\"PeriodicalId\":288328,\"journal\":{\"name\":\"Proceedings of the workshop on Data-driven methods in machine translation -\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-07-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"128\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the workshop on Data-driven methods in machine translation -\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3115/1118037.1118045\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the workshop on Data-driven methods in machine translation -","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3115/1118037.1118045","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 128

摘要

本文描述了一种高效的统计机器翻译的A*搜索算法。与波束搜索或贪婪方法相反，它可以保证使用A*避免搜索错误。我们开发了各种复杂的可接受的和几乎可接受的启发式函数。特别是我们新开发的使用迭代改进的启发式函数执行多遍a *搜索的方法，使我们甚至可以翻译长句子。我们比较了A*搜索算法和波束搜索方法在Hansards任务中的应用。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

An Efficient A* Search Algorithm for Statistical Machine Translation

In this paper, we describe an efficient A* search algorithm for statistical machine translation. In contrary to beam-search or greedy approaches it is possible to guarantee the avoidance of search errors with A*. We develop various so-phisticated 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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助