| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fitever (0) - 14 freq fite'er (1) - 1 freq witever (1) - 2 freq filever (1) - 1 freq firever (1) - 4 freq finever (1) - 2 freq fitiver (1) - 66 freq riever (2) - 2 freq fever (2) - 37 freq fativer (2) - 1 freq forever (2) - 75 freq fooever (2) - 1 freq fit've (2) - 1 freq fitivir (2) - 2 freq whitever (2) - 167 freq fivver (2) - 4 freq finiver (2) - 18 freq furever (2) - 8 freq fitivver (2) - 31 freq firiver (2) - 2 freq fittiver (2) - 4 freq fiver (2) - 46 freq fitter (2) - 5 freq siever (2) - 2 freq fither (2) - 12 freq |
fitever (0) - 14 freq fitiver (1) - 66 freq fativer (2) - 1 freq fitivir (2) - 2 freq finever (2) - 2 freq fite'er (2) - 1 freq firever (2) - 4 freq witever (2) - 2 freq filever (2) - 1 freq fittiver (3) - 4 freq fitivver (3) - 31 freq firiver (3) - 2 freq fiter (3) - 1 freq furever (3) - 8 freq fither (3) - 12 freq fitter (3) - 5 freq fiver (3) - 46 freq finiver (3) - 18 freq forever (3) - 75 freq fooever (3) - 1 freq fever (3) - 37 freq fivver (3) - 4 freq fuither (4) - 6 freq efiter (4) - 1 freq faither (4) - 1391 freq |
SoundEx code - F316 fitprints - 8 freq fitivver - 31 freq fitever - 14 freq faut-free - 2 freq fitiver - 66 freq fit-ivver's - 1 freq 'fitivver - 1 freq fitprents - 1 freq fuitprents - 1 freq fittiver - 4 freq fitbrig - 1 freq footprints - 6 freq fitprent - 1 freq futprints - 1 freq €˜fativer - 1 freq fativer - 1 freq fuitprints - 1 freq fitiver's - 1 freq fitivir - 2 freq footbridge - 1 freq fit-for-fit - 1 freq fittivir - 1 freq fittiebar - 10 freq fittiebariscalling - 1 freq fittiebarchunty - 1 freq fedupboredstiff - 10 freq |
MetaPhone code - FTFR fitivver - 31 freq fitever - 14 freq faut-free - 2 freq fitiver - 66 freq 'fitivver - 1 freq fittiver - 4 freq €˜fativer - 1 freq fativer - 1 freq fitivir - 2 freq fittivir - 1 freq |
FITEVER |
| Time to execute Levenshtein function - 0.205567 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.362164 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.027763 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.037053 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.000912 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. |