The paper describes an algorithm that employs English and French text taggers to associate noun phrases in an aligned bilingual corpus. The taggets 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 other approaches for finding word correspondences, with the advantage that linguistic structure is incorporated. Improvements to the basic algorithm are described, which enable context to be accounted for when constructing the noun phrase mappings.
REF attempted to find noun phrase correspondences in parallel corpora using part-of-speech tagging and noun phrase recognition methods.
An Algorithm For Finding Noun Phrase Correspondences In Bilingual Corpora
Annual Meeting Of The Association For Computational Linguistics
Computer Science