| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ever-more (0) - 1 freq evermore (1) - 2 freq nevermore (2) - 1 freq nivermore (3) - 1 freq everyone (3) - 85 freq memore (4) - 3 freq eeyore (4) - 1 freq herefore (4) - 1 freq ever've (4) - 1 freq therefore (4) - 31 freq overcome (4) - 2 freq evermair (4) - 5 freq aviemore (4) - 4 freq everyones (4) - 2 freq overtone (4) - 1 freq the-morn (4) - 2 freq everton (4) - 3 freq nevermar (4) - 1 freq lettermore (4) - 1 freq overwork (4) - 1 freq everytime (4) - 10 freq the-fore (4) - 1 freq kenmore (4) - 1 freq dromore (4) - 1 freq everee (4) - 1 freq |
ever-more (0) - 1 freq evermore (2) - 2 freq nevermore (4) - 1 freq evermair (5) - 5 freq nivermore (5) - 1 freq everytime (6) - 10 freq dromore (6) - 1 freq nevermar (6) - 1 freq marmore (6) - 2 freq everywhere (6) - 42 freq ivermair (6) - 3 freq toremore (6) - 1 freq verdure (6) - 1 freq aviemore (6) - 4 freq ver-near (6) - 1 freq overcome (6) - 2 freq everyone (6) - 85 freq everywhar (7) - 1 freq every- (7) - 1 freq re-fere (7) - 1 freq vermin (7) - 3 freq verdur (7) - 1 freq overcomes (7) - 2 freq verrier (7) - 1 freq airmor (7) - 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 - EFRMR evermair - 5 freq evermore - 2 freq ever-more - 1 freq |
EVER-MORE |
| Time to execute Levenshtein function - 0.238440 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.369343 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.027455 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.040205 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.000977 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. |