| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| debrief (0) - 1 freq decried (2) - 3 freq €˜brief (2) - 1 freq debbie (2) - 2 freq debris (2) - 10 freq deerie (2) - 1 freq brief (2) - 38 freq dearie (2) - 37 freq defied (3) - 5 freq darien (3) - 8 freq dorie (3) - 1 freq dries (3) - 8 freq decreed (3) - 9 freq derri- (3) - 2 freq memries (3) - 9 freq series (3) - 89 freq brie (3) - 3 freq perrie (3) - 1 freq debbie's (3) - 1 freq denie (3) - 1 freq mebbies (3) - 58 freq derkies (3) - 1 freq defies (3) - 2 freq beirie (3) - 1 freq serried (3) - 1 freq |
debrief (0) - 1 freq debris (3) - 10 freq brief (3) - 38 freq dearie (4) - 37 freq dreef (4) - 4 freq derf (4) - 2 freq bref (4) - 1 freq decried (4) - 3 freq €˜brief (4) - 1 freq deerie (4) - 1 freq debbie (4) - 2 freq debated (5) - 3 freq driet (5) - 2 freq deere (5) - 3 freq derbie (5) - 2 freq briefs (5) - 2 freq debased (5) - 1 freq debit (5) - 2 freq debate (5) - 81 freq derrida (5) - 1 freq beeriet (5) - 26 freq decree (5) - 12 freq degree (5) - 71 freq o'brien (5) - 1 freq drearie (5) - 1 freq |
SoundEx code - D161 deprive - 3 freq deprived - 7 freq deprivation - 11 freq deprives - 1 freq deprivin - 1 freq depravity - 2 freq deprivat - 1 freq day-afore-peyday - 1 freq debrief - 1 freq dabarbuckle - 3 freq depraved - 1 freq daveraver - 2 freq |
MetaPhone code - TBRF debrief - 1 freq |
DEBRIEF |
| Time to execute Levenshtein function - 0.234740 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.451179 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.027810 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.042067 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.000970 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. |