Efficient pattern searching over large dictionaries

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

Authors: Olumide Owolabi 

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)