Skip to main content

Sentence Compression Using Statistical Information About Dependency Path Length

  • Conference paper
Text, Speech and Dialogue (TSD 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4188))

Included in the following conference series:

Abstract

This paper is concerned with the use of statistical information about dependency path length for sentence compression. The sentence compression method employed here requires a quantity called inter-phrase dependency strength. In the training process, original sentences are parsed, and the number of tokens is counted for each pair of phrases, connected with each other by a dependency path of certain length, that survive as a modifier-modified phrase pair in the corresponding compressed sentence in the training corpus. The statistics is exploited to estimate the inter-phrase dependency strength required in the sentence compression process. Results of subjective evaluation shows that the present method outperforms the conventional one of the same framework where the distribution of dependency distance is used to estimate the inter-phrase dependency strength.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Okumura, M., Nanba, H.: Automated text summarization: A survey. Journal of Natural Language Processing 6(6), 1–26 (1999)

    Google Scholar 

  2. Oguro, R., Ozeki, K., Zhang, Y., Takagi, K.: An efficient algorithm for Japanese sentence compaction based on phrase importance and inter-phrase dependency. In: Sojka, P., Kopeček, I., Pala, K. (eds.) TSD 2000. LNCS (LNAI), vol. 1902, pp. 65–81. Springer, Heidelberg (2000)

    Google Scholar 

  3. Oguro, R., Sekiya, H., Morooka, Y., Takagi, K., Ozeki, K.: Evaluation of a Japanese sentence compression method based on phrase significance and inter-phrase dependency. In: Sojka, P., Kopeček, I., Pala, K. (eds.) TSD 2002. LNCS (LNAI), vol. 2448, pp. 27–32. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. JUMAN, http://www.kc.t.u-tokyo.ac.jp/nl-resource/juman.html

  5. KNP, http://www.kc.t.u-tokyo.ac.jp/nl-resource/knp.html

  6. Fukutomi, S., Takagi, K., Ozeki, K.: Aligning phrases in original text and its summary using concept distance and inter-phrase dependency. In: Proc. 67th Annual Meeting of IPSJ, vol. 2, pp. 119–120 (2005)

    Google Scholar 

  7. Morooka, Y., Esaki, M., Takagi, K., Ozeki, K.: Summarization of newspaper articles using important sentence extraction and sentence compression. In: Proc. 10th Annual Meeting of Natural Language Processing Society, pp. 436–439 (2004)

    Google Scholar 

  8. Sinbunsha, M.: Mainichi Shinbun zenbun-kiji oyobi 54-moji database (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yamagata, K., Fukutomi, S., Takagi, K., Ozeki, K. (2006). Sentence Compression Using Statistical Information About Dependency Path Length. In: Sojka, P., Kopeček, I., Pala, K. (eds) Text, Speech and Dialogue. TSD 2006. Lecture Notes in Computer Science(), vol 4188. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11846406_16

Download citation

  • DOI: https://doi.org/10.1007/11846406_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-39090-9

  • Online ISBN: 978-3-540-39091-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics