| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fibre (0) - 8 freq fibres (1) - 2 freq fiere (1) - 4 freq fire (1) - 699 freq libre (1) - 1 freq flyre (2) - 1 freq mibe (2) - 3 freq vibe (2) - 9 freq fille (2) - 1 freq fierce (2) - 33 freq fidge (2) - 9 freq aible (2) - 2 freq bible (2) - 93 freq libr (2) - 1 freq firm (2) - 67 freq dire (2) - 9 freq fayre (2) - 8 freq figure (2) - 104 freq eire (2) - 3 freq fiord (2) - 1 freq litre (2) - 11 freq firg (2) - 1 freq fir (2) - 3901 freq fie (2) - 3 freq ible (2) - 1 freq |
fibre (0) - 8 freq fire (2) - 699 freq libre (2) - 1 freq fiere (2) - 4 freq fibres (2) - 2 freq fyber (3) - 1 freq fore (3) - 155 freq flure (3) - 13 freq firey (3) - 2 freq fere (3) - 18 freq fier (3) - 6 freq fibert (3) - 2 freq fure (3) - 1 freq fare (3) - 62 freq fyre (3) - 27 freq faire (3) - 1 freq fowre (3) - 25 freq afiore (3) - 1 freq fibo (3) - 1 freq fable (3) - 8 freq sabre (3) - 2 freq fibf (3) - 1 freq fib (3) - 3 freq firr (3) - 2 freq libra (3) - 2 freq |
SoundEx code - F160 favour - 69 freq fiver - 46 freq fever - 37 freq fa-ivver - 2 freq fever' - 1 freq faavour - 1 freq fauvour - 3 freq five-year - 1 freq fibre - 8 freq fyver - 1 freq fyber - 1 freq fooiver - 14 freq fooivver - 2 freq feb'rie - 1 freq faivver - 4 freq fifer - 11 freq faivir - 2 freq faevir - 2 freq fae'iver - 2 freq faaivver - 26 freq 'faaivver - 1 freq fivver - 4 freq faevor - 1 freq fooever - 1 freq fuivvir - 1 freq favor - 1 freq faaiver - 1 freq faiver - 3 freq fyfer - 1 freq faber - 1 freq €œfaaivver - 1 freq faber- - 1 freq €œfaiver - 2 freq €œfooever - 1 freq fapor - 2 freq |
MetaPhone code - FBR fibre - 8 freq fyber - 1 freq feb'rie - 1 freq vibrio - 1 freq faber - 1 freq faber- - 1 freq vhbr - 1 freq |
FIBRE |
| Time to execute Levenshtein function - 0.171950 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.347175 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.027710 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.037215 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.000842 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. |