| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| visitscotnews (0) - 1 freq indyscotnews (4) - 1 freq visitscotbtu (4) - 1 freq eventscotnews (4) - 1 freq iscotnews (4) - 5 freq visitscotland (4) - 14 freq visibleotter (6) - 1 freq digitscotland (6) - 1 freq visitwales (6) - 1 freq visions (6) - 7 freq visitors (6) - 47 freq visitswscotland (6) - 2 freq listlessness (7) - 1 freq veisitors (7) - 2 freq digiscot (7) - 2 freq preisoners (7) - 1 freq lightsomeness (7) - 1 freq stvnews (7) - 22 freq ministers (7) - 7 freq hesitates (7) - 1 freq visited (7) - 23 freq digiscoped (7) - 1 freq visitabdnbt (7) - 6 freq disconnect (7) - 3 freq misstress (7) - 1 freq |
visitscotnews (0) - 1 freq eventscotnews (5) - 1 freq visitscotland (7) - 14 freq iscotnews (7) - 5 freq visitscotbtu (7) - 1 freq indyscotnews (7) - 1 freq stvnews (11) - 22 freq vastness (11) - 1 freq shetnews (11) - 4 freq distinctless (11) - 1 freq distractions (11) - 1 freq veesitations (11) - 1 freq visitation (11) - 1 freq scatness (11) - 2 freq visitswscotland (11) - 2 freq visitwales (11) - 1 freq digitscotland (11) - 1 freq stickiness (11) - 2 freq visions (11) - 7 freq visitors (11) - 47 freq distinctions (11) - 2 freq itvnews (12) - 2 freq missions (12) - 3 freq wainscots (12) - 1 freq staycations (12) - 1 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 - FSTSKTNS visitscotnews - 1 freq |
VISITSCOTNEWS |
| Time to execute Levenshtein function - 0.220350 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.456200 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.032168 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.042607 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.000858 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. |