| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kipfatnh (0) - 1 freq kinfauns (3) - 2 freq kippage (4) - 1 freq rippan (4) - 1 freq kipling (4) - 3 freq patch (4) - 79 freq wipan (4) - 1 freq liath (4) - 1 freq kitth (4) - 1 freq kipplin (4) - 1 freq fifth (4) - 29 freq kith (4) - 13 freq kepand (4) - 2 freq knifan (4) - 1 freq platch (4) - 3 freq kickan (4) - 2 freq spatch (4) - 4 freq kitkat (4) - 3 freq fitpath (4) - 4 freq kilsyth (4) - 1 freq path (4) - 178 freq i'path (4) - 1 freq kath (4) - 3 freq killan (4) - 2 freq kiyan (4) - 1 freq |
kipfatnh (0) - 1 freq kinfauns (6) - 2 freq i'path (7) - 1 freq path (7) - 178 freq kath (7) - 3 freq kaftan (7) - 1 freq patna (7) - 2 freq kilsyth (7) - 1 freq kippin (7) - 1 freq keepitna (7) - 1 freq splatch (7) - 7 freq ripeth (7) - 1 freq spatch (7) - 4 freq katsh (7) - 1 freq kirtana (7) - 1 freq kipplin (7) - 1 freq patch (7) - 79 freq kipling (7) - 3 freq kitth (7) - 1 freq kith (7) - 13 freq fifth (7) - 29 freq platch (7) - 3 freq kepand (7) - 2 freq knifan (7) - 1 freq kathy (8) - 4 freq |
SoundEx code - K135 kaftan - 1 freq kipeet-nosed - 1 freq keepitna - 1 freq kipfatnh - 1 freq kbdnsehr - 1 freq |
MetaPhone code - KPFTN kipfatnh - 1 freq |
KIPFATNH |
| Time to execute Levenshtein function - 0.239340 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.519292 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.037665 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.053251 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.001242 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. |