Computing text constituency: an algorithmic approach to the generation of text graphs

  • Authors:
  • Udo Hahn;Ulrich Reimer

  • Affiliations:
  • Universitaet Konstanz, Postfach 5560, Konstanz;Universitaet Konstanz, Postfach 5560, Konstanz

  • Venue:
  • SIGIR '84 Proceedings of the 7th annual international ACM SIGIR conference on Research and development in information retrieval
  • Year:
  • 1984

Quantified Score

Hi-index 0.00

Visualization

Abstract

An algorithm for text summarization (automatic abstracting) is presented which constitutes the text condensation component of TOPIC, a knowledge-based text information system. Based on the results of text parsing knowledge representation structures of text segments are evaluated in order to determine dominant concepts. By means of an interpretation schema dominant concepts are related in terms of thematic units indicative of the topic(s) of the text segment under consideration. The mutual compatibility of topics of adjacent text segments is determined and corresponding text constituents are constructed. Finally, a text graph is generated linking appropriate text constituents on various levels of text constituency. Accordingly, facilities for text-oriented information retrieval will be based on the manipulation of these text graphs.