Examples with Levenshtein info.debatty.java.stringsimilarity.Levenshtein used on opensource projects

Example 1 with Levenshtein

use of info.debatty.java.stringsimilarity.Levenshtein in project java-string-similarity by tdebatty.

the class nischay21 method main.

/**
     * @param args the command line arguments
     */
public static void main(String[] args) {
    String s1 = "MINI GRINDER KIT";
    String s2 = "Weiler 13001 Mini Grinder Accessory Kit, For Use With Small Right Angle Grinders";
    String s3 = "Milwaukee Video Borescope, Rotating Inspection Scope, Series: M-SPECTOR 360, 2.7 in 640 x 480 pixels High-Resolution LCD, Plastic, Black/Red";
    LinkedList<StringDistance> algos = new LinkedList<StringDistance>();
    algos.add(new JaroWinkler());
    algos.add(new Levenshtein());
    algos.add(new NGram());
    algos.add(new Damerau());
    algos.add(new Jaccard());
    algos.add(new SorensenDice());
    algos.add(new Cosine());
    System.out.println("S1 vs S2");
    for (StringDistance algo : algos) {
        System.out.print(algo.getClass().getSimpleName() + " : ");
        System.out.println(algo.distance(s1, s2));
    }
    System.out.println();
    System.out.println("S1 vs S3");
    for (StringDistance algo : algos) {
        System.out.print(algo.getClass().getSimpleName() + " : ");
        System.out.println(algo.distance(s1, s3));
    }
    System.out.println();
    System.out.println("With .toLower()");
    System.out.println("S1 vs S2");
    for (StringDistance algo : algos) {
        System.out.print(algo.getClass().getSimpleName() + " : ");
        System.out.println(algo.distance(s1.toLowerCase(), s2.toLowerCase()));
    }
    System.out.println();
    System.out.println("S1 vs S3");
    for (StringDistance algo : algos) {
        System.out.print(algo.getClass().getSimpleName() + " : ");
        System.out.println(algo.distance(s1.toLowerCase(), s3.toLowerCase()));
    }
    System.out.println();
}

Example 2 with Levenshtein

use of info.debatty.java.stringsimilarity.Levenshtein in project java-string-similarity by tdebatty.

the class Examples method main.

/**
     * @param args the command line arguments
     */
public static void main(String[] args) {
    // Levenshtein
    // ===========
    System.out.println("\nLevenshtein");
    Levenshtein levenshtein = new Levenshtein();
    System.out.println(levenshtein.distance("My string", "My $tring"));
    System.out.println(levenshtein.distance("My string", "M string2"));
    System.out.println(levenshtein.distance("My string", "My $tring"));
    // Jaccard index
    // =============
    System.out.println("\nJaccard");
    Jaccard j2 = new Jaccard(2);
    // AB BC CD DE DF
    // 1  1  1  1  0
    // 1  1  1  0  1
    // => 3 / 5 = 0.6
    System.out.println(j2.similarity("ABCDE", "ABCDF"));
    // Jaro-Winkler
    // ============
    System.out.println("\nJaro-Winkler");
    JaroWinkler jw = new JaroWinkler();
    // substitution of s and t : 0.9740740656852722
    System.out.println(jw.similarity("My string", "My tsring"));
    // substitution of s and n : 0.8962963223457336
    System.out.println(jw.similarity("My string", "My ntrisg"));
    // Cosine
    // ======
    System.out.println("\nCosine");
    Cosine cos = new Cosine(3);
    // ABC BCE
    // 1  0
    // 1  1
    // angle = 45°
    // => similarity = .71
    System.out.println(cos.similarity("ABC", "ABCE"));
    cos = new Cosine(2);
    // AB BA
    // 2  1
    // 1  1
    // similarity = .95
    System.out.println(cos.similarity("ABAB", "BAB"));
    // Damerau
    // =======
    System.out.println("\nDamerau");
    Damerau damerau = new Damerau();
    // 1 substitution
    System.out.println(damerau.distance("ABCDEF", "ABDCEF"));
    // 2 substitutions
    System.out.println(damerau.distance("ABCDEF", "BACDFE"));
    // 1 deletion
    System.out.println(damerau.distance("ABCDEF", "ABCDE"));
    System.out.println(damerau.distance("ABCDEF", "BCDEF"));
    System.out.println(damerau.distance("ABCDEF", "ABCGDEF"));
    // All different
    System.out.println(damerau.distance("ABCDEF", "POIU"));
    // Optimal String Alignment
    // =======
    System.out.println("\nOptimal String Alignment");
    OptimalStringAlignment osa = new OptimalStringAlignment();
    //Will produce 3.0
    System.out.println(osa.distance("CA", "ABC"));
    // Longest Common Subsequence
    // ==========================
    System.out.println("\nLongest Common Subsequence");
    LongestCommonSubsequence lcs = new LongestCommonSubsequence();
    // Will produce 4.0
    System.out.println(lcs.distance("AGCAT", "GAC"));
    // Will produce 1.0
    System.out.println(lcs.distance("AGCAT", "AGCT"));
    // NGram
    // =====
    // produces 0.416666
    System.out.println("\nNGram");
    NGram twogram = new NGram(2);
    System.out.println(twogram.distance("ABCD", "ABTUIO"));
    // produces 0.97222
    String s1 = "Adobe CreativeSuite 5 Master Collection from cheap 4zp";
    String s2 = "Adobe CreativeSuite 5 Master Collection from cheap d1x";
    NGram ngram = new NGram(4);
    System.out.println(ngram.distance(s1, s2));
    // Normalized Levenshtein
    // ======================
    System.out.println("\nNormalized Levenshtein");
    NormalizedLevenshtein l = new NormalizedLevenshtein();
    System.out.println(l.distance("My string", "My $tring"));
    System.out.println(l.distance("My string", "M string2"));
    System.out.println(l.distance("My string", "abcd"));
    // QGram
    // =====
    System.out.println("\nQGram");
    QGram dig = new QGram(2);
    // AB BC CD CE
    // 1  1  1  0
    // 1  1  0  1
    // Total: 2
    System.out.println(dig.distance("ABCD", "ABCE"));
    System.out.println(dig.distance("", "QSDFGHJKLM"));
    System.out.println(dig.distance("Best Deal Ever! Viagra50/100mg - $1.85 071", "Best Deal Ever! Viagra50/100mg - $1.85 7z3"));
    // Sorensen-Dice
    // =============
    System.out.println("\nSorensen-Dice");
    SorensenDice sd = new SorensenDice(2);
    // AB BC CD DE DF FG
    // 1  1  1  1  0  0
    // 1  1  1  0  1  1
    // => 2 x 3 / (4 + 5) = 6/9 = 0.6666
    System.out.println(sd.similarity("ABCDE", "ABCDFG"));
    // Weighted Levenshtein
    // ====================
    System.out.println("\nWeighted Levenshtein");
    WeightedLevenshtein wl = new WeightedLevenshtein(new CharacterSubstitutionInterface() {

        public double cost(char c1, char c2) {
            // on a keyboard
            if (c1 == 't' && c2 == 'r') {
                return 0.5;
            }
            // is 1.0
            return 1.0;
        }
    });
    System.out.println(wl.distance("String1", "Srring2"));
    // K-Shingling
    System.out.println("\nK-Shingling");
    s1 = "my string,  \n  my song";
    s2 = "another string, from a song";
    Cosine cosine = new Cosine(4);
    System.out.println(cosine.getProfile(s1));
    System.out.println(cosine.getProfile(s2));
    cosine = new Cosine(2);
    System.out.println(cosine.getProfile("ABCAB"));
}