| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| confident (0) - 45 freq considert (2) - 8 freq confeedent (2) - 2 freq confided (2) - 3 freq confidante (2) - 1 freq unconfident (2) - 1 freq confidenss (2) - 1 freq confide (2) - 4 freq confidence (2) - 114 freq continent (2) - 19 freq confidently (2) - 10 freq confidit (2) - 1 freq eensident (3) - 1 freq confidintly (3) - 1 freq ensident (3) - 1 freq consider (3) - 92 freq considers (3) - 7 freq confirmt (3) - 6 freq confidences (3) - 1 freq confidence' (3) - 2 freq incident (3) - 31 freq conseidert (3) - 2 freq content (3) - 119 freq confront (3) - 8 freq confines (3) - 2 freq |
confident (0) - 45 freq confidante (2) - 1 freq confeedent (2) - 2 freq confidence (3) - 114 freq confidently (3) - 10 freq confidit (3) - 1 freq unconfident (3) - 1 freq confidintly (4) - 1 freq confidenss (4) - 1 freq considert (4) - 8 freq confidential (4) - 1 freq confront (4) - 8 freq confide (4) - 4 freq continent (4) - 19 freq confided (4) - 3 freq confoodan (5) - 1 freq confinin (5) - 1 freq contint (5) - 1 freq confinement (5) - 3 freq considine (5) - 6 freq consent (5) - 11 freq convent (5) - 3 freq confirmit (5) - 1 freq considerit (5) - 5 freq confined (5) - 9 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 - KNFTNT confident - 45 freq confeedent - 2 freq confidante - 1 freq |
CONFIDENT |
| Time to execute Levenshtein function - 0.216376 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.376168 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.027985 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.038545 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.000945 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. |