info.debatty.java.stringsimilarity

Class SorensenDice

java.lang.Object

info.debatty.java.stringsimilarity.SorensenDice

All Implemented Interfaces:

StringSimilarityInterface

public class SorensenDice
extends Object
implements StringSimilarityInterface

Sorensen-Dice coefficien, aka Sørensen index, Dice's coefficient or Czekanowski's binary (non-quantitative) index. The strings are first converted to boolean sets of k-shingles (strings of k characters), then the similarity is computed as 2 |A inter B| / (|A| + |B|). Attention: Sorensen-Dice distance (and similarity) does not satisfy triangle inequality.

Author:

Thibault Debatty

Constructor Summary

Constructors

Constructor and Description
SorensenDice()
SorensenDice(int k)

Method Summary

Methods

Modifier and Type	Method and Description
double	distance(String s1, String s2) Generally, distance = 1 - similarity.
static void	main(String[] args)
double	similarity(String s1, String s2) Compute Sorensen-Dice coefficient 2 |A inter B| / (|A| + |B|).

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

SorensenDice

public SorensenDice(int k)

SorensenDice

public SorensenDice()

Method Detail

main

public static void main(String[] args)

Parameters:

args - the command line arguments

similarity

public double similarity(String s1,
                String s2)

Compute Sorensen-Dice coefficient 2 |A inter B| / (|A| + |B|).

Specified by:

similarity in interface StringSimilarityInterface

Parameters:

s1 -

s2 -

Returns:

distance

public double distance(String s1,
              String s2)

Description copied from interface: StringSimilarityInterface

Generally, distance = 1 - similarity. Some implementations can also provide a method distanceAbsolute

Specified by:

distance in interface StringSimilarityInterface

Returns:

distance between 0 (s1 = s2) and 1 (completely different)