Scalable reordering models for SMT based on multiclass SVM


Alrajeh, Abdullah and Niranjan, Mahesan (2015) Scalable reordering models for SMT based on multiclass SVM The Prague Bulletin of Mathematical Linguistics, 103, (1), pp. 65-84. (doi:10.1515/pralin-2015-0004).

Download

[img] PDF art-alrajeh-niranjan.pdf - Other
Available under License Other.

Download (200kB)

Description/Abstract

In state-of-the-art phrase-based statistical machine translation systems, modelling phrase reorderings is an important need to enhance naturalness of the translated outputs, particularly when the grammatical structures of the language pairs differ significantly. Posing phrase movements as a classification problem, we exploit recent developments in solving large-scale multiclass support vector machines. Using dual coordinate descent methods for learning, we provide a mechanism to shrink the amount of training data required for each iteration. Hence, we produce significant computational saving while preserving the accuracy of the models. Our approach is a couple of times faster than maximum entropy approach and more memory-efficient (50% reduction). Experiments were carried out on an Arabic-English corpus with more than a quarter of a billion words. We achieve BLEU score improvements on top of a strong baseline system with sparse reordering features.

Item Type: Article
Digital Object Identifier (DOI): doi:10.1515/pralin-2015-0004
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Organisations: Vision, Learning and Control
ePrint ID: 376612
Date :
Date Event
18 April 2015Published
Date Deposited: 05 May 2015 17:25
Last Modified: 17 Apr 2017 06:18
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/376612

Actions (login required)

View Item View Item