Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
cheerleaders (0) - 1 freq cheerleads (2) - 1 freq hielenders (4) - 1 freq cheerieness (4) - 1 freq ceelinders (4) - 1 freq capecrusaders (5) - 1 freq cleaners (5) - 8 freq cheereeoo (5) - 1 freq charlene's (5) - 67 freq challengers (5) - 1 freq cheetled (5) - 2 freq wheelers (5) - 1 freq leaders (5) - 30 freq readers (5) - 87 freq shetlanders (5) - 10 freq hielanders (5) - 7 freq pipecleaners (5) - 2 freq heilanders (5) - 2 freq cheepers (5) - 1 freq cheered (5) - 27 freq ringleaders (5) - 2 freq cheeriness (5) - 1 freq chevaliers (5) - 1 freq chairecters (5) - 1 freq cheesers (5) - 2 freq |
cheerleaders (0) - 1 freq cheerleads (3) - 1 freq charlene's (7) - 67 freq cherlie's (7) - 6 freq herders (7) - 1 freq chairecters (7) - 1 freq chevaliers (7) - 1 freq hielenders (7) - 1 freq cheerieness (7) - 1 freq ceelinders (7) - 1 freq charlatans (8) - 1 freq beholders (8) - 2 freq shoulders (8) - 24 freq charlie's (8) - 9 freq shaalders (8) - 1 freq chairles (8) - 16 freq chairles's (8) - 1 freq cruisaders (8) - 1 freq o'freeloaders (8) - 1 freq childer's (8) - 1 freq shalders (8) - 6 freq charles (8) - 51 freq chocolatiers (8) - 1 freq charles's (8) - 1 freq shoolders (8) - 6 freq |
SoundEx code - C643 cruelty - 14 freq curlt - 7 freq crawlt - 3 freq curled - 43 freq crawled - 26 freq cheerleads - 1 freq crueltt - 1 freq crowlt - 1 freq craalt - 3 freq crawl't - 1 freq carlton's - 1 freq charlotte - 9 freq craaled - 8 freq curlit - 1 freq carolled - 1 freq curlie-dodie - 1 freq cheerleaders - 1 freq crowled - 2 freq charltons - 4 freq craw-leid - 1 freq corralled - 2 freq curl-doddie - 1 freq charlatan - 3 freq curly-heidit - 1 freq cruelties - 1 freq charlatans - 1 freq carltonkirby - 2 freq charlottegshore - 1 freq charlton - 2 freq carleton - 1 freq curlytalebooks - 11 freq correlation - 1 freq charltonleonies - 1 freq |
MetaPhone code - XRLTRS cheerleaders - 1 freq |
CHEERLEADERS |
Time to execute Levenshtein function - 0.354339 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.545443 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.040327 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.054394 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.001177 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. |