| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fuskers (0) - 21 freq fusker (1) - 1 freq fuspers (1) - 1 freq fuckers (1) - 9 freq buskers (1) - 2 freq fushers (1) - 1 freq hunkers (2) - 11 freq fuses (2) - 1 freq fuskee (2) - 2 freq fuspert (2) - 7 freq busker (2) - 2 freq boskers (2) - 2 freq festers (2) - 1 freq whuskers (2) - 12 freq maskers (2) - 1 freq fucker (2) - 22 freq muskets (2) - 10 freq tusker (2) - 2 freq fusper (2) - 18 freq wiskers (2) - 1 freq muckers (2) - 4 freq fakers (2) - 1 freq furders (2) - 1 freq fuskered (2) - 1 freq dusters (2) - 3 freq |
fuskers (0) - 21 freq buskers (2) - 2 freq fuckers (2) - 9 freq fushers (2) - 1 freq fuspers (2) - 1 freq fusker (2) - 1 freq fakers (3) - 1 freq wiskers (3) - 1 freq fuskered (3) - 1 freq feckers (3) - 7 freq maskers (3) - 1 freq fishers (3) - 13 freq feshers (3) - 1 freq boskers (3) - 2 freq festers (3) - 1 freq fuskee (4) - 2 freq flusters (4) - 1 freq ushers (4) - 2 freq burkers (4) - 2 freq skiers (4) - 2 freq funders (4) - 1 freq seekers (4) - 9 freq fyshirs (4) - 6 freq sookers (4) - 2 freq whuskers (4) - 12 freq |
SoundEx code - F262 fishers - 13 freq feigurs - 11 freq figures - 48 freq fuckers - 9 freq fisher's - 3 freq faichers - 1 freq fisheries - 6 freq fuskers - 21 freq fu-ceirkil - 1 freq fïshers - 1 freq feegurs - 9 freq figgers - 1 freq fasherie's - 2 freq fyshirs - 6 freq figurs - 7 freq fawkirk - 15 freq fasheries - 1 freq feegures - 1 freq fischer-zwiegespräch - 1 freq fushers - 1 freq fugiears - 1 freq fÃgures - 1 freq fakers - 1 freq figgurs - 1 freq €œfookers - 1 freq fixers - 1 freq fizzers - 1 freq figures' - 1 freq fkarghjo - 1 freq fcrzpd - 1 freq feshers - 1 freq fbgrxdzy - 1 freq feckers - 7 freq |
MetaPhone code - FSKRS fuskers - 21 freq |
FUSKERS whisker - 1 freq whiskers - 22 freq fusker - 1 freq fuskers - 21 freq |
| Time to execute Levenshtein function - 0.200430 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.345056 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.027781 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.037302 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.000919 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. |