Back to Results
First PageMeta Content
Markov models / Bitext word alignment / Science / Statistical machine translation / Dice / Function / Hidden Markov model / Probability and statistics / Machine translation / Bioinformatics / Mathematics


A Discriminative Matching Approach to Word Alignment Ben Taskar Simon Lacoste-Julien Dan Klein Computer Science Division, EECS Department
Add to Reading List

Document Date: 2010-06-14 17:43:51


Open Document

File Size: 893,74 KB

Share Result on Facebook

City

Edmonton / Vancouver / Cambridge / /

Company

IBM / D. P. Bertsekas L. C. / Neural Information Processing Systems / MIT Press / Intel / J. Cocke S. A. / /

Country

Jordan / Canada / /

Facility

EECS Department University of California / /

IndustryTerm

combinatorial algorithms / e-relaxation / candidate solution / alignment systems / perceptron algorithms / well known combinatorial algorithms / greedy linking algorithm / separable convex cost network / learning algorithm / be solved using well known combinatorial algorithms / /

Organization

Word Alignment Ben Taskar Simon Lacoste-Julien Dan Klein Computer Science Division / MIT / EECS Department University / University of California / Berkeley / Association for Computational Linguistics / /

Person

B. Taskar / V / Della Pietra / V / J. Della Pietra / Ben Taskar Simon / Julien Dan Klein / F. Jelinek / Simon Lacoste-Julien Dan / /

ProvinceOrState

Alberta / California / Massachusetts / /

PublishedMedium

Computational Linguistics / Machine Learning / Theoretical Computer Science / /

Technology

learning algorithm / matching algorithm / machine translation / 2 Algorithm / supervised algorithm / greedy linking algorithm / well known combinatorial algorithms / Machine Learning / perceptron algorithms / /

URL

www.cs.berkeley.edu/~taskar/extragradient.pdf / /

SocialTag