| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| furwur (0) - 1 freq nurtur (2) - 1 freq furrum (2) - 1 freq murdur (2) - 1 freq furder (2) - 53 freq wurkur (2) - 3 freq curmur (2) - 3 freq murmur (2) - 7 freq furr (2) - 12 freq futur (2) - 22 freq muthur (3) - 1 freq further (3) - 158 freq farmer (3) - 9 freq durer (3) - 1 freq fursht (3) - 1 freq featur (3) - 5 freq purer (3) - 2 freq furget (3) - 29 freq furlin (3) - 15 freq fervour (3) - 2 freq burbury (3) - 2 freq f'ower (3) - 1 freq ferder (3) - 10 freq duror (3) - 1 freq fuckum (3) - 1 freq |
furwur (0) - 1 freq furr (3) - 12 freq furder (3) - 53 freq firmer (4) - 4 freq sarwar (4) - 3 freq farter (4) - 1 freq flower (4) - 16 freq furry (4) - 23 freq furwaird (4) - 1 freq ferdir (4) - 1 freq farder (4) - 31 freq fewer (4) - 11 freq firwid (4) - 1 freq fermer (4) - 194 freq forwart (4) - 4 freq faurer (4) - 36 freq forder (4) - 97 freq farfir (4) - 2 freq former (4) - 40 freq furever (4) - 8 freq farr (4) - 1 freq forewurd (4) - 1 freq forwird (4) - 2 freq friar (4) - 1 freq fyower (4) - 1 freq |
SoundEx code - F660 ferrer - 8 freq fower-year - 2 freq farrer - 27 freq freyre - 4 freq faurer - 36 freq fore'er - 1 freq ferrier - 6 freq farrar - 1 freq farar - 1 freq friary - 2 freq ferrari - 3 freq fairer - 12 freq faarer - 6 freq fiihrer - 1 freq freyr - 1 freq free-er - 1 freq frier - 1 freq furrier - 1 freq farrier - 2 freq fower-oor - 1 freq freear - 1 freq freer - 2 freq friar - 1 freq führer - 1 freq farer - 1 freq furwur - 1 freq freoor - 1 freq ferrero - 1 freq fryer - 3 freq |
MetaPhone code - FRWR furwur - 1 freq |
FURWUR |
| Time to execute Levenshtein function - 0.302443 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.519323 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.061752 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.037194 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.001018 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. |