Concordance

Query P05-1032 13 >
Random sample 13 >
Multilevel Sort 13 (606.1 per million)

measure(ment),10-3-P05-1032,bq	sampling </term> can be used to reduce the <term>	retrieval time	</term> by orders of magnitude with no loss	#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	orders of magnitude with no loss in <term>	translation quality	</term> . We describe a novel <term> approach	#9198 We show how sampling can be used to reduce the retrieval time by orders of magnitude with no loss intranslation quality.
measure(ment),6-2-P05-1032,bq	computational complexity </term> and <term>	average retrieval times	</term> for looking up <term> phrase translations	#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	retrieval times </term> for looking up <term>	phrase translations	</term> in our <term> suffix array-based data	#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	<term> phrase translations </term> in our <term>	suffix array-based data structure	</term> . We show how <term> sampling </term>	#9173 We detail the computational complexity and average retrieval times for looking up phrase translations in oursuffix array-based data structure.
other,22-1-P05-1032,bq	retrieval </term> of arbitrarily long <term>	phrases	</term> while simultaneously using less <term>	#9143 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,bq	</term> while simultaneously using less <term>	memory	</term> than is required by current <term>	#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.
other,3-2-P05-1032,bq	</term> implementations . We detail the <term>	computational complexity	</term> and <term> average retrieval times </term>	#9160 We detail thecomputational complexity and average retrieval times for looking up phrase translations in our suffix array-based data structure.
other,7-1-P05-1032,bq	In this paper we describe a novel <term>	data structure	</term> for <term> phrase-based statistical	#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	novel <term> data structure </term> for <term>	phrase-based statistical machine translation	</term> which allows for the <term> retrieval	#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	translation </term> which allows for the <term>	retrieval	</term> of arbitrarily long <term> phrases </term>	#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.
tech,3-3-P05-1032,bq	data structure </term> . We show how <term>	sampling	</term> can be used to reduce the <term> retrieval	#9181 We show howsampling can be used to reduce the retrieval time by orders of magnitude with no loss in translation quality.
tech,33-1-P05-1032,bq	</term> than is required by current <term>	decoder	</term> implementations . We detail the <term>	#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.


	in Help