| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| barrowful (0) - 2 freq barrowfu (1) - 2 freq barraful (2) - 1 freq sorrowful (2) - 2 freq barrows (3) - 1 freq barrafu (3) - 2 freq barrowman (3) - 1 freq barrowafc (3) - 1 freq barroun (3) - 1 freq carroll (4) - 6 freq yarrows (4) - 1 freq narrowin (4) - 5 freq barbour (4) - 17 freq barlow (4) - 1 freq narrowly (4) - 1 freq burrow (4) - 7 freq baronial (4) - 1 freq borrowed (4) - 6 freq narrows (4) - 3 freq baroque (4) - 7 freq barronis (4) - 1 freq sorracful (4) - 1 freq borrowin (4) - 5 freq burrowin (4) - 2 freq sorraeful (4) - 1 freq |
barrowful (0) - 2 freq barrowfu (2) - 2 freq sorrowful (3) - 2 freq barraful (3) - 1 freq barrowafc (4) - 1 freq barrowman (5) - 1 freq barrafu (5) - 2 freq barrows (5) - 1 freq borrowing (6) - 5 freq barrowload (6) - 1 freq sorraeful (6) - 1 freq burrowin (6) - 2 freq burrowed (6) - 1 freq borrowin (6) - 5 freq burrows (6) - 5 freq borrow-foo (6) - 1 freq barrel (6) - 42 freq borrow (6) - 16 freq barrafae (6) - 1 freq barrmill (6) - 2 freq sorracful (6) - 1 freq narrowly (6) - 1 freq borrowed (6) - 6 freq burrow (6) - 7 freq barroun (6) - 1 freq |
SoundEx code - B614 barraful'll - 1 freq barraful - 1 freq bravely - 8 freq birblin - 1 freq birples - 1 freq briefly - 19 freq berryfields - 1 freq borrow-foo'll - 1 freq bravelies - 2 freq bearable - 5 freq barrowful - 2 freq überfließt - 1 freq bor-fly - 1 freq brieflie - 1 freq breefly - 1 freq |
MetaPhone code - BRFL barraful - 1 freq bravely - 8 freq briefly - 19 freq borrow-foo'll - 1 freq barrowful - 2 freq bor-fly - 1 freq brieflie - 1 freq breefly - 1 freq |
BARROWFUL |
| Time to execute Levenshtein function - 0.185332 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.363757 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.029286 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.038247 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.000899 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. |