| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| elt (0) - 2 freq et (1) - 256 freq elw (1) - 1 freq el (1) - 25 freq ect (1) - 25 freq ent (1) - 3 freq elf (1) - 10 freq glt (1) - 1 freq ell (1) - 1 freq eld (1) - 30 freq celt (1) - 2 freq eat (1) - 467 freq gelt (1) - 1 freq egt (1) - 1 freq belt (1) - 162 freq eltz (1) - 1 freq elc (1) - 5 freq telt (1) - 1569 freq eli (1) - 4 freq ely (1) - 1 freq lt (1) - 5 freq dlt (1) - 1 freq welt (1) - 2 freq elm (1) - 3 freq eet (1) - 581 freq |
elt (0) - 2 freq lt (1) - 5 freq alt (1) - 5 freq pelt (2) - 16 freq els (2) - 11 freq eit (2) - 644 freq est (2) - 22 freq delt (2) - 3 freq relt (2) - 1 freq helt (2) - 5 freq eft (2) - 3 freq ett (2) - 97 freq elr (2) - 1 freq alot (2) - 18 freq melt (2) - 41 freq elite (2) - 22 freq let (2) - 1368 freq leit (2) - 15 freq ailt (2) - 3 freq leet (2) - 81 freq lut (2) - 59 freq lat (2) - 555 freq oolt (2) - 1 freq lty (2) - 1 freq aalt (2) - 2 freq |
SoundEx code - E430 eild - 17 freq eld - 30 freq eauld - 1 freq eilidh - 2 freq elite - 22 freq ee-lid - 2 freq 'elite' - 1 freq eould - 2 freq elied - 1 freq eliud - 3 freq elid - 2 freq eld - 2 freq elt - 2 freq eyelid - 2 freq elude - 1 freq elliot - 17 freq eold - 1 freq ealled - 1 freq eliot - 1 freq eelie't - 3 freq eliot' - 1 freq ehield - 1 freq elliott - 2 freq ellot - 1 freq elide - 1 freq |
MetaPhone code - ELT eild - 17 freq eld - 30 freq eauld - 1 freq eilidh - 2 freq elite - 22 freq ee-lid - 2 freq 'elite' - 1 freq eould - 2 freq elied - 1 freq eliud - 3 freq elid - 2 freq eld - 2 freq elt - 2 freq elude - 1 freq elliot - 17 freq eold - 1 freq ealled - 1 freq eliot - 1 freq eelie't - 3 freq eliot' - 1 freq elliott - 2 freq ellot - 1 freq elide - 1 freq |
ELT |
| Time to execute Levenshtein function - 0.322137 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.550367 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.029627 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.038985 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.000879 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. |