Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
kneel (0) - 15 freq kweel (1) - 1 freq knees (1) - 166 freq kneeld (1) - 1 freq knee (1) - 122 freq kneels (1) - 1 freq kneed (1) - 2 freq keel (1) - 9 freq knell (1) - 5 freq knee' (1) - 1 freq kneelt (1) - 3 freq neem (2) - 22 freq peel (2) - 40 freq incel (2) - 1 freq speel (2) - 18 freq kweek (2) - 2 freq skweel (2) - 86 freq sneef (2) - 1 freq snell (2) - 75 freq keen (2) - 196 freq aweel (2) - 4 freq kennel (2) - 11 freq weeel (2) - 3 freq 'weel (2) - 224 freq eel (2) - 24 freq |
kneel (0) - 15 freq keel (2) - 9 freq knee' (2) - 1 freq kneelt (2) - 3 freq kneed (2) - 2 freq knell (2) - 5 freq kneels (2) - 1 freq kweel (2) - 1 freq knees (2) - 166 freq kneeld (2) - 1 freq knee (2) - 122 freq kinely (3) - 4 freq kell (3) - 1 freq knoll (3) - 2 freq kneis (3) - 1 freq nael (3) - 1 freq noel (3) - 1 freq keele (3) - 1 freq keil (3) - 2 freq kneelin (3) - 19 freq keenly (3) - 8 freq keneen (3) - 2 freq knew (3) - 209 freq neal (3) - 1 freq knelt (3) - 21 freq |
SoundEx code - K540 keenly - 8 freq kneel - 15 freq kennel - 11 freq kennle - 2 freq knoll - 2 freq knell - 5 freq kinelie - 1 freq kinely - 4 freq kïnnle - 1 freq ken'll - 1 freq kummil - 1 freq kynlie - 3 freq kinnle - 3 freq kamile - 37 freq €œkamile - 2 freq kamil - 1 freq kunal - 11 freq |
MetaPhone code - NL neill - 17 freq nile - 13 freq kneel - 15 freq newly - 27 freq nil - 7 freq nalll - 1 freq nail - 43 freq niall - 5 freq nial - 2 freq nell - 13 freq knoll - 2 freq nellie - 42 freq nelly - 8 freq knell - 5 freq neil - 84 freq nilly - 1 freq neilly - 12 freq nila - 1 freq nol - 1 freq nael - 1 freq neal - 1 freq noel - 1 freq newlie - 1 freq nellie- - 1 freq €™nal - 1 freq €™neill - 1 freq nal - 1 freq nnywlo - 1 freq n'all - 2 freq nueuul - 1 freq nl - 6 freq wnl - 1 freq nle - 1 freq neale - 1 freq nll - 1 freq null - 2 freq |
KNEEL |
Time to execute Levenshtein function - 0.180460 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.346112 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.027489 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.038476 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.000946 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. |