| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fitivver (0) - 31 freq finivver (1) - 3 freq 'fitivver (1) - 1 freq firivver (1) - 5 freq fitiver (1) - 66 freq fanivver (2) - 6 freq firiver (2) - 2 freq whitivver (2) - 39 freq faaivver (2) - 26 freq fittiver (2) - 4 freq faivver (2) - 4 freq fooivver (2) - 2 freq fivver (2) - 4 freq fitivir (2) - 2 freq fativer (2) - 1 freq fa-ivver (2) - 2 freq firivwver (2) - 1 freq furtivver (2) - 2 freq farivver (2) - 9 freq fitever (2) - 14 freq finiver (2) - 18 freq forivver (2) - 9 freq finisher (3) - 1 freq stivven (3) - 3 freq witever (3) - 2 freq |
fitivver (0) - 31 freq fitiver (2) - 66 freq firivver (2) - 5 freq finivver (2) - 3 freq 'fitivver (2) - 1 freq fa-ivver (3) - 2 freq fativer (3) - 1 freq furtivver (3) - 2 freq forivver (3) - 9 freq fitivir (3) - 2 freq fitever (3) - 14 freq farivver (3) - 9 freq faivver (3) - 4 freq faaivver (3) - 26 freq fanivver (3) - 6 freq fivver (3) - 4 freq fittiver (3) - 4 freq fooivver (3) - 2 freq tvver (4) - 1 freq fuivvir (4) - 1 freq fittivir (4) - 1 freq faanivver (4) - 1 freq fitsoiver (4) - 1 freq finiver (4) - 18 freq firivwver (4) - 1 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 |
FITIVVER |
| Time to execute Levenshtein function - 0.179496 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.337306 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.027416 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.037241 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.000905 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. |