| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ficher (0) - 4 freq sicher (1) - 1 freq fisher (1) - 41 freq hicher (1) - 1 freq richer (1) - 15 freq fichter (1) - 1 freq nicher (1) - 5 freq fither (1) - 12 freq picher (1) - 4 freq ticher (1) - 3 freq fichert (1) - 1 freq fiter (2) - 1 freq fidder (2) - 12 freq lither (2) - 1 freq gither (2) - 69 freq ficheren (2) - 1 freq tocher (2) - 25 freq fishes (2) - 17 freq dither (2) - 2 freq riche (2) - 4 freq either (2) - 458 freq bicker (2) - 12 freq lichter (2) - 8 freq michex (2) - 1 freq cipher (2) - 1 freq |
ficher (0) - 4 freq fither (2) - 12 freq ticher (2) - 3 freq fichert (2) - 1 freq nicher (2) - 5 freq picher (2) - 4 freq fichter (2) - 1 freq sicher (2) - 1 freq fisher (2) - 41 freq hicher (2) - 1 freq richer (2) - 15 freq facer (3) - 2 freq ficht (3) - 8 freq fechter (3) - 20 freq taicher (3) - 3 freq father (3) - 86 freq fether (3) - 23 freq fother (3) - 4 freq lecher (3) - 1 freq bucher (3) - 1 freq fichered (3) - 1 freq ficherin (3) - 6 freq heicher (3) - 30 freq fecker (3) - 14 freq archer (3) - 9 freq |
SoundEx code - F260 feigur - 16 freq figure - 106 freq fykier - 1 freq facer - 2 freq figger - 6 freq figur - 2 freq fisher - 41 freq fizzer - 6 freq ficher - 4 freq fucker - 22 freq fissure - 1 freq figir - 11 freq faker - 3 freq fasherie - 5 freq fozier - 1 freq foghar - 1 freq fusker - 1 freq figaro' - 1 freq feegur - 7 freq fisherraw - 2 freq fugiear - 1 freq figurr - 2 freq fígur - 1 freq feeger - 1 freq fâcher - 1 freq fakery - 1 freq fisherrow - 4 freq fecker - 14 freq |
MetaPhone code - FXR voocher - 1 freq fisher - 41 freq ficher - 4 freq voucher - 8 freq vouchir - 5 freq fasherie - 5 freq fisherraw - 2 freq veesior - 1 freq fâcher - 1 freq fisherrow - 4 freq |
FICHER |
| Time to execute Levenshtein function - 0.197614 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.355855 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.028448 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.036956 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.000853 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. |