other,4-1-H05-1101,bq </term> . This paper investigates some <term> computational problems </term> associated with <term> probabilistic
model,8-1-H05-1101,bq computational problems </term> associated with <term> probabilistic translation models </term> that have recently been adopted in
other,20-1-H05-1101,bq been adopted in the literature on <term> machine translation </term> . These <term> models </term> can be
model,1-2-H05-1101,bq <term> machine translation </term> . These <term> models </term> can be viewed as pairs of <term> probabilistic
other,8-2-H05-1101,bq models </term> can be viewed as pairs of <term> probabilistic context-free grammars </term> working in a ' synchronous ' way
other,1-3-H05-1101,bq working in a ' synchronous ' way . Two <term> hardness </term> results for the class <term> NP </term>
other,6-3-H05-1101,bq hardness </term> results for the class <term> NP </term> are reported , along with an <term>
other,13-3-H05-1101,bq </term> are reported , along with an <term> exponential time lower-bound </term> for certain classes of <term> algorithms
tech,20-3-H05-1101,bq lower-bound </term> for certain classes of <term> algorithms </term> that are currently used in the literature
skrij podrobnosti