| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eventuate (0) - 1 freq eventual (2) - 4 freq eventually (3) - 159 freq evaluate (3) - 1 freq venturt (3) - 8 freq eventbrite (3) - 1 freq eventide (3) - 2 freq evacuate (3) - 1 freq eventfa (3) - 1 freq venture (3) - 21 freq eventuallie (3) - 2 freq evacuated (4) - 1 freq situate (4) - 3 freq ensuite (4) - 1 freq eventfu (4) - 2 freq eemitate (4) - 2 freq regenerate (4) - 1 freq accentuates (4) - 1 freq mentae (4) - 1 freq event'll (4) - 1 freq vintage (4) - 9 freq accentuated (4) - 1 freq seventie (4) - 2 freq eventful (4) - 2 freq potentate (4) - 1 freq |
eventuate (0) - 1 freq eventual (3) - 4 freq eventide (4) - 2 freq eventfa (4) - 1 freq venturt (4) - 8 freq venture (4) - 21 freq vintage (5) - 9 freq venturit (5) - 1 freq venturet (5) - 1 freq events (5) - 85 freq ventur (5) - 6 freq aventur (5) - 3 freq vantage (5) - 9 freq evacuatet (5) - 1 freq veenture (5) - 1 freq event (5) - 103 freq eventuallie (5) - 2 freq evacuate (5) - 1 freq eventfu (5) - 2 freq avantage (5) - 1 freq eventually (5) - 159 freq evaluate (5) - 1 freq eventbrite (5) - 1 freq senate (6) - 8 freq evenan (6) - 2 freq |
SoundEx code - E153 event - 103 freq eventide - 2 freq eventually - 159 freq events - 85 freq evendoun - 11 freq evendounness - 1 freq eventimes - 1 freq ebbmaet - 1 freq eyvind - 2 freq eapand - 1 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 - EFNTT eventide - 2 freq eventuate - 1 freq |
EVENTUATE |
| Time to execute Levenshtein function - 0.362398 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.708945 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.030217 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.078827 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.000973 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. |