| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| free-warkin (0) - 1 freq re-markin (3) - 1 freq free-flowin (4) - 1 freq free-thinkin (4) - 1 freq sleep-walkin (4) - 3 freq freakin (4) - 3 freq wide-waukin (4) - 1 freq forewarnin (4) - 2 freq lee-wark (4) - 1 freq remarkin (4) - 4 freq re-makkin (4) - 2 freq rewardin (4) - 2 freq re-working (4) - 1 freq hard-warkin (4) - 3 freq netwarkin (4) - 1 freq free-staunin (4) - 2 freq freestaunin (4) - 13 freq free-mairket (4) - 1 freq fleerin (5) - 4 freq reedware (5) - 1 freq fee-peyin (5) - 1 freq raipwalkin (5) - 1 freq firewark (5) - 2 freq re-flarin (5) - 1 freq reekin (5) - 45 freq |
free-warkin (0) - 1 freq re-markin (5) - 1 freq free-mairket (6) - 1 freq hard-warkin (6) - 3 freq re-working (6) - 1 freq forewarnin (6) - 2 freq framewark (7) - 10 freq forwardin (7) - 1 freq hard-wirkin (7) - 5 freq forewarn (7) - 1 freq fermwarker (7) - 1 freq free-staunin (7) - 2 freq firewark (7) - 2 freq fire-raisin (7) - 1 freq netwarkin (7) - 1 freq hard-workin (7) - 2 freq lee-wark (7) - 1 freq wide-waukin (7) - 1 freq remarkin (7) - 4 freq free-thinkin (7) - 1 freq free-flowin (7) - 1 freq rewardin (7) - 2 freq re-makkin (7) - 2 freq freakin (7) - 3 freq fireworks (8) - 11 freq |
SoundEx code - F662 fireworks - 11 freq firework - 9 freq friars - 4 freq firewurks - 1 freq firewark - 2 freq firewirks - 8 freq free-warkin - 1 freq freirs - 2 freq frieryke - 6 freq fire-raisin - 1 freq firewirk - 2 freq firewirkssae - 1 freq ferriers - 1 freq fryers - 1 freq 'fireworks - 2 freq |
MetaPhone code - FRWRKN free-warkin - 1 freq |
FREE-WARKIN |
| Time to execute Levenshtein function - 0.231417 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.411989 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.027943 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.040185 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.000879 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. |