| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| full-frontal (0) - 1 freq full-linth (5) - 1 freq frontal (5) - 1 freq full-on (5) - 5 freq full-grown (5) - 1 freq full-scale (6) - 1 freq fellow-mortal (6) - 1 freq quayfront (6) - 1 freq full-rigged (6) - 1 freq pull-oot (6) - 1 freq fullfill (6) - 3 freq bullfrog (6) - 8 freq fundemental (6) - 2 freq hard-fronted (6) - 1 freq y-fronts (6) - 2 freq hill-forts (6) - 1 freq forefront (6) - 5 freq fundamental (6) - 24 freq frontae (6) - 1 freq ffrontit (6) - 1 freq ill-gruntit (6) - 1 freq full-blown (6) - 2 freq functional (6) - 11 freq full-boukit (6) - 1 freq full-fed (6) - 1 freq |
full-frontal (0) - 1 freq full-linth (8) - 1 freq fellow-mortal (9) - 1 freq ill-gruntit (9) - 1 freq hill-forts (9) - 1 freq full-grown (9) - 1 freq frontal (9) - 1 freq full-on (9) - 5 freq full-fed (10) - 1 freq shop-front (10) - 1 freq full-boukit (10) - 1 freq ill-farrant (10) - 1 freq ffrontit (10) - 1 freq well-traint (10) - 1 freq near-front (10) - 1 freq full-length (10) - 2 freq ill-faurt (10) - 1 freq hard-fronted (10) - 1 freq fullfill (10) - 3 freq full-rigged (10) - 1 freq full-scale (10) - 1 freq forefront (10) - 5 freq y-fronts (10) - 2 freq well-kent (11) - 4 freq quayfront (11) - 1 freq |
SoundEx code - F416 flavour - 27 freq flippers - 15 freq flipper - 2 freq flappers - 5 freq flapper - 5 freq fluffer - 3 freq flafferin - 3 freq foul-breathing - 1 freq flavourin - 1 freq flebbergestit - 1 freq foolproof - 1 freq flayvur - 1 freq flavoured - 1 freq flufferin - 1 freq flaffer - 3 freq filever - 1 freq filbert - 3 freq flavouring - 1 freq foulie-formed - 1 freq full-frontal - 1 freq flavours - 3 freq flabbergastit - 1 freq flabbergasted - 1 freq fielfriday - 2 freq |
MetaPhone code - FLFRNTL full-frontal - 1 freq |
FULL-FRONTAL |
| Time to execute Levenshtein function - 0.230122 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.412285 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.028932 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.044422 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.000967 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. |