| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| navy-blue (0) - 4 freq grey-blue (3) - 3 freq payable (4) - 1 freq blaik-blue (4) - 1 freq ice-blue (4) - 1 freq misty-blue (4) - 1 freq navyne (4) - 3 freq saveable (4) - 1 freq nae-baud (4) - 1 freq table (5) - 674 freq unevytable (5) - 2 freq nave (5) - 1 freq nae-wye (5) - 1 freq hauf-grue (5) - 1 freq playable (5) - 4 freq palpable (5) - 2 freq yabble (5) - 1 freq habble (5) - 2 freq amyelle (5) - 2 freq caapable (5) - 1 freq capable (5) - 25 freq novelle (5) - 4 freq wey-bauk (5) - 1 freq avyse (5) - 4 freq rag-bug (5) - 1 freq |
navy-blue (0) - 4 freq grey-blue (5) - 3 freq unevytable (6) - 2 freq unavoydable (6) - 1 freq unviable (6) - 1 freq saveable (6) - 1 freq enviable (6) - 1 freq nae-baud (6) - 1 freq ice-blue (6) - 1 freq noo-but (7) - 2 freq nibble (7) - 8 freq loveable (7) - 1 freq unvisible (7) - 1 freq noble (7) - 30 freq -able (7) - 1 freq viable (7) - 11 freq nou-but (7) - 1 freq unavoidable (7) - 3 freq unavailable (7) - 1 freq variable (7) - 5 freq valuable (7) - 18 freq unable (7) - 19 freq blue-blae (7) - 1 freq enjeyable (7) - 1 freq inevitable (7) - 26 freq |
SoundEx code - N114 navy-blue - 4 freq nappy-filler - 1 freq naevefils - 1 freq |
MetaPhone code - NFBL navy-blue - 4 freq |
NAVY-BLUE |
| Time to execute Levenshtein function - 0.189273 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.376958 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.033112 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.045374 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.000839 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. |