Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
kercle (0) - 3 freq cercle (1) - 3 freq keele (2) - 1 freq cercled (2) - 1 freq kerrie (2) - 1 freq merble (2) - 2 freq kele (2) - 1 freq kerfl (2) - 1 freq kertie (2) - 2 freq perce (2) - 1 freq kirtle (2) - 2 freq mercie (2) - 22 freq circle (2) - 83 freq erle (2) - 4 freq kettle (2) - 82 freq kennle (2) - 2 freq kerl (2) - 1 freq keckle (2) - 8 freq kerve (2) - 5 freq merle (2) - 4 freq merlle (2) - 1 freq hercule (2) - 1 freq perch (3) - 13 freq hercus (3) - 1 freq female (3) - 74 freq |
kercle (0) - 3 freq cercle (2) - 3 freq hercule (3) - 1 freq kerl (3) - 1 freq kerfl (3) - 1 freq circle (3) - 83 freq kirtle (3) - 2 freq meeracle (4) - 5 freq reclee (4) - 1 freq miracle (4) - 43 freq karl (4) - 6 freq karla (4) - 1 freq oracle (4) - 5 freq kernel (4) - 1 freq recl (4) - 1 freq raucle (4) - 5 freq faercly (4) - 1 freq recile (4) - 1 freq treacle (4) - 24 freq treecle (4) - 1 freq coracle (4) - 1 freq kirlea (4) - 1 freq kertie (4) - 2 freq merlle (4) - 1 freq mercie (4) - 22 freq |
SoundEx code - K624 kirkcaldy - 23 freq kirkwall - 15 freq kirklandneuk - 4 freq kirkill - 1 freq keerious-like - 2 freq keeriouslike - 1 freq kirklandis - 1 freq kirklands - 3 freq kirkaldy - 2 freq kiraagold - 1 freq kirkhillps - 1 freq kercle - 3 freq krislouclubb - 1 freq kirkwallwalking - 1 freq |
MetaPhone code - KRKL crackle - 9 freq coracle - 1 freq kirkill - 1 freq gurgle - 2 freq correcklie - 1 freq crackly - 3 freq gargle - 3 freq cargull - 1 freq kercle - 3 freq |
KERCLE |
Time to execute Levenshtein function - 0.282151 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.570720 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.027296 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.075857 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.001048 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. |