| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uckin (0) - 1 freq duckin (1) - 3 freq suckin (1) - 6 freq unkin (1) - 4 freq cuckin (1) - 1 freq fuckin (1) - 1032 freq ackin (1) - 5 freq muckin (1) - 5 freq tuckin (1) - 9 freq luckin (1) - 16 freq buckin (1) - 3 freq puckin (1) - 10 freq askin (2) - 183 freq unkind (2) - 2 freq ucia (2) - 1 freq bokin (2) - 5 freq lukin (2) - 52 freq awkin (2) - 2 freq ectin (2) - 1 freq dunkin (2) - 2 freq 'fuckin (2) - 29 freq unken (2) - 4 freq tokin (2) - 4 freq geckin (2) - 3 freq duckit (2) - 1 freq |
uckin (0) - 1 freq ackin (1) - 5 freq tuckin (2) - 9 freq buckin (2) - 3 freq puckin (2) - 10 freq cuikin (2) - 7 freq muckin (2) - 5 freq luckin (2) - 16 freq suckin (2) - 6 freq fuckin (2) - 1032 freq duckin (2) - 3 freq unkin (2) - 4 freq cuckin (2) - 1 freq ecrin (3) - 1 freq hackin (3) - 7 freq backin (3) - 41 freq ackir (3) - 1 freq luckan (3) - 3 freq cockin (3) - 8 freq jokin (3) - 46 freq cackin (3) - 1 freq fykin (3) - 2 freq luikin (3) - 201 freq ookin (3) - 1 freq cin (3) - 306 freq |
SoundEx code - U250 usin - 97 freq ugsome - 65 freq uggin - 3 freq uisin - 105 freq uggsome - 7 freq uckin - 1 freq uissin - 1 freq uisein - 9 freq usin' - 1 freq usan - 4 freq uissan - 3 freq uscn - 61 freq uisin' - 1 freq -ukin - 1 freq uizin - 12 freq ugsumm - 1 freq ugsum - 2 freq usain - 1 freq uszxn - 1 freq uwxjm - 1 freq uzn - 1 freq |
MetaPhone code - UKN uggin - 3 freq uckin - 1 freq -ukin - 1 freq |
UCKIN |
| Time to execute Levenshtein function - 0.307170 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.380651 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.027802 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.037988 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.000913 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. |