1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
|
package de.lmu.ifi.dbs.elki.distance.distancefunction.strings;
/*
This file is part of ELKI:
Environment for Developing KDD-Applications Supported by Index-Structures
Copyright (C) 2013
Ludwig-Maximilians-Universität München
Lehr- und Forschungseinheit für Datenbanksysteme
ELKI Development Team
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU Affero General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Affero General Public License for more details.
You should have received a copy of the GNU Affero General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
import static org.junit.Assert.assertEquals;
import org.junit.Test;
import de.lmu.ifi.dbs.elki.JUnit4Test;
/**
* Unit test for Levenshtein distance.
*
* @author Erich Schubert
*/
public class NormalizedLevenshteinDistanceFunctionTest implements JUnit4Test {
/**
* Some test strings, from the Wikipedia article.
*/
final String[][] TESTS = { //
{ "kitten", "sitting" }, //
{ "Saturday", "Sunday" }, //
{ "tier", "tor" }, //
{ "abcz", "zabc" }, //
{ "zabc", "abcz" }, //
};
/**
* The associated scores.
*/
final double[] SCORES = { //
3. / 6.5, // kitten <-> sitting
3. / 7., // Saturday <-> Sunday
2. / 3.5, // tier <-> tor
2. / 4., // abcz <-> zabc
2. / 4., // zabc <-> abcz
};
@Test
public void testStringLevenshtein() {
NormalizedLevenshteinDistanceFunction f = NormalizedLevenshteinDistanceFunction.STATIC_SENSITIVE;
for (int i = 0; i < TESTS.length; i++) {
assertEquals("Distance does not agree: " + TESTS[i][0] + " <-> " + TESTS[i][1], SCORES[i], f.distance(TESTS[i][0], TESTS[i][1]).doubleValue(), 1E-10);
}
}
}
|
