| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| chisellin (0) - 1 freq hirsellin (2) - 1 freq chiselled (2) - 2 freq chillin (2) - 6 freq shivellin (2) - 1 freq shiffllin (3) - 1 freq chirlin (3) - 1 freq shovellin (3) - 2 freq whistlin (3) - 22 freq chisel (3) - 10 freq chisels (3) - 1 freq chinklin (3) - 1 freq cheetlin (3) - 1 freq snivellin (3) - 1 freq hirselin (3) - 1 freq chilli (3) - 12 freq hisell (3) - 2 freq achillin (3) - 1 freq ransellin (3) - 1 freq chesell (3) - 1 freq raivellin (3) - 1 freq compellin (3) - 5 freq shillin (3) - 29 freq cancellin (3) - 1 freq hansellin (3) - 3 freq |
chisellin (0) - 1 freq chiselled (3) - 2 freq chillin (3) - 6 freq chesell (4) - 1 freq counsellin (4) - 2 freq hirsellin (4) - 1 freq achillin (4) - 1 freq coonsellin (4) - 1 freq shivellin (4) - 1 freq cancellin (5) - 1 freq shillin (5) - 29 freq compellin (5) - 5 freq tinsellin (5) - 1 freq channellin (5) - 2 freq shellin (5) - 3 freq ransellin (5) - 1 freq sellin (5) - 70 freq resellin (5) - 1 freq hansellin (5) - 3 freq chisel (5) - 10 freq chisels (5) - 1 freq whistlin (5) - 22 freq shovellin (5) - 2 freq hisell (5) - 2 freq chinklin (5) - 1 freq |
SoundEx code - C245 cacklin - 2 freq cooglin - 1 freq chuckling - 1 freq cushle-mushle - 1 freq chucklin - 3 freq chucklan - 1 freq coaglin - 1 freq cajoling - 1 freq cacklan - 1 freq cashline - 1 freq cyclin - 4 freq cackle-handit - 1 freq cochalene - 1 freq cuchulainn's - 1 freq cochlin - 1 freq cuchullin - 3 freq chisolm - 1 freq couslem - 1 freq caiklin - 1 freq chisholm - 11 freq cackling - 2 freq chisholme - 3 freq casualness - 1 freq chisellin - 1 freq cyclemorgan - 1 freq cycling - 5 freq chisholmiain - 8 freq chocolonely - 1 freq cyclonic - 1 freq cyclingdumfries - 1 freq cislondon - 1 freq |
MetaPhone code - XSLN chisellin - 1 freq |
CHISELLIN |
| Time to execute Levenshtein function - 0.214754 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.393407 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.027905 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.038527 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. |