| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| flab (0) - 2 freq flaw (1) - 8 freq flyb (1) - 1 freq slab (1) - 32 freq blab (1) - 3 freq flan (1) - 3 freq flak (1) - 6 freq flap (1) - 32 freq flax (1) - 3 freq flay (1) - 2 freq flag (1) - 70 freq flae (1) - 2 freq flam (1) - 3 freq lab (1) - 29 freq flav (1) - 1 freq flat (1) - 274 freq flamb (1) - 1 freq alab (1) - 1 freq fab (1) - 18 freq flem (2) - 1 freq bab (2) - 13 freq flail (2) - 5 freq glar (2) - 7 freq frac (2) - 3 freq cab (2) - 16 freq |
flab (0) - 2 freq flyb (1) - 1 freq flav (2) - 1 freq lab (2) - 29 freq flam (2) - 3 freq flat (2) - 274 freq flamb (2) - 1 freq flaw (2) - 8 freq fab (2) - 18 freq flae (2) - 2 freq alab (2) - 1 freq flan (2) - 3 freq flag (2) - 70 freq slab (2) - 32 freq flak (2) - 6 freq blab (2) - 3 freq flax (2) - 3 freq flay (2) - 2 freq flap (2) - 32 freq flie (3) - 9 freq flet (3) - 30 freq folae (3) - 1 freq flr (3) - 3 freq foal (3) - 2 freq fala (3) - 1 freq |
SoundEx code - F410 flip - 9 freq flap - 32 freq floppy - 5 freq fluffy - 20 freq flype - 3 freq flyp - 3 freq flaff - 5 freq flab - 2 freq flee-up - 2 freq follae-up - 4 freq follow-up - 2 freq flop - 4 freq fluff - 5 freq fleep - 1 freq flyb - 1 freq flava - 1 freq flav - 1 freq flp - 2 freq |
MetaPhone code - FLB flab - 2 freq flyb - 1 freq |
FLAB |
| Time to execute Levenshtein function - 0.219773 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.396401 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.027717 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.038032 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.000931 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. |