| other,12-2-J05-4003,bq | classifier </term> that , given a pair of <term> | sentences | </term> , can reliably determine whether | #9010 We train a maximum entropy classifier that, given a pair of sentences , can reliably determine whether or not they are translations of each other. |
| other,22-2-J05-4003,bq | determine whether or not they are <term> | translations | </term> of each other . Using this <term> | #9020 We train a maximum entropy classifier that, given a pair of sentences, can reliably determine whether or not they are translations of each other. |
| other,23-5-J05-4003,bq | <term> parallel corpus </term> ( 100,000 <term> | words | </term> ) and exploiting a large <term> non-parallel | #9091 We also show that a good-quality MT system can be built from scratch by starting with a very small parallel corpus (100,000 words ) and exploiting a large non-parallel corpus. |
| lr,17-6-J05-4003,bq | pairs </term> for which only scarce <term> | resources | </term> are available . In this paper we | #9117 Thus, our method can be applied with great benefit to language pairs for which only scarce resources are available. |
