| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| finiver (0) - 18 freq firiver (1) - 2 freq finivver (1) - 3 freq feniver (1) - 1 freq fitiver (1) - 65 freq finever (1) - 2 freq €œniver (2) - 5 freq finer (2) - 14 freq finisher (2) - 1 freq fivver (2) - 4 freq faiver (2) - 3 freq fitivir (2) - 2 freq finger (2) - 193 freq 'niver (2) - 2 freq fariver (2) - 10 freq €˜niver (2) - 1 freq fitivver (2) - 31 freq finite (2) - 3 freq inver (2) - 1 freq firever (2) - 3 freq fiver (2) - 46 freq foriver (2) - 30 freq finnger (2) - 6 freq fativer (2) - 1 freq niver (2) - 849 freq |
finiver (0) - 18 freq finever (1) - 2 freq feniver (1) - 1 freq fanivir (2) - 1 freq fitiver (2) - 65 freq firiver (2) - 2 freq finivver (2) - 3 freq firivir (3) - 14 freq fouaniver (3) - 2 freq foriver (3) - 30 freq faaiver (3) - 1 freq fativer (3) - 1 freq niver (3) - 849 freq fooiver (3) - 14 freq fitever (3) - 14 freq fanivver (3) - 6 freq finder (3) - 5 freq fiver (3) - 46 freq filever (3) - 1 freq furiver (3) - 1 freq firever (3) - 3 freq finger (3) - 193 freq 'niver (3) - 2 freq faiver (3) - 3 freq fivver (3) - 4 freq |
SoundEx code - F516 fanfare - 5 freq finiver - 18 freq fanivver - 6 freq finivver - 3 freq fanivir - 1 freq feniver - 1 freq fouaniver - 2 freq faanivver - 1 freq finever - 2 freq fionabruce - 1 freq fmaaberdeen - 1 freq fonpre - 1 freq fymywyubfr - 1 freq funfair - 1 freq |
MetaPhone code - FNFR fanfare - 5 freq finiver - 18 freq fanivver - 6 freq finivver - 3 freq fanivir - 1 freq feniver - 1 freq fouaniver - 2 freq faanivver - 1 freq finever - 2 freq funfair - 1 freq |
FINIVER |
| Time to execute Levenshtein function - 0.238055 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.381700 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.030986 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.042422 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.000945 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. |