Extracting objects and their attributes from tables in text documents
- Тип работы:
Узнать стоимость новой
Детальная информация о работе
Выдержка из работы
Extracting Objects and Their Attributes from Tables in Text Documents
Nikita Astrakhantsev astrakhantsev@ispras. ru
Abstract. Extracting information from tables is an important and rather complex part of information retrieval.
For the task of objects extraction from HTML tables we introduce the following methods: determining table orientation, processing of aggregating objects (like Total) and scattered headers (super row labels, subheaders).
Keywords: information extraction- information retrieval- natural language processing- table processing- table extraction- semi-structured information extraction- html- wiki markup.
Significant amount of text information has relational structure, which is often represented in a table view. Since this view is designed for humans and contains many ambiguous elements, it follows that automatic processing of tables is rather complex.
For example, table 1 contains scattered header, complex hierarchical header, special objects, and other elements. They play particular roles in the table and, thus, should be treated in a special way. These elements are described in the rest of the paper.
Another non-trivial task is to determine table orientation: it can be horizontal (row wise, table 1) or vertical (column wise, table 2).
We consider tables in structured formats such as HTML and Wiki markup1. The main goal of our table processing is to extract objects as collections of attribute-value pairs. Thereupon we focus on determining table orientation and understanding the role of each element in the table.
Scattered Special Complex Empty cell
header objects header
CS100 CS100ER CS300
Seat Pitch 32 in (81 cm)
Seat Width 19 in (48 cm)
Flight crew 2 (pilot, co-pilot)
Length 34.9 m (115 ft) 38.0 m (124.7 ft)
1 Wiki markup is a lightweight markup language used to write pages in wiki websites, such as Wikipedia, and is a simplified alternative/intermediate to HTML, http: Ilea, wikipedia. org/wiki/W iki_markup 298
Wingspan 35.1 m (115 ft)
Wing Area (net) 112.3 m2 (1,209 sq ft)
Fuselage max diameter 3.7 m (12 ft)
Cargo Volume 23.2 m3 (820 cu ft) 30 m3 (1,100 cuft)
Max range 4,074 km 5,463 km (2,200 nmi) (2,950 nmi) 4,074 km (2,200 nmi)
Typical cruise speed Mach 0. 78 (828 km/h, 447 kn, 514 mph)
Landing field length 1,350 m (4,430 ft) 1,448 m (4,751 ft)
2 Related work
Silva et al  distinguish five tasks of extraction information from table in their detailed survey:
1. Location: differentiating the table from other text elements such as body text, titles, lists, etc.
2. Segmentation: identifying table cells, rows, and columns and their relative positions.
3. Functional analysis: classifying a table area (cell, column, row) to data or attribute area.
4. Structural analysis: connecting each data cell to all characterizing attribute cells.
5. Interpretation: understanding and further using extracted information.
First of them occurs mostly in plain text and image formats. The last task depends on kind of table usage: generating ontology from tables , mapping extracted information to predefined scheme , and so on.
Our work is devoted to the three last tasks while structural analysis is a principal one.
Early works deal with tables in plain text, usually in ASCII format [4−7]. The main problem here is to detect table, to recognize table delimiters (spaces, tabs, special characters like hyphens, etc), and thereby to understand table structure.
Rus and Summers  consider a text block to be a table if it consists of columns separated by white space and if cells of such columns are lexically persistent. A similar approach is used in the work of Douglas et al. - they group text blocks surrounded by white spaces and use heuristic to determine whether these blocks are parts of tables.
There are many works concerned plain text and most of them use approaches inapplicable for HTML tables. However there are some useful ideas, which were explored in these works and inspired by linguistic characteristics of table content. For example, similarity/cohesion among different table elements (cells/lines/columns) became a common feature in future works including HTML tables oriented ones. Hurst and Douglas  suggest explicit string-based formulas for computing cell values cohesion.
Pinto et al.  present Conditional random field algorithm for classification of each row in ASCII table to one of 12 classes such as «data row», «section header», «super header», etc.
2.2 Image format
The majority of these works are devoted to performing location and segmentation of a table (Tupaj et al. , Wang et al. [9, 10], inter alia).
At a distance, Gatterbauer et al.  process HTML tables treating them as images. More precisely, they distinguish two representations of web pages: DOM tree representation and visual box (topological) representation. Our work is based on the first representation, while their approach is based on the second one, and thereby it cannot be applied to our work.
A main source of HTML tables is Web pages, but many Web-tables are created just for layout, not for representing relational information. Wang and Hu  call such tables non-genuine. They suggest machine learning classifiers (SVM and decision tree) to determine whether the table is genuine or non-genuine. Features are divided into three types: length consistency of the cell contents, type of cell content, and word group.
Chen et al.  apply string and content type similarity to this task. They also use cell similarity for determining table orientation.
Yoshida et al.  suggest Expectation Maximization algorithm for classifying each table into one of 9 predefined types. Ontological knowledge are used as a parameter for the model, e.g. & quot-Name"- and & quot-Birthday"- are more often attributes than values.
Cafarella et al.  process the corpus of 14 billion Web tables. They introduce a tool for synonymic attributes searching (Attribute Correlation Statistics), which can be useful in the task of attribute/value classifying. Also the statistics gathered by authors corroborates the assumption that there is a small set of schemas that most tables in the world conform to.
3 Table orientation
What is an object in a table? Often the answer is obvious. For example, in table 2 objects are two airbuses: A310−200 and A310-
Fire diamond for aluminium shot
As a rough definition, table object is a real world entity, whose attributes are set in the table. We assume that either row or column represents an object. So, table has either horizontal or vertical orientation.
We use 2 machine learning algorithms with the same features to determine table orientation: decision tree and naive Bayes. All features have common nature: some function is computed on horizontal table as well as on vertical one and the difference between obtained values is found.
First feature is the difference in header depth. The function is very simple- it returns the depth of table header hierarchy. E.g. the header depth for horizontal orientation of table 1 is 2, due to Power, hp, and kW cells- the header depth for the vertical table is 1. The header depths for both orientations of table 2 are 1. The motivation is following: orientation with deeper header is more likely to be correct.
Second feature is difference in maximum cell cohesion. Cell cohesion is an average string similarity of all cells in a row or in a column. Average string similarity is computed by summation of all pairwise string similarities/metrics of cells and normalization (dividing by square of total count of cells). Maximum cell cohesion for the horizontal table is simply a maximum of cell cohesion in all rows- the same stands for the vertical one with replacement of rows by columns.
Third feature is the difference in average cell cohesion. The only distinction from the previous feature is that all cell cohesions are summed and then divided by total count of rows or columns.
After experiments with a small set of Wikipedia tables (about 70) we found that the most valuable feature is the difference in average cell cohesion. All other features aren’t presented in decision tree without overlearning (see figure 1).
& lt-= 0. 3 659 & gt- 0. 3 659
Also we experimented with introducing the third type of tables, which contain no object, but effectiveness decreased dramatically. This can be easy explained because even human can’t label classify some table into the third type with confidence. So we don'-t take into account tables without objects.
4 Aggregating objects processing
Some tables contain aggregating objects, which actually store information about other objects from the same table. For example, in table 4 the last row isn'-t an ordinary entity and should be processed in special way.
System Affiliates %
FONASA 12,248,257 72. 69
ISAPRE 2,780,396 16. 50
Total pop. 16,849,081 100. 00
Recognizing such objects by only presence of a keyword (e.g. Total) isn’t efficient because of cells like «Total depravity, with prevenient grace, does not preclude free will». So we collected statistics on thousands of Wikipedia tables and developed the heuristic for determining aggregating objects on basis of the next features:
• Type of keyword in the cell content.
• Number of words in the cell.
• Position of the cell (sequence number of its column).
• Decoration (bold, uppercase, & lt-th>--tag).
All keywords are split into 2 types: the strong type (Total, Totals, Tot., Subtotal)
and the weak type (All, Sum).
The cells containing words from the weak type must satisfy next conditions:
• exactly 1 word
• position is not greater than 2
The cells containing words from the strong type must satisfy next conditions:
• if there is 1 word — no condition
• if there are 2 words — the cell must be decorated
• if there are from 3 to 5 words — the cell must be decorated and its position
must be not greater than 2
The heuristic was inspired by the following considerations. The aggregating cells store information about special objects, so they should be noticeable by human readers. If the cell string is long or if it contains common word like all, then it must have some decorations in order to attract attention.
In future we plan to develop machine learning approach with these heuristics as features.
5 Scattered header processing
Some tables contain special rows, or scattered headers, which add structural information and are not table objects. Example is the row Sports car from table 1. We called the object extracted from such scattered header row during the initial processing the scattered header object.
We extract scattered header objects only from the object set, which corresponds to the horizontal orientation of the table. Vertical objects aren'-t processed, because width of any table is limited and scattered headers are useless in vertical tables.
5.1 Scattered header recognizing
Deciding whether each row is a scattered header (SH) is based on the assumptions that only one cell in the row is nonempty and the row must stand out against other table. In addition, we don'-t consider empty rows and last rows.
We divide all SHs into three subclasses: single-cell SH, middle SH, first-cell SH.
1) Single-cell SH is a row with just one cell in a table where other rows have more than 1 cell (in HTML terms, a row with colspan greater than 1).
The example is given in table 5 (rows Monohydric alcohols and Polyhydric alcohols).
Chemical Formula IUPAC Name Common Name
CH3OH Methanol Wood alcohol
C2H5OH Ethanol Grain alcohol
C5H"OH Pentanol Amyl alcohol
C2H4(OH)2 Ethane-1, 2-diol Ethylene glycol
C3H5(OH)3 Propane-1,2,3-triol Glycerin
C4H6(OH)4 Butane-1, 2,3,4-tetraol Erythritol
We consider such row to be an SH without other criteria.
2) Middle SH is a row with just one nonempty cell, located in the middle of the table.
The 7th row Bonus track of table 6 is a middle SH. Table 6
# Title Songwriters Length
1. & quot-Mixing pot& quot- (& quot-Tacho"-) Hermeto Pascoal 9: 18
2. & quot-Slaves mass& quot- (& quot-Missa dos escravos& quot-) Hermeto Pascoal 4: 19
3. & quot-Little cry for him& quot- (& quot-Chorinho para ele& quot-) Hermeto Pascoal 2: 11
4. & quot-Cannon (Dedicated to Cannonball Adderley)& quot- Hermeto Pascoal 5: 20
5. & quot-Just listen& quot- (& quot-Escuta meu piano& quot-) Hermeto Pascoal 7: 08
6. & quot-That waltz& quot- (& quot-Aquela valsa& quot-) Hermeto Pascoal 2: 46
7. & quot-Open field& quot- (& quot-Campo aberto& quot-) Hermeto Pascoal 4: 25
8. & quot-Pica pau (Take 1)& quot- Hermeto Pascoal 14: 20
We require the nonempty cell of such row to be decorated.
In addition, we check the table to be non-sparse. Sparse table is a table with many empty cells, e.g. table 7. It is evident that the heuristic for determining middle SH doesn'-t work correctly with sparse tables.
Km Exit Junctions To Remarks
SMT Bandar Penawar Sekolah Menengah Teknik Bandar
BANDAR PENAWAR SOUTH Bandar Penawar T- junctions
SMS Kota Tinggi Sekolah Menengah Sains Kota Tinggi
SMKA Bandar Sekolah Menengah Kebangsaan Penawar
0 SMK Bandar Penawar Sekolah Menengah Kebangsaan
DESARU Desaru Impian Desaru Golf & amp- Country Resort
So we check the rows near the concerned middle SH row (3 rows above and 3 below). If they have empty cells, then the row under review isn'-t a middle SH. Of course, the row with empty cells can be another middle SH- to address this issue we don'-t take such rows into account while checking their cells. But previous and next rows must differ from the concerned one, because scattered headers never have the same structure and content with another SH.
3) First-cell SH is a row whose only nonempty cell is first.
For example, the third row Cities (10 Largest) of table 8 belongs to this type.
Census Metropolitan Areas: 2006 2001 1996
Calgary CMA 1,079,310 951,395 821,628
Edmonton CMA 1,034,945 937,845 862,597
Cities (10 Largest):
Calgary 988,193 878,866 768,082
Edmonton 730,372 666,104 616,306
Red Deer 82,772 67,707 60,075
Strathcona County 82,511 71,986 64,176
The criteria for this type are the same as for the previous type.
5.2 Scattered header processing
Scattered header object are removed from the original set before the aggregating objects processing. Therefore created aggregating objects have no information about scattered header objects.
We update attributes of all objects by adding the new field- currently its name is Type. Every table object located below the current scattered header and above the next scattered header (if it exists) is updated by adding a new value, which is the content of the corresponding scattered header.
6 Conclusions and future work
In this paper we concerned on the task of objects extraction from HTML tables, gave a short survey of occurring problems, and introduced methods (mostly
heuristics) for their solving. Of course, there are many cases uncovered by this paper, e.g. accurate detection of table header, processing of non-aggregating special objects and so on. It'-s the scope of future research.
The most common usage of extracted objects is to map them to predefined relational scheme. Embley et al.  worked towards this task, but we believe that fully automatic processing will be ineffective. Gatterbauer et al.  make a similar note: «domain-independent table interpretation cannot result in unambiguously structured information because of existing inherent domain-specific ambiguities that can sometimes not even be resolved by humans». Therefore, we consider the computer-aided way to be more promising for the task of objects mapping and, in general, for table interpretation
 A.C. Silva, A.M. Jorge, L. Torg. Design of an end-to-end method to extract information from tables // International Journal of Document Analysis and Recognition. 2006. 8. N2−3. P. 144−171.
 Y. A. Tijerino, D. W. Embley, D. W. Lonsdale,. Y. Ding, and G. Nagy. Towards ontology generation from tables. World Wide Web. 2005. 8. N 3. 261−285.
 D.W. Embley, C. Tao, S.W. Liddle. Automating the Extraction of Data from HTML Tables with Unknown Structure // Data & amp- Knowledge Engineering. 2003. N 54. P. 3−28.
 D. Rus, K. Summers. Using white space for automated document structuring. Workshop on the Principles of Document Processing, 1994.
 S. Douglas, M. Hurst, D. Quinn. Using Natural Language Processing for Identifying and Interpreting tables in Plain Text. In: Fourth Symposium on Document Analysis and Information Retrieval, pp. 535−545,1995.
 M. Hurst, S. Douglas. Layout and Language: Preliminary investigations in recognizing the structure of tables // Proceedings of International Conference on Document Analysis and Recognition. Washington, DC, USA: IEEE Computer Society, 1997. P. 1043−1047.
 D. Pinto, A. McCallum, X. Wei, W.B. Croft. Table Extraction Using Conditional Random Fields // Proceedings of the ACM SIGIR N 26. New York, USA: ACM New York, 2003. P. 235−242.
 S. Tupaj, Z. Shi, C.H. Chang, A. Hassan. Extracting tabular information from text files, EECS Department. Tufts University, 1996.
 Y. Wang, T.P. Ihsin, H. Robert. Improvements of zone content classification by using background analysis //Document Analysis Systems. 2000. N 4. P. 10−13.
 Y. Wang, T.P. Ihsin, H. Robert. Automatic ground truth generation and a background-analysis-based table structure extraction method // Proceedings of the Sixth International Conference on Document Analysis and Recognition. Washington, DC, USA: IEEE Computer Society, 2001. P. 528−532.
 W. Gatterbauer, P. Bohunsky, M. Herzog, B. Krupl, B. Poliak. Towards domain-independent information extraction from web tables // Proceedings of the 16th WWW. New York, USA: ACM New York, 2007. P. 71−80.
 Y. Wang, J. Hu. A machine learning based approach for table detection on the web // Proceedings of the 11th WWW. New York, USA: ACM New York, 2002. P. 242−250.
 H. -H. Chen, S. -C. Tsai, S. -C., J. -H. Tsai. Mining tables from large scale HTML texts // 18th International Conference on Computational Linguistics. Saarbrucken, Germany: Morgan Kaufmann, 2000. P. 166−172.
 M. Yoshida, K. Torisawa, J. Tsujii. A method to integrate tables of the WorldWideWeb // Proceedings of the First International Workshop on Web Document Analysis. Seattle, USA: PRImA Press, 2001. P. 31−34.
 M.J. Cafarella, A. Halevy, Y. Zhang, D.Z. Wang, E. Wu. WebTables: Exploring the Power of Tables on the Web //ACM SIGMOD Record. 2008. N 37. P. 55−61.