Back to Results
First PageMeta Content
Ugaritic alphabet / Alphabet / Semitic languages / Matching / Hungarian language / Lexicon / Spelling alphabet / YUV / Languages of Europe / Linguistics / Language


Simple Effective Decipherment via Combinatorial Optimization Taylor Berg-Kirkpatrick and Dan Klein Computer Science Division University of California at Berkeley {tberg, klein}@cs.berkeley.edu Abstract
Add to Reading List

Document Date: 2011-09-19 22:38:08


Open Document

File Size: 542,18 KB

Share Result on Facebook

Company

Solve LP / /

Country

Jordan / /

/

Facility

Dan Klein Computer Science Division University of California at Berkeley / Model Hall / D. Hall / /

IndustryTerm

greedy competitive linking algorithm / state-ofthe-art systems / integer solutions / optimized yields accurate solutions / bipartite matching algorithm / fixed yields integer solutions / /

OperatingSystem

GNU / /

Organization

University of California / National Science Foundation / /

Person

Taylor Berg-Kirkpatrick / Dan Klein / Hall / /

Position

parametrically simplistic model / but instead emphasize inference / Model / statistical model for lost language decipherment / /

Technology

Natural Language Processing / bipartite matching algorithm / Machine Translation / be matched using a bipartite matching algorithm / /

SocialTag