| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kelvin (0) - 8 freq kevin (1) - 45 freq melvin (1) - 3 freq kervin (1) - 4 freq delvin (1) - 3 freq kalvin (1) - 1 freq keckin (2) - 1 freq leavin (2) - 178 freq levin (2) - 1 freq delvit (2) - 1 freq weldin (2) - 1 freq meltin (2) - 24 freq kullin (2) - 1 freq ievin (2) - 1 freq keppin (2) - 10 freq kevil (2) - 1 freq revvin (2) - 1 freq kelman (2) - 6 freq elivin (2) - 1 freq seivin (2) - 4 freq kelsi (2) - 3 freq reevin (2) - 3 freq bellin (2) - 3 freq killin (2) - 61 freq elfin (2) - 5 freq |
kelvin (0) - 8 freq kalvin (1) - 1 freq melvin (2) - 3 freq delvin (2) - 3 freq kevin (2) - 45 freq kervin (2) - 4 freq calvin (3) - 8 freq colvin (3) - 1 freq elven (3) - 1 freq keelyvine (3) - 3 freq solvin (3) - 2 freq klein (3) - 5 freq kerven (3) - 1 freq relivin (3) - 1 freq killin (3) - 61 freq keelin (3) - 1 freq selvyn (3) - 1 freq leevin (3) - 194 freq leivin (3) - 57 freq kelman (3) - 6 freq kullin (3) - 1 freq keelivine (3) - 2 freq elivin (3) - 1 freq levin (3) - 1 freq leavin (3) - 178 freq |
SoundEx code - K415 keelivine - 2 freq kelvingrove - 5 freq kelvin - 8 freq kelvinbridge - 1 freq kelvinhaw - 1 freq klappin - 1 freq kelvinside - 3 freq keelyvine - 3 freq kelvinhaugh - 1 freq kalvin - 1 freq |
MetaPhone code - KLFN cloven - 5 freq calvin - 8 freq keelivine - 2 freq coolfin - 1 freq calfan - 1 freq culfin - 1 freq gleven - 1 freq kelvin - 8 freq calaphine - 2 freq keelyvine - 3 freq cleavin - 1 freq golfin - 2 freq callaghan - 6 freq colvin - 1 freq kalvin - 1 freq |
KELVIN |
| Time to execute Levenshtein function - 0.202446 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.406655 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.027450 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.036920 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.000804 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. |