| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| knoat (0) - 3 freq noat (1) - 6 freq knott (1) - 6 freq knoax (1) - 1 freq knoab (1) - 1 freq knot (1) - 27 freq oat (2) - 12 freq 'nowt (2) - 2 freq kat (2) - 156 freq knoll (2) - 2 freq nooat (2) - 1 freq knap (2) - 9 freq soat (2) - 1 freq knaw (2) - 16 freq knowan (2) - 2 freq anoot (2) - 1 freq knock (2) - 111 freq knelt (2) - 21 freq kaat (2) - 1 freq snout (2) - 14 freq 'not (2) - 8 freq kroft (2) - 1 freq nott (2) - 55 freq nout (2) - 2 freq knit (2) - 17 freq |
knoat (0) - 3 freq knot (1) - 27 freq knoab (2) - 1 freq knit (2) - 17 freq knoax (2) - 1 freq noat (2) - 6 freq knott (2) - 6 freq kott (3) - 1 freq not (3) - 712 freq knos (3) - 1 freq knox (3) - 34 freq knowte (3) - 1 freq anat (3) - 1 freq kent (3) - 1809 freq knots (3) - 12 freq kaint (3) - 4 freq knob (3) - 12 freq nat (3) - 21 freq knowe (3) - 56 freq kno (3) - 16 freq kint (3) - 57 freq snot (3) - 1 freq know (3) - 1123 freq snat (3) - 1 freq knaa (3) - 1 freq |
SoundEx code - K530 kind - 686 freq kent - 1809 freq knot - 27 freq knoweth - 1 freq kindae - 23 freq knoat - 3 freq kynd - 24 freq kennt - 151 freq kinda - 160 freq kenned - 33 freq kint - 57 freq kant - 4 freq kenneth - 16 freq knowehead - 1 freq knowed - 64 freq kin't - 2 freq 'kind' - 1 freq knit - 17 freq ken't - 19 freq kaimed - 3 freq kennawhat - 1 freq kinnd - 2 freq kindo - 32 freq 'kent - 1 freq koomed - 1 freq keind - 1 freq k'nit - 2 freq kynda - 3 freq kneed - 2 freq kennedy - 23 freq knowte - 1 freq kennet - 1 freq kamed - 1 freq kanada - 1 freq kindawye - 1 freq kennedie - 1 freq knott - 6 freq kandy - 1 freq kaint - 4 freq kindey - 1 freq kindy - 1 freq kenn'd - 1 freq 'kind - 1 freq kaimt - 1 freq keynote - 1 freq kinda - 1 freq kennit - 1 freq knawed - 1 freq kent - 1 freq kind - 1 freq kenwood - 1 freq kendo - 2 freq 'kent' - 1 freq |
MetaPhone code - NT nut - 127 freq nod - 107 freq need - 1780 freq knot - 27 freq not - 712 freq neat - 42 freq wynd - 14 freq nutt - 2 freq nott - 55 freq note - 238 freq nd - 88 freq nowt - 116 freq knoat - 3 freq net - 87 freq needy - 7 freq 'ned' - 1 freq 'not - 8 freq 'need - 2 freq ned - 42 freq nate - 9 freq nouat - 1 freq 'nowt - 2 freq needae - 1 freq notie - 8 freq nout - 2 freq neid - 1 freq noat - 6 freq knit - 17 freq gna'd - 1 freq noad - 11 freq nutty - 6 freq natty - 2 freq nato - 5 freq -nut - 1 freq now-at - 1 freq nite - 87 freq naet - 3 freq neddie - 1 freq neddy - 1 freq nit - 10 freq nudie - 2 freq ïntae - 93 freq neyt - 3 freq needie - 3 freq nat - 21 freq yyned - 2 freq nied - 3 freq nd - 1 freq notae - 1 freq 'ned - 1 freq 'nd' - 2 freq 'need' - 1 freq nooat - 1 freq nt - 2 freq nd - 1 freq nt - 34 freq n't - 2 freq kneed - 2 freq nuid - 1 freq knowte - 1 freq net - 1 freq nuit' - 1 freq nait - 1 freq not - 8 freq 'nut' - 1 freq knott - 6 freq nede - 3 freq hynd - 1 freq nude - 4 freq not - 3 freq nuyt - 1 freq hnd - 3 freq netta - 6 freq need - 2 freq nato- - 1 freq noida - 1 freq node - 4 freq needa - 1 freq nitty - 1 freq gnd - 1 freq nyte - 1 freq not - 1 freq nou oot - 1 freq newt - 1 freq nowt' - 5 freq pnd - 1 freq hnuty - 1 freq netty - 1 freq nud - 1 freq hnid - 1 freq noddy - 1 freq |
KNOAT |
| Time to execute Levenshtein function - 0.361398 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.588708 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.033387 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.066074 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.000831 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. |