| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| flebbergestit (0) - 1 freq flabbergastit (2) - 1 freq flabbergasted (4) - 1 freq leeberatit (5) - 1 freq froestit (6) - 1 freq interestit (6) - 71 freq slebbers (6) - 2 freq exeestit (6) - 1 freq freestit (6) - 1 freq everlestin (6) - 1 freq slebberin (6) - 1 freq leeberatin (6) - 1 freq fleetit (6) - 2 freq deforestit (6) - 1 freq energetic (6) - 5 freq fermentit (6) - 3 freq leibertie (6) - 1 freq cleverest (6) - 4 freq florestii (6) - 1 freq albeest (7) - 1 freq cheeriest (7) - 1 freq blabberin (7) - 2 freq fleeces (7) - 8 freq fleetin (7) - 20 freq reestit (7) - 11 freq |
flebbergestit (0) - 1 freq flabbergastit (2) - 1 freq flabbergasted (5) - 1 freq leeberatit (9) - 1 freq freestit (10) - 1 freq florestii (10) - 1 freq froestit (10) - 1 freq slebbers (10) - 2 freq flistit (11) - 1 freq frostit (11) - 9 freq celebtratit (11) - 1 freq browstit (11) - 1 freq breistit (11) - 5 freq bruistit (11) - 1 freq burstit (11) - 1 freq clabbert (11) - 2 freq clabbers (11) - 1 freq largest (11) - 5 freq memberstate (11) - 1 freq lairgest (11) - 9 freq freistit (11) - 1 freq celebratit (11) - 17 freq forgett (11) - 1 freq forecastit (11) - 1 freq brustit (11) - 2 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 - FLBRJSTT flebbergestit - 1 freq |
FLEBBERGESTIT |
| Time to execute Levenshtein function - 0.323349 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.512325 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.028490 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.039364 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.000968 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. |