Access Restriction

Author Klementiev, Alexandre ♦ Roth, Dan
Source CiteSeerX
Content type Text
File Format PDF
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Named Entity Transliteration ♦ Automatic Discovery ♦ Many Natural Language Processing Task ♦ Current Approach ♦ Entity Recognition ♦ Multi-word Ne ♦ Transliteration Pair ♦ English-russian Corpus ♦ Machine Learning Technique ♦ Many Language ♦ Time Distribution ♦ Named Entity ♦ Algorithm Discovers Multi-word Ne ♦ Resource Free Discriminative Approach ♦ Similar Time Distribution ♦ Bilingual Corpus ♦ Small Number ♦ Ne Discovery ♦ High Level ♦ Important Part ♦ Resource Free Language ♦ Resource Rich Language
Abstract Named Entity recognition (NER) is an important part of many natural language processing tasks. Current approaches often employ machine learning techniques and require supervised data. However, many languages lack such resources. This paper 1 presents an (almost) unsupervised learning algorithm for automatic discovery of Named Entities (NEs) in a resource free language, given a bilingual corpora in which it is weakly temporally aligned with a resource rich language. NEs have similar time distributions across such corpora, and often some of the tokens in a multi-word NE are transliterated. We develop an algorithm that exploits both observations iteratively. The algorithm makes use of a new, frequency based, metric for time distributions and a resource free discriminative approach to transliteration. Seeded with a small number of transliteration pairs, our algorithm discovers multi-word NEs, and takes advantage of a dictionary (if one exists) to account for translated or partially translated NEs. We evaluate the algorithm on an English-Russian corpus, and show high level of NEs discovery in Russian. 1.1
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article