| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| facades (0) - 2 freq facade (1) - 4 freq arcades (2) - 2 freq fades (2) - 23 freq parades (2) - 7 freq decades (2) - 49 freq faces (2) - 230 freq facees (2) - 1 freq facies (2) - 1 freq €œcaves (3) - 2 freq faded (3) - 16 freq fawkes (3) - 7 freq faalds (3) - 3 freq faarest (3) - 1 freq paraded (3) - 3 freq faced (3) - 69 freq decides (3) - 27 freq carcages (3) - 2 freq parade (3) - 15 freq faeder (3) - 4 freq haaden (3) - 2 freq palaces (3) - 9 freq adaes (3) - 1 freq frames (3) - 18 freq mccabes (3) - 1 freq |
facades (0) - 2 freq facade (2) - 4 freq facees (3) - 1 freq decades (3) - 49 freq facies (3) - 1 freq faces (3) - 230 freq fades (3) - 23 freq arcades (3) - 2 freq fads (4) - 2 freq facks (4) - 15 freq facts (4) - 46 freq faachs (4) - 1 freq acids (4) - 1 freq facedd (4) - 1 freq facials (4) - 2 freq macdos (4) - 1 freq faulds (4) - 21 freq facs (4) - 1 freq focuses (4) - 2 freq decaedes (4) - 1 freq recedes (4) - 1 freq face's (4) - 1 freq facets (4) - 2 freq codes (4) - 4 freq faced (4) - 69 freq |
SoundEx code - F232 facts - 46 freq fechts - 31 freq fastest - 14 freq fists - 21 freq facades - 2 freq foosts - 2 freq festser - 1 freq feasts - 5 freq ficets - 1 freq fights - 4 freq fuckwhits - 1 freq fooshtie-smellin - 1 freq facts' - 1 freq faistest - 1 freq fooshtiesmellin - 1 freq fowkgates - 8 freq feghts - 1 freq fostex - 1 freq facets - 2 freq fects - 5 freq fisticuffs - 1 freq fast-growein - 1 freq 'facts - 1 freq factsheet - 3 freq fichts - 1 freq €˜facts - 1 freq fauseheids - 1 freq fgtwq - 1 freq fktj - 1 freq fvctywgwc - 1 freq fuckwits' - 1 freq |
MetaPhone code - FKTS facts - 46 freq facades - 2 freq facts' - 1 freq fects - 5 freq 'facts - 1 freq €˜facts - 1 freq |
FACADES |
| Time to execute Levenshtein function - 0.194714 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.378708 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.027335 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.039365 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.004696 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. |