From Tessellations to Table Interpretation

  • Authors:

  • Ramana C. Jandhyala;Mukkai Krishnamoorthy;George Nagy;Raghav Padmanabhan;Sharad Seth;William Silversmith

  • Affiliations:

  • DocLab, Rensselaer Polytechnic Institute, Troy, USA 12180;DocLab, Rensselaer Polytechnic Institute, Troy, USA 12180;DocLab, Rensselaer Polytechnic Institute, Troy, USA 12180;DocLab, Rensselaer Polytechnic Institute, Troy, USA 12180;Computer Science and Engineering, University of Nebraska-Lincoln, Lincoln, USA 68502;DocLab, Rensselaer Polytechnic Institute, Troy, USA 12180

  • Venue:
  • Calculemus '09/MKM '09 Proceedings of the 16th Symposium, 8th International Conference. Held as Part of CICM '09 on Intelligent Computer Mathematics
  • Year:
  • 2009

  • Interactive conversion of web tables

    GREC'09 Proceedings of the 8th international conference on Graphics recognition: achievements, challenges, and evolution

  • Factoring web tables

    IEA/AIE'11 Proceedings of the 24th international conference on Industrial engineering and other applications of applied intelligent systems conference on Modern approaches in applied intelligence - Volume Part I

Quantified Score

Hi-index 0.00

Visualization

Abstract

The extraction of the relations of nested table headers to content cells is automated with a view to constructing narrow domain ontologies of semi-structured web data. A taxonomy of tessellations for displaying tabular data is developed. X-Y tessellations that can be obtained by a divide-and-conquer method are asymptotically only an infinitesimal fraction of all partitions of a rectangle into rectangles. Admissible tessellations are the even smaller subset of all partitions that correspond to the structures of published tables and that contain only rectangles produced by successive guillotine cuts. Many of these can be processed automatically. Their structures can be conveniently represented by X-Y trees, which facilitate relating hierarchical row and column headings to content cells. A formal grammar is proposed for characterizing the X-Y trees of layout-equivalent admissible tessellations. Algorithms are presented for transforming a tessellation into an X-Y tree and hence into multidimensional, layout- independent Category Trees (Wang abstract data types).