| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| occurred (0) - 18 freq concurred (2) - 1 freq accured (2) - 1 freq incurred (2) - 2 freq scurred (2) - 2 freq occurrt (2) - 1 freq occupeed (2) - 1 freq occurrin (2) - 1 freq occupied (2) - 20 freq couered (3) - 1 freq occurrence (3) - 3 freq slurred (3) - 7 freq scaured (3) - 4 freq spurred (3) - 4 freq lurred (3) - 1 freq coured (3) - 1 freq cairred (3) - 2 freq curled (3) - 43 freq whurred (3) - 1 freq uncurled (3) - 2 freq acquired (3) - 10 freq acurren (3) - 1 freq occupier (3) - 1 freq obscured (3) - 2 freq occurs (3) - 4 freq |
occurred (0) - 18 freq occurrin (3) - 1 freq occurrt (3) - 1 freq scurred (3) - 2 freq concurred (3) - 1 freq accured (3) - 1 freq incurred (3) - 2 freq accorded (4) - 1 freq curried (4) - 2 freq courried (4) - 1 freq charred (4) - 1 freq scarred (4) - 15 freq scurried (4) - 5 freq carred (4) - 1 freq cairred (4) - 2 freq occupeed (4) - 1 freq occupied (4) - 20 freq clarried (5) - 3 freq churned (5) - 2 freq gurred (5) - 8 freq scoured (5) - 5 freq occurring (5) - 2 freq cursed (5) - 43 freq taurred (5) - 1 freq occupyd (5) - 1 freq |
SoundEx code - O263 occurred - 18 freq ochrtr - 1 freq ogartnes - 1 freq occurrt - 1 freq occurt - 1 freq ograde - 1 freq ohxhrtlo - 1 freq o'crotia - 1 freq oshortbreeds - 1 freq oakroyd - 1 freq |
MetaPhone code - OKKRT occurred - 18 freq occurrt - 1 freq occurt - 1 freq |
OCCURRED |
| Time to execute Levenshtein function - 0.214891 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.345695 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.027744 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.042546 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.000833 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. |