| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| combat (0) - 5 freq comeat (1) - 1 freq coat (2) - 159 freq coman (2) - 41 freq comet (2) - 12 freq coma (2) - 13 freq combs (2) - 6 freq corat (2) - 1 freq commit (2) - 17 freq combo (2) - 5 freq comfae (2) - 1 freq comman (2) - 4 freq cowpat (2) - 1 freq cobalt (2) - 1 freq comb (2) - 18 freq bombay (2) - 5 freq sommat (2) - 47 freq combe (2) - 1 freq cymbal (2) - 3 freq combust (2) - 4 freq commas (2) - 3 freq compact (2) - 7 freq combed (2) - 3 freq somat (2) - 1 freq comber (2) - 2 freq |
combat (0) - 5 freq comeat (2) - 1 freq combed (3) - 3 freq combo (3) - 5 freq comber (3) - 2 freq compt (3) - 1 freq commit (3) - 17 freq combs (3) - 6 freq combust (3) - 4 freq comet (3) - 12 freq cymbal (3) - 3 freq combe (3) - 1 freq comb (3) - 18 freq campt (4) - 2 freq climbit (4) - 3 freq acrobat (4) - 3 freq combine (4) - 19 freq compete (4) - 11 freq camboal (4) - 1 freq comatie (4) - 2 freq campit (4) - 2 freq climbt (4) - 1 freq comatee (4) - 104 freq camber (4) - 1 freq commute (4) - 4 freq |
SoundEx code - C513 cambodia's - 1 freq campit - 2 freq champit - 11 freq confetti - 5 freq computer - 108 freq comfits - 6 freq confident - 42 freq competitive - 9 freq confidence - 107 freq compete - 11 freq camped - 6 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 - 61 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 - KMT comet - 12 freq comatie - 2 freq comedy - 33 freq committee - 25 freq comed - 12 freq caumed - 3 freq combat - 5 freq commute - 4 freq commit - 17 freq caamed - 1 freq caam't - 1 freq kaimed - 3 freq comte - 1 freq commuity - 1 freq comatee - 104 freq combed - 3 freq commït - 2 freq commita - 1 freq gamut - 1 freq koomed - 1 freq commïttee - 1 freq cumd - 1 freq cummed - 1 freq gomed - 18 freq comedie - 3 freq kamed - 1 freq goamit - 1 freq caimbed - 3 freq comeat - 1 freq comete - 1 freq coomed - 1 freq gamed - 1 freq kaimt - 1 freq cammatee - 1 freq gmde - 1 freq |
COMBAT |
| Time to execute Levenshtein function - 0.277164 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.530448 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.039672 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.053698 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.001085 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. |