| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ogre (0) - 1 freq oagre (1) - 1 freq oure (1) - 7 freq ore (1) - 1 freq mogre (1) - 1 freq ogle (1) - 2 freq gre (1) - 4 freq owre (1) - 607 freq sure (2) - 1001 freq dire (2) - 9 freq oboe (2) - 1 freq bogle (2) - 45 freq here (2) - 4207 freq bore (2) - 41 freq ora (2) - 1 freq ourie (2) - 3 freq lire (2) - 2 freq 'gie (2) - 26 freq obe (2) - 2 freq agri (2) - 1 freq 're (2) - 4 freq ole (2) - 2 freq bogie (2) - 24 freq ogl (2) - 1 freq oors (2) - 357 freq |
ogre (0) - 1 freq gre (1) - 4 freq oagre (1) - 1 freq grey (2) - 349 freq agree (2) - 159 freq gree (2) - 102 freq gore (2) - 5 freq agri (2) - 1 freq agr (2) - 1 freq gra (2) - 3 freq grye (2) - 1 freq grei (2) - 1 freq gro (2) - 3 freq gare (2) - 1 freq gr (2) - 4 freq gyre (2) - 13 freq grie (2) - 6 freq gri (2) - 1 freq owre (2) - 607 freq grae (2) - 4 freq ore (2) - 1 freq mogre (2) - 1 freq grue (2) - 56 freq oure (2) - 7 freq ogle (2) - 2 freq |
SoundEx code - O260 oscar - 8 freq ogre - 1 freq owcr - 1 freq occur - 7 freq ochre - 4 freq oziri - 1 freq oagre - 1 freq okr - 1 freq ohhjr - 1 freq |
MetaPhone code - OKR ogre - 1 freq owcr - 1 freq oagre - 1 freq okr - 1 freq |
OGRE |
| Time to execute Levenshtein function - 0.190338 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.336942 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.028046 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.037169 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.000894 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. |