PR + RQ ALMOST EQUAL to PQ: Transliteration Mining Using Bridge Language
Abstract
We address the problem of mining name transliterations from comparable corpora in languages P and Q in the following resource-poor scenario:Parallel names in PQ are not available for training. Parallel names in PR and RQ are available for training.We propose a novel solution for the problem by computing a common geometric feature space for P,Q and R where name transliterations are mapped to similar vectors. We employ Canonical Correlation Analysis (CCA) to compute the common geometric feature space using only parallel names in PR and RQ and without requiring parallel names in PQ. We test our algorithm on data sets in several languages and show that it gives results comparable to the state-of-the-art transliteration mining algorithms that use parallel names in PQ for training.
Cite
Text
Khapra et al. "PR + RQ ALMOST EQUAL to PQ: Transliteration Mining Using Bridge Language." AAAI Conference on Artificial Intelligence, 2010. doi:10.1609/AAAI.V24I1.7526Markdown
[Khapra et al. "PR + RQ ALMOST EQUAL to PQ: Transliteration Mining Using Bridge Language." AAAI Conference on Artificial Intelligence, 2010.](https://mlanthology.org/aaai/2010/khapra2010aaai-pr/) doi:10.1609/AAAI.V24I1.7526BibTeX
@inproceedings{khapra2010aaai-pr,
title = {{PR + RQ ALMOST EQUAL to PQ: Transliteration Mining Using Bridge Language}},
author = {Khapra, Mitesh M. and Udupa, Raghavendra and Kumaran, A. and Bhattacharyya, Pushpak},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2010},
pages = {1346-1351},
doi = {10.1609/AAAI.V24I1.7526},
url = {https://mlanthology.org/aaai/2010/khapra2010aaai-pr/}
}