Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
kalonji (0) - 1 freq kali (3) - 1 freq alone- (3) - 1 freq taloned (3) - 1 freq alon (3) - 2 freq alone (3) - 72 freq mcdonji (3) - 1 freq along (3) - 170 freq alone' (3) - 1 freq malone (3) - 4 freq balgoni (3) - 1 freq kanani (3) - 1 freq talons (3) - 5 freq salon (3) - 10 freq alonn (3) - 1 freq kalvin (4) - 1 freq aaron (4) - 5 freq klines (4) - 1 freq khloe (4) - 1 freq baloons (4) - 1 freq malunch (4) - 1 freq kallax (4) - 1 freq alana (4) - 12 freq anon (4) - 6 freq jason (4) - 24 freq |
kalonji (0) - 1 freq knj (5) - 1 freq lnj (5) - 2 freq klan (5) - 1 freq klines (5) - 1 freq kali (5) - 1 freq kline (5) - 1 freq klyned (5) - 1 freq koloniya (5) - 1 freq kiln (5) - 7 freq klintie (5) - 1 freq kelng (5) - 1 freq alonn (5) - 1 freq kilns (5) - 1 freq salon (5) - 10 freq along (5) - 170 freq alon (5) - 2 freq taloned (5) - 1 freq alone- (5) - 1 freq alone' (5) - 1 freq alone (5) - 72 freq malone (5) - 4 freq talons (5) - 5 freq kanani (5) - 1 freq nylon (6) - 4 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 - KLNJ kalonji - 1 freq |
KALONJI |
Time to execute Levenshtein function - 0.200796 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.394210 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.031833 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.046123 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.004367 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. |