| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| betrothit (0) - 1 freq betrothal (2) - 1 freq detroit (3) - 21 freq betocht (3) - 1 freq trottit (3) - 4 freq betraisit (3) - 1 freq berthet (3) - 1 freq birthit (3) - 3 freq beardit (4) - 2 freq erotic (4) - 4 freq pettit (4) - 13 freq defrostit (4) - 1 freq broth (4) - 70 freq beirit (4) - 1 freq ratrettit (4) - 1 freq approchit (4) - 1 freq meithit (4) - 1 freq berthed (4) - 1 freq broukit (4) - 21 freq detectit (4) - 5 freq berthen (4) - 3 freq pertit (4) - 2 freq stottit (4) - 12 freq belovit (4) - 5 freq detestit (4) - 1 freq |
betrothit (0) - 1 freq betrothal (3) - 1 freq birthit (4) - 3 freq berthet (4) - 1 freq trottit (5) - 4 freq betocht (5) - 1 freq breithit (5) - 1 freq betraisit (5) - 1 freq brocht (6) - 733 freq bertolt (6) - 1 freq birthin (6) - 7 freq retreatit (6) - 7 freq troth (6) - 18 freq bitchit (6) - 1 freq brothel (6) - 2 freq stretchit (6) - 1 freq retortit (6) - 2 freq bettert (6) - 2 freq 'trothed (6) - 1 freq betther (6) - 18 freq brother (6) - 285 freq beetruit (6) - 1 freq broths (6) - 1 freq beetroot (6) - 14 freq burtit (6) - 1 freq |
SoundEx code - B363 bothert - 37 freq buttert - 7 freq bothert- - 1 freq butter'd - 1 freq betrothal - 1 freq bothered - 59 freq boatyaird - 1 freq bathert - 11 freq battered - 37 freq beetroot - 14 freq bathered - 8 freq buttered - 19 freq betrayed - 7 freq battert - 9 freq betteradjistit - 1 freq bedridden - 2 freq bethrayed - 2 freq buddered - 7 freq bettered - 4 freq bother't - 1 freq baithert - 1 freq bithert - 2 freq bed-ridden - 1 freq batthered - 1 freq butter't - 2 freq baitert - 1 freq boathered - 2 freq bettert - 2 freq beetruit - 1 freq betrothit - 1 freq butteret - 1 freq batterit - 1 freq betterthedeilyeken - 1 freq bithered - 2 freq botherd - 1 freq |
MetaPhone code - BTR0T betrothit - 1 freq |
BETROTHIT |
| Time to execute Levenshtein function - 0.210410 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.439594 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.029674 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.041269 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.000858 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. |