| /* |
| * The Apache Software License, Version 1.1 |
| * |
| * |
| * Copyright (c) 2003 The Apache Software Foundation. All rights |
| * reserved. |
| * |
| * Redistribution and use in source and binary forms, with or without |
| * modification, are permitted provided that the following conditions |
| * are met: |
| * |
| * 1. Redistributions of source code must retain the above copyright |
| * notice, this list of conditions and the following disclaimer. |
| * |
| * 2. Redistributions in binary form must reproduce the above copyright |
| * notice, this list of conditions and the following disclaimer in |
| * the documentation and/or other materials provided with the |
| * distribution. |
| * |
| * 3. The end-user documentation included with the redistribution, |
| * if any, must include the following acknowledgment: |
| * "This product includes software developed by the |
| * Apache Software Foundation (http://www.apache.org/)." |
| * Alternately, this acknowledgment may appear in the software itself, |
| * if and wherever such third-party acknowledgments normally appear. |
| * |
| * 4. The names "Apache" and "Apache Software Foundation" must |
| * not be used to endorse or promote products derived from this |
| * software without prior written permission. For written |
| * permission, please contact apache@apache.org. |
| * |
| * 5. Products derived from this software may not be called "Apache |
| * XMLBeans", nor may "Apache" appear in their name, without prior |
| * written permission of the Apache Software Foundation. |
| * |
| * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED |
| * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
| * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
| * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR |
| * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF |
| * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND |
| * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, |
| * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT |
| * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| * SUCH DAMAGE. |
| * ==================================================================== |
| * |
| * This software consists of voluntary contributions made by many |
| * individuals on behalf of the Apache Software Foundation and was |
| * originally based on software copyright (c) 2000-2003 BEA Systems |
| * Inc., <http://www.bea.com/>. For more information on the Apache Software |
| * Foundation, please see <http://www.apache.org/>. |
| */ |
| |
| package org.apache.xmlbeans.impl.common; |
| |
| public class Levenshtein |
| { |
| //**************************** |
| // Get minimum of three values |
| //**************************** |
| |
| private static int minimum(int a, int b, int c) |
| { |
| int mi = a; |
| if (b < mi) |
| mi = b; |
| if (c < mi) |
| mi = c; |
| return mi; |
| } |
| |
| //***************************** |
| // Compute Levenshtein distance |
| //***************************** |
| public static int distance(String s, String t) |
| { |
| int d[][]; // matrix |
| int n; // length of s |
| int m; // length of t |
| int i; // iterates through s |
| int j; // iterates through t |
| char s_i; // ith character of s |
| char t_j; // jth character of t |
| int cost; // cost |
| |
| // Step 1 |
| n = s.length(); |
| m = t.length(); |
| if (n == 0) |
| return m; |
| if (m == 0) |
| return n; |
| d = new int[n+1][m+1]; |
| |
| // Step 2 |
| for (i = 0; i <= n; i++) |
| d[i][0] = i; |
| for (j = 0; j <= m; j++) |
| d[0][j] = j; |
| |
| // Step 3 |
| for (i = 1; i <= n; i++) |
| { |
| s_i = s.charAt (i - 1); |
| |
| // Step 4 |
| for (j = 1; j <= m; j++) |
| { |
| t_j = t.charAt(j - 1); |
| |
| // Step 5 |
| if (s_i == t_j) |
| cost = 0; |
| else |
| cost = 1; |
| |
| // Step 6 |
| d[i][j] = minimum(d[i-1][j]+1, d[i][j-1]+1, d[i-1][j-1] + cost); |
| } |
| } |
| |
| // Step 7 |
| return d[n][m]; |
| } |
| |
| } |