Facebook Instagram Twitter RSS Feed PodBean Back to top on side

Method to Overcome the Ambiguities in Shallow Parse and Transfer Machine Translation

In: Computing and Informatics, vol. 37, no. 6
Jernej Vičič - M. Grgurovič

Details:

Year, pages: 2019, 1443 - 1463
Language: eng
Keywords:
Multigraph, k-shortest paths, shallow parse and transfer RBMT, machine translation
Document type: article
About article:
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.
How to cite:
ISO 690:
Vičič, J., Grgurovič, M. 2019. Method to Overcome the Ambiguities in Shallow Parse and Transfer Machine Translation. In Computing and Informatics, vol. 37, no.6, pp. 1443-1463. 1335-9150. DOI: https://doi.org/10.4149/cai_2018_6_1443

APA:
Vičič, J., Grgurovič, M. (2019). Method to Overcome the Ambiguities in Shallow Parse and Transfer Machine Translation. Computing and Informatics, 37(6), 1443-1463. 1335-9150. DOI: https://doi.org/10.4149/cai_2018_6_1443
About edition:
Publisher: Ústav informatiky SAV
Published: 15. 2. 2019