| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fift (0) - 14 freq fitt (1) - 41 freq gift (1) - 116 freq lift (1) - 490 freq fiet (1) - 2 freq rift (1) - 12 freq fifa (1) - 5 freq fft (1) - 1 freq tift (1) - 4 freq aift (1) - 14 freq fint (1) - 2 freq fit (1) - 3793 freq fiat (1) - 3 freq fist (1) - 55 freq fyft (1) - 1 freq fiot (1) - 1 freq fifth (1) - 28 freq fifty (1) - 161 freq fife (1) - 124 freq fiff (1) - 1 freq fifd (1) - 1 freq filt (1) - 8 freq sift (1) - 6 freq firs (2) - 6 freq lint (2) - 17 freq |
fift (0) - 14 freq fyft (1) - 1 freq fifty (1) - 161 freq fft (1) - 1 freq fifd (2) - 1 freq fiff (2) - 1 freq fifety (2) - 1 freq fufty (2) - 6 freq filt (2) - 8 freq sift (2) - 6 freq fiftay (2) - 1 freq afft (2) - 1 freq fifth (2) - 28 freq fiftie (2) - 12 freq offt (2) - 1 freq fife (2) - 124 freq fiot (2) - 1 freq rift (2) - 12 freq fiet (2) - 2 freq lift (2) - 490 freq gift (2) - 116 freq tift (2) - 4 freq fifa (2) - 5 freq fiat (2) - 3 freq fitt (2) - 41 freq |
SoundEx code - F130 fifth - 28 freq fifty - 161 freq fuftie - 4 freq fuffed - 1 freq fifety - 1 freq fift - 14 freq fob-wateh - 1 freq fiypt - 1 freq foofed - 1 freq fibta' - 1 freq fiftay - 1 freq fiftie - 12 freq fyft - 1 freq fyftie - 1 freq fufty - 6 freq fufft - 5 freq feyfty - 1 freq foubeit - 7 freq fobbit - 1 freq feefty - 1 freq fived - 1 freq €˜fifty - 1 freq fifd - 1 freq fabbydoo - 1 freq |
MetaPhone code - FFT vivid - 14 freq fight - 94 freq fifty - 161 freq fuftie - 4 freq fuffed - 1 freq fifety - 1 freq fift - 14 freq 'phhft - 3 freq phffft - 1 freq 'f-fit - 1 freq faught - 2 freq foofed - 1 freq fiftay - 1 freq feight - 3 freq fiftie - 12 freq fought - 19 freq fïftie - 1 freq fyft - 1 freq fyftie - 1 freq fufty - 6 freq foght - 1 freq fufft - 5 freq 'vivid' - 1 freq feyfty - 1 freq feefty - 1 freq feght - 1 freq fived - 1 freq €˜fifty - 1 freq fifd - 1 freq |
FIFT |
| Time to execute Levenshtein function - 0.188506 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.331844 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.030667 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.036620 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.000821 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. |