| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| evintually (0) - 4 freq ivintually (1) - 2 freq eventually (1) - 155 freq virtually (2) - 13 freq vitally (3) - 1 freq visually (3) - 4 freq eventuallie (3) - 2 freq eventual (3) - 4 freq ectually (3) - 1 freq €œeventually (3) - 1 freq ritually (3) - 2 freq essentially (4) - 6 freq manually (4) - 2 freq painfully (4) - 9 freq equally (4) - 35 freq ethnically (4) - 1 freq finally (4) - 296 freq 'finally (4) - 1 freq tuinfully (4) - 1 freq mutually (4) - 9 freq actually (4) - 372 freq clinically (4) - 3 freq victuals (4) - 5 freq veesually (4) - 1 freq 'virtual' (4) - 1 freq |
evintually (0) - 4 freq eventually (1) - 155 freq ivintually (1) - 2 freq virtually (3) - 13 freq eventuallie (3) - 2 freq eventual (4) - 4 freq vitally (4) - 1 freq event'll (5) - 1 freq initially (5) - 4 freq mentally (5) - 9 freq intull (5) - 5 freq ritually (5) - 2 freq visually (5) - 4 freq ectually (5) - 1 freq €œeventually (5) - 1 freq pairtially (6) - 2 freq naiturally (6) - 2 freq eventuate (6) - 1 freq naitrally (6) - 1 freq habitually (6) - 3 freq centrally (6) - 1 freq intilla (6) - 1 freq cantilly (6) - 1 freq eventful (6) - 2 freq ontull (6) - 1 freq |
SoundEx code - E153 event - 103 freq eventide - 2 freq eventually - 155 freq events - 82 freq evendoun - 11 freq evendounness - 1 freq eventimes - 1 freq ebbmaet - 1 freq eyvind - 2 freq eventfa - 1 freq evintually - 4 freq eh've-met - 1 freq eventuallie - 2 freq evendoon - 5 freq eventual - 4 freq eventfu - 2 freq evander's - 1 freq evened - 1 freq event'll - 1 freq eventful - 2 freq evindounlie - 1 freq evindoun - 1 freq eventuate - 1 freq €œeventually - 1 freq efpnta - 1 freq evandonoghue - 1 freq eventscotnews - 1 freq eventbrite - 1 freq eventbriteuk - 2 freq |
MetaPhone code - EFNTL eventually - 155 freq evintually - 4 freq eventuallie - 2 freq eventual - 4 freq event'll - 1 freq €œeventually - 1 freq |
EVINTUALLY |
| Time to execute Levenshtein function - 0.189484 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.387912 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.027138 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.044494 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.000920 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. |