| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| brilliant (0) - 161 freq brillant (1) - 1 freq bmilliant (1) - 1 freq brillaint (2) - 1 freq billiart (2) - 1 freq brillident (2) - 1 freq brilliance (2) - 11 freq brilliantly (2) - 2 freq willint (3) - 5 freq trillion (3) - 1 freq gillians (3) - 1 freq gillian (3) - 7 freq failliand (3) - 2 freq billiard (3) - 1 freq ballant (3) - 11 freq brazillian (3) - 1 freq trillions (3) - 1 freq brallin (3) - 1 freq reliant (3) - 3 freq drillin (3) - 13 freq drillit (3) - 1 freq grillin (3) - 2 freq grilling (3) - 1 freq billions (3) - 7 freq lillian (3) - 1 freq |
brilliant (0) - 161 freq brillant (1) - 1 freq brillaint (2) - 1 freq bmilliant (2) - 1 freq brilliantly (3) - 2 freq brilliance (3) - 11 freq brillident (3) - 1 freq ballant (4) - 11 freq brallin (4) - 1 freq billiart (4) - 1 freq billion (5) - 34 freq grilling (5) - 1 freq grillin (5) - 2 freq trillin (5) - 1 freq birlling (5) - 1 freq drillit (5) - 1 freq billionth (5) - 1 freq briant (5) - 1 freq vailleant (5) - 2 freq billions (5) - 7 freq brazillian (5) - 1 freq drillin (5) - 13 freq ebullient (5) - 1 freq willint (5) - 5 freq reliant (5) - 3 freq |
SoundEx code - B645 birlin - 156 freq brilliant - 161 freq barelins - 1 freq barrelin - 1 freq burlin - 8 freq barlinnie - 7 freq birlinn - 8 freq birlins - 1 freq birlan - 18 freq berlin - 14 freq brillant - 1 freq brawlin' - 1 freq brilliance - 11 freq brøllin - 1 freq brölin - 1 freq birlin-gunn - 1 freq bruilyiement - 1 freq brilliantly - 2 freq braelanders - 1 freq brallin - 1 freq bruiliement - 1 freq birling - 1 freq birlling - 1 freq birlinnbooks - 1 freq brolin - 1 freq barrowlands - 2 freq brillaint - 1 freq |
MetaPhone code - BRLNT brilliant - 161 freq brillant - 1 freq brillaint - 1 freq |
BRILLIANT |
| Time to execute Levenshtein function - 0.209731 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.380734 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.029714 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.039161 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.000888 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. |