| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| goodlyburn (0) - 1 freq goodlyburnps (2) - 1 freq woodburn (3) - 3 freq goodluck (4) - 2 freq goodlookin (4) - 1 freq moorburn (4) - 1 freq gossaburn (4) - 1 freq holburn (4) - 3 freq googlin (5) - 7 freq woburn (5) - 1 freq goodby (5) - 1 freq godlye (5) - 1 freq goodnatured (5) - 1 freq godly (5) - 6 freq googly (5) - 3 freq goodsire (5) - 1 freq gothenburg (5) - 2 freq rankleburn (5) - 1 freq coburn (5) - 3 freq dollybird (5) - 1 freq goodwin (5) - 7 freq joeyburns (5) - 1 freq loodly (5) - 11 freq goodbrand (5) - 1 freq toddlurs (5) - 1 freq |
goodlyburn (0) - 1 freq goodlyburnps (4) - 1 freq woodburn (5) - 3 freq holburn (6) - 3 freq gossaburn (6) - 1 freq goodlookin (6) - 1 freq godlin (7) - 1 freq wudburn (7) - 11 freq glenburn (7) - 2 freq goodbrand (7) - 1 freq millburn (7) - 2 freq moorburn (7) - 1 freq goodluck (7) - 2 freq cockburn (8) - 9 freq loreburn (8) - 2 freq goolden (8) - 10 freq glaurin (8) - 1 freq doodlin (8) - 2 freq woburn (8) - 1 freq googlin (8) - 7 freq gooder' (8) - 1 freq goodbye (8) - 20 freq pooderhorn (8) - 1 freq gilbert (8) - 15 freq gollerin (8) - 6 freq |
SoundEx code - G341 gweed-livin - 1 freq gate-leave - 2 freq goodlyburn - 1 freq gzyhtolvpb - 1 freq goodlyburnps - 1 freq |
MetaPhone code - KTLBRN goodlyburn - 1 freq |
GOODLYBURN |
| Time to execute Levenshtein function - 0.533111 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.169173 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.035233 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.163050 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.001113 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. |