| other,4-1-H05-1101,ak | </term> . This paper investigates some <term> | computational problems | </term> associated with <term> probabilistic | #5682 This paper investigates somecomputational problems associated with probabilistic translation models that have recently been adopted in the literature on machine translation. | |
| model,8-1-H05-1101,ak | computational problems </term> associated with <term> | probabilistic translation models | </term> that have recently been adopted in | #5686 This paper investigates some computational problems associated withprobabilistic translation models that have recently been adopted in the literature on machine translation. | |
| tech,20-1-H05-1101,ak | been adopted in the literature on <term> | machine translation | </term> . These <term> models </term> can be | #5698 This paper investigates some computational problems associated with probabilistic translation models that have recently been adopted in the literature onmachine translation. | |
| model,1-2-H05-1101,ak | <term> machine translation </term> . These <term> | models | </term> can be viewed as pairs of <term> probabilistic | #5702 Thesemodels can be viewed as pairs of probabilistic context-free grammars working in a 'synchronous' way. | |
| lr,8-2-H05-1101,ak | models </term> can be viewed as pairs of <term> | probabilistic context-free grammars | </term> working in a ' synchronous ' way | #5709 These models can be viewed as pairs ofprobabilistic context-free grammars working in a 'synchronous' way. | |
| other,1-3-H05-1101,ak | working in a ' synchronous ' way . Two <term> | hardness results | </term> for the <term> class NP </term> are reported | #5721 Twohardness results for the class NP are reported, along with an exponential time lower-bound for certain classes of algorithms that are currently used in the literature. | |
| other,5-3-H05-1101,ak | <term> hardness results </term> for the <term> | class NP | </term> are reported , along with an <term> | #5725 Two hardness results for theclass NP are reported, along with an exponential time lower-bound for certain classes of algorithms that are currently used in the literature. | |
| other,13-3-H05-1101,ak | </term> are reported , along with an <term> | exponential time lower-bound | </term> for certain classes of <term> algorithms | #5733 Two hardness results for the class NP are reported, along with anexponential time lower-bound for certain classes of algorithms that are currently used in the literature. | |
| tech,20-3-H05-1101,ak | lower-bound </term> for certain classes of <term> | algorithms | </term> that are currently used in the literature | #5740 Two hardness results for the class NP are reported, along with an exponential time lower-bound for certain classes ofalgorithms that are currently used in the literature. |
