| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| opposition (0) - 29 freq oppostion (1) - 1 freq opposeition (1) - 1 freq position (2) - 95 freq imposition (2) - 2 freq composition (2) - 3 freq supposition (2) - 1 freq opposeetion (2) - 3 freq preposition (3) - 8 freq apparition (3) - 3 freq opposites (3) - 1 freq apportion (3) - 1 freq positions (3) - 13 freq composietion (3) - 1 freq proposition (3) - 1 freq composeition (3) - 2 freq disposition (3) - 2 freq opposin (3) - 3 freq opposite (3) - 89 freq poseition (3) - 9 freq expotition (3) - 1 freq expositioun (3) - 1 freq repitition (4) - 1 freq corporation (4) - 5 freq compositional (4) - 1 freq |
opposition (0) - 29 freq oppostion (1) - 1 freq opposeition (1) - 1 freq opposeetion (2) - 3 freq supposition (3) - 1 freq imposition (3) - 2 freq position (3) - 95 freq opposin (4) - 3 freq opposite (4) - 89 freq proposition (4) - 1 freq expositioun (4) - 1 freq poseition (4) - 9 freq preposition (4) - 8 freq composition (4) - 3 freq opposites (4) - 1 freq apparition (4) - 3 freq apportion (4) - 1 freq exposeetion (5) - 2 freq apparitioun (5) - 1 freq oapposite (5) - 1 freq reposeetion (5) - 1 freq appareition (5) - 1 freq opposeit (5) - 1 freq poseitioun (5) - 5 freq postin (5) - 21 freq |
SoundEx code - O123 opposite - 89 freq oappasite - 1 freq obstacle - 7 freq opposed - 20 freq opposeet - 1 freq opposeetion - 3 freq oppeysit - 1 freq oppeyseet - 1 freq obstacles - 3 freq opposition - 29 freq obfuscate - 1 freq obstructions - 1 freq opposeition - 1 freq opposeit - 1 freq off-cuts - 1 freq obstruction - 1 freq opposites - 1 freq obesity - 8 freq €œobesity - 1 freq obstructive - 1 freq oppostion - 1 freq offside - 3 freq €”obstinater - 1 freq oapposite - 1 freq ouwpcedqq - 1 freq oeabjit - 1 freq offsides - 1 freq obgdig - 1 freq |
MetaPhone code - OPSXN opposeetion - 3 freq opposition - 29 freq opposeition - 1 freq oppostion - 1 freq |
OPPOSITION |
| Time to execute Levenshtein function - 0.233987 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.488942 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.027920 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.040028 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.000896 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. |