Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Efficient pattern searching over large dictionaries

From MaRDI portal
Publication:685494
Jump to:navigation, search

DOI10.1016/0020-0190(93)90152-YzbMATH Open0788.68064MaRDI QIDQ685494FDOQ685494


Authors: Olumide Owolabi Edit this on Wikidata


Publication date: 17 October 1993

Published in: Information Processing Letters (Search for Journal in Brave)





Recommendations

  • Fast string matching for multiple searches
  • A Table Compression Method for Extended Aho-Corasick Automaton
  • Using signature hashing for approximate string matching
  • Tuning string matching for huge pattern sets
  • String Processing and Information Retrieval


zbMATH Keywords

computational complexitystring similarity\(N\)-gramsBoyer-Moore pattern matchingon-line query term expansionstemming


Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25)


Cites Work

  • Algorithms for pattern matching
  • Title not available (Why is that?)


Cited In (2)

  • Indexing a Dictionary for Subset Matching Queries
  • CSA++: Fast Pattern Search for Large Alphabets





This page was built for publication: Efficient pattern searching over large dictionaries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685494)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:685494&oldid=12595174"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 09:27. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki