Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
frequents (0) - 1 freq frequent (1) - 18 freq frequency (2) - 4 freq frequently (2) - 8 freq frequentit (2) - 2 freq frequentin (2) - 1 freq requests (2) - 7 freq freens (3) - 241 freq freends (3) - 181 freq prevents (3) - 1 freq frequencies (3) - 1 freq greements (3) - 1 freq presents (3) - 50 freq crescents (3) - 4 freq request (3) - 28 freq freen's (3) - 10 freq frequentlie (3) - 1 freq frunts (3) - 1 freq repents (3) - 2 freq fragments (3) - 6 freq relents (3) - 3 freq frequentin' (3) - 1 freq frunt (4) - 21 freq reruns (4) - 1 freq repeats (4) - 11 freq |
frequents (0) - 1 freq frequent (2) - 18 freq frequentin (3) - 1 freq frequentit (3) - 2 freq frequently (3) - 8 freq frunts (4) - 1 freq frequencies (4) - 1 freq frequentlie (4) - 1 freq requests (4) - 7 freq frequency (4) - 4 freq repents (5) - 2 freq fragments (5) - 6 freq frequentin' (5) - 1 freq fronts (5) - 1 freq freends (5) - 181 freq relents (5) - 3 freq prevents (5) - 1 freq freens (5) - 241 freq presents (5) - 50 freq greements (5) - 1 freq freen's (5) - 10 freq tridents (6) - 1 freq grunts (6) - 5 freq rodents (6) - 2 freq fruits (6) - 18 freq |
SoundEx code - F625 freezin - 55 freq frozent - 13 freq frisian - 29 freq frozen - 69 freq forgiein - 3 freq ferr-kent - 7 freq fowersome-reels - 1 freq forgien - 42 freq faur-kennt - 2 freq freezing - 13 freq foregang - 1 freq fearsome - 28 freq faur-kent - 8 freq fiereesome - 1 freq frequentit - 2 freq forkin - 7 freq 'fresh-made' - 1 freq forcin - 22 freq friggin - 6 freq freshness - 7 freq frequent - 18 freq freshener - 4 freq 'fragment' - 1 freq fragment - 2 freq faurgone - 1 freq frequents - 1 freq foreign - 69 freq firkins - 2 freq fragments - 6 freq forekennin - 2 freq faurseein - 2 freq foreseen - 4 freq freezin' - 4 freq frasinei - 1 freq freezen - 4 freq frecn - 1 freq feersum - 4 freq freshnin - 1 freq freshen - 3 freq freshnen - 1 freq feersom - 2 freq foreigners - 7 freq frequency - 4 freq frequencies - 1 freq freakin - 3 freq foreigner - 4 freq freshner - 1 freq feerichin - 1 freq freshened - 1 freq fearsomeness - 1 freq freshenin - 3 freq fresian - 4 freq fresians - 1 freq frogmarched - 3 freq friskin - 1 freq frisson - 2 freq faersom - 1 freq foregaun - 4 freq faur-seen - 2 freq forgane - 1 freq 'frognerparken' - 3 freq foursome - 1 freq forkins - 1 freq fir-cones - 5 freq fir-cone - 5 freq foirgaun - 3 freq forgieness - 4 freq fowersome - 2 freq faersome - 5 freq freezan - 2 freq fraisin - 1 freq frequentin - 1 freq frequentlie - 1 freq frichened - 11 freq frisians - 3 freq 'foreign' - 1 freq forgein - 1 freq forgang - 1 freq foresamekill - 1 freq fruizen - 1 freq ferr-seen - 1 freq frequently - 8 freq frisking - 1 freq forsameikle - 8 freq forgienes - 1 freq furreign - 6 freq fowersum - 3 freq foirsein - 1 freq foirsman - 6 freq frosin - 1 freq forecomin - 1 freq forgan - 3 freq forcing - 3 freq fierceness - 2 freq forgin - 1 freq frackin - 6 freq far-seen - 1 freq fracking - 1 freq foraging - 1 freq fragmented - 2 freq foregone - 1 freq €žforeign - 1 freq fragmentit - 1 freq fower-some - 1 freq fearsamer - 1 freq f-f-friggin - 1 freq foregane - 2 freq fresheners - 1 freq fraesan - 1 freq furckin - 1 freq feeriesome - 1 freq frequentin' - 1 freq farsmadram - 1 freq friesian - 1 freq fraazin - 1 freq freakindelight - 2 freq foreigncorr - 1 freq friockheim - 3 freq forgandenny - 2 freq frogmsrched - 1 freq friesans - 5 freq |
MetaPhone code - FRKNTS frequents - 1 freq |
FREQUENTS |
Time to execute Levenshtein function - 0.227957 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.386848 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.028944 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.037672 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.000949 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. |