| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pinkerton (0) - 4 freq tinkerman (3) - 1 freq tinkerin (3) - 1 freq finneston (3) - 1 freq ingerson (3) - 1 freq gilmerton (3) - 1 freq pinsion (4) - 1 freq pirket (4) - 1 freq pinntin (4) - 2 freq interpol (4) - 1 freq winterin (4) - 1 freq hinnerin (4) - 2 freq anderston (4) - 1 freq undertone (4) - 1 freq pincer (4) - 1 freq insertit (4) - 2 freq inkervit (4) - 1 freq minker (4) - 2 freq pinten (4) - 1 freq hankert (4) - 1 freq sinnert (4) - 1 freq sinnerin (4) - 2 freq laneroon (4) - 1 freq pinnet (4) - 1 freq hinnersin (4) - 4 freq |
pinkerton (0) - 4 freq tinkerin (5) - 1 freq tinkerman (5) - 1 freq pinkman (6) - 1 freq inheritin (6) - 2 freq hunkerin (6) - 10 freq kertan (6) - 1 freq ponderin (6) - 3 freq unnertone (6) - 2 freq penetratin (6) - 1 freq convertin (6) - 2 freq ginneration (6) - 9 freq puckert (6) - 2 freq pokert (6) - 1 freq norton (6) - 3 freq hunkert (6) - 20 freq pandert (6) - 1 freq porton (6) - 1 freq hankerin (6) - 3 freq gineration (6) - 1 freq pinklin (6) - 2 freq parton (6) - 4 freq panettone (6) - 2 freq pintin (6) - 17 freq pioneerin (6) - 1 freq |
SoundEx code - P526 pincers' - 1 freq pincher - 2 freq pomegranate - 7 freq pomegranates - 2 freq pinchers - 2 freq panegyric - 1 freq pan-scrubbers - 1 freq poohanweegrumphie's - 1 freq pankhurst - 2 freq pinkerton - 4 freq panser - 26 freq pansers - 2 freq panzer - 1 freq punishers - 1 freq pincer - 1 freq pmjrk - 1 freq pancreaticcanuk - 1 freq |
MetaPhone code - PNKRTN pinkerton - 4 freq |
PINKERTON |
| Time to execute Levenshtein function - 0.285824 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.552438 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.061741 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.037187 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.000843 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. |