Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
cooihzbqwn (0) - 1 freq cooshion (5) - 1 freq cooshen (5) - 1 freq cooin (5) - 6 freq cooshin (5) - 1 freq coolin (6) - 2 freq crossbow (6) - 6 freq ootben (6) - 1 freq clocherin (6) - 1 freq coolfin (6) - 1 freq coin (6) - 46 freq comin (6) - 1056 freq ccohanlon (6) - 1 freq onthebaw (6) - 1 freq cochran (6) - 1 freq clown (6) - 35 freq confabblin (6) - 2 freq pooshen (6) - 1 freq crohn (6) - 2 freq coachman (6) - 3 freq coorien (6) - 1 freq comission (6) - 1 freq coachin (6) - 1 freq cizzin (6) - 1 freq pooshan (6) - 1 freq |
cooihzbqwn (0) - 1 freq chibbin (9) - 4 freq chmbin (9) - 1 freq chozen (9) - 1 freq hzqnn (9) - 1 freq chorazin (10) - 1 freq choirbeuk (10) - 3 freq citizen (10) - 10 freq cohen (10) - 1 freq cohesion (10) - 8 freq coburn (10) - 3 freq corbyn (10) - 8 freq crown (10) - 21 freq climbin (10) - 18 freq chawin (10) - 42 freq countdown (10) - 1 freq caibin (10) - 5 freq hooseboun (10) - 1 freq cown (10) - 2 freq cribbin (10) - 1 freq cobain (10) - 1 freq climban (10) - 2 freq cockburn (10) - 9 freq colourblin (10) - 1 freq craigyburn (10) - 1 freq |
SoundEx code - C212 cacafuego - 1 freq cookbuik - 2 freq cookbook - 7 freq cookbooks - 2 freq ceukbeuk - 1 freq cashbox - 1 freq case-by-case - 1 freq cashback - 1 freq cheekybesom - 2 freq cooihzbqwn - 1 freq cuxbohjama - 1 freq chooseybeggar - 1 freq |
MetaPhone code - KSBKN cooihzbqwn - 1 freq |
COOIHZBQWN |
Time to execute Levenshtein function - 0.220828 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.378285 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.027787 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.038297 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.000997 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. |