| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| friars (0) - 4 freq briars (1) - 1 freq friary (1) - 2 freq friar (1) - 1 freq drars (2) - 2 freq fraes (2) - 1 freq friens (2) - 50 freq triers (2) - 2 freq firs (2) - 6 freq freirs (2) - 2 freq frills (2) - 1 freq fyirs (2) - 1 freq freaks (2) - 2 freq fuirs (2) - 1 freq trials (2) - 18 freq fears (2) - 40 freq feirs (2) - 3 freq rears (2) - 2 freq liars (2) - 1 freq frier (2) - 1 freq briar (2) - 1 freq briers (2) - 2 freq brians (2) - 1 freq roars (2) - 22 freq fiers (2) - 6 freq |
friars (0) - 4 freq fryers (2) - 1 freq friar (2) - 1 freq freirs (2) - 2 freq briars (2) - 1 freq friary (2) - 2 freq draars (3) - 37 freq fars (3) - 14 freq roars (3) - 22 freq briers (3) - 2 freq fridays (3) - 11 freq fiers (3) - 6 freq fairs (3) - 10 freq furrs (3) - 1 freq forrays (3) - 1 freq frites (3) - 1 freq frier (3) - 1 freq furras (3) - 1 freq fries (3) - 3 freq freats (3) - 3 freq freaks (3) - 2 freq fraes (3) - 1 freq fyirs (3) - 1 freq firs (3) - 6 freq triers (3) - 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 - FRRS friars - 4 freq freirs - 2 freq verrier's - 1 freq vyryrz - 1 freq ferriers - 1 freq frères - 2 freq |
FRIARS |
| Time to execute Levenshtein function - 0.220515 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.372029 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.035636 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.051428 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.000814 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. |