Dear Moses community, I understand that there is the http://www.cs.umd.edu/~snover/tercom/ implementation of the translation edit rate and https://github.com/jhclark/multeval script that wraps around it.
There's also the python implementation that looks rather cryptic partly because i don't understand japanese: https://github.com/aflc/pyter Looking at the pseudo code in https://www.cs.umd.edu/~snover/pub/amta06/ter_amta.pdf ( http://pastebin.com/Z4KFeFhM) There are several lines that are not so self-explanatory. Could someone help to clarify what they mean? At line 10 on http://pastebin.com/Z4KFeFhM, it says: Find shift, s, that most reduces min-edit- distance(h′, r) *Does that "min-edit-distance" here mean levenshtein distance?* Thanks in advance for the clarification and tips! Regards, liling
_______________________________________________ Moses-support mailing list [email protected] http://mailman.mit.edu/mailman/listinfo/moses-support
