|
Joshua
open source statistical hierarchical phrase-based machine translation system
|
Static Public Member Functions | |
| static final int | levenshtein (String[] candidate, String[] source) |
Static Private Member Functions | |
| static final int | minimum (int a, int b, int c) |
| static final int joshua.util.Algorithms.levenshtein | ( | String[] | candidate, |
| String[] | source | ||
| ) | [static] |
Calculates the Levenshtein Distance for a candidate paraphrase given the source.
The code is based on the example by Michael Gilleland found at http://www.merriampark.com/ld.htm.
| static final int joshua.util.Algorithms.minimum | ( | int | a, |
| int | b, | ||
| int | c | ||
| ) | [static, private] |
Returns the minimum of the three values.