| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| elide (0) - 1 freq slide (1) - 26 freq elise (1) - 1 freq glide (1) - 20 freq elid (1) - 2 freq elude (1) - 1 freq elie (1) - 1 freq elided (1) - 1 freq elite (1) - 22 freq blide (1) - 19 freq alike (2) - 26 freq elied (2) - 1 freq olive (2) - 16 freq 'side (2) - 1 freq bide (2) - 830 freq abide (2) - 15 freq blyde (2) - 112 freq sclide (2) - 1 freq kline (2) - 1 freq alive (2) - 160 freq ide (2) - 3 freq else (2) - 743 freq eld (2) - 30 freq belive (2) - 2 freq elipse (2) - 1 freq |
elide (0) - 1 freq elid (1) - 2 freq elude (1) - 1 freq eliud (2) - 3 freq lede (2) - 9 freq lade (2) - 26 freq olde (2) - 1 freq lido (2) - 2 freq lode (2) - 2 freq eld (2) - 30 freq lid (2) - 71 freq lude (2) - 1 freq lyde (2) - 1 freq elied (2) - 1 freq elided (2) - 1 freq elie (2) - 1 freq glide (2) - 20 freq blide (2) - 19 freq elise (2) - 1 freq elite (2) - 22 freq slide (2) - 26 freq leid (3) - 1536 freq alie (3) - 1 freq eirde (3) - 2 freq wide (3) - 249 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 |
ELIDE |
| Time to execute Levenshtein function - 0.195158 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.349693 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.031602 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.036999 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.000876 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. |