| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| polwart (0) - 2 freq polvara (2) - 2 freq towart (2) - 54 freq onwart (2) - 2 freq poleaxt (2) - 1 freq polnar (2) - 1 freq ootwart (2) - 2 freq polworth (2) - 3 freq powert (2) - 2 freq collart (2) - 1 freq forwart (2) - 4 freq polar (2) - 24 freq skywart (3) - 1 freq foart (3) - 1 freq olways (3) - 1 freq powlar (3) - 1 freq plait (3) - 6 freq bleart (3) - 5 freq leart (3) - 4 freq collars (3) - 8 freq dollars (3) - 7 freq part (3) - 196 freq postwar (3) - 3 freq plaet (3) - 5 freq poplar (3) - 1 freq |
polwart (0) - 2 freq powert (3) - 2 freq polworth (3) - 3 freq upwart (4) - 8 freq forwart (4) - 4 freq polar (4) - 24 freq lowert (4) - 1 freq collart (4) - 1 freq onwart (4) - 2 freq towart (4) - 54 freq ootwart (4) - 2 freq poleaxt (4) - 1 freq polvara (4) - 2 freq polnar (4) - 1 freq wart (5) - 4 freq gollert (5) - 7 freq stewart (5) - 75 freq polaris (5) - 3 freq poller (5) - 1 freq policht (5) - 1 freq lozart (5) - 1 freq playt (5) - 3 freq fulmart (5) - 1 freq poleet (5) - 3 freq yollert (5) - 2 freq |
SoundEx code - P463 playwriting - 1 freq plartin - 1 freq playwritin - 1 freq pillared - 1 freq polwart - 2 freq polaroid - 1 freq polworth - 3 freq pilloried - 1 freq |
MetaPhone code - PLWRT polwart - 2 freq |
POLWART |
| Time to execute Levenshtein function - 0.223445 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.364338 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.027832 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.038378 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.000915 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. |