Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
kirkbean (0) - 2 freq kirkman (2) - 1 freq kirkmen (2) - 2 freq kickan (3) - 2 freq mirabeau (3) - 1 freq mirkneen (3) - 1 freq kirk-brae (3) - 1 freq wirkmaan (3) - 1 freq wirkan (3) - 12 freq pirndean (3) - 2 freq kirsen (3) - 2 freq mirken (3) - 1 freq wirkmen (3) - 1 freq kickoan (3) - 1 freq mirknen (3) - 11 freq kirkton (3) - 5 freq kirlea (3) - 1 freq korean (3) - 8 freq mirkenan (3) - 1 freq kirkyerd (3) - 2 freq kirkness (3) - 1 freq kirsteen (3) - 1 freq kirsten (3) - 4 freq kirktoun (3) - 1 freq sikken (4) - 11 freq |
kirkbean (0) - 2 freq kirkman (3) - 1 freq kirkmen (3) - 2 freq kirkton (4) - 5 freq kirktoun (4) - 1 freq korean (5) - 8 freq mirknen (5) - 11 freq kickoan (5) - 1 freq kirsteen (5) - 1 freq wirkmen (5) - 1 freq kirkyerd (5) - 2 freq mirkenan (5) - 1 freq kirsten (5) - 4 freq kirk-brae (5) - 1 freq mirkneen (5) - 1 freq mirken (5) - 1 freq wirkan (5) - 12 freq wirkmaan (5) - 1 freq kirsen (5) - 2 freq kickan (5) - 2 freq kinkin (6) - 3 freq harkan (6) - 2 freq yirkin (6) - 1 freq ribben (6) - 1 freq rubban (6) - 3 freq |
SoundEx code - K621 kirkbean - 2 freq khruschev - 1 freq krassivy - 1 freq kirkfieldbank - 1 freq kirk-brae - 1 freq kirkpatrick - 6 freq kircubbin - 1 freq kirk-fowk - 1 freq kershopefit - 1 freq krazibaker - 1 freq krispies - 1 freq krzwyf - 1 freq krisboydssmile - 1 freq krispy - 4 freq |
MetaPhone code - KRKBN kirkbean - 2 freq kircubbin - 1 freq |
KIRKBEAN |
Time to execute Levenshtein function - 0.211287 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.397122 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.028828 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.039939 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.000926 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. |