Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
firework (0) - 9 freq fireworks (1) - 11 freq firewark (1) - 2 freq firewirk (1) - 2 freq 'fireworks (2) - 2 freq firewirks (2) - 8 freq foreword (2) - 4 freq firewurks (2) - 1 freq forefock (3) - 2 freq firewid (3) - 26 freq freoor (3) - 1 freq firebox (3) - 1 freq byrewark (3) - 1 freq fieldwork (3) - 1 freq firewidd (3) - 3 freq foreswore (3) - 1 freq firever (3) - 4 freq firebird (3) - 1 freq homework (3) - 26 freq firewuid (3) - 1 freq forewird (3) - 6 freq forefolk (3) - 2 freq fireburn (3) - 1 freq firefox (3) - 1 freq careworn (3) - 1 freq |
firework (0) - 9 freq firewirk (1) - 2 freq firewark (1) - 2 freq fireworks (2) - 11 freq firewurks (3) - 1 freq foreword (3) - 4 freq firewirks (3) - 8 freq fitwark (4) - 3 freq framework (4) - 7 freq forewurd (4) - 1 freq forewird (4) - 6 freq byrewark (4) - 1 freq rewirk (4) - 1 freq 'fireworks (4) - 2 freq forewarn (4) - 1 freq hamework (5) - 10 freq forefowk (5) - 9 freq framewark (5) - 10 freq artwork (5) - 6 freq orrawark (5) - 1 freq furwur (5) - 1 freq overwork (5) - 1 freq frawart (5) - 2 freq framewirk (5) - 3 freq forwird (5) - 2 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 - FRWRK firework - 9 freq firewark - 2 freq firewirk - 2 freq |
FIREWORK fireworks - 11 freq firewirks - 8 freq firework - 9 freq firewirk - 2 freq firewark - 2 freq firecrackers - 1 freq |
Time to execute Levenshtein function - 0.199071 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.394741 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.027893 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.039017 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.001104 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. |