| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oppeyseet (0) - 1 freq opposeet (2) - 1 freq oppeysit (2) - 1 freq oppeneen (3) - 1 freq opposeit (3) - 1 freq apposeet (3) - 1 freq oppressed (4) - 7 freq owersett (4) - 3 freq mikeyskeet (4) - 1 freq opprest (4) - 1 freq owre-set (4) - 1 freq overseen (4) - 1 freq appeert (4) - 2 freq owreset (4) - 19 freq oppened (4) - 22 freq overseer (4) - 2 freq oppose (4) - 2 freq owersee (4) - 2 freq peyment (4) - 6 freq opposed (4) - 20 freq pre-set (4) - 1 freq opponent (4) - 3 freq speereet (4) - 1 freq permeet (4) - 1 freq 'present (4) - 1 freq |
oppeyseet (0) - 1 freq oppeysit (2) - 1 freq opposeet (2) - 1 freq opposeit (3) - 1 freq apposeet (3) - 1 freq oppose (5) - 2 freq appease (5) - 8 freq appeased (5) - 1 freq opposed (5) - 20 freq applyet (5) - 1 freq opposite (5) - 89 freq appeert (5) - 2 freq oppeneen (5) - 1 freq opprest (5) - 1 freq poppet (6) - 8 freq pest (6) - 25 freq peediest (6) - 4 freq opps (6) - 1 freq prest (6) - 1 freq appeart (6) - 80 freq upseyt (6) - 1 freq apperit (6) - 3 freq applyit (6) - 1 freq appearit (6) - 5 freq appynt (6) - 4 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 |
OPPEYSEET |
| Time to execute Levenshtein function - 0.240979 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.383894 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.030336 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.037735 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.000857 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. |