Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
guid-bye (0) - 9 freq guidbye (1) - 4 freq gidbye (2) - 1 freq guid-boy (2) - 2 freq 'guidbye (2) - 1 freq guidbyes (2) - 2 freq guid-wyfe (2) - 3 freq guidlie (3) - 2 freq guid-een (3) - 1 freq wid-be (3) - 1 freq in-bye (3) - 1 freq guidwife (3) - 41 freq guid-wife (3) - 5 freq guid-sel (3) - 1 freq guidwyfe (3) - 24 freq guidance (3) - 42 freq guid-anes (3) - 1 freq goodbye (3) - 20 freq guidsire (3) - 1 freq guidly (3) - 4 freq guidobot (3) - 1 freq guid-style (3) - 1 freq guidmife (3) - 2 freq guid-man (3) - 2 freq guide (3) - 91 freq |
guid-bye (0) - 9 freq guidbye (2) - 4 freq guid-boy (2) - 2 freq gidbye (3) - 1 freq guid-een (4) - 1 freq goodbye (4) - 20 freq wid-be (4) - 1 freq 'guidbye (4) - 1 freq guidbyes (4) - 2 freq guid-wyfe (4) - 3 freq guide (5) - 91 freq guid-man (5) - 2 freq guidmife (5) - 2 freq up-bye (5) - 1 freq wad-be (5) - 3 freq guidly (5) - 4 freq go-by (5) - 2 freq guide-buik (5) - 1 freq goodby (5) - 1 freq guidobot (5) - 1 freq guid-sel (5) - 1 freq in-bye (5) - 1 freq guidwife (5) - 41 freq guid-wife (5) - 5 freq guidwyfe (5) - 24 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 |
GUID-BYE |
Time to execute Levenshtein function - 0.356787 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.791951 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.041218 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.092253 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.000788 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. |