| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| furv (0) - 1 freq furm (1) - 20 freq furr (1) - 12 freq furd (1) - 2 freq fuv (1) - 1 freq furk (1) - 1 freq fur' (1) - 1 freq furl (1) - 6 freq fur (1) - 7713 freq fury (1) - 32 freq furt (1) - 13 freq furs (1) - 6 freq fure (1) - 1 freq urr (2) - 40 freq juv (2) - 1 freq burp (2) - 9 freq lurk (2) - 2 freq gfur (2) - 1 freq ury (2) - 2 freq fuel (2) - 45 freq fare (2) - 64 freq fart (2) - 29 freq hure (2) - 12 freq fmrj (2) - 1 freq furly (2) - 10 freq |
furv (0) - 1 freq fur (2) - 7713 freq fury (2) - 32 freq fure (2) - 1 freq furl (2) - 6 freq furt (2) - 13 freq furs (2) - 6 freq furm (2) - 20 freq fur' (2) - 1 freq furd (2) - 2 freq furr (2) - 12 freq fuv (2) - 1 freq furk (2) - 1 freq faur (3) - 728 freq fire (3) - 705 freq fev (3) - 1 freq curvy (3) - 3 freq farg (3) - 1 freq ferr (3) - 48 freq afure (3) - 2 freq farl (3) - 5 freq fora (3) - 3 freq ferm (3) - 340 freq jarv (3) - 15 freq ferd (3) - 2 freq |
SoundEx code - F610 far-off - 3 freq forbye - 429 freq forby - 497 freq faur-aff - 10 freq furbye - 6 freq 'forby - 1 freq fearfu - 15 freq firbye - 29 freq furby - 29 freq 'forbye - 3 freq forbye' - 1 freq firbaw - 1 freq fearfa - 1 freq forebye - 59 freq fearfou - 1 freq foreby - 2 freq frapp - 1 freq firby - 1 freq far-aff - 6 freq fearfae - 1 freq fairfaw - 1 freq freebee - 1 freq forbye- - 1 freq freebie - 2 freq €œforby - 1 freq €œforbye - 1 freq for-bye - 2 freq €˜forby - 1 freq forbae - 1 freq furv - 1 freq fairfaaye - 11 freq freeview - 1 freq |
MetaPhone code - FRF far-off - 3 freq faur-aff - 10 freq fearfu - 15 freq fearfa - 1 freq verify - 2 freq fearfou - 1 freq far-aff - 6 freq virrfu - 3 freq fearfae - 1 freq fairfaw - 1 freq verve - 2 freq furv - 1 freq freeview - 1 freq |
FURV |
| Time to execute Levenshtein function - 0.175886 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.361276 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.027963 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.045315 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.001154 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. |