| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kellheid (0) - 1 freq kell-heid (1) - 1 freq hillheid (2) - 2 freq hullheid (2) - 1 freq feelheid (2) - 1 freq kell-heids (2) - 3 freq skellied (3) - 2 freq jellied (3) - 1 freq kale-heid (3) - 1 freq bellend (3) - 7 freq bellied (3) - 3 freq ellecid (3) - 1 freq kellie (3) - 1 freq metalheid (3) - 3 freq aerheid (3) - 1 freq keller (3) - 1 freq killed (3) - 81 freq delled (3) - 2 freq eggheid (3) - 1 freq likeliheid (3) - 3 freq willreid (3) - 13 freq bellae'd (3) - 1 freq hillhead (3) - 2 freq felled (3) - 9 freq selled (3) - 1 freq |
kellheid (0) - 1 freq kell-heid (2) - 1 freq hullheid (3) - 1 freq hillheid (3) - 2 freq hillhead (4) - 2 freq killed (4) - 81 freq kale-heid (4) - 1 freq keilled (4) - 2 freq kelloside (4) - 1 freq kelliher (4) - 1 freq feelheid (4) - 1 freq kell-heids (4) - 3 freq selled (5) - 1 freq felled (5) - 9 freq gelled (5) - 1 freq bellae'd (5) - 1 freq keeched (5) - 4 freq melled (5) - 34 freq keeled (5) - 5 freq telled (5) - 2 freq ketched (5) - 1 freq yelled (5) - 20 freq ellecid (5) - 1 freq kellie (5) - 1 freq bellied (5) - 3 freq |
SoundEx code - K430 killt - 73 freq killed - 81 freq keelt - 2 freq kilt - 67 freq kilda - 3 freq killit - 6 freq keelit - 1 freq keeled - 5 freq kiltie - 5 freq kïllt - 9 freq kläti - 1 freq klüti - 1 freq kelty - 37 freq 'killed - 1 freq kill't - 6 freq kildie - 5 freq killt' - 1 freq killed' - 1 freq kaald - 4 freq kloodie - 1 freq klett - 1 freq kellheid - 1 freq kaylied - 1 freq kale-heid - 1 freq kell-heid - 1 freq keilled - 2 freq kilt' - 1 freq 'kiltie - 1 freq killieawtheway - 1 freq 'kelt' - 1 freq keltie - 1 freq |
MetaPhone code - KLHT kellheid - 1 freq kale-heid - 1 freq galahad - 1 freq kell-heid - 1 freq |
KELLHEID |
| Time to execute Levenshtein function - 0.204344 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.393521 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.027676 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.037737 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.000825 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. |