| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| facts (0) - 46 freq fants (1) - 1 freq 'facts (1) - 1 freq facto (1) - 3 freq fects (1) - 5 freq facs (1) - 1 freq fauts (1) - 27 freq faces (1) - 230 freq facks (1) - 15 freq facets (1) - 2 freq acts (1) - 43 freq faats (1) - 7 freq farts (1) - 5 freq facts' (1) - 1 freq fact (1) - 485 freq fats (1) - 2 freq pacts (1) - 2 freq 'act (2) - 1 freq laces (2) - 11 freq faess (2) - 1 freq mac's (2) - 1 freq jacks (2) - 10 freq marts (2) - 4 freq fack (2) - 182 freq faals (2) - 1 freq |
facts (0) - 46 freq facets (1) - 2 freq fects (1) - 5 freq faats (2) - 7 freq ficets (2) - 1 freq farts (2) - 5 freq fact (2) - 485 freq acts (2) - 43 freq fats (2) - 2 freq pacts (2) - 2 freq facts' (2) - 1 freq 'facts (2) - 1 freq facks (2) - 15 freq fants (2) - 1 freq facs (2) - 1 freq facto (2) - 3 freq faces (2) - 230 freq fauts (2) - 27 freq fechts (3) - 31 freq focus (3) - 115 freq feasts (3) - 5 freq factly (3) - 1 freq ects (3) - 4 freq factors (3) - 21 freq fists (3) - 21 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 |
FACTS fact - 485 freq facts - 46 freq |
| Time to execute Levenshtein function - 0.171509 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.331890 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.027802 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.042663 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.000970 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. |