| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| competeition (0) - 8 freq competition (1) - 63 freq competeetion (1) - 13 freq competeitions (1) - 3 freq composeition (2) - 2 freq compitition (2) - 1 freq competeition's (2) - 1 freq competeetions (2) - 4 freq competitions (2) - 7 freq competitive (3) - 9 freq compeetin (3) - 1 freq repeteition (3) - 1 freq competitor (3) - 1 freq peteition (3) - 1 freq compensation (3) - 10 freq completion (3) - 4 freq complection (3) - 1 freq composition (3) - 3 freq compression (4) - 3 freq condeetion (4) - 5 freq competin (4) - 3 freq competeeshun (4) - 1 freq complementin (4) - 1 freq composeetions (4) - 1 freq peteetion (4) - 3 freq |
competeition (0) - 8 freq competeetion (1) - 13 freq competition (1) - 63 freq compitition (2) - 1 freq competeitions (2) - 3 freq competeetions (3) - 4 freq competitions (3) - 7 freq composeition (3) - 2 freq completion (4) - 4 freq competitor (4) - 1 freq composition (4) - 3 freq competitive (4) - 9 freq competeition's (4) - 1 freq compeetin (4) - 1 freq repeteition (5) - 1 freq composietion (5) - 1 freq compilation (5) - 3 freq peteition (5) - 1 freq competit (5) - 1 freq competin (5) - 3 freq competeen (5) - 1 freq compensation (5) - 10 freq complection (5) - 1 freq competent (6) - 3 freq complexion (6) - 4 freq |
SoundEx code - C513 cambodia's - 1 freq campit - 2 freq champit - 11 freq confetti - 5 freq computer - 109 freq comfits - 6 freq confident - 45 freq competitive - 9 freq confidence - 114 freq compete - 11 freq camped - 5 freq competeition - 8 freq confidit - 1 freq combatants - 1 freq competeeshun - 1 freq computers - 26 freq convoyt - 1 freq competeetions - 4 freq combat - 5 freq competition - 63 freq confided - 3 freq compiete - 1 freq confide - 4 freq conveyed - 2 freq convoyit - 1 freq compute - 2 freq competin - 3 freq confidintly - 1 freq competent - 3 freq competence - 5 freq can-but - 4 freq confidently - 10 freq computit - 2 freq confederations - 2 freq competitions - 7 freq computin - 3 freq combed - 3 freq champed - 2 freq campt - 2 freq computer's - 1 freq competeetion - 13 freq competes - 1 freq compt - 1 freq confidenss - 1 freq confoodan - 1 freq confidence' - 2 freq compadres - 1 freq confederation - 1 freq compatriots - 3 freq canopied - 1 freq confederacy - 2 freq confideracy - 1 freq computer-generatit - 2 freq compeetitors - 1 freq compuiters - 2 freq compatible - 2 freq competeeshin - 5 freq confeedent - 2 freq competitors - 4 freq compeetin - 1 freq competeeshins - 1 freq competitor - 1 freq competeition's - 1 freq competeitions - 3 freq caimbed - 3 freq convoyed - 2 freq computeir - 4 freq compuiteir - 1 freq confettae - 1 freq confidential - 1 freq confuddlin - 1 freq competeen - 1 freq competan - 2 freq competitiveness - 1 freq champit' - 1 freq confidante - 1 freq competit - 1 freq confidences - 1 freq compatriot - 2 freq confidentially - 1 freq €œconfidence - 1 freq computatiouns - 1 freq competing - 2 freq compitition - 1 freq cmbpdufuwc - 1 freq competently - 1 freq combatcoach - 1 freq |
MetaPhone code - KMPTXN competeition - 8 freq competeeshun - 1 freq competition - 63 freq competeetion - 13 freq competeeshin - 5 freq compitition - 1 freq |
COMPETEITION |
| Time to execute Levenshtein function - 0.292645 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.541577 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.059380 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.037743 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.000924 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. |