| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| frieryke (0) - 6 freq freyre (3) - 4 freq fierie (3) - 2 freq fiery (3) - 28 freq fiere (3) - 4 freq friary (3) - 2 freq friedome (3) - 5 freq frier (3) - 1 freq frieze (3) - 2 freq fierce (3) - 34 freq friesans (4) - 5 freq forgery (4) - 1 freq frie (4) - 18 freq fibre (4) - 8 freq fike (4) - 1 freq reyyce (4) - 1 freq pierie (4) - 8 freq grieve (4) - 53 freq friendly (4) - 43 freq frilly (4) - 8 freq fridge (4) - 59 freq pierce (4) - 4 freq faerce (4) - 6 freq firse (4) - 1 freq fyke (4) - 6 freq |
frieryke (0) - 6 freq frier (4) - 1 freq friary (4) - 2 freq freyre (4) - 4 freq friar (5) - 1 freq fryske (5) - 4 freq fryer (5) - 3 freq rerek (5) - 1 freq frisky (5) - 4 freq freyr (5) - 1 freq frisk (5) - 1 freq forerede (5) - 1 freq freak (5) - 8 freq freesk (5) - 1 freq feirrie (5) - 1 freq friars (5) - 4 freq ferrie (5) - 7 freq freck (5) - 2 freq freer (5) - 2 freq freaky (5) - 4 freq fryers (5) - 1 freq friedome (5) - 5 freq fiere (5) - 4 freq frieze (5) - 2 freq fierie (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 - FRRK frieryke - 6 freq |
FRIERYKE |
| Time to execute Levenshtein function - 0.221163 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.399768 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.028241 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.040361 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.001171 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. |