Graph Algorithms for Multiparallel Word Alignment - Traitement du Langage Parlé Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

Graph Algorithms for Multiparallel Word Alignment

Résumé

With the advent of end-to-end deep learning approaches in machine translation, interest in word alignments initially decreased; however, they have again become a focus of research more recently. Alignments are useful for typological research, transferring formatting like markup to translated texts and can be used in the decoding of machine translation systems. At the same time, massively multilingual processing is becoming an important NLP scenario and pretrained language and machine translation models that are truly multilingual are proposed. However, most alignment algorithms rely on bitexts only and do not leverage the fact that many parallel corpora are multiparallel. In this work, we exploit multiparallelity of corpora by representing an initial set of bilingual alignments as a graph and then predicting additional edges in the graph. We present two graph algorithms for edge prediction: one inspired by recommender systems and one based on network link prediction. Our experimental results show absolute improvements of F 1 of up to 28% over the baseline bilingual word aligner in different datasets.
Fichier principal
Vignette du fichier
2021.emnlp-main.665.pdf (603.57 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-03424044 , version 1 (10-11-2021)

Identifiants

  • HAL Id : hal-03424044 , version 1

Citer

Ayyoob Imani, Masoud Jalili Sabet, Lütfi Keremşenel, Philipp Dufter, François Yvon, et al.. Graph Algorithms for Multiparallel Word Alignment. The 2021 Conference on Empirical Methods in Natural Language Processing, Association for Computational Linguistics, Nov 2021, Punta Cana, Dominica. ⟨hal-03424044⟩
66 Consultations
75 Téléchargements

Partager

Gmail Facebook X LinkedIn More