| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| elegy (0) - 6 freq eely (2) - 2 freq clergy (2) - 2 freq pleg (2) - 2 freq eggy (2) - 1 freq flegg (2) - 2 freq eleck (2) - 4 freq ledy (2) - 1 freq eesy (2) - 2 freq elby (2) - 2 freq celery (2) - 5 freq clegg (2) - 2 freq eeezy (2) - 1 freq glegg (2) - 1 freq fley (2) - 1 freq pley (2) - 45 freq engy (2) - 2 freq gleg (2) - 127 freq elect (2) - 9 freq ely (2) - 1 freq glesgy (2) - 7 freq enemy (2) - 38 freq elegie (2) - 3 freq eulogy (2) - 4 freq klegs (2) - 1 freq |
elegy (0) - 6 freq lego (2) - 19 freq leg (2) - 202 freq elegie (2) - 3 freq eulogy (2) - 4 freq iley (3) - 4 freq ley (3) - 3 freq peleg (3) - 3 freq elxy (3) - 1 freq edgy (3) - 7 freq lexy (3) - 2 freq leggy (3) - 1 freq lezy (3) - 1 freq log (3) - 36 freq lug (3) - 302 freq olga (3) - 1 freq lig (3) - 18 freq liga (3) - 1 freq ulg (3) - 1 freq laeg (3) - 1 freq lag (3) - 5 freq cleg (3) - 12 freq lg (3) - 4 freq liege (3) - 4 freq logo (3) - 19 freq |
SoundEx code - E420 else - 743 freq elsie - 62 freq eels - 11 freq elegie - 3 freq els - 11 freq ellis - 3 freq elk - 6 freq elijah - 25 freq elisha - 1 freq ella's - 10 freq 'elsie - 9 freq 'elise - 1 freq elise - 1 freq elic - 2 freq eyls - 3 freq eulogy - 4 freq else' - 1 freq eliska - 1 freq elegy - 6 freq eleck - 4 freq €˜elegy - 1 freq €œelsie - 1 freq elaiss - 1 freq elks - 2 freq €œelk - 1 freq eyeless - 1 freq €™else - 1 freq eilish - 1 freq elxy - 1 freq eilse - 1 freq elke - 3 freq elc - 5 freq elouise - 9 freq elkie - 1 freq |
MetaPhone code - ELJ elegie - 3 freq elijah - 25 freq eulogy - 4 freq elegy - 6 freq €˜elegy - 1 freq |
ELEGY |
| Time to execute Levenshtein function - 0.308046 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.609863 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.069608 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.038049 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.000887 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. |