Concordance

Query P05-1032 13 >
Negative filter NNS 12 (559.5 per million)

other,7-1-P05-1032,bq	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 </term> implementations .	#9128 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,bq	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 </term> implementations .	#9131 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.
tech,18-1-P05-1032,bq	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 </term> implementations .	#9139 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,27-1-P05-1032,bq	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 </term> implementations .	#9148 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.
tech,33-1-P05-1032,bq	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 </term> implementations .	#9154 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,bq	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> .	#9160 We detail thecomputational complexity and average retrieval times for looking up phrase translations in our suffix array-based data structure.
measure(ment),6-2-P05-1032,bq	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> .	#9163 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,bq	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> .	#9169 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,bq	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> .	#9173 We detail the computational complexity and average retrieval times for looking up phrase translations in oursuffix array-based data structure.
tech,3-3-P05-1032,bq	We show how <term> sampling </term> can be used to reduce the <term> retrieval time </term> by orders of magnitude with no loss in <term> translation quality </term> .	#9181 We show howsampling can be used to reduce the retrieval time by orders of magnitude with no loss in translation quality.
measure(ment),10-3-P05-1032,bq	We show how <term> sampling </term> can be used to reduce the <term> retrieval time </term> by orders of magnitude with no loss in <term> translation quality </term> .	#9188 We show how sampling can be used to reduce theretrieval time by orders of magnitude with no loss in translation quality.
measure(ment),20-3-P05-1032,bq	We show how <term> sampling </term> can be used to reduce the <term> retrieval time </term> by orders of magnitude with no loss in <term> translation quality </term> .	#9198 We show how sampling can be used to reduce the retrieval time by orders of magnitude with no loss intranslation quality.


	in Help