Skip to main content

Text Simplification for Information-Seeking Applications

  • Conference paper
On the Move to Meaningful Internet Systems 2004: CoopIS, DOA, and ODBASE (OTM 2004)

Abstract

This paper addresses the issue of simplifying natural language texts in order to ease the task of accessing factual information contained in them. We define the notion of Easy Access Sentence – a unit of text from which the information it contains can be retrieved by a system with modest text-analysis capabilities, able to process single verb sentences with named entities as constituents. We present an algorithm that constructs Easy Access Sentences from the input text, with a small-scale evaluation. Challenges and further research directions are then discussed.

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. Baker, C.F., Fillmore, C.J., Lowe, J.B.: The Berkeley FrameNet project. In: Proceedings of COLING/ACL1998 (1998), http://www.icsi.berkeley.edu/framenet/

  2. Bikel, D.M., Schwartz, R., Weischedel, R.M.: An Algorithm that learns What’s in a Name. Machine Learning 34, 211–231 (1999)

    Article  MATH  Google Scholar 

  3. Bontcheva, K., Dimitrov, M., Maynard, D., Tablan, V., Cunningham, H.: Shallow Methods for Named Entity Coreference Resolution. In: Proceedings of TALN 2002 (2002)

    Google Scholar 

  4. Carroll, J., Minnen, G., Pearce, D., Canning, Y., Devlin, S., Tait, J.: Simplifying Text for Langauge-Impaired Readers. In: Proceedings of EACL 1999 (1999)

    Google Scholar 

  5. Chandrasekar, R., Doran, C., Srivinas, B.: Motivations and Methods for Text Simplification. In: Proceedings of COLING 1996 (1996)

    Google Scholar 

  6. Chandrasekar, R., Srivinas, B.: Automatic Induction of Rules for Text Simplification. Knowledge-Based Systems 10, 183–190 (1997)

    Article  Google Scholar 

  7. Devlin, S.: Simplifying natural lanauge text for aphasic readers. PhD dissertation. University of Sunderland, UK (1999)

    Google Scholar 

  8. Lin, D.: Dependency-based Evaluation of MINIPAR. In: Workshop on the Evaluation of Parsing Systems (1998)

    Google Scholar 

  9. Och, F.J., Gildea, D., Khudanpur, S., Sarkar, A., Yamada, K., Fraser, A., Kumar, S., Shen, L., Smith, D., Eng, K., Jain, V., Jin, Z., Radev, D.: A Smorgasbord of Features for Statistical Machine Translation. In: Proceedings of HLT/NAACL (2004)

    Google Scholar 

  10. Tetrault, J.: A corpus-based evaluation of centering and pronoun resolution. Computational Linguistics 27(4), 507–520 (2001)

    Article  Google Scholar 

  11. Voorhees, E.M., Buckland, L.P. (eds.): Proceedings of the 11th Text REtrieval Conference (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Beigman Klebanov, B., Knight, K., Marcu, D. (2004). Text Simplification for Information-Seeking Applications. In: Meersman, R., Tari, Z. (eds) On the Move to Meaningful Internet Systems 2004: CoopIS, DOA, and ODBASE. OTM 2004. Lecture Notes in Computer Science, vol 3290. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30468-5_47

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30468-5_47

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23663-4

  • Online ISBN: 978-3-540-30468-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics