Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
flavourin (0) - 1 freq favourin (1) - 1 freq flavouring (1) - 1 freq flavoured (2) - 1 freq favouring (2) - 1 freq savourin (2) - 7 freq flavour (2) - 27 freq flavours (2) - 3 freq favourit (2) - 7 freq labourin (2) - 3 freq faivourin (2) - 1 freq favourt (3) - 5 freq flooerin (3) - 4 freq favour (3) - 69 freq claverin (3) - 8 freq clourin (3) - 1 freq featurin (3) - 8 freq flouerin (3) - 2 freq flatterin (3) - 1 freq favour's (3) - 1 freq glaurin (3) - 1 freq clamouran (3) - 1 freq lourin (3) - 8 freq favourist (3) - 1 freq flairin (3) - 2 freq |
flavourin (0) - 1 freq flavouring (2) - 1 freq favourin (2) - 1 freq flavour (3) - 27 freq faivourin (3) - 1 freq flavoured (3) - 1 freq flavours (3) - 3 freq florin (4) - 4 freq claverin (4) - 8 freq flarin (4) - 3 freq flouerin (4) - 2 freq flooerin (4) - 4 freq labourin (4) - 3 freq favouring (4) - 1 freq flairin (4) - 2 freq savourin (4) - 7 freq favourit (4) - 7 freq slaverin (4) - 11 freq slavours (5) - 1 freq favoured (5) - 12 freq flaran (5) - 1 freq faavourt (5) - 1 freq favourite (5) - 234 freq faivourit (5) - 1 freq claiverin (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 - FLFRN flafferin - 3 freq flavourin - 1 freq flufferin - 1 freq |
FLAVOURIN |
Time to execute Levenshtein function - 0.204523 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.475472 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.029248 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.039885 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.000982 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. |