| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| killings (0) - 2 freq fillings (1) - 2 freq killing (1) - 7 freq killins (1) - 1 freq jillings (1) - 10 freq pilling (2) - 1 freq shillings (2) - 4 freq kitlins (2) - 6 freq killin (2) - 61 freq tilling (2) - 1 freq kipling (2) - 3 freq siblings (2) - 6 freq fillins (2) - 2 freq filling (2) - 5 freq milling (2) - 1 freq millins (2) - 1 freq willing (2) - 10 freq willin (3) - 58 freq biggings (3) - 3 freq millies (3) - 1 freq kimmins (3) - 1 freq kollie's (3) - 1 freq willis (3) - 1 freq kennings (3) - 1 freq billies (3) - 14 freq |
killings (0) - 2 freq fillings (2) - 2 freq killins (2) - 1 freq jillings (2) - 10 freq killing (2) - 7 freq millins (4) - 1 freq milling (4) - 1 freq willing (4) - 10 freq fillins (4) - 2 freq kelloggs (4) - 1 freq killingeve (4) - 1 freq filling (4) - 5 freq kitlins (4) - 6 freq siblings (4) - 6 freq pilling (4) - 1 freq shillings (4) - 4 freq killin (4) - 61 freq tilling (4) - 1 freq kipling (4) - 3 freq dwellings (5) - 1 freq kills (5) - 19 freq selling (5) - 10 freq keings (5) - 9 freq linings (5) - 2 freq pulling (5) - 11 freq |
SoundEx code - K452 killing - 7 freq killins - 1 freq klankan - 1 freq killinchy - 3 freq killin-strang - 1 freq klyms - 1 freq kelng - 1 freq kilns - 1 freq killings - 2 freq kleenex - 3 freq klinsmann - 3 freq klinsmann's - 2 freq klinsman - 1 freq kilncadzow-kincadie - 1 freq klingons - 1 freq kalonji - 1 freq killingeve - 1 freq klines - 1 freq kilngranny - 1 freq |
MetaPhone code - KLNKS clings - 9 freq clinics - 1 freq killings - 2 freq kleenex - 3 freq callinicos - 1 freq |
KILLINGS |
| Time to execute Levenshtein function - 0.440809 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.579600 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.070165 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.038347 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.000823 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. |