Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
knapper (0) - 2 freq napper (1) - 36 freq drapper (2) - 1 freq knappy (2) - 1 freq coapper (2) - 1 freq knappin (2) - 4 freq snappers (2) - 2 freq napier (2) - 25 freq wapper (2) - 2 freq crapper (2) - 1 freq nappers (2) - 6 freq wrapper (2) - 22 freq knapp (2) - 2 freq kipper (2) - 5 freq snapped (2) - 40 freq lapper (2) - 1 freq knapp't (2) - 1 freq chapper (2) - 2 freq nipper (2) - 1 freq flapper (2) - 5 freq papper (2) - 1 freq knacker (2) - 4 freq slapper (2) - 5 freq knappit (2) - 3 freq snappet (2) - 5 freq |
knapper (0) - 2 freq napper (2) - 36 freq kipper (3) - 5 freq nipper (3) - 1 freq knappit (3) - 3 freq knapp (3) - 2 freq knappis (3) - 1 freq knappy (3) - 1 freq knappin (3) - 4 freq rapper (4) - 4 freq snappet (4) - 5 freq slapper (4) - 5 freq knacker (4) - 4 freq dapper (4) - 4 freq napier (4) - 25 freq drapper (4) - 1 freq capper (4) - 2 freq tapper (4) - 1 freq papper (4) - 1 freq nippier (4) - 1 freq wrapper (4) - 22 freq nappers (4) - 6 freq crapper (4) - 1 freq flapper (4) - 5 freq snappers (4) - 2 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 - NPR neepur - 1 freq neiper - 6 freq napper - 36 freq naipier - 1 freq nippier - 1 freq neeper - 5 freq napier - 25 freq knapper - 2 freq nipper - 1 freq |
KNAPPER |
Time to execute Levenshtein function - 0.228168 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.389875 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.027962 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.037535 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.000848 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. |