| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| siccarly (0) - 8 freq siccart (2) - 1 freq sickerly (2) - 2 freq siccar (2) - 289 freq siccared (2) - 1 freq siccarlie (2) - 4 freq siccer (3) - 3 freq miscarry (3) - 2 freq siecar (3) - 1 freq scaly (3) - 13 freq succar (3) - 3 freq sicecar (3) - 2 freq sisterly (3) - 1 freq scary (3) - 55 freq sicily (3) - 5 freq sincerely (3) - 8 freq siccan (3) - 115 freq scaaly (3) - 1 freq signally (3) - 2 freq siccar-lik (3) - 1 freq scarey (3) - 2 freq sicear (3) - 6 freq sickly (3) - 6 freq similarly (3) - 3 freq sicca (3) - 4 freq |
siccarly (0) - 8 freq siccarlie (2) - 4 freq siccart (3) - 1 freq siccared (3) - 1 freq sickerly (3) - 2 freq siccar (3) - 289 freq sicecar (4) - 2 freq sincerely (4) - 8 freq succar (4) - 3 freq siccer (4) - 3 freq siccand (5) - 4 freq socially (5) - 17 freq sicca (5) - 4 freq sickly (5) - 6 freq sickerlie (5) - 1 freq sicear (5) - 6 freq siccaritie (5) - 1 freq mccarlie (5) - 1 freq soccer (5) - 4 freq securely (5) - 1 freq similarly (5) - 3 freq scary (5) - 55 freq scarey (5) - 2 freq scaly (5) - 13 freq siecar (5) - 1 freq |
SoundEx code - S264 sugarollie - 4 freq siccarlie - 4 freq sugarallie - 3 freq showgirl - 2 freq sikkarlie - 1 freq sacrileegious - 1 freq siccar-lik - 1 freq sojer-like - 1 freq sugar-loaf - 1 freq sickerlie - 1 freq siccarly - 8 freq sickerly - 2 freq securely - 1 freq |
MetaPhone code - SKKRL siccarlie - 4 freq siccarly - 8 freq |
SICCARLY |
| Time to execute Levenshtein function - 0.207209 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.373345 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.030732 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.037360 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.000900 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |