{'fraction_non_alphanumeric': 0.01463963963963964, 'fraction_numerical': 0.010135135135135136, 'mean_word_length': 4.966442953020135, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Using hidden Markov model for Chinese business card recognition

Business card recognition is a difficult problem. Characters in business card are small with diverse font types. An approach using the left-right hidden Markov model is proposed for business card recognition. The hidden Markov model will output a top-10 candidate list as its recognition result. A postprocessing stage is followed to improve the recognition result. The postprocessing stage uses a bigram table as linguistic information to search for the optimized recognition result from the top-10 candidate list. Our experiments are built on the recognition of company item and address item in Chinese business cards. Bigram table and hidden Markov models are trained with a telephony database. 100 address items and 30 company items are used for testing. Experimental results reveal the validity of our proposed method.