| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| elegy (0) - 6 freq klegg (2) - 1 freq €˜elegy (2) - 1 freq pleg (2) - 2 freq ledy (2) - 1 freq eery (2) - 2 freq every (2) - 799 freq leggy (2) - 1 freq flegs (2) - 10 freq lexy (2) - 2 freq fleg (2) - 84 freq eesy (2) - 2 freq eulogy (2) - 4 freq pley (2) - 45 freq eggy (2) - 1 freq celery (2) - 5 freq epely (2) - 1 freq lezy (2) - 1 freq elect (2) - 9 freq cleg (2) - 12 freq glegly (2) - 18 freq klegs (2) - 1 freq glesgy (2) - 7 freq emery (2) - 1 freq energy (2) - 74 freq |
elegy (0) - 6 freq lego (2) - 19 freq elegie (2) - 3 freq leg (2) - 199 freq eulogy (2) - 4 freq engy (3) - 2 freq lug (3) - 297 freq gleg (3) - 127 freq lig (3) - 18 freq elroy (3) - 2 freq eely (3) - 2 freq luge (3) - 1 freq iley (3) - 4 freq peleg (3) - 3 freq elby (3) - 2 freq lag (3) - 5 freq logo (3) - 19 freq log (3) - 36 freq lg (3) - 4 freq edgy (3) - 6 freq ely (3) - 1 freq cleg (3) - 12 freq lexy (3) - 2 freq fleg (3) - 84 freq ulg (3) - 1 freq |
SoundEx code - E420 else - 723 freq elsie - 62 freq eels - 11 freq elegie - 3 freq els - 11 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 elk - 5 freq elaiss - 1 freq elks - 2 freq €œelk - 1 freq eyeless - 1 freq €™else - 1 freq eilish - 1 freq elxy - 1 freq ellis - 2 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.411246 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.796516 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.085742 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.097368 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.001060 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. |