| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| scorland (0) - 1 freq scoland (1) - 1 freq scotland (1) - 2192 freq scotlan' (2) - 9 freq nscotland (2) - 3 freq scotlann (2) - 1 freq norland (2) - 9 freq moorland (2) - 3 freq scotlang (2) - 5 freq iscotland (2) - 3 freq scotand (2) - 2 freq scotlan (2) - 63 freq 'scotland (2) - 3 freq copland (2) - 6 freq scotland' (2) - 13 freq scotlands (2) - 2 freq gairland (3) - 1 freq tarland (3) - 4 freq zkotland (3) - 5 freq iceland (3) - 42 freq scowlin (3) - 2 freq schyand (3) - 1 freq scowlded (3) - 1 freq soothland (3) - 2 freq nescotland (3) - 1 freq |
scorland (0) - 1 freq scotland (2) - 2192 freq scoland (2) - 1 freq iscotland (3) - 3 freq scotlands (4) - 2 freq scotland' (4) - 13 freq scrubland (4) - 1 freq ouscotland (4) - 1 freq scragland (4) - 1 freq scorned (4) - 3 freq copland (4) - 6 freq 'scotland (4) - 3 freq nscotland (4) - 3 freq scotlann (4) - 1 freq moorland (4) - 3 freq norland (4) - 9 freq scotlan' (4) - 9 freq scotlan (4) - 63 freq scotand (4) - 2 freq scotlang (4) - 5 freq scoolin (5) - 2 freq shetland (5) - 285 freq scraaled (5) - 1 freq straand (5) - 1 freq servand (5) - 2 freq |
SoundEx code - S645 swirlin - 21 freq skirlin - 48 freq scrollin - 6 freq scrollin' - 1 freq shorelin - 2 freq surlin - 1 freq shore-line - 1 freq sworlin - 1 freq sirloin - 7 freq sheerlin - 3 freq skirlan - 1 freq shoreline - 4 freq swirlan - 2 freq shirley-anne - 2 freq skirling - 1 freq swurlin - 1 freq swirling - 2 freq scorland - 1 freq sharleen - 1 freq 'sharleen - 1 freq |
MetaPhone code - SKRLNT scorland - 1 freq |
SCORLAND |
| Time to execute Levenshtein function - 0.896498 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.205089 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.087449 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.094668 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.000764 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. |