| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| olif (0) - 1 freq olaf (1) - 292 freq glif (1) - 1 freq olaf' (2) - 1 freq clie (2) - 2 freq glit (2) - 1 freq glie (2) - 1 freq mlih (2) - 1 freq obf (2) - 1 freq lief (2) - 3 freq itif (2) - 1 freq olde (2) - 1 freq leif (2) - 2 freq olly (2) - 6 freq lift (2) - 496 freq oolit (2) - 2 freq onli (2) - 40 freq cif (2) - 4 freq owef (2) - 1 freq odf (2) - 1 freq oqf (2) - 1 freq olds (2) - 3 freq deif (2) - 28 freq liz (2) - 71 freq ol (2) - 1 freq |
olif (0) - 1 freq olaf (1) - 292 freq leif (2) - 2 freq ulf (2) - 4 freq lf (2) - 5 freq luif (2) - 34 freq lof (2) - 1 freq laif (2) - 5 freq laf (2) - 1 freq lief (2) - 3 freq life (2) - 1976 freq alf (2) - 7 freq glif (2) - 1 freq elf (2) - 10 freq lyf (2) - 3 freq lef (2) - 7 freq old (3) - 178 freq beif (3) - 2 freq leaf (3) - 40 freq lufe (3) - 1 freq ilin (3) - 1 freq faif (3) - 1 freq 'olaf (3) - 2 freq aalf (3) - 1 freq ol (3) - 5 freq |
SoundEx code - O410 olive - 16 freq olaf - 292 freq 'olaf - 2 freq olivy - 1 freq olivia - 5 freq olaf' - 1 freq olav - 1 freq 'olivia - 2 freq oulwife - 1 freq oaulwv - 1 freq olif - 1 freq |
MetaPhone code - OLF olive - 16 freq olaf - 292 freq 'olaf - 2 freq olivy - 1 freq olivia - 5 freq olaf' - 1 freq olav - 1 freq 'olivia - 2 freq oaulwv - 1 freq olif - 1 freq |
OLIF |
| Time to execute Levenshtein function - 0.186161 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.369721 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.027355 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.036768 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.000932 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. |