| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| polypantransman (0) - 1 freq polyanthus (7) - 1 freq thepantryman (7) - 1 freq robohanrahan (8) - 1 freq panorama (8) - 1 freq julianbrans (8) - 3 freq plantan (8) - 1 freq plantation (8) - 12 freq philipbrannan (8) - 1 freq colonaisan (8) - 1 freq polarisin (8) - 1 freq polissman (8) - 2 freq poyntan (8) - 1 freq polynesia (8) - 1 freq plantains (8) - 1 freq pollisman (8) - 2 freq ryanflanagan (8) - 36 freq doricbananaman (8) - 1 freq lantrens (8) - 2 freq non-partisan (8) - 2 freq polisman (8) - 22 freq plannan (8) - 2 freq onhandhandyman (8) - 1 freq poloandsons (8) - 1 freq pomeranian (8) - 2 freq |
polypantransman (0) - 1 freq thepantryman (11) - 1 freq polyanthus (12) - 1 freq lantrens (12) - 2 freq planteens (12) - 1 freq plantains (12) - 1 freq plantations (13) - 5 freq polisman (13) - 22 freq plannan (13) - 2 freq poloandsons (13) - 1 freq plauntins (13) - 1 freq planter's (13) - 1 freq planters (13) - 4 freq patronisin (13) - 6 freq planters' (13) - 1 freq pleasantries (13) - 1 freq lanterns (13) - 7 freq pleesantries (13) - 1 freq polarisin (13) - 1 freq julianbrans (13) - 3 freq philipbrannan (13) - 1 freq plantation (13) - 12 freq polissman (13) - 2 freq plantan (13) - 1 freq pollisman (13) - 2 freq |
SoundEx code - P415 plappin - 2 freq phillipines - 2 freq plipan - 1 freq pluffin - 2 freq pleepin - 1 freq playpen - 1 freq pleepan - 1 freq philippians - 1 freq ploppan - 1 freq pluffen - 4 freq polyphonic - 2 freq pluffins - 2 freq polyphème - 4 freq plypin - 1 freq polyphony - 3 freq pleven - 1 freq €˜polyphonic - 1 freq polyphemus - 1 freq plebeians - 1 freq philbinmark - 1 freq polypantransman - 1 freq |
MetaPhone code - PLPNTRNS |
POLYPANTRANSMAN |
| Time to execute Levenshtein function - 0.375449 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.631255 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.058731 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.040465 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.000865 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. |