Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
events (0) - 85 freq event (1) - 103 freq vents (1) - 1 freq evens (1) - 1 freq averts (2) - 1 freq eveit (2) - 3 freq lents (2) - 1 freq glents (2) - 6 freq repents (2) - 2 freq relents (2) - 3 freq leven's (2) - 2 freq prents (2) - 10 freq bents (2) - 10 freq eens (2) - 131 freq gents (2) - 8 freq scents (2) - 5 freq tents (2) - 22 freq seventh (2) - 6 freq efekts (2) - 1 freq evenins (2) - 10 freq eden's (2) - 6 freq evenin (2) - 133 freq ovens (2) - 4 freq een's (2) - 13 freq vests (2) - 4 freq |
events (0) - 85 freq vents (1) - 1 freq event (2) - 103 freq evens (2) - 1 freq vests (3) - 4 freq ovens (3) - 4 freq evenins (3) - 10 freq ments (3) - 1 freq invents (3) - 1 freq vent (3) - 6 freq rents (3) - 11 freq eventfa (3) - 1 freq evidents (3) - 1 freq pents (3) - 5 freq tents (3) - 22 freq ents (3) - 1 freq agents (3) - 7 freq lents (3) - 1 freq bents (3) - 10 freq cents (3) - 3 freq vets (3) - 9 freq gents (3) - 8 freq averts (3) - 1 freq venus (3) - 32 freq evans (3) - 27 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 - EFNTS events - 85 freq |
EVENTS |
Time to execute Levenshtein function - 0.166353 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.321061 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.027162 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.036883 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.000921 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. |