| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| flavour (0) - 27 freq flavours (1) - 3 freq favour (1) - 69 freq faavour (1) - 1 freq fauvour (2) - 3 freq flavoured (2) - 1 freq clamour (2) - 8 freq 'labour (2) - 1 freq slavours (2) - 1 freq flaur (2) - 1 freq famour (2) - 1 freq flour (2) - 15 freq flayvur (2) - 1 freq lamour (2) - 1 freq faavourt (2) - 1 freq glamour (2) - 29 freq labour (2) - 276 freq savour (2) - 18 freq favours (2) - 22 freq favourt (2) - 5 freq flavourin (2) - 1 freq fervour (2) - 2 freq favor (2) - 1 freq flavouring (3) - 1 freq slaver (3) - 6 freq |
flavour (0) - 27 freq faavour (2) - 1 freq flayvur (2) - 1 freq flavours (2) - 3 freq favour (2) - 69 freq flour (3) - 15 freq flavourin (3) - 1 freq fervour (3) - 2 freq flaur (3) - 1 freq fauvour (3) - 3 freq favor (3) - 1 freq flavoured (3) - 1 freq floor (4) - 87 freq clavier (4) - 1 freq claver (4) - 14 freq fleur (4) - 1 freq faevor (4) - 1 freq floar (4) - 6 freq flooer (4) - 151 freq flair (4) - 398 freq fvor (4) - 1 freq flamer (4) - 1 freq filever (4) - 1 freq flava (4) - 1 freq flor (4) - 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 - FLFR flavour - 27 freq fluffer - 3 freq flayvur - 1 freq flaffer - 3 freq filever - 1 freq |
FLAVOUR |
| Time to execute Levenshtein function - 0.272802 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.353475 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.027448 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.038129 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.000944 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. |