| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fishman (0) - 8 freq fishan (1) - 1 freq fashan (2) - 2 freq wishan (2) - 2 freq hishan (2) - 1 freq riseman (2) - 1 freq fishen (2) - 1 freq fightan (2) - 3 freq irishman (2) - 6 freq fishin (2) - 90 freq fishtank (2) - 1 freq fichtan (2) - 1 freq richman (2) - 1 freq fisherman (2) - 23 freq fitman (2) - 22 freq fisheen (2) - 6 freq wiseman (2) - 1 freq fismal (2) - 1 freq finman (2) - 2 freq fushion (3) - 30 freq dismal (3) - 5 freq washan (3) - 3 freq wishin (3) - 38 freq islan (3) - 13 freq fidgan (3) - 1 freq |
fishman (0) - 8 freq fishan (2) - 1 freq irishman (3) - 6 freq fisheen (3) - 6 freq fishen (3) - 1 freq fisherman (3) - 23 freq fishin (3) - 90 freq fashan (3) - 2 freq fashun (4) - 2 freq fyshin (4) - 4 freq fishermin (4) - 2 freq feshin (4) - 2 freq fashin (4) - 28 freq irishmen (4) - 1 freq fusherman (4) - 1 freq fushion (4) - 30 freq fushin (4) - 19 freq fishermen (4) - 36 freq feishen (4) - 8 freq fashion (4) - 71 freq riseman (4) - 1 freq hishan (4) - 1 freq fightan (4) - 3 freq fishtank (4) - 1 freq fichtan (4) - 1 freq |
SoundEx code - F255 fusomeness - 1 freq fishmongers - 1 freq fishmannie's - 2 freq fag-mingin - 1 freq fishman - 8 freq fushmongers - 1 freq fushmonger - 1 freq figment - 1 freq faxnumber - 1 freq fcnenk - 1 freq |
MetaPhone code - FXMN fishman - 8 freq |
FISHMAN |
| Time to execute Levenshtein function - 0.283290 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.585070 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.038122 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.047878 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.000869 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. |