| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fulmar (0) - 2 freq fulmars (1) - 2 freq fulmart (1) - 1 freq furmal (2) - 1 freq fulham (2) - 1 freq fulla (2) - 6 freq fuar (2) - 1 freq culmas (2) - 2 freq fuller (2) - 3 freq floar (2) - 6 freq fulm (2) - 2 freq fullae (2) - 1 freq fulca (2) - 1 freq fulm's (2) - 1 freq fulmed (2) - 1 freq fumart (2) - 1 freq kumar (2) - 1 freq fullay (2) - 1 freq pullar (2) - 5 freq cullar (2) - 1 freq elmar (2) - 2 freq vulgar (2) - 4 freq bulgar (2) - 1 freq fellar (2) - 1 freq fleas (3) - 13 freq |
fulmar (0) - 2 freq fulmars (2) - 2 freq fulmart (2) - 1 freq fulmed (3) - 1 freq fulm (3) - 2 freq flamer (3) - 1 freq floar (3) - 6 freq elmar (3) - 2 freq fellar (3) - 1 freq fuller (3) - 3 freq flr (4) - 3 freq farmer (4) - 9 freq felder (4) - 1 freq flyman (4) - 5 freq flyer (4) - 1 freq flare (4) - 10 freq filmed (4) - 9 freq filter (4) - 5 freq calmer (4) - 2 freq flour (4) - 15 freq films (4) - 39 freq filler (4) - 2 freq fleer (4) - 122 freq flier (4) - 1 freq falter (4) - 1 freq |
SoundEx code - F456 flamer - 1 freq flinrichen - 1 freq flame-haired - 1 freq flimmer - 2 freq fulmars - 2 freq fellow-mortal - 1 freq feelin-herted - 1 freq fulmart - 1 freq fulmartis - 1 freq flamarrion - 1 freq feliamort - 1 freq fulmar - 2 freq |
MetaPhone code - FLMR flamer - 1 freq flimmer - 2 freq fulmar - 2 freq |
FULMAR |
| Time to execute Levenshtein function - 0.227178 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.585368 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.057943 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.038303 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.000790 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. |