Extracting statistics indicators from tables of basic structure

Authors:
P. Yu. Kudinov
Affiliations:
Institution of Russian Academy of Sciences Dorodnicyn Computing Centre of RAS, Moscow, Russia 119333
Venue:
Pattern Recognition and Image Analysis
Year:
2011

Citing 9
Cited 0

Fast parallel and serial approximate string matching

Journal of Algorithms
Algebraic-logic synthesis of correct recognition procedures based on elementary algorithms

Computational Mathematics and Mathematical Physics
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
TINTIN: a system for retrieval in text tables

DL '97 Proceedings of the second ACM international conference on Digital libraries
Decision Tree Induction Based on Efficient Tree Restructuring

Machine Learning
A Space-Economical Suffix Tree Construction Algorithm

Journal of the ACM (JACM)
A guided tour to approximate string matching

ACM Computing Surveys (CSUR)
Approximate String-Matching over Suffix Trees

CPM '93 Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching
Linear pattern matching algorithms

SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of extracting statistical data from a table of a basic structure is considered. The problem of extracting statistical indicators is formally stated. The method for extracting statistical data that analyzes the content of table cells is described. Algorithms for cell type recognition, table structure restoration, and a fuzzy search of the content of text cells are proposed.