| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oappasite (0) - 1 freq oapposite (1) - 1 freq opposite (2) - 89 freq parasite (3) - 3 freq appetite (3) - 19 freq campsite (3) - 1 freq camp-site (3) - 1 freq opposites (3) - 2 freq eppatite (3) - 1 freq cappit (4) - 3 freq bappit (4) - 1 freq appruive (4) - 2 freq happit (4) - 104 freq cappie (4) - 3 freq swbyasite (4) - 1 freq campsie (4) - 2 freq campsites (4) - 1 freq appairt (4) - 5 freq yappit (4) - 1 freq oppeysit (4) - 1 freq fantasise (4) - 1 freq nappie (4) - 1 freq sapsie (4) - 2 freq sappit (4) - 3 freq happilie (4) - 1 freq |
oappasite (0) - 1 freq oapposite (1) - 1 freq opposite (2) - 89 freq opposeit (4) - 1 freq opposites (4) - 2 freq oppeysit (4) - 1 freq eppatite (4) - 1 freq appetite (4) - 19 freq parasite (4) - 3 freq papist (5) - 3 freq supposit (5) - 4 freq applyit (5) - 1 freq appease (5) - 8 freq pappit (5) - 1 freq yappit (5) - 1 freq oppose (5) - 2 freq apprisit (5) - 1 freq opposin (5) - 3 freq paste (5) - 10 freq apposeet (5) - 1 freq appairt (5) - 5 freq apperit (5) - 3 freq opposeet (5) - 1 freq appearit (5) - 5 freq campsite (5) - 1 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 |
OAPPASITE |
| Time to execute Levenshtein function - 0.183365 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.438154 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.030241 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.038600 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.001242 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. |