| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| occur (0) - 7 freq accur (1) - 1 freq occurs (1) - 4 freq occurt (1) - 1 freq occurrt (2) - 1 freq owcr (2) - 1 freq cur (2) - 6 freq scour (2) - 4 freq oafur (2) - 1 freq scur (2) - 1 freq caur (2) - 125 freq our (2) - 486 freq scaur (2) - 14 freq owur (2) - 1 freq occa (2) - 1 freq recur (2) - 1 freq mccr (2) - 1 freq odour (2) - 3 freq oncum (2) - 50 freq occult (2) - 3 freq cour (2) - 1 freq concur (2) - 5 freq soccer (2) - 4 freq incur (2) - 2 freq ownur (2) - 1 freq |
occur (0) - 7 freq accur (1) - 1 freq occurt (2) - 1 freq occurs (2) - 4 freq soccer (3) - 4 freq concur (3) - 5 freq incur (3) - 2 freq mccr (3) - 1 freq cour (3) - 1 freq oscar (3) - 6 freq occam (3) - 1 freq recur (3) - 1 freq occupy (3) - 6 freq corcur (3) - 4 freq occa (3) - 1 freq scur (3) - 1 freq scour (3) - 4 freq cur (3) - 6 freq owcr (3) - 1 freq scaur (3) - 14 freq caur (3) - 125 freq succour (4) - 6 freq occupier (4) - 1 freq secure (4) - 22 freq pecr (4) - 1 freq |
SoundEx code - O260 oscar - 6 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 - OKKR occur - 7 freq |
OCCUR |
| Time to execute Levenshtein function - 0.241937 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.574235 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.027488 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.080038 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.001111 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. |