Record-boundary discovery in Web documents

  • Authors:
  • D. W. Embley;Y. Jiang;Y.-K. Ng

  • Affiliations:
  • Dept. of Computer Science, Brigham Young University, Provo, Utah;Dept. of Computer Science, Brigham Young University, Provo, Utah;Dept. of Computer Science, Brigham Young University, Provo, Utah

  • Venue:
  • SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

Extraction of information from unstructured or semistructured Web documents often requires a recognition and delimitation of records. (By “record” we mean a group of information relevant to some entity.) Without first chunking documents that contain multiple records according to record boundaries, extraction of record information will not likely succeed. In this paper we describe a heuristic approach to discovering record boundaries in Web documents. In our approach, we capture the structure of a document as a tree of nested HTML tags, locate the subtree containing the records of interest, identify candidate separator tags within the subtree using five independent heuristics, and select a consensus separator tag based on a combined heuristic. Our approach is fast (runs linearly for practical cases within the context of the larger data-extraction problem) and accurate (100% in the experiments we conducted).