| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fïshermen (0) - 1 freq fushermen (2) - 1 freq fyshermen (2) - 1 freq fishermen (2) - 36 freq fishermen' (3) - 1 freq fusherman (3) - 1 freq feeshermin (3) - 10 freq fïshers (3) - 1 freq fishermin (3) - 2 freq fisherman (3) - 23 freq fishermen's (4) - 4 freq fisheries (4) - 6 freq ficheren (4) - 1 freq gæthereen (4) - 1 freq ulstermen (4) - 5 freq fïshin (4) - 1 freq fasheries (4) - 1 freq fasherie (4) - 5 freq fisheen (4) - 6 freq sherman (4) - 1 freq sherpen (4) - 2 freq fishermans (4) - 1 freq freshen (5) - 3 freq feathered (5) - 7 freq sermon (5) - 29 freq |
fïshermen (0) - 1 freq fishermen (4) - 36 freq fyshermen (4) - 1 freq fushermen (4) - 1 freq fisherman (5) - 23 freq fïshers (5) - 1 freq fishermin (5) - 2 freq feeshermin (5) - 10 freq fusherman (5) - 1 freq fishermen' (6) - 1 freq fïshin (6) - 1 freq sherman (7) - 1 freq fishermans (7) - 1 freq fisheen (8) - 6 freq fishman (8) - 8 freq fasherie (8) - 5 freq fïsh (8) - 3 freq sherpen (8) - 2 freq ficheren (8) - 1 freq fasheries (8) - 1 freq fisheries (8) - 6 freq gæthereen (8) - 1 freq ulstermen (8) - 5 freq fishermen's (8) - 4 freq feeshermin's (9) - 1 freq |
SoundEx code - F265 figurine - 2 freq ficherin - 6 freq foghorn - 4 freq fisherman - 23 freq feeshermin - 10 freq fishermin - 2 freq fishermen - 36 freq feeshermin's - 1 freq ficheren - 1 freq fishermen' - 1 freq fisherman'll - 1 freq fïshermen - 1 freq fishermans - 1 freq fisherman's - 1 freq fishermen's - 4 freq fusherman - 1 freq fushermen - 1 freq fyshermen - 1 freq figurines - 2 freq fou-grown - 1 freq |
MetaPhone code - FXRMN fisherman - 23 freq feeshermin - 10 freq fishermin - 2 freq fishermen - 36 freq fishermen' - 1 freq fïshermen - 1 freq fusherman - 1 freq fushermen - 1 freq fyshermen - 1 freq |
FÏSHERMEN |
| Time to execute Levenshtein function - 0.392969 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.583005 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.033565 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.065662 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.000915 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. |