| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oppeysit (0) - 1 freq oppeyseet (2) - 1 freq pleyit (3) - 2 freq obsessit (3) - 2 freq opposin (3) - 3 freq apprisit (3) - 1 freq appearit (3) - 5 freq pleasit (3) - 5 freq peyit (3) - 9 freq apperit (3) - 3 freq pressit (3) - 4 freq oppressin (3) - 1 freq applyit (3) - 1 freq appellit (3) - 1 freq opposeit (3) - 1 freq pleisit (3) - 2 freq opprest (3) - 1 freq oppens (3) - 4 freq opposite (3) - 89 freq openit (3) - 4 freq oppenin (3) - 6 freq openin (4) - 120 freq €œpermit (4) - 1 freq speilit (4) - 1 freq poppets (4) - 1 freq |
oppeysit (0) - 1 freq oppeyseet (2) - 1 freq opposite (3) - 89 freq opposeit (3) - 1 freq oapposite (4) - 1 freq oappasite (4) - 1 freq opprest (4) - 1 freq apperit (4) - 3 freq pleisit (4) - 2 freq applyit (4) - 1 freq apprisit (4) - 1 freq opposin (4) - 3 freq appearit (4) - 5 freq opposeet (4) - 1 freq pleasit (4) - 5 freq poppet (5) - 8 freq appert (5) - 1 freq appeased (5) - 1 freq pepsi (5) - 7 freq ppokit (5) - 1 freq opposed (5) - 20 freq appease (5) - 8 freq pleepsit (5) - 1 freq prest (5) - 1 freq papist (5) - 3 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 |
OPPEYSIT |
| Time to execute Levenshtein function - 0.224743 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.398795 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.028794 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.037983 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.000854 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. |