Concordance

Query E06-1004 15 (699.3 per million)

tech,15-1-E06-1004,bq	In this paper we study a set of problems that are of considerable importance to <term> Statistical Machine Translation ( SMT ) </term> but which have not been addressed satisfactorily by the <term> SMT research community </term> .	#9937 In this paper we study a set of problems that are of considerable importance toStatistical Machine Translation ( SMT ) but which have not been addressed satisfactorily by the SMT research community.
other,30-1-E06-1004,bq	In this paper we study a set of problems that are of considerable importance to <term> Statistical Machine Translation ( SMT ) </term> but which have not been addressed satisfactorily by the <term> SMT research community </term> .	#9952 In this paper we study a set of problems that are of considerable importance to Statistical Machine Translation (SMT) but which have not been addressed satisfactorily by theSMT research community.
tech,8-2-E06-1004,bq	Over the last decade , a variety of <term> SMT algorithms </term> have been built and empirically tested whereas little is known about the <term> computational complexity </term> of some of the fundamental problems of <term> SMT </term> .	#9964 Over the last decade, a variety ofSMT algorithms have been built and empirically tested whereas little is known about the computational complexity of some of the fundamental problems of SMT.
other,22-2-E06-1004,bq	Over the last decade , a variety of <term> SMT algorithms </term> have been built and empirically tested whereas little is known about the <term> computational complexity </term> of some of the fundamental problems of <term> SMT </term> .	#9978 Over the last decade, a variety of SMT algorithms have been built and empirically tested whereas little is known about thecomputational complexity of some of the fundamental problems of SMT.
tech,31-2-E06-1004,bq	Over the last decade , a variety of <term> SMT algorithms </term> have been built and empirically tested whereas little is known about the <term> computational complexity </term> of some of the fundamental problems of <term> SMT </term> .	#9987 Over the last decade, a variety of SMT algorithms have been built and empirically tested whereas little is known about the computational complexity of some of the fundamental problems ofSMT.
other,10-3-E06-1004,bq	Our work aims at providing useful insights into the the <term> computational complexity </term> of those problems .	#9999 Our work aims at providing useful insights into the thecomputational complexity of those problems.
tool,4-4-E06-1004,bq	We prove that while <term> IBM Models 1-2 </term> are conceptually and computationally simple , computations involving the higher ( and more useful ) <term> models </term> are <term> hard </term> .	#10009 We prove that whileIBM Models 1-2 are conceptually and computationally simple, computations involving the higher (and more useful) models are hard.
model,22-4-E06-1004,bq	We prove that while <term> IBM Models 1-2 </term> are conceptually and computationally simple , computations involving the higher ( and more useful ) <term> models </term> are <term> hard </term> .	#10027 We prove that while IBM Models 1-2 are conceptually and computationally simple, computations involving the higher (and more useful)models are hard.
other,24-4-E06-1004,bq	We prove that while <term> IBM Models 1-2 </term> are conceptually and computationally simple , computations involving the higher ( and more useful ) <term> models </term> are <term> hard </term> .	#10029 We prove that while IBM Models 1-2 are conceptually and computationally simple, computations involving the higher (and more useful) models arehard.
other,8-5-E06-1004,bq	Since it is unlikely that there exists a <term> polynomial time solution </term> for any of these <term> hard problems </term> ( unless <term> P = NP </term> and <term> P #P = P </term> ) , our results highlight and justify the need for developing <term> polynomial time approximations </term> for these computations .	#10039 Since it is unlikely that there exists apolynomial time solution for any of these hard problems (unless P = NP and P#P = P), our results highlight and justify the need for developing polynomial time approximations for these computations.
other,15-5-E06-1004,bq	Since it is unlikely that there exists a <term> polynomial time solution </term> for any of these <term> hard problems </term> ( unless <term> P = NP </term> and <term> P #P = P </term> ) , our results highlight and justify the need for developing <term> polynomial time approximations </term> for these computations .	#10046 Since it is unlikely that there exists a polynomial time solution for any of thesehard problems (unless P = NP and P#P = P), our results highlight and justify the need for developing polynomial time approximations for these computations.
other,19-5-E06-1004,bq	Since it is unlikely that there exists a <term> polynomial time solution </term> for any of these <term> hard problems </term> ( unless <term> P = NP </term> and <term> P #P = P </term> ) , our results highlight and justify the need for developing <term> polynomial time approximations </term> for these computations .	#10050 Since it is unlikely that there exists a polynomial time solution for any of these hard problems (unlessP = NP and P#P = P), our results highlight and justify the need for developing polynomial time approximations for these computations.
other,23-5-E06-1004,bq	Since it is unlikely that there exists a <term> polynomial time solution </term> for any of these <term> hard problems </term> ( unless <term> P = NP </term> and <term> P #P = P </term> ) , our results highlight and justify the need for developing <term> polynomial time approximations </term> for these computations .	#10054 Since it is unlikely that there exists a polynomial time solution for any of these hard problems (unless P = NP andP #P = P), our results highlight and justify the need for developing polynomial time approximations for these computations.
other,38-5-E06-1004,bq	Since it is unlikely that there exists a <term> polynomial time solution </term> for any of these <term> hard problems </term> ( unless <term> P = NP </term> and <term> P #P = P </term> ) , our results highlight and justify the need for developing <term> polynomial time approximations </term> for these computations .	#10069 Since it is unlikely that there exists a polynomial time solution for any of these hard problems (unless P = NP and P#P = P), our results highlight and justify the need for developingpolynomial time approximations for these computations.
other,9-6-E06-1004,bq	We also discuss some practical ways of dealing with <term> complexity </term> .	#10085 We also discuss some practical ways of dealing withcomplexity.


	in Help