| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nanbreid (0) - 1 freq abreid (2) - 12 freq pan-breid (2) - 2 freq manured (3) - 3 freq wandred (3) - 1 freq albeid (3) - 1 freq 'inbred (3) - 1 freq breid (3) - 230 freq abraid (3) - 11 freq natured (3) - 2 freq android (3) - 6 freq nabbed (3) - 8 freq abreed (3) - 5 freq manheid (3) - 2 freq cankered (4) - 1 freq dreid (4) - 51 freq nairrie (4) - 1 freq 'breid' (4) - 1 freq nailed (4) - 16 freq neared (4) - 3 freq candid (4) - 1 freq baneyerd (4) - 1 freq nare (4) - 1 freq ranced (4) - 1 freq tabled (4) - 1 freq |
nanbreid (0) - 1 freq 'inbred (4) - 1 freq pan-breid (4) - 2 freq abreid (4) - 12 freq abreed (5) - 5 freq nabbed (5) - 8 freq tounbraid (5) - 1 freq numbered (5) - 6 freq android (5) - 6 freq in-bred (5) - 1 freq neebored (5) - 1 freq natured (5) - 2 freq wandred (5) - 1 freq manured (5) - 3 freq breid (5) - 230 freq abraid (5) - 11 freq numbed (6) - 4 freq braid (6) - 256 freq ingrid (6) - 17 freq hybrid (6) - 4 freq hanbrake (6) - 2 freq daunered (6) - 20 freq anyroad (6) - 7 freq abroad (6) - 35 freq labored (6) - 1 freq |
SoundEx code - N516 number - 174 freq numbers - 65 freq nine-bars - 1 freq numbered - 6 freq non-partisan - 2 freq number-plates - 1 freq non-pairty - 1 freq nambarrie - 1 freq number'll - 1 freq nonpareil - 1 freq nanbreid - 1 freq nonpairlament - 1 freq €œnumber - 1 freq nhmbr - 1 freq |
MetaPhone code - NNBRT nanbreid - 1 freq |
NANBREID |
| Time to execute Levenshtein function - 0.235679 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.385106 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.027671 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.038324 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.000932 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. |