| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| opposite (0) - 89 freq oapposite (1) - 1 freq opposites (1) - 1 freq opposing (2) - 2 freq oappasite (2) - 1 freq oppose (2) - 2 freq opposin (2) - 3 freq opposeit (2) - 1 freq deposits (3) - 3 freq deposit (3) - 5 freq appetite (3) - 19 freq oppostion (3) - 1 freq ppokit (3) - 1 freq supposit (3) - 4 freq impolite (3) - 1 freq oppeysit (3) - 1 freq deposited (3) - 2 freq sprosie (3) - 1 freq poosie (3) - 4 freq posie (3) - 1 freq pomposity (3) - 2 freq opposed (3) - 20 freq composit (3) - 2 freq onsite (3) - 1 freq oosie (3) - 3 freq |
opposite (0) - 89 freq oapposite (1) - 1 freq oappasite (2) - 1 freq opposites (2) - 1 freq opposeit (2) - 1 freq opposeet (3) - 1 freq oppeysit (3) - 1 freq opposin (3) - 3 freq oppose (3) - 2 freq opposition (4) - 29 freq pomposity (4) - 2 freq opposed (4) - 20 freq eppatite (4) - 1 freq apposeet (4) - 1 freq supposit (4) - 4 freq appetite (4) - 19 freq deposit (4) - 5 freq opposing (4) - 2 freq ppokit (4) - 1 freq oppostion (4) - 1 freq pausit (5) - 4 freq oppeyseet (5) - 1 freq poppit (5) - 1 freq i'postie (5) - 1 freq pissit (5) - 2 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 - 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 |
OPPOSITE |
| Time to execute Levenshtein function - 0.193694 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.321496 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.026960 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.036628 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.000811 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. |