| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| viewplatform (0) - 1 freq platform (4) - 46 freq €˜platform (4) - 1 freq platforms (5) - 3 freq pletform (5) - 1 freq plaitform (5) - 1 freq speculator (6) - 1 freq pletforms (6) - 1 freq pletfurm (6) - 3 freq vigilateers (6) - 2 freq vigilateer (6) - 1 freq peculators (6) - 1 freq revelatory (6) - 1 freq dilatory (6) - 1 freq vibrator (6) - 1 freq pletfoarm (6) - 1 freq speculators (6) - 3 freq viewforth (6) - 4 freq watford (6) - 2 freq firealarm (7) - 1 freq maelstrom (7) - 3 freq inspector (7) - 19 freq isolation (7) - 19 freq veesitations (7) - 1 freq bestford (7) - 1 freq |
viewplatform (0) - 1 freq €˜platform (6) - 1 freq platform (6) - 46 freq plaitform (7) - 1 freq pletform (7) - 1 freq pletfoarm (8) - 1 freq pletfurm (8) - 3 freq platforms (8) - 3 freq pletforms (9) - 1 freq pletfoarms (10) - 3 freq vigilateer (10) - 1 freq watford (10) - 2 freq vigilateers (10) - 2 freq plethora (11) - 1 freq splatterd (11) - 1 freq viewpoints (11) - 1 freq watrm (11) - 1 freq whitfor (11) - 2 freq airtfoarm (11) - 1 freq perform (11) - 22 freq splatters (11) - 4 freq wallayford (11) - 1 freq platinum (11) - 7 freq letford (11) - 1 freq jupstorm (11) - 3 freq |
SoundEx code - V143 viewplatform - 1 freq vivaldi - 1 freq viability - 1 freq |
MetaPhone code - FPLTFRM viewplatform - 1 freq |
VIEWPLATFORM |
| Time to execute Levenshtein function - 0.393098 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.677381 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.027503 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.073044 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.000874 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. |