| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| flavours (0) - 3 freq flavour (1) - 27 freq favours (1) - 22 freq slavours (1) - 1 freq favour (2) - 69 freq flavoured (2) - 1 freq labours (2) - 5 freq flavourin (2) - 1 freq favour's (2) - 1 freq faavour (2) - 1 freq faavourt (2) - 1 freq savours (2) - 1 freq fauvours (2) - 1 freq floours (2) - 1 freq favourt (2) - 5 freq labour' (3) - 1 freq glaurs (3) - 1 freq flappers (3) - 5 freq claturs (3) - 1 freq fleurs (3) - 2 freq flaur (3) - 1 freq flour (3) - 15 freq faamous (3) - 1 freq savoury (3) - 1 freq favoured (3) - 12 freq |
flavours (0) - 3 freq slavours (2) - 1 freq favours (2) - 22 freq flavour (2) - 27 freq floours (3) - 1 freq fauvours (3) - 1 freq flavourin (3) - 1 freq flavoured (3) - 1 freq flayvur (4) - 1 freq clavers (4) - 15 freq slavers (4) - 12 freq floors (4) - 22 freq flooers (4) - 197 freq flairs (4) - 16 freq floo'rs (4) - 1 freq fleurs (4) - 2 freq flouers (4) - 67 freq faavourt (4) - 1 freq savours (4) - 1 freq labours (4) - 5 freq faavour (4) - 1 freq favour's (4) - 1 freq favour (4) - 69 freq favourt (4) - 5 freq flocers (5) - 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 - FLFRS flavours - 3 freq |
FLAVOURS |
| Time to execute Levenshtein function - 0.228468 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.385441 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.029224 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.037638 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.000948 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. |