| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| occupation (0) - 14 freq occupations (1) - 4 freq accusation (2) - 8 freq occupation's (2) - 1 freq incubation (3) - 1 freq preoccupation (3) - 2 freq occupyin (3) - 2 freq accusations (3) - 7 freq occasion (3) - 42 freq vocation (4) - 2 freq regulation (4) - 4 freq occupant (4) - 2 freq situation (4) - 151 freq decoration (4) - 4 freq companion (4) - 26 freq creaation (4) - 1 freq occupies (4) - 1 freq option (4) - 51 freq ejaculation (4) - 1 freq duration (4) - 5 freq vacation (4) - 2 freq accumulation (4) - 1 freq dictation (4) - 1 freq oration (4) - 1 freq saturation (4) - 1 freq |
occupation (0) - 14 freq occupations (2) - 4 freq accusation (3) - 8 freq acceptin (4) - 16 freq occupyin (4) - 2 freq occupation's (4) - 1 freq exception (5) - 18 freq inception (5) - 1 freq caption (5) - 1 freq conception (5) - 4 freq reception (5) - 29 freq accusations (5) - 7 freq occasion (5) - 42 freq preoccupation (5) - 2 freq incubation (5) - 1 freq recitation (6) - 2 freq excavation (6) - 4 freq occupants (6) - 1 freq captioun (6) - 1 freq caution (6) - 9 freq accepin (6) - 1 freq carnation (6) - 3 freq occupied (6) - 20 freq acclamation (6) - 2 freq accoontin (6) - 5 freq |
SoundEx code - O213 occupeed - 1 freq occupied - 20 freq occupation - 14 freq ospital - 8 freq occupations - 4 freq occupyd - 1 freq occupation's - 1 freq ospitals - 1 freq ossified - 1 freq ospittle - 2 freq oucpbdu - 1 freq ojbt - 1 freq ozvotbhk - 1 freq |
MetaPhone code - OKKPXN occupation - 14 freq |
OCCUPATION |
| Time to execute Levenshtein function - 0.174498 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.328369 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.027392 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.037013 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. |