| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| everywan (0) - 22 freq everwan (1) - 4 freq everywans (1) - 1 freq everywhan (1) - 1 freq evrywan (1) - 1 freq iverywan (1) - 1 freq everyday (2) - 32 freq everywhar (2) - 1 freq everyfin (2) - 10 freq evriwan (2) - 2 freq everywye (2) - 2 freq everyane (2) - 1 freq everywoman (2) - 2 freq everywan's (2) - 5 freq everyeen (2) - 4 freq everyhin (2) - 31 freq ivrywan (2) - 7 freq everywhaut (3) - 1 freq every- (3) - 1 freq evenan (3) - 2 freq evelyn (3) - 1 freq everybdy (3) - 6 freq evriman (3) - 1 freq eeran (3) - 2 freq everythin (3) - 119 freq |
everywan (0) - 22 freq evrywan (1) - 1 freq iverywan (1) - 1 freq everwan (1) - 4 freq evriwan (2) - 2 freq ivrywan (2) - 7 freq everywhan (2) - 1 freq everywans (2) - 1 freq everywoman (3) - 2 freq everyeen (3) - 4 freq everyhin (3) - 31 freq everyane (3) - 1 freq everywye (3) - 2 freq everyfin (3) - 10 freq everton (4) - 3 freq evriman (4) - 1 freq verdean (4) - 3 freq erowan (4) - 1 freq varyan (4) - 1 freq iverywye (4) - 1 freq evryhin (4) - 2 freq everhin (4) - 1 freq everywhar (4) - 1 freq everywan's (4) - 5 freq everyone (4) - 96 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 - EFRWN everywan - 22 freq everwan - 4 freq evriwan - 2 freq evrywan - 1 freq |
EVERYWAN |
| Time to execute Levenshtein function - 0.220991 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.352836 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.027854 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.038926 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.001183 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. |