Pith. sign in

REVIEW 1 cited by

SMT vs NMT: A Comparison over Hindi & Bengali Simple Sentences

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1812.04898 v1 pith:AWYAJIKS submitted 2018-12-12 cs.CL

classification cs.CL
keywords sentencessimplerespecttranslationcaselevelmachinemodel
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In the present article, we identified the qualitative differences between Statistical Machine Translation (SMT) and Neural Machine Translation (NMT) outputs. We have tried to answer two important questions: 1. Does NMT perform equivalently well with respect to SMT and 2. Does it add extra flavor in improving the quality of MT output by employing simple sentences as training units. In order to obtain insights, we have developed three core models viz., SMT model based on Moses toolkit, followed by character and word level NMT models. All of the systems use English-Hindi and English-Bengali language pairs containing simple sentences as well as sentences of other complexity. In order to preserve the translations semantics with respect to the target words of a sentence, we have employed soft-attention into our word level NMT model. We have further evaluated all the systems with respect to the scenarios where they succeed and fail. Finally, the quality of translation has been validated using BLEU and TER metrics along with manual parameters like fluency, adequacy etc. We observed that NMT outperforms SMT in case of simple sentences whereas SMT outperforms in case of all types of sentence.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Designing tight frames for quantum computing

    quant-ph 2026-07 conditional novelty 5.0 of 10

    This thesis characterizes harmonic-frame quantum states by an S-matrix, proves a necessary and sufficient separability condition, and implements C_N harmonic POVMs via a Fourier-plus-permutation circuit under Naimark ...

Pith tools