### Question:
Relatedness { public boolean matchViaLevenshtein(String left, String right) { int dist = StringUtils.getLevenshteinDistance( StringUtils.canonicalize(left), StringUtils.canonicalize(right), 2); return (0 <= dist && dist < 2); } Relatedness(Environment env); List<Weighted<String>> viaWikiLinks(String[] sources); boolean matchViaSearch(String left, String right); boolean matchViaLevenshtein(String left, String right); boolean implies(Phrase left, Phrase right); final Redirects redirects; }### Answer:
@Test public void testMatchViaLevenshtein() { fail("Not yet implemented"); }