| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fearfu (0) - 14 freq fearfa (1) - 1 freq fearfou (1) - 1 freq fearful (1) - 9 freq fearfae (2) - 1 freq fearie (2) - 2 freq feary (2) - 1 freq feart' (2) - 1 freq fearty (2) - 2 freq feard (2) - 1 freq feart (2) - 537 freq ferful (2) - 2 freq feared (2) - 35 freq feckfu (2) - 12 freq tearful (2) - 2 freq arfu (2) - 1 freq fear' (2) - 1 freq fears (2) - 40 freq fear't (2) - 1 freq fekfu (2) - 8 freq feardy (2) - 2 freq perfu (2) - 1 freq weafu (2) - 1 freq fearin (2) - 4 freq earful (2) - 2 freq |
fearfu (0) - 14 freq fearfou (1) - 1 freq fearfa (1) - 1 freq fearfae (2) - 1 freq fearful (2) - 9 freq fears (3) - 40 freq fear' (3) - 1 freq fekfu (3) - 8 freq arfu (3) - 1 freq fearce (3) - 1 freq fearin (3) - 4 freq perfu (3) - 1 freq feardy (3) - 2 freq ferful (3) - 2 freq feard (3) - 1 freq fearty (3) - 2 freq fear (3) - 415 freq fearit (3) - 3 freq feart (3) - 537 freq feared (3) - 35 freq fearie (3) - 2 freq feary (3) - 1 freq ferly (4) - 20 freq fermi (4) - 5 freq derf (4) - 2 freq |
SoundEx code - F610 far-off - 3 freq forbye - 427 freq forby - 491 freq faur-aff - 10 freq furbye - 6 freq 'forby - 1 freq fearfu - 14 freq firbye - 29 freq furby - 29 freq 'forbye - 3 freq forbye' - 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 - 14 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 |
FEARFU |
| Time to execute Levenshtein function - 0.196234 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.328948 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.027267 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.036741 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.000837 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. |