Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
oozin (0) - 3 freq oozie (1) - 1 freq ookin (1) - 1 freq ooin (1) - 1 freq ootin (1) - 5 freq boozin (1) - 4 freq oobin (1) - 2 freq oo-in (1) - 1 freq dozin (1) - 8 freq oozit (1) - 2 freq poopin (2) - 1 freq sizin (2) - 5 freq roonin (2) - 1 freq coolin (2) - 2 freq coin (2) - 46 freq boxin (2) - 13 freq soomin (2) - 7 freq pootin (2) - 1 freq bodin (2) - 1 freq jookin (2) - 7 freq pozi (2) - 1 freq nogin (2) - 1 freq posin (2) - 9 freq nohin (2) - 1 freq outin (2) - 4 freq |
oozin (0) - 3 freq dozin (2) - 8 freq oo-in (2) - 1 freq uizin (2) - 12 freq yazin (2) - 3 freq oobin (2) - 2 freq oozit (2) - 2 freq oozie (2) - 1 freq boozin (2) - 4 freq ookin (2) - 1 freq ootin (2) - 5 freq ooin (2) - 1 freq pooin (3) - 5 freq doin (3) - 74 freq tizin (3) - 3 freq yoosin (3) - 1 freq dozan (3) - 1 freq tooin (3) - 1 freq oozed (3) - 1 freq bouin (3) - 5 freq owain (3) - 1 freq ozil (3) - 1 freq toyin (3) - 2 freq dozen (3) - 38 freq rooin (3) - 2 freq |
SoundEx code - O250 ocean - 63 freq ochone - 13 freq oozin - 3 freq owsen - 3 freq oxen - 2 freq ocna - 1 freq 'ochone - 1 freq oagin - 6 freq oshin - 1 freq oggimai - 1 freq ochon - 1 freq ogham - 2 freq €˜ocean - 2 freq oesin - 1 freq occam - 1 freq osnu - 1 freq oÂ’some - 1 freq ookin - 1 freq oqm - 1 freq |
MetaPhone code - OSN ocean - 63 freq oozin - 3 freq owsen - 3 freq €˜ocean - 2 freq oesin - 1 freq osnu - 1 freq |
OOZIN |
Time to execute Levenshtein function - 0.270898 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.617065 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.028778 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.070019 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.001036 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. |