| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| europeanelection (0) - 1 freq crockaneetion (6) - 1 freq re-election (6) - 1 freq expedeetion (7) - 2 freq recollection (7) - 2 freq reflection (7) - 35 freq proposeetion (7) - 3 freq repeteetion (7) - 4 freq generalelection (7) - 1 freq repeteition (8) - 1 freq resurrection (8) - 14 freq revelation (8) - 27 freq crockanition (8) - 1 freq poseeetion (8) - 1 freq revelaetion (8) - 1 freq reaction (8) - 51 freq european (8) - 173 freq recollections (8) - 1 freq perfection (8) - 14 freq crocanation (8) - 1 freq reinvention (8) - 1 freq complection (8) - 1 freq erection (8) - 3 freq inflection (8) - 2 freq rendeition (8) - 1 freq |
europeanelection (0) - 1 freq re-election (8) - 1 freq reflection (9) - 35 freq recollection (9) - 2 freq reflectioun (10) - 1 freq reflectin (10) - 22 freq replicaetion (10) - 1 freq repeteetion (10) - 4 freq replication (10) - 2 freq reffelation (11) - 1 freq unelectit (11) - 2 freq protection (11) - 29 freq reposeetion (11) - 1 freq randlestoon (11) - 2 freq projection (11) - 1 freq selection (11) - 28 freq collection (11) - 81 freq reflections (11) - 12 freq election (11) - 87 freq transaction (11) - 6 freq deflection (11) - 2 freq regeneration (11) - 3 freq replicatin (11) - 1 freq reunification (11) - 1 freq supplication (11) - 2 freq |
SoundEx code - E615 european - 173 freq eurvin - 1 freq earphones - 2 freq europan - 1 freq europaen - 2 freq europeans - 4 freq europeanelection - 1 freq eerhevinafuckinlafonasunday - 1 freq ervinelinda - 9 freq europeandayoflanguages - 1 freq ervine - 1 freq |
MetaPhone code - ERPNLKXN europeanelection - 1 freq |
EUROPEANELECTION |
| Time to execute Levenshtein function - 0.220746 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.431298 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.029179 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.037956 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.000847 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. |