| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fishermen (0) - 36 freq fushermen (1) - 1 freq fyshermen (1) - 1 freq fisherman (1) - 23 freq fishermen' (1) - 1 freq fishermin (1) - 2 freq fishermen's (2) - 4 freq fisheen (2) - 6 freq fisheries (2) - 6 freq ficheren (2) - 1 freq fishermans (2) - 1 freq fïshermen (2) - 1 freq fusherman (2) - 1 freq fasherie (3) - 5 freq dishertent (3) - 2 freq fisher (3) - 41 freq sherpen (3) - 2 freq fishers (3) - 14 freq fishen (3) - 1 freq ulstermen (3) - 5 freq sherman (3) - 1 freq firemen (3) - 4 freq fishman (3) - 8 freq fisherrow (3) - 4 freq fasheries (3) - 1 freq |
fishermen (0) - 36 freq fishermin (1) - 2 freq fisherman (1) - 23 freq fushermen (1) - 1 freq fyshermen (1) - 1 freq fusherman (2) - 1 freq fishermen' (2) - 1 freq feeshermin (3) - 10 freq fishermans (3) - 1 freq ficheren (4) - 1 freq sherman (4) - 1 freq fisheen (4) - 6 freq fisheries (4) - 6 freq fishman (4) - 8 freq fïshermen (4) - 1 freq fishermen's (4) - 4 freq fasheries (5) - 1 freq fisherraw (5) - 2 freq fisher's (5) - 3 freq fisherman's (5) - 1 freq ficherin (5) - 6 freq fisherrow (5) - 4 freq fisher (5) - 41 freq firemen (5) - 4 freq fasherie (5) - 5 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 |
FISHERMEN |
| Time to execute Levenshtein function - 0.175803 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.332991 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.027709 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.037352 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.000909 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. |