KyotoEBMT v1.0

Welcome to the official documentation for KyotoEBMT v1.0 ‘Awamori’.

The KyotoEBMT translation framework takes a tree-to-tree approach to Machine Translation, employing syntactic dependency analysis for both source and target languages in an attempt to preserve non-local structure. The effectiveness of our system is maximized with online example matching and a flexible decoder. Evaluation demonstrates BLEU scores competitive with state-of-the-art SMT systems such as Moses.

This document explains the usage of the KyotoEBMT system (Richardson et al., 2014). See the project homepage for further details.

The source can be downloaded here.

Please send any questions or comments to:

Contributions

We gratefully welcome your contributions to KyotoEBMT.

• Bug reports: Please give a detailed explanation of anything you feel is not working correctly.

• Fixes: Please send a patch (diff) with a short explanation of your changes.

• New features: Anything is welcome, but please check first that your feature is not currently being worked on by someone else.

All patches/bug reports should be sent by email to John (see above).

Version History

• 2015/09/25 v1.0 ‘Awamori’

  • Full forest input support

  • Improved documentation and usability

  • End-to-end translation works out-of-the-box

  • Various improvements and bugfixes

  • Supports bilingual RNNLM reranking

• 2015/03/31 v0.6 ‘Whisky’

  • Experiment Management System (EMS)

  • Example similarity, alignment score, word similarity features

  • Decoding memory and speed optimisations

• 2014/10/04 v0.5 ‘Sake’ (@WAT2014)

  • Forest/n-best input (currently not supported)

  • Reranking with RNNLM (Mikolov et al., 2010)

• 2014/06/18 v0.4 ‘Bourbon’ (@ACL2014)

  • Lexical translation probability feature

  • Tuner improvements

  • First public release

• 2014/02/04 v0.3 ‘Champagne’

  • Many new example features

  • Lattice decoding

  • UI for tuning/serialisation

• 2013/8/23 v0.2 ‘Mojito’

  • Improved decoding algorithm (also experimental ‘lazy’ algorithm)

  • Siblings supported

  • Language-dependent modules and post-processing

  • Hypothesis serialisation

  • Dependency tree output

• 2013/5/13 v0.1 ‘Raki’

  • Perl version rewritten in C

  • Tuning scripts, web output, logging

Evaluation

Latest evaluation results (BLEU) for ASPEC data set (see here).

License

KyotoEBMT Example-Based Machine Translation System
Copyright (C) 2014 John Richardson, Fabien Cromieres, Toshiaki Nakazawa and Sadao Kurohashi

This program is free software: you can redistribute it and/or modify it under the terms of the GNU Affero General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.

This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Affero General Public License for more details.

You should have received a copy of the GNU Affero General Public License along with this program. If not, see <http://www.gnu.org/licenses/>.