| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kennyfarq (0) - 14 freq kennymacd (3) - 3 freq kenny (4) - 46 freq jennymarra (4) - 3 freq kenny's (4) - 1 freq fernyear (4) - 5 freq kennlers (4) - 1 freq kinnefa (4) - 1 freq kenny' (4) - 1 freq jennifer (4) - 14 freq kennae (4) - 1 freq fernyears (4) - 10 freq knoydart (4) - 1 freq kenmark (4) - 1 freq kenya (4) - 6 freq kennef (4) - 1 freq kerryfail (4) - 1 freq kenna (4) - 11 freq pennywurt (4) - 1 freq ennywurt (4) - 1 freq penny-a (4) - 1 freq kennysc (4) - 38 freq kennan (4) - 14 freq fernyear- (4) - 1 freq jenna (5) - 5 freq |
kennyfarq (0) - 14 freq kennef (6) - 1 freq jennifer (6) - 14 freq kennlers (6) - 1 freq kinnefa (6) - 1 freq kennymacd (6) - 3 freq ennywurt (7) - 1 freq pennywurt (7) - 1 freq kenna (7) - 11 freq kennan (7) - 14 freq kinnaird (7) - 1 freq kinneff (7) - 1 freq kennacraig (7) - 1 freq kinnlers (7) - 2 freq kinnoir (7) - 3 freq kennysc (7) - 38 freq kenny' (7) - 1 freq kennae (7) - 1 freq kenny's (7) - 1 freq jennymarra (7) - 3 freq kenny (7) - 46 freq kenmark (7) - 1 freq knoydart (7) - 1 freq kenned (8) - 33 freq kennet (8) - 1 freq |
SoundEx code - K516 knee-breeks - 1 freq kempers - 2 freq kinpurney - 6 freq knee-breiks - 1 freq €˜kimberley - 1 freq knapper - 2 freq komfirtablee - 1 freq kennyfarq - 14 freq kennyaberdeen - 1 freq |
MetaPhone code - KNFRK kennyfarq - 14 freq |
KENNYFARQ |
| Time to execute Levenshtein function - 0.298227 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.500348 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.030714 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.037697 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.000873 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. |