| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| opposing (0) - 2 freq opposin (1) - 3 freq composing (2) - 1 freq imposing (2) - 1 freq opposite (2) - 89 freq exposing (2) - 1 freq phasing (3) - 1 freq phoning (3) - 4 freq topping (3) - 2 freq opposeit (3) - 1 freq opposed (3) - 20 freq opposeet (3) - 1 freq toppling (3) - 1 freq popping (3) - 1 freq oppose (3) - 2 freq applying (3) - 8 freq poling (3) - 1 freq oapposite (3) - 1 freq composin (3) - 3 freq proposing (3) - 3 freq oppint (3) - 2 freq closing (3) - 8 freq pulsing (3) - 3 freq oppostion (3) - 1 freq exposin (3) - 7 freq |
opposing (0) - 2 freq opposin (2) - 3 freq exposing (3) - 1 freq imposing (3) - 1 freq pausing (4) - 1 freq popping (4) - 1 freq proposing (4) - 3 freq pulsing (4) - 3 freq applying (4) - 8 freq pissing (4) - 2 freq opposite (4) - 89 freq composing (4) - 1 freq uprising (4) - 3 freq phasing (4) - 1 freq passing (4) - 24 freq upcoming (5) - 3 freq hosing (5) - 1 freq losing (5) - 14 freq pooling (5) - 1 freq choosing (5) - 3 freq poking (5) - 5 freq appearing (5) - 5 freq pursuing (5) - 2 freq peeping (5) - 2 freq appealing (5) - 1 freq |
SoundEx code - O125 obscene - 13 freq obscenities - 2 freq offcn - 1 freq oohyafuckin - 1 freq obscenely - 3 freq off-chance - 1 freq ovey-somethin - 1 freq opposin - 3 freq opposing - 2 freq obviousness - 1 freq ofcom - 5 freq oybxmv - 1 freq obknit - 1 freq ofzm - 1 freq ophusnnk - 1 freq ofjnzg - 1 freq opscmh - 1 freq |
MetaPhone code - OPSNK opposing - 2 freq |
OPPOSING |
| Time to execute Levenshtein function - 0.231240 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.392902 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.036934 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.049241 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.001265 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. |