Efficient text searching of regular expressions: Preliminary version

Efficient text searching of regular expressions: Preliminary version

We present algorithms for efficient searching of regular expressions on preprocessed text. We obtain logarithmic (in the size of the text) average time for a wide subclass of regular expressions, and sublinear average time for any regular expression, hence providing the first known algorithm to achi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Baeza-Yates, Ricardo A., Gonnet, Gaston H.
Format: Buchkapitel
Sprache:eng
Schlagworte:
Internal Node
Node Label
Random String
Regular Expression
String Match
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We present algorithms for efficient searching of regular expressions on preprocessed text. We obtain logarithmic (in the size of the text) average time for a wide subclass of regular expressions, and sublinear average time for any regular expression, hence providing the first known algorithm to achieve this time complexity.
ISSN:0302-9743
1611-3349
DOI:10.1007/BFb0035751