| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pansers (0) - 2 freq panser (1) - 26 freq packers (2) - 1 freq ponders (2) - 3 freq posers (2) - 5 freq papers (2) - 137 freq pauses (2) - 11 freq pinters (2) - 1 freq dangers (2) - 11 freq panes (2) - 9 freq canters (2) - 1 freq answers (2) - 74 freq wanners (2) - 3 freq pane's (2) - 1 freq landers (2) - 10 freq punters (2) - 25 freq sassers (2) - 6 freq falsers (2) - 18 freq banners (2) - 15 freq anser (2) - 5 freq penters (2) - 2 freq planters (2) - 4 freq mangers (2) - 1 freq lancers (2) - 4 freq bankers (2) - 4 freq |
pansers (0) - 2 freq panser (2) - 26 freq awnsers (3) - 1 freq pynters (3) - 1 freq pansies (3) - 4 freq phasers (3) - 1 freq penters (3) - 2 freq punters (3) - 25 freq unnsers (3) - 1 freq ponders (3) - 3 freq pinters (3) - 1 freq posers (3) - 5 freq punders (3) - 2 freq painters (3) - 6 freq paipers (4) - 5 freq rangers (4) - 55 freq panthers (4) - 2 freq tankers (4) - 2 freq danser (4) - 1 freq panels (4) - 15 freq gangers (4) - 2 freq pander (4) - 1 freq anders (4) - 1 freq payers (4) - 4 freq paiters (4) - 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 - PNSRS pincers' - 1 freq pansers - 2 freq |
PANSERS |
| Time to execute Levenshtein function - 0.175024 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.341710 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.027948 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.037189 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.000931 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. |