| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kaftan (0) - 1 freq laffan (2) - 1 freq wantan (2) - 4 freq rantan (2) - 1 freq baetan (2) - 1 freq oaften (2) - 6 freq satan (2) - 24 freq saften (2) - 7 freq actan (2) - 3 freq castan (2) - 1 freq tiftan (2) - 1 freq waftin (2) - 8 freq sautan (2) - 1 freq aetan (2) - 3 freq liftan (2) - 3 freq kertan (2) - 1 freq pantan (2) - 3 freq afton (2) - 3 freq afta (2) - 1 freq lafan (2) - 1 freq sawtan (2) - 1 freq dartan (2) - 1 freq tartan (2) - 93 freq bafta (2) - 1 freq wastan (2) - 1 freq |
kaftan (0) - 1 freq waftin (3) - 8 freq tiftan (3) - 1 freq liftan (3) - 3 freq kertan (3) - 1 freq afton (3) - 3 freq oaftin (3) - 1 freq aften (3) - 345 freq siftan (3) - 1 freq saften (3) - 7 freq oaften (3) - 6 freq kestin (4) - 2 freq kirtana (4) - 1 freq keaton (4) - 1 freq soften (4) - 2 freq oftin (4) - 1 freq coftin (4) - 1 freq saaften (4) - 1 freq often (4) - 126 freq giftin (4) - 2 freq footan (4) - 1 freq kistin (4) - 3 freq heftin (4) - 41 freq kforn (4) - 1 freq kicten (4) - 1 freq |
SoundEx code - K135 kaftan - 1 freq kipeet-nosed - 1 freq keepitna - 1 freq kipfatnh - 1 freq kbdnsehr - 1 freq |
MetaPhone code - KFTN kaftan - 1 freq coftin - 1 freq |
KAFTAN |
| Time to execute Levenshtein function - 0.201045 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.392052 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.036629 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.038154 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.000844 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. |