Joshua
open source statistical hierarchical phrase-based machine translation system
 All Classes Namespaces Functions Variables Typedefs Enumerations Enumerator Friends
joshua.util.Algorithms Class Reference

List of all members.

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)

Member Function Documentation

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.

Here is the call graph for this function:

Here is the caller graph for this function:

static final int joshua.util.Algorithms.minimum ( int  a,
int  b,
int  c 
) [static, private]

Returns the minimum of the three values.

Here is the caller graph for this function: