| other,7-1-P05-1032,ak | In this paper we describe a novel <term> data structure </term> for <term> phrase-based statistical machine translation </term> which allows for the <term> retrieval </term> of arbitrarily long <term> phrases </term> while simultaneously using less <term> memory </term> than is required by current <term> decoder implementations </term> . | #8766 In this paper we describe a noveldata structure for phrase-based statistical machine translation which allows for the retrieval of arbitrarily long phrases while simultaneously using less memory than is required by current decoder implementations. | |
| tech,10-1-P05-1032,ak | In this paper we describe a novel <term> data structure </term> for <term> phrase-based statistical machine translation </term> which allows for the <term> retrieval </term> of arbitrarily long <term> phrases </term> while simultaneously using less <term> memory </term> than is required by current <term> decoder implementations </term> . | #8769 In this paper we describe a novel data structure forphrase-based statistical machine translation which allows for the retrieval of arbitrarily long phrases while simultaneously using less memory than is required by current decoder implementations. | |
| other,18-1-P05-1032,ak | In this paper we describe a novel <term> data structure </term> for <term> phrase-based statistical machine translation </term> which allows for the <term> retrieval </term> of arbitrarily long <term> phrases </term> while simultaneously using less <term> memory </term> than is required by current <term> decoder implementations </term> . | #8777 In this paper we describe a novel data structure for phrase-based statistical machine translation which allows for theretrieval of arbitrarily long phrases while simultaneously using less memory than is required by current decoder implementations. | |
| other,22-1-P05-1032,ak | In this paper we describe a novel <term> data structure </term> for <term> phrase-based statistical machine translation </term> which allows for the <term> retrieval </term> of arbitrarily long <term> phrases </term> while simultaneously using less <term> memory </term> than is required by current <term> decoder implementations </term> . | #8781 In this paper we describe a novel data structure for phrase-based statistical machine translation which allows for the retrieval of arbitrarily longphrases while simultaneously using less memory than is required by current decoder implementations. | |
| other,27-1-P05-1032,ak | In this paper we describe a novel <term> data structure </term> for <term> phrase-based statistical machine translation </term> which allows for the <term> retrieval </term> of arbitrarily long <term> phrases </term> while simultaneously using less <term> memory </term> than is required by current <term> decoder implementations </term> . | #8786 In this paper we describe a novel data structure for phrase-based statistical machine translation which allows for the retrieval of arbitrarily long phrases while simultaneously using lessmemory than is required by current decoder implementations. | |
| other,33-1-P05-1032,ak | In this paper we describe a novel <term> data structure </term> for <term> phrase-based statistical machine translation </term> which allows for the <term> retrieval </term> of arbitrarily long <term> phrases </term> while simultaneously using less <term> memory </term> than is required by current <term> decoder implementations </term> . | #8792 In this paper we describe a novel data structure for phrase-based statistical machine translation which allows for the retrieval of arbitrarily long phrases while simultaneously using less memory than is required by currentdecoder implementations. | |
| other,3-2-P05-1032,ak | We detail the <term> computational complexity </term> and <term> average retrieval times </term> for looking up <term> phrase translations </term> in our <term> suffix array-based data structure </term> . | #8798 We detail thecomputational complexity and average retrieval times for looking up phrase translations in our suffix array-based data structure. | |
| other,6-2-P05-1032,ak | We detail the <term> computational complexity </term> and <term> average retrieval times </term> for looking up <term> phrase translations </term> in our <term> suffix array-based data structure </term> . | #8801 We detail the computational complexity andaverage retrieval times for looking up phrase translations in our suffix array-based data structure. | |
| other,12-2-P05-1032,ak | We detail the <term> computational complexity </term> and <term> average retrieval times </term> for looking up <term> phrase translations </term> in our <term> suffix array-based data structure </term> . | #8807 We detail the computational complexity and average retrieval times for looking upphrase translations in our suffix array-based data structure. | |
| other,16-2-P05-1032,ak | We detail the <term> computational complexity </term> and <term> average retrieval times </term> for looking up <term> phrase translations </term> in our <term> suffix array-based data structure </term> . | #8811 We detail the computational complexity and average retrieval times for looking up phrase translations in oursuffix array-based data structure. | |
| other,10-3-P05-1032,ak | We show how sampling can be used to reduce the <term> retrieval time </term> by <term> orders of magnitude </term> with no loss in <term> translation quality </term> . | #8826 We show how sampling can be used to reduce theretrieval time by orders of magnitude with no loss in translation quality. | |
| other,13-3-P05-1032,ak | We show how sampling can be used to reduce the <term> retrieval time </term> by <term> orders of magnitude </term> with no loss in <term> translation quality </term> . | #8829 We show how sampling can be used to reduce the retrieval time byorders of magnitude with no loss in translation quality. | |
| other,20-3-P05-1032,ak | We show how sampling can be used to reduce the <term> retrieval time </term> by <term> orders of magnitude </term> with no loss in <term> translation quality </term> . | #8836 We show how sampling can be used to reduce the retrieval time by orders of magnitude with no loss intranslation quality. |
