| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nlscotland (0) - 1 freq nscotland (1) - 3 freq nescotland (1) - 1 freq lgscotland (2) - 8 freq ouscotland (2) - 1 freq scotland (2) - 2210 freq €œscotland (2) - 4 freq nbmscotland (2) - 2 freq 'scotland (2) - 3 freq €˜scotland (2) - 1 freq iscotland (2) - 3 freq bbcscotland (3) - 30 freq scotlann (3) - 1 freq indyscotland (3) - 1 freq scotlands (3) - 2 freq tesscotland (3) - 2 freq scotland' (3) - 13 freq agescotland (3) - 6 freq scotlang (3) - 5 freq €˜scotlan (3) - 1 freq scoland (3) - 1 freq scorland (3) - 1 freq scotlan' (3) - 9 freq yesscotland (3) - 1 freq 'scotland' (3) - 1 freq |
nlscotland (0) - 1 freq nescotland (2) - 1 freq nscotland (2) - 3 freq 'scotland (4) - 3 freq iscotland (4) - 3 freq indyscotland (4) - 1 freq nbmscotland (4) - 2 freq €˜scotland (4) - 1 freq €œscotland (4) - 4 freq ouscotland (4) - 1 freq lgscotland (4) - 8 freq scotland (4) - 2210 freq walkscotland (5) - 1 freq agescotland (5) - 6 freq tesscotland (5) - 2 freq yesscotland (5) - 1 freq bidscotland (5) - 1 freq scotlan (6) - 63 freq angryscotland (6) - 3 freq cyclescotland (6) - 1 freq scotand (6) - 2 freq yyesscotland (6) - 1 freq huntlyscotland (6) - 1 freq freescotland (6) - 1 freq tourscotland (6) - 3 freq |
SoundEx code - N423 naelstring - 1 freq no-looked-for - 1 freq nihilistic - 1 freq nlscotland - 1 freq |
MetaPhone code - NLSKTLNT nlscotland - 1 freq |
NLSCOTLAND |
| Time to execute Levenshtein function - 0.283063 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.536747 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.038638 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.042632 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.001550 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. |