Sørensen–Dice Coefficient

The Sørensen–Dice coefficient also known as Sørensen–Dice index, Sørensen index, Dice's coefficient or Soerenson index, is a simple and elegant way to calculate a measure of the similarity of two strings. The values produces are bounded between zero and one. The algorithm works by comparing the number of identical character pairs between the two strings.

• C#
• VB.Net
• C
• C++
• PHP

									/*****Please include following header files*****/
// string.h
/***********************************************/

double DiceMatch(const char *string1, const char *string2)
{
	if (((string1 != NULL) && (string1[0] == '\0')) || ((string2 != NULL) && (string2[0] == '\0')))
		return 0;

	if (string1 == string2)
		return 1;

	size_t strlen1 = strlen(string1);
	size_t strlen2 = strlen(string2);

	if (strlen1 < 2 || strlen2 < 2)
		return 0;

	size_t length1 = strlen1 - 1;
	size_t length2 = strlen2 - 1;

	double matches = 0;
	int i = 0;
	int j = 0;

	while (i < length1 && j < length2)
	{
		char a[3] = { string1[i], string1[i + 1], '\0' };
		char b[3] = { string2[j], string2[j + 1], '\0' };
		int cmp = _strcmpi(a, b);

		if (cmp == 0)
			matches += 2;

		++i;
		++j;
	}

	return matches / (length1 + length2);
}
								

Example

									double result = DiceMatch("algorithms are fun", "logarithms are not");
								

Output

									result: 0.58823529411764708