| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| elves (0) - 10 freq elven (1) - 1 freq eves (1) - 1 freq elvis (1) - 11 freq elses (1) - 1 freq selves (1) - 4 freq eaves (1) - 2 freq twelves (2) - 1 freq heles (2) - 1 freq ales (2) - 1 freq elites (2) - 5 freq delve (2) - 6 freq eldest (2) - 18 freq heaves (2) - 2 freq eares (2) - 1 freq gives (2) - 19 freq eres (2) - 1 freq eines (2) - 3 freq even (2) - 2579 freq delved (2) - 2 freq eeve (2) - 8 freq elmer (2) - 2 freq elder (2) - 58 freq flies (2) - 32 freq eeses (2) - 1 freq |
elves (0) - 10 freq elvis (1) - 11 freq leeves (2) - 19 freq lives (2) - 236 freq leaves (2) - 203 freq laves (2) - 3 freq leives (2) - 3 freq olives (2) - 17 freq loves (2) - 63 freq elses (2) - 1 freq eves (2) - 1 freq elven (2) - 1 freq luves (2) - 16 freq selves (2) - 4 freq eaves (2) - 2 freq lees (3) - 63 freq hives (3) - 2 freq rives (3) - 4 freq muves (3) - 1 freq taves (3) - 4 freq jeeves (3) - 3 freq elbies (3) - 1 freq evolves (3) - 1 freq waves (3) - 137 freq loaves (3) - 5 freq |
SoundEx code - E412 elbas - 9 freq elbows - 7 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.215481 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.336861 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.026928 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.052182 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. |