| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| sun-loungers (0) - 1 freq sun-lounge (2) - 1 freq unbounders (4) - 1 freq mud-loggers (4) - 1 freq loungers (4) - 2 freq slounges (4) - 1 freq sunflowers (4) - 3 freq scroungers (4) - 1 freq sunflooers (4) - 1 freq sounders (5) - 2 freq encounters (5) - 3 freq flounders (5) - 2 freq dunfounert (5) - 1 freq lounger (5) - 1 freq sundouns (5) - 7 freq sunfloors (5) - 2 freq slounge (5) - 1 freq sunplouks (5) - 2 freq scrounger (5) - 1 freq fushmongers (5) - 1 freq youngers (5) - 1 freq straungers (5) - 2 freq lug-lounderin (5) - 1 freq slounged (5) - 1 freq announcers (5) - 1 freq |
sun-loungers (0) - 1 freq sun-lounge (4) - 1 freq sunflooers (7) - 1 freq sunflowers (7) - 3 freq slingers (7) - 1 freq scroungers (7) - 1 freq slounges (7) - 1 freq mud-loggers (7) - 1 freq loungers (7) - 2 freq sunfloors (8) - 2 freq unbounders (8) - 1 freq straungers (8) - 2 freq longbangers (9) - 1 freq lingers (9) - 5 freq sthrangers (9) - 1 freq sinclers (9) - 1 freq sairfangers (9) - 2 freq sanners (9) - 2 freq money-lenders (9) - 1 freq finngers (9) - 3 freq yin-liner (9) - 1 freq saut-miners (9) - 1 freq straingers (9) - 1 freq screengers (9) - 1 freq singers (9) - 55 freq |
SoundEx code - S545 smilin - 155 freq smallness - 1 freq smellin - 15 freq smiling - 16 freq smilin' - 1 freq semolina - 5 freq snailin - 1 freq snuilin - 1 freq sun-loungers - 1 freq smilan - 8 freq smelling - 4 freq skinnylinky - 1 freq smeilin - 1 freq sun-lounge - 1 freq somnolent - 1 freq semolina-textured - 1 freq semolinie - 1 freq sámiland - 1 freq scanlon - 49 freq €˜scanlon - 2 freq snawline - 1 freq smilnehomes - 1 freq smellin' - 1 freq shonawhillansx - 1 freq |
MetaPhone code - SNLNJRS sun-loungers - 1 freq |
SUN-LOUNGERS |
| Time to execute Levenshtein function - 0.244821 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.412942 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.036291 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.043392 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.000899 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. |