| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kilwinning (0) - 1 freq winning (3) - 14 freq beginning (4) - 21 freq winnin (4) - 90 freq planning (4) - 14 freq lining (4) - 1 freq winging (4) - 1 freq twinnin (4) - 1 freq killing (4) - 7 freq linnin (4) - 2 freq blinding (4) - 1 freq winnins (4) - 4 freq rinning (4) - 7 freq inning (4) - 1 freq skinning (4) - 1 freq 'wining (4) - 1 freq blinking (4) - 2 freq spinning (4) - 9 freq grinning (4) - 5 freq winding (4) - 2 freq liinnin (4) - 1 freq clinging (4) - 1 freq flinging (4) - 4 freq kenning (4) - 10 freq winnings (4) - 1 freq |
kilwinning (0) - 1 freq winning (5) - 14 freq kenning (6) - 10 freq planning (6) - 14 freq flinging (7) - 4 freq grinning (7) - 5 freq clinging (7) - 1 freq liinnin (7) - 1 freq winding (7) - 2 freq winnings (7) - 1 freq blinnin (7) - 1 freq dinning (7) - 1 freq thinning (7) - 1 freq lairning (7) - 4 freq swinging (7) - 3 freq spinning (7) - 9 freq a'winnin (7) - 1 freq linking (7) - 2 freq twinnin (7) - 1 freq killing (7) - 7 freq winging (7) - 1 freq lining (7) - 1 freq beginning (7) - 21 freq blinking (7) - 2 freq linnin (7) - 2 freq |
SoundEx code - K455 kelman - 6 freq killymain - 1 freq kilimanjaro - 1 freq kleinen - 1 freq €˜kilmeny - 2 freq kilmeny - 8 freq €œkilmeny - 4 freq kilwinning - 1 freq kylieminogue - 1 freq |
MetaPhone code - KLWNNK kilwinning - 1 freq |
KILWINNING |
| Time to execute Levenshtein function - 0.338750 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.441416 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.028513 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.038222 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.000950 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. |