| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fizzers (0) - 1 freq fizzer (1) - 6 freq mizzer (2) - 4 freq fithers (2) - 4 freq fingers (2) - 255 freq cizzens (2) - 1 freq finders (2) - 2 freq dizzens (2) - 19 freq mizzert (2) - 1 freq rizzens (2) - 1 freq gizzerns (2) - 1 freq kizzens (2) - 6 freq fivers (2) - 3 freq gizzern (2) - 1 freq filters (2) - 4 freq gizzens (2) - 1 freq gizzes (2) - 2 freq fiooers (2) - 2 freq pizzens (2) - 1 freq fishers (2) - 14 freq fitters (2) - 3 freq izzens (2) - 1 freq fiers (2) - 6 freq rozzers (2) - 1 freq fillers (2) - 1 freq |
fizzers (0) - 1 freq fizzer (2) - 6 freq rozzers (3) - 1 freq fizzogs (3) - 6 freq jazzers (3) - 1 freq fiers (4) - 6 freq freezers (4) - 1 freq izzens (4) - 1 freq fitters (4) - 3 freq fishers (4) - 14 freq fillers (4) - 1 freq fifers (4) - 8 freq fixers (4) - 1 freq rizzert (4) - 1 freq pizzens (4) - 1 freq fizzed (4) - 1 freq sizzens (4) - 8 freq figgers (4) - 1 freq dizzens (4) - 19 freq mizzer (4) - 4 freq mizzert (4) - 1 freq finders (4) - 2 freq fingers (4) - 255 freq fiooers (4) - 2 freq fithers (4) - 4 freq |
SoundEx code - F262 fishers - 14 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 - FSRS phasers - 1 freq vissiers - 3 freq fizzers - 1 freq |
FIZZERS |
| Time to execute Levenshtein function - 0.191354 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.428162 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.027691 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.037913 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.000931 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. |