| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| funnier (0) - 7 freq funcier (1) - 1 freq funner (1) - 1 freq funcied (2) - 7 freq hunnder (2) - 1 freq fundiet (2) - 1 freq funie (2) - 1 freq funcies (2) - 5 freq hunnger (2) - 5 freq funnel (2) - 7 freq fancier (2) - 3 freq funcie (2) - 1 freq wunner (2) - 282 freq 'unnser (2) - 2 freq funder (2) - 1 freq cannier (2) - 1 freq funnily (2) - 6 freq funned (2) - 2 freq runner (2) - 19 freq finnger (2) - 6 freq sunnie (2) - 1 freq unner (2) - 461 freq gunner (2) - 2 freq bonnier (2) - 24 freq dunnie (2) - 6 freq |
funnier (0) - 7 freq funner (1) - 1 freq funcier (2) - 1 freq gunner (3) - 2 freq bonnier (3) - 24 freq unner (3) - 461 freq funned (3) - 2 freq finnie (3) - 1 freq finnger (3) - 6 freq funnin (3) - 7 freq hunner (3) - 442 freq fannies (3) - 12 freq dunner (3) - 6 freq funnily (3) - 6 freq funnert (3) - 2 freq runner (3) - 19 freq fancier (3) - 3 freq cannier (3) - 1 freq wunner (3) - 282 freq funnel (3) - 7 freq funder (3) - 1 freq fanned (4) - 9 freq fennin (4) - 53 freq funfair (4) - 1 freq binner (4) - 2 freq |
SoundEx code - F560 finer - 14 freq finerie - 2 freq fooner - 4 freq finery - 5 freq funner - 1 freq faemier - 2 freq famour - 1 freq funnier - 7 freq fweohnor - 1 freq fnaar - 2 freq fwmre - 1 freq |
MetaPhone code - FNR finer - 14 freq vanir - 5 freq finerie - 2 freq fooner - 4 freq finery - 5 freq funner - 1 freq funnier - 7 freq venera - 2 freq veneer - 1 freq fnaar - 2 freq |
FUNNIER |
| Time to execute Levenshtein function - 0.231847 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.370877 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.027919 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.037277 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.000902 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. |