Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
cottars (0) - 19 freq cottar's (1) - 1 freq sottars (1) - 3 freq cottars' (1) - 3 freq cottar (1) - 28 freq coars (2) - 1 freq potters (2) - 12 freq cottared (2) - 5 freq cotter (2) - 3 freq cottaries (2) - 1 freq collars (2) - 8 freq jotters (2) - 23 freq corters (2) - 1 freq cottage (2) - 49 freq cottagers (2) - 2 freq rottans (2) - 7 freq sottar (2) - 10 freq cottert (2) - 1 freq conters (2) - 1 freq votars (2) - 4 freq coutar (2) - 1 freq coffars (2) - 1 freq otters (2) - 3 freq cotts (2) - 3 freq cottages (2) - 30 freq |
cottars (0) - 19 freq cottaries (2) - 1 freq cottar's (2) - 1 freq cottar (2) - 28 freq sottars (2) - 3 freq cottars' (2) - 3 freq cottagers (3) - 2 freq conters (3) - 1 freq corters (3) - 1 freq cotts (3) - 3 freq cottages (3) - 30 freq cotter (3) - 3 freq potters (3) - 12 freq cottared (3) - 5 freq cottert (3) - 1 freq otters (3) - 3 freq jotters (3) - 23 freq coasters (4) - 4 freq fitters (4) - 3 freq tatars (4) - 1 freq claturs (4) - 1 freq letters (4) - 142 freq scatters (4) - 2 freq cutter (4) - 5 freq patters (4) - 3 freq |
SoundEx code - C362 cattrick - 1 freq chitters - 7 freq catharsis - 1 freq cottaries - 1 freq citris - 3 freq citrus - 1 freq cedars - 1 freq cottars - 19 freq citrusy - 1 freq cottar-hooses - 1 freq catter's - 1 freq cutter's - 1 freq cheeters - 1 freq cataracts - 1 freq cataract - 5 freq cottars' - 3 freq cottar's - 1 freq cottar-hoose - 5 freq citric - 2 freq cheaters - 1 freq cathersmcg - 5 freq cheddars - 1 freq |
MetaPhone code - KTRS gutters - 10 freq guitars - 5 freq cottaries - 1 freq cottars - 19 freq guitar's - 1 freq catter's - 1 freq cutter's - 1 freq gadders - 4 freq guidèrs - 1 freq quaaters - 5 freq guit-ers - 1 freq gadderies - 2 freq guidars - 2 freq cottars' - 3 freq cottar's - 1 freq gutters' - 1 freq quaters - 1 freq guiders - 1 freq gaiters - 1 freq |
COTTARS |
Time to execute Levenshtein function - 0.215035 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.367083 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.029403 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.041527 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.000990 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. |