| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ogilvie (0) - 13 freq ogilvy (2) - 2 freq gillie (2) - 2 freq invie (3) - 1 freq vievie (3) - 1 freq bonilie (3) - 1 freq drillie (3) - 1 freq seillie (3) - 2 freq givin (3) - 8 freq giftie (3) - 8 freq kiltie (3) - 5 freq 'kiltie (3) - 1 freq give (3) - 161 freq oilier (3) - 1 freq kildie (3) - 5 freq hailie (3) - 9 freq govie (3) - 3 freq deilie (3) - 2 freq ailie (3) - 1 freq dowilie (3) - 1 freq grilsie (3) - 1 freq baillie (3) - 17 freq huilie (3) - 2 freq gilpin (3) - 1 freq glie (3) - 1 freq |
ogilvie (0) - 13 freq ogilvy (2) - 2 freq gillie (3) - 2 freq gilli (4) - 3 freq gluve (4) - 1 freq guiltie (4) - 4 freq gullie (4) - 9 freq ogle (4) - 2 freq glie (4) - 1 freq olivia (4) - 5 freq garvie (4) - 1 freq goliev (4) - 1 freq silvio (4) - 1 freq goldie (4) - 3 freq sylvie (4) - 8 freq giltee (4) - 2 freq govie (4) - 3 freq gliv (4) - 1 freq livie (4) - 8 freq give (4) - 161 freq olive (4) - 15 freq glove (4) - 10 freq agile (4) - 2 freq evolve (5) - 7 freq lieve (5) - 1 freq |
SoundEx code - O241 ogilvie - 13 freq ogilvy - 2 freq o'kilpatrick - 1 freq oklyfy - 1 freq |
MetaPhone code - OJLF ogilvie - 13 freq ogilvy - 2 freq |
OGILVIE |
| Time to execute Levenshtein function - 0.468845 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.634828 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.059842 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.039788 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.002590 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. |