Abstract
The manuscript proposes a new architecture for a Shallow Parsing and Shallow Transfer Rule-Based Machine Translation System. The newly proposed architecture omits the disambiguation module in the starting phases of the translation pipeline and stores all translation candidates generated by the ambiguous process in the morphological analysis phase. The architecture is based on multigraphs. We propose a simplified version of k-best shortest path algorithm for this special case of directed multigraph. The k-best set is ranked using a trigram language model. The empirical evaluation shows that the new architecture produces better translation quality results with constant delay in time.
Keywords
MSC
68T50
Cite this article
@article{cai-4328,
author = {Jernej Vičič and Marko Grgurovič},
title = {Method to Overcome the Ambiguities in Shallow Parse and Transfer Machine Translation},
journal = {Computing and Informatics},
volume = {37},
number = {6},
pages = {1443--1463},
year = {2018},
issn = {1335-9150},
doi = {10.4149/cai_2018_6_1443}
}
TY - JOUR AU - Jernej Vičič AU - Marko Grgurovič TI - Method to Overcome the Ambiguities in Shallow Parse and Transfer Machine Translation JO - Computing and Informatics VL - 37 IS - 6 SP - 1443 EP - 1463 PY - 2018 SN - 1335-9150 DO - 10.4149/cai_2018_6_1443 UR - https://doi.org/10.4149/cai_2018_6_1443 KW - Multigraph KW - k-shortest paths KW - shallow parse and transfer RBMT KW - machine translation ER -
Vičič, J., & Grgurovič, M. (2018). Method to Overcome the Ambiguities in Shallow Parse and Transfer Machine Translation. Computing and Informatics, 37(6), 1443–1463. https://doi.org/10.4149/cai_2018_6_1443