| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eild (0) - 17 freq weild (1) - 1 freq eind (1) - 1 freq eihd (1) - 2 freq wild (1) - 236 freq mild (1) - 40 freq eid (1) - 4 freq beild (1) - 41 freq eil (1) - 10 freq eilds (1) - 2 freq aild (1) - 1 freq heild (1) - 48 freq eile (1) - 1 freq gild (1) - 1 freq eld (1) - 30 freq feild (1) - 1 freq eold (1) - 1 freq keily (2) - 1 freq kilt (2) - 67 freq eli (2) - 4 freq wald (2) - 2 freq 'old (2) - 3 freq suld (2) - 11 freq wil (2) - 12 freq evill (2) - 1 freq |
eild (0) - 17 freq aild (1) - 1 freq eld (1) - 30 freq eold (1) - 1 freq ould (2) - 21 freq aald (2) - 202 freq ld (2) - 3 freq eliud (2) - 3 freq yeld (2) - 2 freq ald (2) - 14 freq ailed (2) - 2 freq auld (2) - 3449 freq eauld (2) - 1 freq lied (2) - 15 freq ayld (2) - 1 freq oiled (2) - 1 freq yield (2) - 16 freq eould (2) - 2 freq lid (2) - 71 freq old (2) - 178 freq elied (2) - 1 freq mild (2) - 40 freq eid (2) - 4 freq beild (2) - 41 freq wild (2) - 236 freq |
SoundEx code - E430 eild - 17 freq eld - 30 freq eauld - 1 freq eilidh - 1 freq ee-lid - 2 freq elite - 21 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 - 1 freq ee-lid - 2 freq elite - 21 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 |
EILD |
| Time to execute Levenshtein function - 0.454571 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.748422 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.076175 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.090278 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.000777 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. |