| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| elbain (0) - 1 freq alain (2) - 8 freq slain (2) - 9 freq eltin (2) - 1 freq bain (2) - 77 freq abain (2) - 23 freq ellan (2) - 2 freq lain (2) - 18 freq claain (2) - 3 freq elfin (2) - 5 freq elba (2) - 15 freq cobain (2) - 1 freq blaain (2) - 22 freq elbae (2) - 12 freq 'lain (2) - 1 freq elgin (2) - 24 freq alban (2) - 3 freq clain (2) - 13 freq plain (2) - 174 freq elbowin (2) - 4 freq elbaed (2) - 1 freq elshin (2) - 1 freq elivin (2) - 1 freq elbas (2) - 9 freq blain (2) - 2 freq |
elbain (0) - 1 freq alban (2) - 3 freq albino (3) - 2 freq elivin (3) - 1 freq elbaed (3) - 1 freq elbowin (3) - 4 freq albania (3) - 1 freq elbas (3) - 9 freq leain (3) - 23 freq ebbin (3) - 3 freq eldin (3) - 3 freq ebban (3) - 1 freq elaine (3) - 12 freq albais (3) - 1 freq elbaes (3) - 1 freq elgin (3) - 24 freq eltin (3) - 1 freq bain (3) - 77 freq lain (3) - 18 freq ellan (3) - 2 freq elfin (3) - 5 freq elba (3) - 15 freq albion (3) - 3 freq elbae (3) - 12 freq alain (3) - 8 freq |
SoundEx code - E415 elephants - 12 freq eleventh - 6 freq elbowin - 4 freq elephant - 34 freq eleeven - 35 freq eleiventh - 1 freq eleiven - 15 freq elfin - 5 freq eleivin - 1 freq elivvin - 1 freq elefven - 1 freq eleven - 36 freq eleeven-year-auld - 1 freq eleeven-an-a-hauf - 1 freq eleven-an-a-hauf - 1 freq eleeven-year-aul - 1 freq eleevinth - 1 freq elbain - 1 freq elyven - 2 freq eleevent - 1 freq elephant's - 1 freq eleevin - 4 freq eeleeven - 1 freq elieven - 3 freq elephantine - 1 freq eeleevent - 1 freq elphinstone - 14 freq elibank - 2 freq ellyfants - 1 freq elphinstane - 3 freq eleyven - 5 freq eleevan - 1 freq elven - 1 freq elivin - 1 freq elephint - 1 freq elphinstonejack - 7 freq |
MetaPhone code - ELBN elbain - 1 freq |
ELBAIN |
| Time to execute Levenshtein function - 0.186669 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.331949 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.028023 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.037370 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.000816 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. |