Skip to main content

Text Retrieval Machines

  • Chapter
Office Automation

Part of the book series: Topics in Information Systems ((TINF))

Abstract

Various approaches to text retrieval machines for large text database are surveyed. Signature processors for supporting superimposed coding are first described. Text processors for pattern matching are then categorized and discussed. Finally, various designs for multiple response resolution, an important but often ignored issue in associative memory and processors, are reviewed.

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

Access this chapter

eBook
USD 16.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

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Lee, D.L., Lochovsky, F.H. (1985). Text Retrieval Machines. In: Tsichritzis, D.C. (eds) Office Automation. Topics in Information Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-82435-7_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-82435-7_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-82437-1

  • Online ISBN: 978-3-642-82435-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics