| J03-1005 | the most relevant details of the | DP-based search | procedure . The simplified set |
| W06-3602 | of analyzing the complexity of | DP-based search | algorithm . Generally , the regular |
| H05-1022 | model that supports efficient | DP-based search | . We preserve efficiency in the |
| C00-2123 | have presented a new , efficient | DP-based search | procedure for statistical machine |
| C00-2123 | concept to word re-ordering and a | DP-based search | , which is especially suitable |
| W06-3602 | exactly once . In this paper , the | DP-based search | algorithm in ( Tillmann and Ney |
| J03-1005 | statistical MT. In Section 3 , a | DP-based search | approach is presented , along |
| C00-2123 | . <title> Word Re-ordering and | DP-based Search | in Statistical Machine Translation |
| C00-2123 | <figurecaption> Word Re-ordering and | DP-based Search | in Statistical Machine Translation |
| J03-1005 | newly Two-list implementation of a | DP-based search | algorithm for statistical MT. |
