ACM Home Page
Please provide us with feedback. Feedback
Text summarization via hidden Markov models
Full text PdfPdf (133 KB)
Source Annual ACM Conference on Research and Development in Information Retrieval archive
Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval table of contents
New Orleans, Louisiana, United States
Pages: 406 - 407  
Year of Publication: 2001
ISBN:1-58113-331-6
Authors
John M. Conroy  Institute for Defense Analyses, Bowie, MD
Dianne P. O'leary  Univ. of Maryland, College Park
Sponsor
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 123,   Citation Count: 10
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/383952.384042
What is a DOI?

ABSTRACT

A sentence extract summary of a document is a subset of the document's sentences that contains the main ideas in the document. We present an approach to generating such summaries, a hidden Markov model that judges the likelihood that each sentence should be contained in the summary. We compare the results of this method with summaries generated by humans, showing that we obtain significantly higher agreement than do earlier methods.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
C. Aone, M. Okurowski, J. Gorlinsky, and B. Larsen. A scalable summarization system using robust nlp. Proceeding of the ACL'97/EACL'97 Workshop on Intelligent Scalable Text Summarization, pages 66-73, 1997.
 
2
L. E. Baum, T. Petrie, G. Soules, and N. Weiss. A maximization technique occurring in the statistical analysis of probabilistic functions of markov chains. Ann. Math. Stat., 41:164-171, 1970.
 
3
J. M. Conroy and D. P. O'Leary. Text summarization via hidden markov models and pivoted qr matrix decomposition. Technical report, University of Maryland, College Park, Maryland, March 2001.
 
4
5
6
 
7
H. P. Luhn. The automatic creation of literture abstracts. IBM Journal of Research Development, 2:159-165, 1958.
 
8
L. R. Rabiner. A tutorial on hidden Markov models and selected applications in speech recognition. Proc. of the IEEE, 77:257-285, 1989.
 
9
TREC Conference Series. Text REtrieval Conference (TREC) text research collection. Technical Report http://trec.nist.gov/, National Institute of Standards and Technology, Gaithersburg, Maryland, 1994, 1996, 1997.

CITED BY  10

Collaborative Colleagues:
John M. Conroy: colleagues
Dianne P. O'leary: colleagues