| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fire-raisin (0) - 1 freq fun-raisin (3) - 1 freq time-reivin (4) - 1 freq fire-aeting (4) - 1 freq iver-risin (4) - 1 freq sirprisin (4) - 2 freq firritin (4) - 1 freq fore-maist (4) - 1 freq fireproofin (4) - 1 freq ye-raikin (4) - 1 freq fine-luikin (4) - 1 freq fire-maister (4) - 1 freq fundraisin (4) - 1 freq fraisin (4) - 1 freq pike-riven (5) - 1 freq air-raids (5) - 2 freq kirk-gangin (5) - 1 freq prevailin (5) - 2 freq supervisin (5) - 1 freq fire-shivel (5) - 1 freq fine-tuin (5) - 1 freq free-warkin (5) - 1 freq fit-tappin (5) - 1 freq wirritin (5) - 1 freq firgivin (5) - 1 freq |
fire-raisin (0) - 1 freq fun-raisin (4) - 1 freq iver-risin (5) - 1 freq fireproofin (6) - 1 freq fundraisin (6) - 1 freq fraisin (6) - 1 freq fore-maist (6) - 1 freq firritin (6) - 1 freq sirprisin (6) - 2 freq tear-arsin (7) - 1 freq freemason (7) - 1 freq fraternisin (7) - 1 freq fire-erms (7) - 1 freq fire-ingine (7) - 1 freq surpreisin (7) - 1 freq fire-irons (7) - 4 freq rehearsin (7) - 2 freq firey-reid (7) - 1 freq free-warkin (7) - 1 freq surprisin (7) - 17 freq fair-daein (7) - 1 freq terrorisin (7) - 1 freq re-readin (7) - 2 freq fire-maister (7) - 1 freq forewarnin (7) - 2 freq |
SoundEx code - F662 fireworks - 11 freq firework - 7 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 - FRRSN fire-raisin - 1 freq |
FIRE-RAISIN |
| Time to execute Levenshtein function - 0.215081 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.380971 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.030795 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.039377 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.003413 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. |