Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
occasion (0) - 42 freq occassion (1) - 1 freq occasioun (1) - 2 freq occasions (1) - 18 freq occasional (2) - 22 freq occashun (2) - 1 freq occasiouns (2) - 2 freq occasioned (2) - 1 freq occassions (2) - 1 freq clarion (3) - 1 freq location (3) - 35 freq invasion (3) - 15 freq moccasins (3) - 1 freq nclusion (3) - 1 freq accusin (3) - 7 freq casin (3) - 3 freq vocation (3) - 2 freq vacation (3) - 2 freq decision (3) - 86 freq orcadian (3) - 51 freq mccallion (3) - 1 freq omeesion (3) - 2 freq clasin (3) - 1 freq omission (3) - 2 freq occupation (3) - 14 freq |
occasion (0) - 42 freq occasioun (1) - 2 freq occassion (2) - 1 freq occasions (2) - 18 freq occasioned (3) - 1 freq accusin (3) - 7 freq occashun (3) - 1 freq occasiouns (3) - 2 freq occasional (3) - 22 freq casin (4) - 3 freq chasin (4) - 40 freq occassions (4) - 1 freq decision (4) - 86 freq caasin (4) - 3 freq clasin (4) - 1 freq deceision (5) - 5 freq occupyin (5) - 2 freq accessin (5) - 5 freq crusin (5) - 1 freq cursin (5) - 23 freq cuisin (5) - 1 freq cohesion (5) - 8 freq casino (5) - 9 freq coccoon (5) - 1 freq accusation (5) - 8 freq |
SoundEx code - O225 occasion - 42 freq occasional - 22 freq occasions - 18 freq okaysein - 1 freq oxygen - 17 freq occasionallie - 1 freq occasionally - 10 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.192408 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.389477 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.027242 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.036824 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.000840 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. |