| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| opposeet (0) - 1 freq opposeit (1) - 1 freq apposeet (1) - 1 freq opponent (2) - 3 freq oppeyseet (2) - 1 freq opposed (2) - 20 freq oppose (2) - 2 freq impoleet (3) - 1 freq opposing (3) - 2 freq opprest (3) - 1 freq opposites (3) - 2 freq opposin (3) - 3 freq opposeetion (3) - 3 freq poleet (3) - 3 freq opponents (3) - 9 freq oppeneen (3) - 1 freq opposite (3) - 89 freq closeen (4) - 2 freq project (4) - 95 freq owerset (4) - 81 freq €™pose (4) - 1 freq appent (4) - 7 freq plusnet (4) - 1 freq prophet (4) - 13 freq imposed (4) - 9 freq |
opposeet (0) - 1 freq apposeet (1) - 1 freq opposeit (1) - 1 freq oppeyseet (2) - 1 freq opposite (3) - 89 freq oppose (3) - 2 freq opposed (3) - 20 freq opposeetion (4) - 3 freq oppeysit (4) - 1 freq opposin (4) - 3 freq oapposite (4) - 1 freq opposites (4) - 2 freq opprest (4) - 1 freq opponent (4) - 3 freq upset (5) - 66 freq popet (5) - 2 freq oppostion (5) - 1 freq appert (5) - 1 freq upseyt (5) - 1 freq appoint (5) - 2 freq ppokit (5) - 1 freq oappasite (5) - 1 freq opposeition (5) - 1 freq opps (5) - 1 freq deposit (5) - 6 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 opposites - 2 freq opposition - 30 freq obfuscate - 1 freq obstructions - 1 freq opposeition - 1 freq opposeit - 1 freq off-cuts - 1 freq obstruction - 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 - OPST opposite - 89 freq oappasite - 1 freq opposed - 20 freq opposeet - 1 freq oppeysit - 1 freq oppeyseet - 1 freq opposeit - 1 freq oapposite - 1 freq |
OPPOSEET |
| Time to execute Levenshtein function - 0.380343 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.540054 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.030727 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.041662 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.001197 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. |