| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kinnaird (0) - 1 freq kincaid (2) - 1 freq vinyaird (2) - 3 freq kinnoir (2) - 3 freq vineyaird (3) - 9 freq discaird (3) - 1 freq kinnilt (3) - 1 freq kaird (3) - 1 freq inlaid (3) - 3 freq lannlaird (3) - 1 freq kinkeind (3) - 7 freq innards (3) - 4 freq kenmairk (3) - 2 freq kailyaird (3) - 10 freq sinnart (3) - 1 freq sinnahard (3) - 1 freq winnerd (3) - 1 freq kinnik (3) - 1 freq yin-wird (3) - 1 freq kin-kind (3) - 1 freq vangaird (3) - 1 freq hinnied (3) - 1 freq inwairds (3) - 1 freq kinna (3) - 279 freq winnirt (3) - 1 freq |
kinnaird (0) - 1 freq kinnoir (3) - 3 freq winnerd (4) - 1 freq vinyaird (4) - 3 freq kincaid (4) - 1 freq kinnd (4) - 2 freq pinnied (5) - 1 freq lanlaird (5) - 1 freq lonnwird (5) - 1 freq inward (5) - 7 freq kinnlers (5) - 2 freq kinnlin (5) - 10 freq kirkyaird (5) - 81 freq kinnae (5) - 10 freq hinnered (5) - 1 freq kenned (5) - 33 freq kennled (5) - 2 freq connord (5) - 2 freq winnered (5) - 7 freq hunnerd (5) - 2 freq wunnerd (5) - 1 freq minzard (5) - 1 freq kindred (5) - 4 freq kinred (5) - 2 freq ainward (5) - 4 freq |
SoundEx code - K563 kyn-hertit - 1 freq kinred - 2 freq kin-hertit - 1 freq kinraddie - 1 freq kinnaird - 1 freq kennyritch - 1 freq |
MetaPhone code - KNRT conrad - 47 freq conrod - 1 freq kinred - 2 freq kinraddie - 1 freq counrty - 1 freq connord - 2 freq kinnaird - 1 freq |
KINNAIRD |
| Time to execute Levenshtein function - 0.305052 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.426240 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.035462 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.044966 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.000989 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. |