Skip to main content

Machine Learning for Efficient Natural-Language Processing

  • Conference paper
  • First Online:
Combinatorial Pattern Matching (CPM 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1848))

Included in the following conference series:

  • 605 Accesses

Abstract

Much of computational linguistics in the past thirty years assumed a ready supply of general and linguistic knowledge, and limitless computational resources to use it in understanding and producing language. However, accurate knowledge is hard to acquire and computational power is limited. Over the last ten years, inspired in part by advances in speech recognition, computational linguists have been investigating alternative approaches that take advantage of the statistical regularities in large text collections to automatically acquire efficient approximate language processing algorithms. Such machine-learning techniques have achieved remarkable successes in tasks such as document classification, part-of-speech tagging, named-entity recognition and classification, and even parsing and machine translation.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pereira, F. (2000). Machine Learning for Efficient Natural-Language Processing. In: Giancarlo, R., Sankoff, D. (eds) Combinatorial Pattern Matching. CPM 2000. Lecture Notes in Computer Science, vol 1848. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45123-4_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-45123-4_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67633-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics