| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| siccarlie (0) - 4 freq mccarlie (2) - 1 freq siccarly (2) - 8 freq sikkarlie (2) - 1 freq siccaritie (2) - 1 freq siccar-lik (2) - 1 freq sickerlie (2) - 1 freq 'charlie (3) - 2 freq sharlie (3) - 1 freq siccared (3) - 1 freq €œcharlie (3) - 1 freq charlie (3) - 88 freq siccar (3) - 285 freq siccart (3) - 1 freq carlie (3) - 2 freq snarlit (4) - 1 freq succar (4) - 3 freq i'carnies (4) - 2 freq tiscali (4) - 1 freq scailit (4) - 2 freq scurrie (4) - 3 freq cardie (4) - 2 freq scahldie (4) - 1 freq sillie (4) - 2 freq sociable (4) - 7 freq |
siccarlie (0) - 4 freq siccarly (2) - 8 freq siccaritie (3) - 1 freq mccarlie (3) - 1 freq sickerlie (3) - 1 freq siccared (4) - 1 freq siccar (4) - 285 freq siccart (4) - 1 freq siccar-lik (4) - 1 freq sikkarlie (4) - 1 freq succar (5) - 3 freq sharlie (5) - 1 freq sicecar (5) - 2 freq socceraid (5) - 1 freq siccer (5) - 3 freq sickerly (5) - 2 freq charlie (5) - 88 freq carlie (5) - 2 freq 'charlie (5) - 2 freq scarlet (6) - 22 freq mcarle (6) - 2 freq schale (6) - 1 freq scotrail (6) - 5 freq siecar (6) - 1 freq scarrin (6) - 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 |
SICCARLIE |
| Time to execute Levenshtein function - 0.221524 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.375178 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.027604 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.038377 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.000803 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. |