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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
[AhRo80]
[ArGi81]
[BeKu79]
[BiNT78]
[Burk82]
[ChFa84]
[Chi82]
[EPHa80]
[FiLo77]
[FoKu80]
[FrGo6l]
[Grav78]
[HaHo83]
[Harr71]
[Hask80]
[Holl79]
[Holl83]
[HoU179]
[Hsia80]
[KeDe83]
[Land77]
[Lee84]
[Lewi62]
[Loch81]
[Love77]
[Lowe82]
[Mall80]
[MeBo76]
[Mukh79]
[Mukh80]
[RaTW78]
[Robe78]
[Robe79]
[Salt71]
[ScOS76]
[Shaw80]
[Song80]
[ThTa82]
Editor information
Editors and Affiliations
Rights 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