| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kittiwake (0) - 2 freq kittiwakes (1) - 4 freq kittie (3) - 3 freq kittle (4) - 43 freq bitticks (4) - 2 freq kittin (4) - 1 freq cittie (4) - 2 freq kinrike (4) - 1 freq bittae (4) - 2 freq oottake (4) - 1 freq kiltie (4) - 5 freq tittie (4) - 30 freq bittie (4) - 551 freq kittil (4) - 9 freq kittag (4) - 1 freq fittinlie (4) - 1 freq fittie (4) - 131 freq fitlike (4) - 1 freq sitiwat (4) - 1 freq intake (4) - 4 freq bittickie (4) - 1 freq kittlie (4) - 7 freq kistie (4) - 14 freq kittilt (4) - 5 freq intiae (4) - 1 freq |
kittiwake (0) - 2 freq kittiwakes (2) - 4 freq kittie (5) - 3 freq kittit (6) - 2 freq bittickie (6) - 1 freq kittag (6) - 1 freq oottake (6) - 1 freq kittil (6) - 9 freq kittlie (6) - 7 freq kittilt (6) - 5 freq kittle (6) - 43 freq bittikie (6) - 4 freq kittin (6) - 1 freq kittlt (7) - 4 freq kitthin (7) - 1 freq bittok (7) - 1 freq kittens (7) - 7 freq attrak (7) - 1 freq kittlet (7) - 5 freq bittock (7) - 10 freq kittln (7) - 1 freq kettlie (7) - 3 freq kitty (7) - 13 freq kettle (7) - 82 freq kittelt (7) - 7 freq |
SoundEx code - K320 kites - 6 freq ketch - 9 freq kittiwake - 2 freq kate's - 26 freq kythes - 64 freq kiddies - 2 freq kids - 87 freq kitchie - 71 freq katja - 6 freq kitty's - 1 freq ket's - 1 freq kidz - 1 freq kits - 3 freq kïsts - 1 freq kytes - 2 freq kat's - 15 freq 'kat's - 1 freq kittag - 1 freq kuts - 1 freq katsh - 1 freq 'katze - 1 freq kyths - 5 freq kitsch - 4 freq kidds - 2 freq kudos - 2 freq kathak - 1 freq kodak - 1 freq kszydj - 1 freq katiec - 18 freq kdaz - 1 freq keithc - 1 freq kdz - 1 freq kdeyg - 1 freq kid's - 1 freq ketts - 1 freq kxdkh - 1 freq ktsc - 1 freq ktze - 1 freq kdjya - 1 freq kdiouwg - 1 freq kawwhtaxw - 1 freq |
MetaPhone code - KTWK kittiwake - 2 freq catwawk - 1 freq |
KITTIWAKE |
| Time to execute Levenshtein function - 0.255163 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.426890 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.030196 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.045935 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.001143 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. |