| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| burp (0) - 9 freq burn (1) - 455 freq burr (1) - 2 freq bury (1) - 24 freq burg (1) - 1 freq burt (1) - 2 freq bure (1) - 3 freq bump (1) - 23 freq burl (1) - 6 freq burd (1) - 91 freq bur (1) - 8 freq bern (2) - 10 freq cup (2) - 316 freq hure (2) - 12 freq irp (2) - 2 freq brurs (2) - 1 freq hurd (2) - 2 freq furk (2) - 1 freq phrp (2) - 1 freq buon (2) - 1 freq qrp (2) - 1 freq burlt (2) - 1 freq uzp (2) - 1 freq uujp (2) - 1 freq burnt (2) - 90 freq |
burp (0) - 9 freq bump (2) - 23 freq burl (2) - 6 freq bur (2) - 8 freq bure (2) - 3 freq burd (2) - 91 freq burn (2) - 455 freq burt (2) - 2 freq burr (2) - 2 freq bury (2) - 24 freq burg (2) - 1 freq bhp (3) - 1 freq ber (3) - 4 freq barn (3) - 68 freq burly (3) - 6 freq buir (3) - 10 freq tarp (3) - 1 freq berg (3) - 1 freq byro (3) - 1 freq bp (3) - 9 freq burou (3) - 1 freq borg (3) - 1 freq baurs (3) - 21 freq buird (3) - 52 freq berr (3) - 2 freq |
SoundEx code - B610 brave - 134 freq bribe - 3 freq barrafu - 2 freq 'brave - 1 freq barbie - 3 freq brief - 38 freq bravi - 1 freq barrowfu - 2 freq brev - 31 freq baarafu - 2 freq broup - 1 freq burp - 9 freq barf - 7 freq borrow-foo - 1 freq burraview - 2 freq beryaev - 1 freq brave' - 1 freq €˜brief - 1 freq buuuurp - 1 freq barrafae - 1 freq bruv - 2 freq brava - 1 freq byrb - 1 freq byreboy - 1 freq bref - 1 freq |
MetaPhone code - BRP broup - 1 freq burp - 9 freq buuuurp - 1 freq |
BURP |
| Time to execute Levenshtein function - 0.171846 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.346602 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.028034 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.037882 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.000890 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. |