| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| birlit (0) - 2 freq birsit (1) - 1 freq birlt (1) - 25 freq birrit (1) - 3 freq dirlit (1) - 1 freq birlin (1) - 156 freq birl't (1) - 1 freq tirlit (1) - 2 freq pirlit (1) - 1 freq billia (2) - 1 freq bilet (2) - 3 freq whirlit (2) - 1 freq mirkit (2) - 1 freq curlit (2) - 1 freq willit (2) - 1 freq fillit (2) - 2 freq bullit (2) - 1 freq borrit (2) - 1 freq barkit (2) - 8 freq birlan (2) - 18 freq nirlt (2) - 1 freq tirlt (2) - 2 freq birzin (2) - 3 freq mirlt (2) - 1 freq birblin (2) - 1 freq |
birlit (0) - 2 freq birlt (1) - 25 freq tirlit (2) - 2 freq pirlit (2) - 1 freq birsit (2) - 1 freq birl't (2) - 1 freq burlt (2) - 1 freq birlin (2) - 156 freq birrit (2) - 3 freq dirlit (2) - 1 freq pairlit (3) - 1 freq firlot (3) - 2 freq burit (3) - 1 freq barlic (3) - 1 freq birsilt (3) - 2 freq bilt (3) - 4 freq beirit (3) - 1 freq dirlt (3) - 4 freq barfit (3) - 4 freq buirdit (3) - 1 freq marlit (3) - 1 freq bowlit (3) - 1 freq rilit (3) - 1 freq burnit (3) - 1 freq harlit (3) - 2 freq |
SoundEx code - B643 birlt - 25 freq birled - 69 freq burlt - 1 freq barryload - 1 freq birlit - 2 freq bröled - 1 freq barrelled - 3 freq birl't - 1 freq brillident - 1 freq burled - 2 freq barrowload - 1 freq |
MetaPhone code - BRLT birlt - 25 freq birled - 69 freq burlt - 1 freq barryload - 1 freq birlit - 2 freq bröled - 1 freq barrelled - 3 freq birl't - 1 freq burled - 2 freq barrowload - 1 freq |
BIRLIT |
| Time to execute Levenshtein function - 0.256086 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.410259 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.033324 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.043706 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.001220 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. |