| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| everyone (0) - 96 freq everyones (1) - 2 freq everyane (1) - 1 freq everton (2) - 3 freq everywye (2) - 2 freq evermore (2) - 2 freq everyone's (2) - 2 freq ivryone (2) - 2 freq overtone (2) - 1 freq overdone (2) - 1 freq everson (2) - 3 freq every (3) - 822 freq vernon (3) - 1 freq evelynn (3) - 8 freq everyhing (3) - 14 freq everhin (3) - 1 freq ever've (3) - 1 freq everwan (3) - 4 freq everee (3) - 1 freq overcome (3) - 2 freq evertype (3) - 2 freq reverrons (3) - 1 freq everybody (3) - 92 freq deveron (3) - 1 freq everyfink (3) - 7 freq |
everyone (0) - 96 freq everyane (1) - 1 freq everyones (2) - 2 freq ivryone (2) - 2 freq overdone (3) - 1 freq everyeen (3) - 4 freq everson (3) - 3 freq overtone (3) - 1 freq everton (3) - 3 freq everywye (3) - 2 freq everyday (4) - 32 freq everyhin (4) - 31 freq everie (4) - 4 freq evelyn (4) - 1 freq eterne (4) - 2 freq geryon (4) - 9 freq everyfin (4) - 10 freq everyboay (4) - 1 freq varyan (4) - 1 freq varyin (4) - 5 freq iverson (4) - 1 freq veronx (4) - 1 freq iverywye (4) - 1 freq lerone (4) - 1 freq everywan (4) - 22 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 - EFRYN everyone - 96 freq everyane - 1 freq everyeen - 4 freq |
EVERYONE |
| Time to execute Levenshtein function - 0.199693 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.361209 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.028120 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.037494 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.000876 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. |