| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| friar (0) - 1 freq friars (1) - 4 freq briar (1) - 1 freq friary (1) - 2 freq frier (1) - 1 freq feir (2) - 7 freq drear (2) - 10 freq fran (2) - 1 freq friday (2) - 334 freq freyr (2) - 1 freq primar (2) - 1 freq frith (2) - 3 freq fair (2) - 1530 freq freer (2) - 2 freq rar (2) - 1 freq freear (2) - 1 freq foir (2) - 6 freq brier (2) - 5 freq fridae (2) - 1 freq faar (2) - 81 freq drier (2) - 9 freq freak (2) - 8 freq fir (2) - 4027 freq frisk (2) - 1 freq fnaar (2) - 2 freq |
friar (0) - 1 freq frier (1) - 1 freq friary (1) - 2 freq freear (2) - 1 freq freer (2) - 2 freq farar (2) - 1 freq freyr (2) - 1 freq firr (2) - 2 freq briar (2) - 1 freq fryer (2) - 3 freq friars (2) - 4 freq forfar (3) - 10 freq frac (3) - 3 freq frim (3) - 1 freq farrar (3) - 1 freq fier (3) - 6 freq frag (3) - 1 freq fray (3) - 10 freq fairer (3) - 12 freq draar (3) - 6 freq fraa (3) - 2 freq fram (3) - 1 freq roar (3) - 81 freq drar (3) - 1 freq fri (3) - 6 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 - FRR ferrer - 8 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 verrier - 1 freq furrier - 1 freq farrier - 2 freq freear - 1 freq freer - 2 freq friar - 1 freq führer - 1 freq farer - 1 freq freoor - 1 freq ferrero - 1 freq |
FRIAR |
| Time to execute Levenshtein function - 0.308692 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.595639 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.029036 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.069032 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.000958 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. |