| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eldin (0) - 3 freq geldin (1) - 1 freq weldin (1) - 1 freq endin (1) - 43 freq elfin (1) - 5 freq eldon (1) - 1 freq elgin (1) - 24 freq edin (1) - 4 freq eltin (1) - 1 freq meldin (1) - 2 freq erin (2) - 9 freq ewin (2) - 1 freq fllin (2) - 1 freq bellin (2) - 3 freq beddin (2) - 16 freq yelpin (2) - 3 freq aidin (2) - 1 freq enin (2) - 4 freq goldin (2) - 1 freq dellin (2) - 5 freq elton (2) - 2 freq edit (2) - 17 freq fludin (2) - 1 freq reidin (2) - 1 freq ectin (2) - 1 freq |
eldin (0) - 3 freq eldon (1) - 1 freq ladin (2) - 1 freq meldin (2) - 2 freq eildon (2) - 3 freq yieldin (2) - 3 freq eltin (2) - 1 freq leadin (2) - 66 freq olden (2) - 1 freq weldin (2) - 1 freq edin (2) - 4 freq elfin (2) - 5 freq endin (2) - 43 freq elgin (2) - 24 freq geldin (2) - 1 freq glidin (3) - 7 freq ellon (3) - 19 freq holdin (3) - 18 freq eidein (3) - 1 freq eldern (3) - 4 freq ilin (3) - 1 freq alkin (3) - 1 freq nedin (3) - 1 freq bladin (3) - 1 freq edina (3) - 2 freq |
SoundEx code - E435 elation - 3 freq eildon - 3 freq eouldna - 1 freq eltin - 1 freq elton - 2 freq eildons - 1 freq eldon - 1 freq eldin - 3 freq |
MetaPhone code - ELTN eildon - 3 freq eouldna - 1 freq eltin - 1 freq elton - 2 freq eldon - 1 freq eldin - 3 freq |
ELDIN |
| Time to execute Levenshtein function - 0.324271 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.370202 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.030547 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.043248 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.001013 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. |