| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| everyane (0) - 1 freq everyone (1) - 96 freq everwan (2) - 4 freq everywye (2) - 2 freq everywan (2) - 22 freq everyones (2) - 2 freq everywans (2) - 1 freq everyday' (3) - 1 freq every (3) - 822 freq varyan (3) - 1 freq overtone (3) - 1 freq reverant (3) - 3 freq overtake (3) - 1 freq everyfink (3) - 7 freq everywan's (3) - 5 freq overcame (3) - 2 freq eerrans (3) - 1 freq eerant (3) - 2 freq beverage (3) - 3 freq evenan (3) - 2 freq evelynn (3) - 8 freq eerans (3) - 1 freq everycunt (3) - 18 freq everyeen (3) - 4 freq certane (3) - 2 freq |
everyane (0) - 1 freq everyone (1) - 96 freq everyeen (3) - 4 freq varyan (3) - 1 freq everyones (3) - 2 freq everywan (3) - 22 freq everwan (3) - 4 freq everywye (3) - 2 freq ivryone (3) - 2 freq average (4) - 29 freq everson (4) - 3 freq everhin (4) - 1 freq everie (4) - 4 freq verlaine (4) - 2 freq everee (4) - 1 freq iverywye (4) - 1 freq everday (4) - 2 freq every- (4) - 1 freq everyfin (4) - 10 freq everton (4) - 3 freq everyday (4) - 32 freq varyin (4) - 5 freq evrywan (4) - 1 freq evelyn (4) - 1 freq eeran (4) - 2 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 |
EVERYANE |
| Time to execute Levenshtein function - 0.210734 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.370600 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.028208 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.040588 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.000953 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. |