Fast error-tolerant search on very large texts

doi:10.1145/1529282.1529669

Fast error-tolerant search on very large texts

Full Text:

PDF

Buy this Article

Authors:	Marjan Celikik	Max Planck Institute for Computer Science, Saarbrücken, Germany
	Holger Bast	Max Planck Institute for Computer Science, Saarbrücken, Germany

Published in:

	· Proceeding
	SAC '09 Proceedings of the 2009 ACM symposium on Applied Computing
	Pages 1724-1731 ACM New York, NY, USA ©2009 table of contents ISBN: 978-1-60558-166-8 doi>10.1145/1529282.1529669

	2009 Article
Bibliometrics
· Downloads (6 Weeks): 3 · Downloads (12 Months): 40 · Downloads (cumulative): 243 · Citation Count: 5

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: algorithms approximate string matching error-tolerant search experimentation information search and retrieval measurement performance spelling variants systems and software user interfaces

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder