| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| occasion (0) - 42 freq occasions (1) - 19 freq occasioun (1) - 2 freq occassion (1) - 1 freq occasional (2) - 23 freq occasioned (2) - 1 freq occassions (2) - 1 freq occashun (2) - 1 freq occasiouns (2) - 2 freq decision (3) - 87 freq vocation (3) - 2 freq omission (3) - 2 freq moccasins (3) - 1 freq invasion (3) - 15 freq location (3) - 35 freq nclusion (3) - 1 freq omeesion (3) - 2 freq 'chasin (3) - 1 freq chasin (3) - 41 freq clarion (3) - 1 freq occupation (3) - 14 freq clasin (3) - 1 freq mccallion (3) - 1 freq caasin (3) - 3 freq occassional (3) - 1 freq |
occasion (0) - 42 freq occasioun (1) - 2 freq occasions (2) - 19 freq occassion (2) - 1 freq accusin (3) - 7 freq occashun (3) - 1 freq occasiouns (3) - 2 freq occasioned (3) - 1 freq occasional (3) - 23 freq occassions (4) - 1 freq clasin (4) - 1 freq caasin (4) - 3 freq casin (4) - 3 freq chasin (4) - 41 freq decision (4) - 87 freq accusation (5) - 8 freq accessin (5) - 5 freq cuisin (5) - 1 freq inceesion (5) - 1 freq cohesion (5) - 8 freq casino (5) - 9 freq accepin (5) - 1 freq crusin (5) - 1 freq carson (5) - 1 freq deceision (5) - 5 freq |
SoundEx code - O225 occasion - 42 freq occasional - 23 freq occasions - 19 freq okaysein - 1 freq occasionally - 11 freq oxygen - 17 freq occasionallie - 1 freq occasioun - 2 freq occashun - 1 freq occasiouns - 2 freq oxiegene - 1 freq occasioned - 1 freq occassions - 1 freq ochkenny - 1 freq occassional - 1 freq occassion - 1 freq |
MetaPhone code - OKKXN occasion - 42 freq occasioun - 2 freq occashun - 1 freq |
OCCASION |
| Time to execute Levenshtein function - 0.402136 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.881788 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.087291 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.098232 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.000876 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. |