| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| choochert (0) - 1 freq choocher (1) - 1 freq shoothert (2) - 1 freq poocher (3) - 2 freq smoocher (3) - 3 freq moocher (3) - 2 freq poothert (3) - 1 freq shooert (3) - 2 freq chocht (3) - 1 freq crochet (3) - 6 freq hoochter (3) - 1 freq concert (3) - 44 freq choosers (3) - 2 freq snochert (3) - 1 freq coontert (3) - 1 freq hooched (3) - 3 freq chincher (3) - 4 freq shooched (3) - 1 freq shoother (3) - 43 freq crooched (3) - 1 freq shoodert (3) - 1 freq hooches (3) - 1 freq chooch (3) - 1 freq hoocht (3) - 3 freq voocher (3) - 1 freq |
choochert (0) - 1 freq choocher (2) - 1 freq chocht (4) - 1 freq shoothert (4) - 1 freq concert (5) - 44 freq crochet (5) - 6 freq hoocht (5) - 3 freq chooch (5) - 1 freq snochert (5) - 1 freq chincher (5) - 4 freq chattert (6) - 4 freq concreit (6) - 6 freq chockit (6) - 2 freq cheuchter (6) - 1 freq chert (6) - 2 freq thocht (6) - 2668 freq torchirt (6) - 1 freq cocht (6) - 11 freq clocherin (6) - 1 freq hicher (6) - 1 freq shauchelt (6) - 3 freq chamchars (6) - 1 freq chocolat (6) - 1 freq hochlet (6) - 1 freq heicher (6) - 30 freq |
SoundEx code - C263 cigarette - 21 freq cigarettes - 9 freq cowk-wirthy - 1 freq choochert - 1 freq chequered - 1 freq checquered - 1 freq ceegarettes - 7 freq ceegarette - 1 freq ceigarettes - 1 freq |
MetaPhone code - XXRT choochert - 1 freq |
CHOOCHERT |
| Time to execute Levenshtein function - 0.194226 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.510522 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.029157 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.037635 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.000909 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. |