| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| olivia (0) - 5 freq oliviag (1) - 1 freq bolivia (1) - 2 freq oliviaj (1) - 1 freq 'olivia (1) - 2 freq lyvia (2) - 2 freq oliver (2) - 10 freq olina (2) - 11 freq alivin (2) - 1 freq olive (2) - 15 freq alicia (2) - 1 freq livid (2) - 4 freq olives (2) - 17 freq trivia (2) - 2 freq clivir (2) - 6 freq livit (2) - 1 freq livin (2) - 334 freq livie (2) - 8 freq livi (2) - 2 freq olivia's (2) - 1 freq boleivia (2) - 1 freq elivin (2) - 1 freq sliga (3) - 3 freq muivit (3) - 7 freq rivin (3) - 28 freq |
olivia (0) - 5 freq livi (2) - 2 freq olive (2) - 15 freq livie (2) - 8 freq lyvia (2) - 2 freq oliviag (2) - 1 freq bolivia (2) - 2 freq oliviaj (2) - 1 freq 'olivia (2) - 2 freq elivin (3) - 1 freq boleivia (3) - 1 freq levi (3) - 12 freq ilive (3) - 1 freq live (3) - 418 freq lava (3) - 4 freq alive (3) - 160 freq liv (3) - 12 freq olav (3) - 1 freq alva (3) - 2 freq olina (3) - 11 freq alicia (3) - 1 freq olives (3) - 17 freq livid (3) - 4 freq oliver (3) - 10 freq alivin (3) - 1 freq |
SoundEx code - O410 olive - 15 freq olaf - 292 freq 'olaf - 2 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 - 15 freq olaf - 292 freq 'olaf - 2 freq olivia - 5 freq olaf' - 1 freq olav - 1 freq 'olivia - 2 freq oaulwv - 1 freq olif - 1 freq |
OLIVIA |
| Time to execute Levenshtein function - 0.170299 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.327451 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.028290 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.036317 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.000845 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. |