| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| olina (0) - 11 freq lina (1) - 1 freq lona (2) - 1 freq ylind (2) - 1 freq opin (2) - 9 freq sliga (2) - 3 freq blink (2) - 89 freq olick (2) - 1 freq ocna (2) - 1 freq china (2) - 53 freq alana (2) - 12 freq robina (2) - 1 freq blint (2) - 3 freq blind (2) - 41 freq dolin (2) - 1 freq -lins (2) - 1 freq luna (2) - 2 freq oana (2) - 1 freq olivia (2) - 5 freq odin (2) - 43 freq clint (2) - 4 freq poling (2) - 1 freq ona (2) - 14 freq dina (2) - 43 freq beina (2) - 1 freq |
olina (0) - 11 freq lina (1) - 1 freq ulna (2) - 1 freq lino (2) - 5 freq ilin (2) - 1 freq luna (2) - 2 freq lna (2) - 1 freq lin (2) - 10 freq line (2) - 479 freq alana (2) - 12 freq lena (2) - 2 freq lona (2) - 1 freq alon (3) - 2 freq ilia (3) - 1 freq ina (3) - 99 freq alaine (3) - 1 freq alane (3) - 267 freq lila (3) - 1 freq holin (3) - 2 freq alone (3) - 68 freq kline (3) - 1 freq onna (3) - 18 freq lint (3) - 17 freq cline (3) - 4 freq olite (3) - 3 freq |
SoundEx code - O450 oilan - 1 freq olina - 11 freq o'loon - 1 freq |
MetaPhone code - OLN oilan - 1 freq olina - 11 freq o'loon - 1 freq |
OLINA |
| Time to execute Levenshtein function - 0.196301 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.353775 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.030574 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.036386 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.000860 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. |