| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| faves (0) - 3 freq caves (1) - 16 freq fates (1) - 4 freq faces (1) - 224 freq faes (1) - 35 freq fares (1) - 5 freq fives (1) - 7 freq waves (1) - 137 freq saves (1) - 11 freq raves (1) - 5 freq fades (1) - 21 freq fakes (1) - 2 freq laves (1) - 3 freq daves (1) - 2 freq taves (1) - 4 freq eaves (1) - 2 freq fave (1) - 14 freq paves (1) - 1 freq faxes (1) - 1 freq maves (1) - 8 freq daes (2) - 213 freq face (2) - 1675 freq daies (2) - 2 freq loves (2) - 63 freq gapes (2) - 1 freq |
faves (0) - 3 freq fives (1) - 7 freq fave (2) - 14 freq taves (2) - 4 freq daves (2) - 2 freq laves (2) - 3 freq paves (2) - 1 freq caves (2) - 16 freq maves (2) - 8 freq faxes (2) - 1 freq fakes (2) - 2 freq eaves (2) - 2 freq faes (2) - 35 freq faces (2) - 224 freq fades (2) - 21 freq fares (2) - 5 freq fates (2) - 4 freq waves (2) - 137 freq saves (2) - 11 freq raves (2) - 5 freq cauves (3) - 7 freq flaes (3) - 1 freq faiks (3) - 1 freq fones (3) - 1 freq foes (3) - 10 freq |
SoundEx code - F120 fives - 7 freq fyfic - 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 fifie's - 1 freq fife's - 2 freq vivas - 1 freq faves - 3 freq fafa's - 2 freq vefz - 1 freq |
FAVES |
| Time to execute Levenshtein function - 0.240941 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.388427 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.028216 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.038816 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.001145 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. |