An Algorithm for finding Noun Phrase Correspondences in Bilingual Corpora Export

@inproceedings{citeulike:1205762, abstract = {The paper describes an algorithm that employs English and French text taggers to associate noun phrases in an aligned bilingual corpus. The taggers provide part-of-speech categories which are used by finite-state recognizers to extract simple noun phrases for both languages. Noun phrases are then mapped to each other using an iterative re-estimation algorithm that bears similarities to the Baum-Welch algorithm which is used for training the taggers. The algorithm provides an alternative to...}, author = {Kupiec, Julian}, booktitle = {Meeting of the Association for Computational Linguistics}, citeulike-article-id = {1205762}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.5827}, keywords = {allignment, chunking, history}, pages = {17--22}, posted-at = {2007-04-04 11:44:57}, priority = {2}, title = {An Algorithm for finding Noun Phrase Correspondences in Bilingual Corpora}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.5827}, year = {1993} }

TY - CONF ID - citeulike:1205762 L3 - citeulike-article-id:1205762 N2 - The paper describes an algorithm that employs English and French text taggers to associate noun phrases in an aligned bilingual corpus. The taggers provide part-of-speech categories which are used by finite-state recognizers to extract simple noun phrases for both languages. Noun phrases are then mapped to each other using an iterative re-estimation algorithm that bears similarities to the Baum-Welch algorithm which is used for training the taggers. The algorithm provides an alternative to... EP - 22 TI - An Algorithm for finding Noun Phrase Correspondences in Bilingual Corpora T2 - Meeting of the Association for Computational Linguistics SP - 17 KW - allignment KW - chunking KW - history AU - Kupiec, Julian PY - 1993/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.5827 ER -