| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fulmars (0) - 2 freq fulmart (1) - 1 freq fulmar (1) - 2 freq fumart (2) - 1 freq culmas (2) - 2 freq fulmartis (2) - 1 freq fulm's (2) - 1 freq furrs (3) - 1 freq dollars (3) - 7 freq collars (3) - 8 freq fella's (3) - 2 freq flaps (3) - 8 freq fugiears (3) - 1 freq fuller (3) - 3 freq gulders (3) - 6 freq bummers (3) - 18 freq futrats (3) - 1 freq foumart (3) - 3 freq thulmard (3) - 2 freq fellar (3) - 1 freq fowmart (3) - 4 freq fleas (3) - 13 freq sugars (3) - 2 freq foumarts (3) - 1 freq sulla's (3) - 1 freq |
fulmars (0) - 2 freq fulmart (2) - 1 freq fulmar (2) - 2 freq fulm's (3) - 1 freq fulmartis (3) - 1 freq fulums (4) - 3 freq fleers (4) - 1 freq floors (4) - 22 freq falsers (4) - 18 freq fleurs (4) - 2 freq fluirs (4) - 4 freq flairs (4) - 16 freq flams (4) - 2 freq follaers (4) - 108 freq fillers (4) - 1 freq films (4) - 41 freq fermers (4) - 90 freq farmers (4) - 5 freq culmas (4) - 2 freq fumart (4) - 1 freq flares (4) - 10 freq filters (4) - 4 freq fume's (5) - 4 freq flame's (5) - 1 freq fuspers (5) - 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 - FLMRS fulmars - 2 freq |
FULMARS |
| Time to execute Levenshtein function - 0.367226 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.432708 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.027590 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.037218 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.000921 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. |