| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ¢ell (0) - 1 freq 'well (2) - 52 freq abell (2) - 1 freq fjell (2) - 1 freq hell (2) - 370 freq dell (2) - 8 freq tell (2) - 2490 freq jell (2) - 3 freq snell (2) - 78 freq nell (2) - 13 freq tell (2) - 2 freq spell (2) - 158 freq knell (2) - 5 freq bell (2) - 210 freq dwell (2) - 11 freq gbell (2) - 1 freq yell (2) - 56 freq 'fell (2) - 1 freq 'yell (2) - 1 freq tell (2) - 1 freq kell (2) - 1 freq tell (2) - 1 freq stell (2) - 31 freq smell (2) - 263 freq mell (2) - 23 freq |
¢ell (0) - 1 freq -well (4) - 2 freq 'sell (4) - 1 freq sell (4) - 164 freq gell (4) - 5 freq waell (4) - 1 freq shell (4) - 40 freq mell (4) - 23 freq ell (4) - 1 freq well (4) - 1 freq swell (4) - 17 freq pell (4) - 4 freq thell (4) - 4 freq quell (4) - 5 freq weell (4) - 1 freq all (4) - 5 freq ill (4) - 32 freq 'tell (4) - 14 freq 'hell (4) - 1 freq well (4) - 1394 freq iell (4) - 2 freq cell (4) - 34 freq smell (4) - 263 freq fell (4) - 709 freq jell (4) - 3 freq |
SoundEx code - E400 eel - 24 freq ee'll - 12 freq el - 25 freq ellie - 7 freq eil - 10 freq ely - 1 freq 'el - 2 freq ei'll - 2 freq ella - 26 freq ¢ell - 1 freq eal - 1 freq eli - 4 freq eyl - 9 freq eela - 3 freq 'ee'll - 1 freq eely - 2 freq ey'll - 1 freq 'elle - 1 freq eelie - 1 freq elyia - 2 freq ell - 1 freq eile - 1 freq elo - 2 freq elw - 1 freq elie - 1 freq |
MetaPhone code - EL eel - 24 freq ee'll - 12 freq el - 25 freq ellie - 7 freq eil - 10 freq ely - 1 freq 'el - 2 freq ei'll - 2 freq ella - 26 freq ¢ell - 1 freq eal - 1 freq eli - 4 freq eyl - 9 freq ael - 1 freq eela - 3 freq 'ee'll - 1 freq eely - 2 freq ey'll - 1 freq 'elle - 1 freq eelie - 1 freq ell - 1 freq eile - 1 freq elo - 2 freq elw - 1 freq elie - 1 freq |
¢ELL |
| Time to execute Levenshtein function - 0.207627 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.362793 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.039492 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.037867 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.000851 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. |