| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kinlochleven (0) - 1 freq lochleven (3) - 1 freq killeen (5) - 1 freq kitcheen (5) - 6 freq auchleven (5) - 1 freq kinleen (5) - 1 freq kindleen (5) - 1 freq kinochers (5) - 2 freq kinloch (5) - 3 freq kinloch's (5) - 1 freq bloohievin (6) - 1 freq snocherin (6) - 7 freq dialeck-level (6) - 1 freq clocherin (6) - 1 freq sin-sheen (6) - 1 freq flochterin (6) - 2 freq kitchen (6) - 427 freq enlichten (6) - 3 freq inchees (6) - 1 freq loch-en (6) - 1 freq inlove (6) - 1 freq kicherin (6) - 2 freq incoherent (6) - 1 freq killen (6) - 4 freq enlichtened (6) - 3 freq |
kinlochleven (0) - 1 freq lochleven (5) - 1 freq kinloch (8) - 3 freq auchleven (8) - 1 freq kinloch's (8) - 1 freq enlichten (9) - 3 freq kinleen (9) - 1 freq snochlin (9) - 1 freq killeen (9) - 1 freq kitcheen (9) - 6 freq kindleen (9) - 1 freq kinochers (9) - 2 freq kinchie (10) - 5 freq kinshen (10) - 1 freq involvin (10) - 10 freq kinches (10) - 8 freq keechlin (10) - 2 freq keetcheen (10) - 2 freq lochinver (10) - 1 freq kenloachsixteen (10) - 2 freq mclachlan (10) - 3 freq lincluden (10) - 8 freq kinichted (10) - 2 freq knucklin (10) - 1 freq lochmaben (10) - 2 freq |
SoundEx code - K542 knolls - 1 freq kennels' - 1 freq kennels - 5 freq kinloch - 3 freq kemel's - 1 freq knawlege - 5 freq kinless - 1 freq kinloch's - 1 freq kneels - 1 freq kin-like - 1 freq kinlochleven - 1 freq kinnelcuttie - 1 freq €˜kinloch - 1 freq kenloachsixteen - 2 freq |
MetaPhone code - KNLXLFN kinlochleven - 1 freq |
KINLOCHLEVEN |
| Time to execute Levenshtein function - 0.701610 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 - 1.294090 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.093526 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.114622 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.001223 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. |