| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kathak (0) - 1 freq kathy (2) - 4 freq kath (2) - 3 freq kithan (2) - 1 freq cathal (2) - 1 freq cathay (2) - 1 freq ashak (2) - 1 freq matha (2) - 2 freq nathan (2) - 4 freq kayak (2) - 1 freq kathie (2) - 2 freq katja (2) - 6 freq bathin (3) - 11 freq katie (3) - 34 freq mayhap (3) - 3 freq datcha (3) - 1 freq ''that (3) - 1 freq althar (3) - 5 freq oaths (3) - 3 freq paak (3) - 1 freq €˜tak (3) - 3 freq kytht (3) - 3 freq watchan (3) - 20 freq matthan (3) - 4 freq kangas (3) - 2 freq |
kathak (0) - 1 freq kathie (3) - 2 freq kithan (3) - 1 freq kathy (3) - 4 freq kath (3) - 3 freq fethok (4) - 1 freq kythit (4) - 25 freq kythes (4) - 64 freq kith (4) - 13 freq kyths (4) - 5 freq thik (4) - 3 freq kythin (4) - 33 freq thake (4) - 1 freq kithy (4) - 2 freq kytht (4) - 3 freq kyth (4) - 3 freq matha (4) - 2 freq ashak (4) - 1 freq cathay (4) - 1 freq cathal (4) - 1 freq nathan (4) - 4 freq kayak (4) - 1 freq kythe (4) - 65 freq kythed (4) - 95 freq khaki (4) - 5 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 - K0K quiethke - 1 freq gothic - 5 freq kathak - 1 freq keithc - 1 freq |
KATHAK |
| Time to execute Levenshtein function - 0.215954 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.402025 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.027907 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.036742 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.000869 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. |