Algorithms for correcting recognition results using N-grams


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

This paper studies the application of N-grams for correcting the results of pattern recognition of words in documents based on the example of recognition of passport fields of a citizen of the Russian Federation. Three algorithms for correcting recognition results are given for trigrams. One of them is based on the use of trigram probabilities in combination with evaluation of recognition. The other algorithms are based on the definition of marginal distributions and computations by means of graphical probability models. The results of experiments on the application of the algorithms and comparison of the characteristics of the algorithms are presented.

About the authors

T. V. Manzhikov

Institute of System Analysis, Informatics and Management Federal Research Center

Author for correspondence.
Email: tmanzhikov@gmail.com
Russian Federation, Moscow, 117312

O. A. Slavin

Institute of System Analysis, Informatics and Management Federal Research Center

Email: tmanzhikov@gmail.com
Russian Federation, Moscow, 117312

I. A. Faradjev

Institute of System Analysis, Informatics and Management Federal Research Center

Email: tmanzhikov@gmail.com
Russian Federation, Moscow, 117312

I. M. Janiszewski

Institute of System Analysis, Informatics and Management Federal Research Center

Email: tmanzhikov@gmail.com
Russian Federation, Moscow, 117312

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2017 Pleiades Publishing, Ltd.