| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oliver (0) - 10 freq sliver (1) - 8 freq cliver (1) - 12 freq olives (1) - 17 freq liver (1) - 34 freq olive (1) - 15 freq shiver (2) - 32 freq oilier (2) - 1 freq fooiver (2) - 14 freq livert (2) - 1 freq olivia (2) - 5 freq live (2) - 418 freq liner (2) - 4 freq clever (2) - 66 freq chiver (2) - 1 freq faiver (2) - 3 freq lover (2) - 27 freq caiver (2) - 1 freq slivers (2) - 5 freq live' (2) - 3 freq over (2) - 335 freq slider (2) - 4 freq luver (2) - 8 freq aiver (2) - 3 freq daiver (2) - 4 freq |
oliver (0) - 10 freq liver (1) - 34 freq lover (2) - 27 freq sliver (2) - 8 freq livery (2) - 13 freq lever (2) - 2 freq olive (2) - 15 freq cliver (2) - 12 freq olives (2) - 17 freq luver (2) - 8 freq lives (3) - 236 freq plover (3) - 9 freq wiver (3) - 1 freq diver (3) - 5 freq cuiver (3) - 4 freq fiver (3) - 46 freq ilive (3) - 1 freq hooiver (3) - 13 freq slaver (3) - 6 freq iver (3) - 312 freq alive' (3) - 1 freq siver (3) - 2 freq slaiver (3) - 1 freq clivir (3) - 6 freq taiver (3) - 2 freq |
SoundEx code - O416 oliver - 10 freq oul-farrant - 1 freq olivermundell - 2 freq oliviers - 1 freq olphrmze - 1 freq oliver's - 1 freq |
MetaPhone code - OLFR oliver - 10 freq |
OLIVER |
| Time to execute Levenshtein function - 0.205554 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.540123 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.027445 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.068044 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.000835 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. |