| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fryer (0) - 3 freq fryers (1) - 1 freq fayer (1) - 3 freq flyer (1) - 1 freq dryer (1) - 5 freq freer (1) - 2 freq fyer (1) - 1 freq frier (1) - 1 freq foyer (1) - 2 freq breer (2) - 11 freq frys (2) - 1 freq layer (2) - 15 freq ofrer (2) - 1 freq fraser (2) - 72 freq cryed (2) - 97 freq elyer (2) - 1 freq furder (2) - 53 freq fyur (2) - 2 freq fermer (2) - 194 freq ryder (2) - 1 freq fyber (2) - 1 freq fyew (2) - 8 freq fried (2) - 33 freq weyer (2) - 1 freq floer (2) - 2 freq |
fryer (0) - 3 freq frier (1) - 1 freq freer (1) - 2 freq ofrer (2) - 1 freq friar (2) - 1 freq freear (2) - 1 freq farer (2) - 1 freq freyr (2) - 1 freq foyer (2) - 2 freq fayer (2) - 3 freq fryers (2) - 1 freq flyer (2) - 1 freq dryer (2) - 5 freq fyer (2) - 1 freq fer (3) - 2011 freq greer (3) - 6 freq reer (3) - 1 freq former (3) - 40 freq braer (3) - 1 freq prayer (3) - 96 freq fifer (3) - 11 freq farter (3) - 1 freq frayed (3) - 2 freq brier (3) - 5 freq finer (3) - 14 freq |
SoundEx code - F660 ferrer - 8 freq fower-year - 2 freq farrer - 27 freq freyre - 4 freq faurer - 36 freq fore'er - 1 freq ferrier - 6 freq farrar - 1 freq farar - 1 freq friary - 2 freq ferrari - 3 freq fairer - 12 freq faarer - 6 freq fiihrer - 1 freq freyr - 1 freq free-er - 1 freq frier - 1 freq furrier - 1 freq farrier - 2 freq fower-oor - 1 freq freear - 1 freq freer - 2 freq friar - 1 freq führer - 1 freq farer - 1 freq furwur - 1 freq freoor - 1 freq ferrero - 1 freq fryer - 3 freq |
MetaPhone code - FRYR fryer - 3 freq |
FRYER |
| Time to execute Levenshtein function - 0.223288 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.397556 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.028170 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.038917 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.001027 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. |