Download code

Jump to: navigation, search

Back to Levenshtein_distance_(Java)

Download for Windows: single file, zip

Download for UNIX: single file, zip, tar.gz, tar.bz2

EditDistance.java

 1 /* The authors of this work have released all rights to it and placed it
 2 in the public domain under the Creative Commons CC0 1.0 waiver
 3 (http://creativecommons.org/publicdomain/zero/1.0/).
 4 
 5 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
 6 EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
 7 MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
 8 IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
 9 CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
10 TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
11 SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
12 
13 Retrieved from: http://en.literateprograms.org/Levenshtein_distance_(Java)?oldid=18625
14 */
15 
16 public class EditDistance {
17 	public int compute(String s1, String s2) {
18 		int[][] dp = new int[s1.length() + 1][s2.length() + 1];
19 
20 		for (int i = 0; i < dp.length; i++) {
21 			for (int j = 0; j < dp[i].length; j++) {
22 				dp[i][j] = i == 0 ? j : j == 0 ? i : 0;
23 				if (i > 0 && j > 0) {
24 					if (s1.charAt(i - 1) == s2.charAt(j - 1))
25 						dp[i][j] = dp[i - 1][j - 1];
26 					else
27 						dp[i][j] = Math.min(dp[i][j - 1] + 1, Math.min(
28 								dp[i - 1][j - 1] + 1, dp[i - 1][j] + 1));
29 				}
30 			}
31 		}
32 		return dp[s1.length()][s2.length()];
33 	}
34 	public static void main(String[] args) {
35 		EditDistance distance = new EditDistance();
36 		System.out.println(distance.compute("vintner", "writers"));
37 		System.out.println(distance.compute("vintners", "writers"));
38 		System.out.println(distance.compute("vintners", ""));
39 		System.out.println(distance.compute("", ""));
40 	}
41 }


hijacker
hijacker
hijacker
hijacker