### Question:
Relatedness { public boolean matchViaSearch(String left, String right) { final int K = 3; final int Q = K/2; ScoreDoc[] left_hits = env.simpleLuceneQuery(left, K); Set<ScoreDoc> lefts = new HashSet<>(Arrays.asList(left_hits)); ScoreDoc[] right_hits = env.simpleLuceneQuery(right, K); Set<ScoreDoc> rights = new HashSet<>(Arrays.asList(right_hits)); return left_hits.length >0 && right_hits.length > 0 && left_hits[0].doc == right_hits[0].doc; } 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 testMatchViaSearch() { fail("Not yet implemented"); }