info.debatty.java.stringsimilarity.examples.nischay21 Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of java-string-similarity Show documentation

Implementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard index, Longest Common Subsequence edit distance, cosine similarity...

There is a newer version: 2.0.0

Show newest version

/*
 * The MIT License
 *
 * Copyright 2017 Thibault Debatty.
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 * THE SOFTWARE.
 */

package info.debatty.java.stringsimilarity.examples;

import info.debatty.java.stringsimilarity.Cosine;
import info.debatty.java.stringsimilarity.Damerau;
import info.debatty.java.stringsimilarity.Jaccard;
import info.debatty.java.stringsimilarity.JaroWinkler;
import info.debatty.java.stringsimilarity.Levenshtein;
import info.debatty.java.stringsimilarity.NGram;
import info.debatty.java.stringsimilarity.SorensenDice;
import info.debatty.java.stringsimilarity.interfaces.StringDistance;
import java.util.LinkedList;

/**
 *
 * @author Thibault Debatty
 */
public class nischay21 {

    /**
     * @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 algos = new LinkedList();
        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();

    }

}