| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| faffs (0) - 1 freq waffs (1) - 7 freq daffs (1) - 3 freq gaffs (1) - 4 freq affs (1) - 4 freq faff (1) - 3 freq yaffs (1) - 1 freq falls (2) - 15 freq fauss (2) - 14 freq fan's (2) - 3 freq fails (2) - 20 freq guffs (2) - 4 freq faers (2) - 2 freq wafts (2) - 8 freq riffs (2) - 2 freq datfs (2) - 1 freq faes (2) - 35 freq naffu (2) - 1 freq faif (2) - 1 freq fauts (2) - 27 freq nyaffs (2) - 6 freq ruffs (2) - 1 freq waff (2) - 19 freq rafts (2) - 3 freq graffs (2) - 2 freq |
faffs (0) - 1 freq faff (2) - 3 freq waffs (2) - 7 freq affs (2) - 4 freq yaffs (2) - 1 freq daffs (2) - 3 freq gaffs (2) - 4 freq offs (3) - 9 freq duffs (3) - 2 freq buffs (3) - 4 freq puffs (3) - 8 freq toffs (3) - 13 freq fiff (3) - 1 freq fufft (3) - 5 freq huffs (3) - 2 freq ffs (3) - 152 freq coffs (3) - 2 freq ruffs (3) - 1 freq cuffs (3) - 7 freq fafa's (3) - 2 freq fuff (3) - 6 freq muffs (3) - 1 freq daffys (3) - 1 freq doffs (3) - 1 freq guffs (3) - 4 freq |
SoundEx code - F120 fives - 7 freq fyfic - 1 freq faffs - 1 freq fifie's - 1 freq fife's - 2 freq fobie's - 1 freq fabius - 2 freq fobs - 1 freq five-ack - 1 freq faw-back - 2 freq five-week - 1 freq fwpk - 1 freq faefoggie - 85 freq faves - 3 freq fafa's - 2 freq |
MetaPhone code - FFS fives - 7 freq faffs - 1 freq fifie's - 1 freq fife's - 2 freq vivas - 1 freq faves - 3 freq fafa's - 2 freq vefz - 1 freq |
FAFFS |
| Time to execute Levenshtein function - 0.218425 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.400596 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.031541 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.041355 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.001033 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. |