| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wingsscotland (0) - 4 freq indyscotland (3) - 1 freq yesscotland (4) - 1 freq lgscotland (4) - 8 freq tesscotland (4) - 2 freq bylinesscotland (4) - 1 freq nescotland (4) - 1 freq firstscotland (4) - 5 freq weirdscotland (4) - 2 freq walkscotland (4) - 1 freq nlscotland (4) - 1 freq visitscotland (4) - 14 freq agescotland (4) - 6 freq digitscotland (4) - 1 freq wingsoverscotland (4) - 2 freq angryscotland (4) - 3 freq bidscotland (4) - 1 freq yyesscotland (4) - 1 freq iscotland (4) - 3 freq nscotland (4) - 3 freq wearescotland (4) - 2 freq nbmscotland (4) - 2 freq tourscotland (5) - 3 freq huntlyscotland (5) - 1 freq transcotland (5) - 2 freq |
wingsscotland (0) - 4 freq indyscotland (6) - 1 freq angryscotland (6) - 3 freq wingsoverscotland (6) - 2 freq digitscotland (7) - 1 freq yyesscotland (7) - 1 freq wearescotland (7) - 2 freq nbmscotland (7) - 2 freq agescotland (7) - 6 freq nscotland (7) - 3 freq fantasyscotland (7) - 2 freq lgscotland (7) - 8 freq nescotland (7) - 1 freq tesscotland (7) - 2 freq yesscotland (7) - 1 freq weirdscotland (7) - 2 freq nlscotland (7) - 1 freq walkscotland (7) - 1 freq bylinesscotland (7) - 1 freq tmsascotland (8) - 1 freq englishscotland (8) - 1 freq huntlyscotland (8) - 1 freq agentscotland (8) - 1 freq iscotland (8) - 3 freq visitscotland (8) - 14 freq |
SoundEx code - W523 wanst - 32 freq whanged - 1 freq wheenged - 1 freq winked - 12 freq winkt - 2 freq wneist - 1 freq wingit - 4 freq wine-stained - 1 freq wanced - 3 freq winged - 5 freq weinstein - 1 freq winkit - 11 freq winston - 3 freq wame-stappin - 1 freq 'winston - 1 freq winceyette - 1 freq wan-sided - 2 freq weenstip - 1 freq whingit - 1 freq winched - 4 freq weenged - 1 freq wansdays - 1 freq wainscots - 1 freq winced - 2 freq wanc't - 1 freq wance't - 3 freq wingsscotland - 4 freq wnkdqi - 1 freq whingytoddlers - 1 freq |
MetaPhone code - WNKSKTLN |
WINGSSCOTLAND |
| Time to execute Levenshtein function - 0.211386 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.439633 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.028713 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.038170 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.000890 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. |