| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| visitkilmarnock (0) - 1 freq kilmarnock (5) - 18 freq kirmarnock (6) - 1 freq kilmaurnock (6) - 5 freq kilmarnockfc (7) - 3 freq triciamarwick (8) - 13 freq distillant (8) - 1 freq mikekilpatrick (8) - 1 freq shitmarack (8) - 1 freq kilmarnockrfc (8) - 1 freq visitir (8) - 1 freq marnock (8) - 2 freq kilmarnockwfc (8) - 1 freq visiting (8) - 15 freq visitin (8) - 22 freq sibilance (8) - 1 freq sittinback (8) - 1 freq visitation (8) - 1 freq sittinroom (9) - 1 freq interlock (9) - 1 freq shamrock (9) - 3 freq visibleearth (9) - 1 freq gentilmannie (9) - 1 freq visitabdn (9) - 11 freq skylark (9) - 2 freq |
visitkilmarnock (0) - 1 freq kilmarnock (8) - 18 freq kilmaurnock (9) - 5 freq kirmarnock (10) - 1 freq kilmarnockfc (12) - 3 freq shitmarack (13) - 1 freq marnock (13) - 2 freq triciamarwick (13) - 13 freq stammack (14) - 1 freq pestilence (14) - 6 freq districk (14) - 3 freq instinck (14) - 2 freq stolyarni (14) - 1 freq eastendmark (14) - 1 freq stamack (14) - 5 freq silverback (14) - 2 freq shamrock (14) - 3 freq barlornock (14) - 1 freq balornock (14) - 1 freq skylark (14) - 2 freq sittinback (14) - 1 freq sibilance (14) - 1 freq kilmarnockwfc (14) - 1 freq visitin (14) - 22 freq visiting (14) - 15 freq |
SoundEx code - V232 vests - 4 freq visits - 24 freq veesits - 15 freq vauxhatis - 1 freq vistas - 3 freq vestiges - 1 freq vestigial - 1 freq vesta's - 1 freq veisits - 8 freq vastes-du - 1 freq visitscotland - 14 freq vestige - 1 freq visit's - 1 freq vvztwhhgpa - 1 freq vktocl - 1 freq visitscotbtu - 1 freq visitscotnews - 1 freq vzudsqfdpe - 1 freq vjedsgj - 1 freq vpiugtkqdx - 1 freq vctstlgoip - 1 freq visitkilmarnock - 1 freq visitswscotland - 2 freq |
MetaPhone code - FSTKLMRN |
VISITKILMARNOCK |
| Time to execute Levenshtein function - 0.219946 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.410985 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.034184 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.037583 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.000881 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. |