We propose an approach to summarization exploiting both lexical information and the output of an automatic anaphoric re- solver, and using Singular Value Decom- position ( SVD ) to identify the main terms. We demonstrate that adding anaphoric information results in significant perfor- mance improvements over a previously developed system, in which only lexical terms are used as the input to SVD . How- ever, we also show that how anaphoric in- formation is used is crucial: whereas using this information to add new terms does re- sult in improved performance, simple sub- stitution makes the performance worse

Improving LSA-based Summarization with Anaphora Resolution

Poesio, Massimo;
2005-01-01

Abstract

We propose an approach to summarization exploiting both lexical information and the output of an automatic anaphoric re- solver, and using Singular Value Decom- position ( SVD ) to identify the main terms. We demonstrate that adding anaphoric information results in significant perfor- mance improvements over a previously developed system, in which only lexical terms are used as the input to SVD . How- ever, we also show that how anaphoric in- formation is used is crucial: whereas using this information to add new terms does re- sult in improved performance, simple sub- stitution makes the performance worse
2005
Proceedings of EMNLP
209 N. Eighth Street, Stroudsburg PA 18360, USA
Association for Computational Linguistics (ACL)
Steinberger, J.; Kabadjov, M.; Poesio, Massimo; SANCHEZ GRAILLET, O.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11572/18107
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact