| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| goodbye (0) - 20 freq goodby (1) - 1 freq goodbyes (1) - 3 freq guidbye (2) - 4 freq oorbye (2) - 1 freq 'goodbye' (2) - 1 freq doonbye (2) - 4 freq gidbye (2) - 1 freq goodie (2) - 4 freq gooby (2) - 2 freq ootbye (2) - 98 freq godlye (2) - 1 freq doonby (3) - 20 freq good's (3) - 3 freq go-by (3) - 2 freq goodnes (3) - 1 freq ootby (3) - 128 freq godlie (3) - 1 freq gorble (3) - 2 freq gordie (3) - 1 freq goodbodie (3) - 1 freq moody (3) - 5 freq goodsir (3) - 6 freq goods (3) - 21 freq noodle (3) - 7 freq |
goodbye (0) - 20 freq goodby (1) - 1 freq gidbye (2) - 1 freq guidbye (2) - 4 freq goodbyes (2) - 3 freq goodie (3) - 4 freq godlye (3) - 1 freq gooby (3) - 2 freq gode (4) - 5 freq good' (4) - 2 freq gdb (4) - 2 freq goodo (4) - 1 freq goodies (4) - 6 freq goodie' (4) - 1 freq godly (4) - 6 freq geodie (4) - 1 freq gedboy (4) - 1 freq globe (4) - 31 freq guidbyes (4) - 3 freq 'guidbye (4) - 1 freq goods (4) - 21 freq ootbye (4) - 98 freq go-by (4) - 2 freq doonbye (4) - 4 freq 'goodbye' (4) - 1 freq |
SoundEx code - G310 guidwife - 41 freq 'guidbye - 1 freq guidbye - 4 freq guidwyfe - 24 freq goodbye - 20 freq gidbye - 1 freq guid-wife - 5 freq 'gidbye' - 1 freq gdp - 3 freq guid-bye - 9 freq gettafu - 1 freq gweedwife - 6 freq gudewife - 1 freq guid-wyfe - 3 freq gdb - 2 freq guid-boy - 2 freq goodby - 1 freq gtf - 2 freq gedboy - 1 freq gdeb - 1 freq 'goodbye' - 1 freq gxdv - 1 freq gydpvb - 1 freq |
MetaPhone code - KTBY 'guidbye - 1 freq guidbye - 4 freq goodbye - 20 freq guid-bye - 9 freq 'goodbye' - 1 freq |
GOODBYE |
| Time to execute Levenshtein function - 0.199336 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.367201 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.028302 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.037024 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.000898 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. |