DamerauLevenshteinDistance.java.html
8.4 KB
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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd"><html xmlns="http://www.w3.org/1999/xhtml" lang="en"><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8"/><link rel="stylesheet" href="../jacoco-resources/report.css" type="text/css"/><link rel="shortcut icon" href="../jacoco-resources/report.gif" type="image/gif"/><title>DamerauLevenshteinDistance.java</title><link rel="stylesheet" href="../jacoco-resources/prettify.css" type="text/css"/><script type="text/javascript" src="../jacoco-resources/prettify.js"></script></head><body onload="window['PR_TAB_WIDTH']=4;prettyPrint()"><div class="breadcrumb" id="breadcrumb"><span class="info"><a href="../jacoco-sessions.html" class="el_session">Sessions</a></span><a href="../index.html" class="el_report">MTAS</a> > <a href="index.source.html" class="el_package">mtas.codec.util.distance</a> > <span class="el_source">DamerauLevenshteinDistance.java</span></div><h1>DamerauLevenshteinDistance.java</h1><pre class="source lang-java linenums">package mtas.codec.util.distance;
import java.io.IOException;
import java.util.Arrays;
import java.util.Map;
import java.util.Map.Entry;
import org.apache.lucene.util.BytesRef;
import mtas.analysis.token.MtasToken;
/**
* The Class DamerauLevenshteinDistance.
*/
public class DamerauLevenshteinDistance extends LevenshteinDistance {
/** The Constant defaultTranspositionDistance. */
protected final static double defaultTranspositionDistance = 1.0;
/** The transposition distance. */
protected double transpositionDistance;
/** The Constant PARAMETER_TRANSPOSITIONDISTANCE. */
protected final static String PARAMETER_TRANSPOSITIONDISTANCE = "transpositionDistance";
/**
* Instantiates a new damerau levenshtein distance.
*
* @param prefix the prefix
* @param base the base
* @param maximum the maximum
* @param parameters the parameters
* @throws IOException Signals that an I/O exception has occurred.
*/
public DamerauLevenshteinDistance(String prefix, String base, Double maximum,
Map<String, String> parameters) throws IOException {
<span class="nc" id="L37"> super(prefix, base, maximum, parameters);</span>
<span class="nc" id="L38"> transpositionDistance = defaultTranspositionDistance;</span>
<span class="nc bnc" id="L39" title="All 2 branches missed."> if (parameters != null) {</span>
<span class="nc bnc" id="L40" title="All 2 branches missed."> for (Entry<String, String> entry : parameters.entrySet()) {</span>
<span class="nc bnc" id="L41" title="All 2 branches missed."> if (entry.getKey().equals(PARAMETER_TRANSPOSITIONDISTANCE)) {</span>
<span class="nc" id="L42"> transpositionDistance = Double.parseDouble(entry.getValue());</span>
}
<span class="nc" id="L44"> }</span>
}
<span class="nc bnc" id="L46" title="All 2 branches missed."> if (transpositionDistance < 0) {</span>
<span class="nc" id="L47"> throw new IOException("distances should be zero or positive");</span>
}
<span class="nc" id="L49"> }</span>
/*
* (non-Javadoc)
*
* @see
* mtas.codec.util.distance.LevenshteinDistance#validate(org.apache.lucene.
* util.BytesRef)
*/
@Override
public boolean validate(BytesRef term) {
<span class="nc bnc" id="L60" title="All 2 branches missed."> if (maximum == null) {</span>
<span class="nc" id="L61"> return true;</span>
} else {
<span class="nc" id="L63"> double[][] state = _start();</span>
char ch1;
<span class="nc" id="L65"> char ch2 = 0x00;</span>
<span class="nc" id="L66"> int i = term.offset + MtasToken.DELIMITER.length() + prefix.length();</span>
<span class="nc bnc" id="L67" title="All 2 branches missed."> for (; i < term.length; i++) {</span>
<span class="nc" id="L68"> ch1 = (char) term.bytes[i];</span>
<span class="nc bnc" id="L69" title="All 2 branches missed."> if (ch1 == 0x00) {</span>
<span class="nc" id="L70"> break;</span>
}
<span class="nc" id="L72"> state = _step(state, ch1, ch2);</span>
<span class="nc bnc" id="L73" title="All 2 branches missed."> if (!_can_match(state)) {</span>
<span class="nc" id="L74"> return false;</span>
}
<span class="nc" id="L76"> ch2 = ch1;</span>
}
<span class="nc" id="L78"> return _is_match(state);</span>
}
}
/*
* (non-Javadoc)
*
* @see mtas.codec.util.distance.LevenshteinDistance#compute(java.lang.String)
*/
@Override
public double compute(String key) {
<span class="nc" id="L89"> double[][] state = _start();</span>
<span class="nc" id="L90"> char ch2 = 0x00;</span>
<span class="nc bnc" id="L91" title="All 2 branches missed."> for (char ch1 : key.toCharArray()) {</span>
<span class="nc bnc" id="L92" title="All 2 branches missed."> if (ch1 == 0x00) {</span>
<span class="nc" id="L93"> break;</span>
}
<span class="nc" id="L95"> state = _step(state, ch1, ch2);</span>
<span class="nc" id="L96"> ch2 = ch1;</span>
}
<span class="nc" id="L98"> return _distance(state);</span>
}
/**
* Start.
*
* @return the double[][]
*/
private double[][] _start() {
<span class="nc" id="L107"> double[][] startState = new double[3][];</span>
<span class="nc" id="L108"> startState[0] = new double[initialState.length];</span>
<span class="nc" id="L109"> startState[1] = new double[initialState.length];</span>
<span class="nc" id="L110"> startState[2] = Arrays.copyOf(initialState, initialState.length);</span>
<span class="nc" id="L111"> return startState;</span>
}
/**
* Step.
*
* @param state the state
* @param ch1 the ch 1
* @param ch2 the ch 2
* @return the double[][]
*/
private double[][] _step(double[][] state, char ch1, char ch2) {
double cost;
<span class="nc" id="L124"> _shift(state);</span>
<span class="nc" id="L125"> state[2][0] = state[1][0] + deletionDistance;</span>
<span class="nc bnc" id="L126" title="All 2 branches missed."> for (int i = 0; i < base.length(); i++) {</span>
<span class="nc bnc" id="L127" title="All 2 branches missed."> cost = (base.charAt(i) == ch1) ? 0 : replaceDistance;</span>
<span class="nc" id="L128"> state[2][i + 1] = Math.min(state[2][i] + insertionDistance,</span>
state[1][i] + cost);
<span class="nc" id="L130"> state[2][i + 1] = Math.min(state[2][i + 1],</span>
state[1][i + 1] + deletionDistance);
<span class="nc bnc" id="L132" title="All 6 branches missed."> if (i > 0 && ch2 != 0x00 && (base.charAt(i - 1) == ch1)</span>
<span class="nc bnc" id="L133" title="All 2 branches missed."> && (base.charAt(i) == ch2)) {</span>
<span class="nc" id="L134"> state[2][i + 1] = Math.min(state[2][i + 1],</span>
state[0][i - 1] + transpositionDistance);
}
}
<span class="nc" id="L138"> return state;</span>
}
/**
* Shift.
*
* @param state the state
*/
private void _shift(double[][] state) {
<span class="nc" id="L147"> double[] tmpState = state[0];</span>
<span class="nc" id="L148"> state[0] = state[1];</span>
<span class="nc" id="L149"> state[1] = state[2];</span>
<span class="nc" id="L150"> state[2] = tmpState;</span>
<span class="nc" id="L151"> }</span>
/**
* Checks if is match.
*
* @param state the state
* @return true, if successful
*/
private boolean _is_match(double[][] state) {
<span class="nc bnc" id="L160" title="All 2 branches missed."> return state[2][state[2].length - 1] <= maximum;</span>
}
/**
* Can match.
*
* @param state the state
* @return true, if successful
*/
private boolean _can_match(double[][] state) {
<span class="nc bnc" id="L170" title="All 2 branches missed."> for (double d : state[2]) {</span>
<span class="nc bnc" id="L171" title="All 2 branches missed."> if (d <= maximum) {</span>
<span class="nc" id="L172"> return true;</span>
}
}
<span class="nc" id="L175"> return false;</span>
}
/**
* Distance.
*
* @param state the state
* @return the double
*/
private double _distance(double[][] state) {
<span class="nc" id="L185"> return state[2][state[2].length - 1];</span>
}
}
</pre><div class="footer"><span class="right">Created with <a href="http://www.jacoco.org/jacoco">JaCoCo</a> 0.7.9.201702052155</span></div></body></html>