| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| everyhing (0) - 14 freq everyhin (1) - 30 freq everything (1) - 96 freq evryhing (1) - 1 freq iverthing (2) - 1 freq every'hin' (2) - 1 freq iverything (2) - 1 freq everyhin's (2) - 4 freq everythins (2) - 3 freq evryhin (2) - 2 freq everythin (2) - 113 freq everyhing's (2) - 1 freq everthings (2) - 1 freq everthin (2) - 2 freq everythin' (2) - 1 freq everyfink (2) - 7 freq everhin (2) - 1 freq everyeen (3) - 4 freq erything (3) - 1 freq emerging (3) - 1 freq verging (3) - 1 freq €™everything (3) - 1 freq evening (3) - 75 freq €œeverything (3) - 2 freq everycunt (3) - 18 freq |
everyhing (0) - 14 freq evryhing (1) - 1 freq everyhin (2) - 30 freq everything (2) - 96 freq overhung (3) - 1 freq evryhin (3) - 2 freq everhin (3) - 1 freq iverything (3) - 1 freq iverthing (3) - 1 freq verging (4) - 1 freq ivrything (4) - 4 freq evrihin (4) - 1 freq ivirything (4) - 6 freq varying (4) - 7 freq everyfink (4) - 7 freq everythin (4) - 113 freq everythins (4) - 3 freq everyhin's (4) - 4 freq every'hin' (4) - 1 freq everthings (4) - 1 freq everyhing's (4) - 1 freq everthin (4) - 2 freq everythin' (4) - 1 freq owerhung (5) - 1 freq reverting (5) - 1 freq |
SoundEx code - E165 everyhin - 30 freq everyhin's - 4 freq everyhing - 14 freq everywan - 13 freq everywan's - 4 freq everyone - 85 freq everywans - 1 freq evermair - 5 freq everyhing's - 1 freq everynight - 1 freq everyone's - 2 freq evriwan - 2 freq evriman - 1 freq evermore - 2 freq everyane - 1 freq effeirin - 31 freq everyeen - 4 freq everywhan - 1 freq evrihin - 1 freq evryhin - 2 freq evrywan - 1 freq everwan - 2 freq every'hin' - 1 freq ever-more - 1 freq everhin - 1 freq eferneen - 1 freq effernneen - 1 freq everywoman - 2 freq eparnpr - 1 freq everyones - 2 freq evryhing - 1 freq |
MetaPhone code - EFRHNK everyhing - 14 freq evryhing - 1 freq |
EVERYHING |
| Time to execute Levenshtein function - 0.183467 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.332449 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.027199 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.040142 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.000834 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. |