| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kirnel (0) - 5 freq kernel (1) - 1 freq kirned (1) - 3 freq girnel (1) - 2 freq kirn (2) - 33 freq kriel (2) - 1 freq kirnin (2) - 5 freq girnal (2) - 5 freq kinnelt (2) - 3 freq kirnells (2) - 1 freq girned (2) - 33 freq kirnit (2) - 1 freq kirsen (2) - 2 freq kinely (2) - 4 freq kirnt (2) - 2 freq kirlea (2) - 1 freq kine (2) - 101 freq lionel (2) - 2 freq birned (2) - 1 freq curnel (2) - 1 freq irsel (2) - 2 freq kidney (2) - 10 freq kirns (2) - 2 freq girner (2) - 1 freq kines (2) - 21 freq |
kirnel (0) - 5 freq kernel (1) - 1 freq girnel (2) - 2 freq kirned (2) - 3 freq kirnt (3) - 2 freq kinely (3) - 4 freq kirlea (3) - 1 freq kirns (3) - 2 freq kirnit (3) - 1 freq curnel (3) - 1 freq kennel (3) - 11 freq kirnin (3) - 5 freq girnal (3) - 5 freq kirn (3) - 33 freq kriel (3) - 1 freq diurnal (4) - 1 freq kirtle (4) - 2 freq karine (4) - 2 freq jurnal (4) - 1 freq kerfl (4) - 1 freq karn (4) - 7 freq kinelie (4) - 1 freq kunal (4) - 11 freq krone (4) - 2 freq vernal (4) - 3 freq |
SoundEx code - K654 kirnells - 1 freq kernel - 1 freq kirnel - 5 freq |
MetaPhone code - KRNL curnel - 1 freq granniel - 2 freq kernel - 1 freq cornelia - 1 freq 'granniel' - 1 freq kirnel - 5 freq cornell - 1 freq groinal - 1 freq granola - 1 freq currenly - 1 freq crynl - 1 freq gornall - 1 freq greenlaw - 8 freq |
KIRNEL |
| Time to execute Levenshtein function - 0.185766 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.356626 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.026773 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.038513 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.000772 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. |