| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| elves (0) - 10 freq elses (1) - 1 freq eves (1) - 1 freq elven (1) - 1 freq selves (1) - 4 freq elvis (1) - 11 freq eaves (1) - 2 freq ewes (2) - 6 freq else' (2) - 1 freq deives (2) - 1 freq erles (2) - 1 freq serves (2) - 26 freq exes (2) - 3 freq elks (2) - 2 freq weles (2) - 1 freq eliven (2) - 1 freq eshes (2) - 6 freq claes (2) - 582 freq hives (2) - 2 freq tles (2) - 1 freq eries (2) - 1 freq solves (2) - 3 freq cloves (2) - 4 freq alven (2) - 1 freq flees (2) - 73 freq |
elves (0) - 10 freq elvis (1) - 11 freq leeves (2) - 19 freq lyves (2) - 1 freq leives (2) - 3 freq lives (2) - 241 freq loves (2) - 68 freq laves (2) - 3 freq luves (2) - 16 freq olives (2) - 17 freq elses (2) - 1 freq eves (2) - 1 freq elven (2) - 1 freq eaves (2) - 2 freq leaves (2) - 208 freq selves (2) - 4 freq lues (3) - 1 freq meeves (3) - 1 freq alles (3) - 1 freq daves (3) - 2 freq weaves (3) - 9 freq les (3) - 7 freq salves (3) - 2 freq iles (3) - 3 freq jeeves (3) - 3 freq |
SoundEx code - E412 elbas - 9 freq elbows - 8 freq elvis - 11 freq elbuck - 13 freq elbucks - 6 freq elves - 10 freq elbaes - 1 freq elbock-cheer - 1 freq elbies - 1 freq elbick - 3 freq elbicks - 1 freq elbuk - 1 freq elipse - 1 freq elevkit - 1 freq elapse - 1 freq elfs - 1 freq elevicrkb - 1 freq elvis - 1 freq eilaubqdvm - 1 freq |
MetaPhone code - ELFS elvis - 11 freq elves - 10 freq elfs - 1 freq elvis - 1 freq |
ELVES |
| Time to execute Levenshtein function - 0.324479 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.709432 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.066569 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.077200 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.001243 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. |