| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| elibeli (0) - 1 freq elied (3) - 1 freq label (3) - 57 freq elibank (3) - 2 freq elise (3) - 1 freq dellbell (3) - 1 freq emili (3) - 1 freq elites (3) - 5 freq eliven (3) - 1 freq decibels (3) - 1 freq elite (3) - 22 freq eisel (3) - 1 freq libert (3) - 1 freq daibelt (3) - 1 freq likelie (3) - 11 freq elided (3) - 1 freq lili (3) - 2 freq labels (3) - 6 freq lively (3) - 10 freq ewebnli (3) - 1 freq elide (3) - 1 freq elie (3) - 1 freq ehield (3) - 1 freq alibi (3) - 2 freq likely (3) - 311 freq |
elibeli (0) - 1 freq label (3) - 57 freq lively (4) - 10 freq labels (4) - 6 freq lili (4) - 2 freq alibi (4) - 2 freq likely (4) - 311 freq labelt (4) - 2 freq edible (4) - 3 freq liable (4) - 4 freq likelie (4) - 11 freq elby (5) - 2 freq lidl (5) - 1 freq lilo (5) - 1 freq elbba (5) - 1 freq lonely (5) - 38 freq lazuli (5) - 1 freq labeo (5) - 1 freq lil (5) - 10 freq elbaed (5) - 1 freq loisel (5) - 1 freq global (5) - 51 freq gliblee (5) - 2 freq libby (5) - 10 freq eligible (5) - 4 freq |
SoundEx code - E414 elibeli - 1 freq |
MetaPhone code - ELBL elibeli - 1 freq |
ELIBELI |
| Time to execute Levenshtein function - 0.237052 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.409862 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.028515 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.038959 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.000928 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. |