| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| everywans (0) - 1 freq everywan (1) - 22 freq everywan's (1) - 5 freq everywhan (2) - 1 freq everwan (2) - 4 freq evrywan (2) - 1 freq iverywan (2) - 1 freq everyane (2) - 1 freq everyday' (3) - 1 freq everyhin (3) - 31 freq everyone (3) - 96 freq everyhing (3) - 14 freq everywhaut (3) - 1 freq everyones (3) - 2 freq everywhar (3) - 1 freq everyeen (3) - 4 freq everyfink (3) - 7 freq everycunt (3) - 18 freq evriwan (3) - 2 freq everythins (3) - 3 freq eerrans (3) - 1 freq everywhaur (3) - 6 freq ivrywan (3) - 7 freq everywhair (3) - 1 freq everyhin's (3) - 4 freq |
everywans (0) - 1 freq everywan's (2) - 5 freq everywan (2) - 22 freq evrywan (3) - 1 freq iverywan (3) - 1 freq everwan (3) - 4 freq everywhan (4) - 1 freq everyones (4) - 2 freq evriwan (4) - 2 freq ivrywan (4) - 7 freq everyane (4) - 1 freq everywoman (5) - 2 freq everyhin's (5) - 4 freq everywye (5) - 2 freq rowans (5) - 12 freq vrans (5) - 1 freq everywhaur (5) - 6 freq everyfin (5) - 10 freq versions (5) - 36 freq eerans (5) - 1 freq everywhair (5) - 1 freq everywhaut (5) - 1 freq everyhing (5) - 14 freq eerrans (5) - 1 freq everyhin (5) - 31 freq |
SoundEx code - E165 everyhin - 31 freq everyhin's - 4 freq everyhing - 14 freq everywan - 22 freq everywan's - 5 freq everyone - 96 freq everywans - 1 freq evermair - 5 freq everwan - 4 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 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 - EFRWNS everywan's - 5 freq everywans - 1 freq |
EVERYWANS |
| Time to execute Levenshtein function - 0.374986 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.527616 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.028553 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.038848 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.000899 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. |