Reconsidering SMT Over NMT for Closely Related Languages: A Case Study of Persian-Hindi Pair

Waisullah Yousofi, Pushpak Bhattacharyya
12/22/2024
cs.CL

No confident code implementation found for this paper.

Abstract

This paper demonstrates that Phrase-Based Statistical Machine Translation (PBSMT) can outperform Transformer-based Neural Machine Translation (NMT) in moderate-resource scenarios, specifically for structurally similar languages, like the Persian-Hindi pair. Despite the Transformer architecture's typical preference for large parallel corpora, our results show that PBSMT achieves a BLEU score of 66.32, significantly exceeding the Transformer-NMT score of 53.7 on the same dataset. Additionally, we explore variations of the SMT architecture, including training on Romanized text and modifying the word order of Persian sentences to match the left-to-right (LTR) structure of Hindi. Our findings highlight the importance of choosing the right architecture based on language pair characteristics and advocate for SMT as a high-performing alternative, even in contexts commonly dominated by NMT.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{yousofi2024reconsidering,
  title  = {Reconsidering SMT Over NMT for Closely Related Languages: A Case Study of Persian-Hindi Pair},
  author = {Waisullah Yousofi and Pushpak Bhattacharyya},
  year   = {2024},
  eprint = {2412.16877},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2412.16877v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2412.16877.svg)](https://codeofpaper.com/paper/2412.16877)

Discussion