Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
biography (0) - 7 freq biographie (2) - 3 freq geography (2) - 37 freq biographer (2) - 2 freq digraph (3) - 3 freq demography (3) - 4 freq geograph (3) - 2 freq 'geography (3) - 1 freq hagiography (3) - 1 freq digraphs (3) - 4 freq bibliography (3) - 3 freq seaography (3) - 6 freq topography (3) - 2 freq photography (4) - 6 freq autobiography (4) - 2 freq biographical (4) - 5 freq graph (4) - 4 freq biglarry (4) - 1 freq bxageography (4) - 4 freq geographic (4) - 4 freq brashy (4) - 1 freq bourach (4) - 36 freq geographer (4) - 23 freq lithograph (4) - 1 freq orthography (4) - 50 freq |
biography (0) - 7 freq biographie (2) - 3 freq biographer (3) - 2 freq geography (3) - 37 freq geograph (4) - 2 freq seaography (4) - 6 freq digraph (4) - 3 freq topography (5) - 2 freq autobiography (5) - 2 freq graph (5) - 4 freq autograph (5) - 1 freq geographie (5) - 2 freq bibliography (5) - 3 freq demography (5) - 4 freq 'geography (5) - 1 freq hagiography (5) - 1 freq digraphs (5) - 4 freq birthy (6) - 1 freq boorach (6) - 31 freq borrach (6) - 1 freq monograph (6) - 1 freq autographs (6) - 2 freq graphs (6) - 6 freq brashy (6) - 1 freq geographic (6) - 4 freq |
SoundEx code - B261 biography - 7 freq biographical - 5 freq bugger-aff - 1 freq biographer - 2 freq biographie - 3 freq bikerbloke - 1 freq |
MetaPhone code - BKRF biography - 7 freq bugger-aff - 1 freq biographie - 3 freq |
BIOGRAPHY |
Time to execute Levenshtein function - 0.211478 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.376654 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.028204 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.044661 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.001269 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. |