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.
Publié le : 2019-02-05
Classification:
other areas of Computing and Informatics,
Multigraph, k-shortest paths, shallow parse and transfer RBMT, machine translation,
68T50
@article{cai2018_6_1443,
author = {Jernej Vi\v ci\v c; University of Primorska, Andrej Maru\v si\v c Institute (UP IAM), Muzejski trg 2, 6000 Koper and Marko Grgurovi\v c; University of Primorska, The Andrej Maru\v si\v c Institute, Muzejski trg 2, 6000 Koper},
title = {A Method to Overcome the Ambiguities in Shallow Parse and Transfer Machine Translation},
journal = {Computing and Informatics},
volume = {37},
number = {6},
year = {2019},
language = {en},
url = {http://dml.mathdoc.fr/item/cai2018_6_1443}
}
Jernej Vičič; University of Primorska, Andrej Marušič Institute (UP IAM), Muzejski trg 2, 6000 Koper; Marko Grgurovič; University of Primorska, The Andrej Marušič Institute, Muzejski trg 2, 6000 Koper. A Method to Overcome the Ambiguities in Shallow Parse and Transfer Machine Translation. Computing and Informatics, Tome 37 (2019) no. 6, . http://gdmltest.u-ga.fr/item/cai2018_6_1443/