| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| furtivver (0) - 2 freq firivver (2) - 5 freq furiver (2) - 1 freq fitivver (2) - 31 freq farivver (2) - 9 freq forivver (2) - 9 freq furtive (2) - 2 freq fanivver (3) - 6 freq furriner (3) - 1 freq furgive (3) - 4 freq fariver (3) - 10 freq furniter (3) - 3 freq fa-ivver (3) - 2 freq whitivver (3) - 39 freq foriver (3) - 30 freq quativer (3) - 4 freq fittiver (3) - 4 freq fativer (3) - 1 freq fivver (3) - 4 freq firivwver (3) - 1 freq 'fitivver (3) - 1 freq furrier (3) - 1 freq fitiver (3) - 66 freq faaivver (3) - 26 freq faanivver (3) - 1 freq |
furtivver (0) - 2 freq farivver (3) - 9 freq fitivver (3) - 31 freq forivver (3) - 9 freq firivver (3) - 5 freq furtive (4) - 2 freq furiver (4) - 1 freq finivver (5) - 3 freq further (5) - 158 freq faanivver (5) - 1 freq faaivver (5) - 26 freq fitiver (5) - 66 freq faivver (5) - 4 freq firriver (5) - 1 freq forevvir (5) - 5 freq 'fitivver (5) - 1 freq firiver (5) - 2 freq fooivver (5) - 2 freq fuivvir (5) - 1 freq furever (5) - 8 freq foriver (5) - 30 freq fa-ivver (5) - 2 freq fanivver (5) - 6 freq fariver (5) - 10 freq firivwver (5) - 1 freq |
SoundEx code - F631 fruitfu - 5 freq fortepianas - 1 freq forty-five - 2 freq forty-fower - 6 freq furtive - 2 freq fortified - 4 freq forty-four - 1 freq fretful - 2 freq forritfor - 1 freq fourth-fleer - 1 freq fruitful - 2 freq frothfly - 1 freq faur-i-the-buik - 3 freq forteviot - 1 freq fortifed - 1 freq fortyfive - 2 freq far-i-the-buik - 1 freq furtivver - 2 freq forrat-pyntin - 1 freq fortify - 1 freq €œforty-five - 1 freq furtiverwiys - 1 freq fridayfun - 1 freq feardie-baa - 1 freq forthepeeps - 1 freq |
MetaPhone code - FRTFR forty-four - 1 freq forritfor - 1 freq furtivver - 2 freq |
FURTIVVER |
| Time to execute Levenshtein function - 0.477825 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.497691 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.029438 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.041506 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.000911 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. |