| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| non-folk (0) - 1 freq non-work (2) - 1 freq tounsfolk (3) - 5 freq kinfolk (3) - 2 freq kin-fowk (3) - 1 freq menfolk (3) - 1 freq finfolk (3) - 1 freq forefolk (3) - 2 freq men-fowk (3) - 1 freq tounfolk (3) - 2 freq toonfolk (3) - 1 freq non-votin (4) - 1 freq unfold (4) - 8 freq non-pe (4) - 1 freq moniefowk (4) - 1 freq menfokk (4) - 2 freq grandfolk (4) - 1 freq kinfowk (4) - 1 freq donstalk (4) - 5 freq hafolk (4) - 1 freq non-pc (4) - 1 freq confoun (4) - 1 freq non- (4) - 1 freq conflik (4) - 1 freq controls (4) - 5 freq |
non-folk (0) - 1 freq non-work (4) - 1 freq men-fowk (5) - 1 freq finfolk (5) - 1 freq toonfolk (5) - 1 freq tounfolk (5) - 2 freq menfolk (5) - 1 freq tounsfolk (5) - 5 freq kinfolk (5) - 2 freq kin-fowk (5) - 1 freq man-flu (6) - 1 freq conflik (6) - 1 freq tin-foil (6) - 1 freq forefolk (6) - 2 freq toonsfowk (7) - 4 freq two-fold (7) - 1 freq note-book (7) - 6 freq nev-foo (7) - 1 freq non-paid (7) - 1 freq mon-fri (7) - 1 freq €œfolk (7) - 1 freq menfock (7) - 1 freq nanook (7) - 1 freq ten-foot (7) - 2 freq kinsfowk (7) - 7 freq |
SoundEx code - N514 nimble - 1 freq name-plate - 1 freq nameplates - 1 freq non-politically - 1 freq ninefauld - 1 freq non-violent - 1 freq €œnon-mobile - 1 freq nonpolitical - 1 freq non-folk - 1 freq nameplate - 1 freq |
MetaPhone code - NNFLK non-folk - 1 freq |
NON-FOLK |
| Time to execute Levenshtein function - 0.214570 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.384785 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.027824 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.038623 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.000910 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. |