Results 11 to 20 of about 7,287,958 (273)
Text Indexing for Regular Expression Matching
Algorithms, 2021 Finding substrings of a text T that match a regular expression p is a fundamental problem. Despite being the subject of extensive research, no solution with a time complexity significantly better than O(|T||p|) has been found.
Daniel Gibney, Sharma V. Thankachan
doaj +2 more sources
Which Regular Expression Patterns are Hard to Match? [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2016 Regular expressions constitute a fundamental notion in formal language theory and are frequently used in computer science to define search patterns. A classic algorithm for these problems constructs and simulates a non-deterministic finite automaton ...
Backurs, Arturs, Indyk, Piotr
core +2 more sources
Regular Expression Based Medical Text Classification Using Constructive Heuristic Approach
IEEE Access, 2019 Medical text classification assigns medical related text into different categories such as topics or disease types. Machine learning based techniques have been widely used to perform such tasks despite the obvious drawback in such “black box ...
Menglin Cui +5 more
doaj +2 more sources
Derivatives of Regular Expressions [PDF]
Journal of the ACM, 1964 Janusz Brzozowski
openalex +3 more sources
Regular expression types for XML [PDF]
Proceedings of the fifth ACM SIGPLAN international conference on Functional programming, 2000 We propose regular expression types as a foundation for XML processing languages. Regular expression types are a natural generalization of Document Type Definitions (DTDs), describing structures in XML documents using regular expression operators (i.e., *, ?, |, etc.) and supporting a simple but powerful notion of
Haruo Hosoya +2 more
+11 more sources
Data Extraction via Semantic Regular Expression Synthesis [PDF]
Proc. ACM Program. Lang., 2023 Many data extraction tasks of practical relevance require not only syntactic pattern matching but also semantic reasoning about the content of the underlying text.
Qiaochu Chen +4 more
semanticscholar +1 more source
Regular Expressions with Lookahead [PDF]
JUCS - Journal of Universal Computer Science, 2021 This paper investigates regular expressions which in addition to the standard operators of union, concatenation, and Kleene star, have lookaheads. We show how to translate regular expressions with lookaheads (REwLA) to equivalent Boolean automata having at most 3 states more than the length of the REwLA.
Berglund,Martin +2 more
openaire +5 more sources
Regular expression patterns [PDF]
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming, 2004 We extend Haskell with regular expression patterns . Regular expression patterns provide means for matching and extracting data which goes well beyond ordinary pattern matching as found in Haskell. It has proven useful for string manipulation and for processing structured data such as XML.
Niklas Broberg +2 more
openalex +3 more sources
Regular expressions and the equivalence of programs
Journal of Computer and System Sciences, 1969 If we assume that the study and detection of equivalence for ALGOLl ike programs holds certain pragmatic interest, then it seems reasonable to pursue these matters despite the well-known undecidability of this property. Various efforts have been made to isolate decidable sub-cases of this equivalence problem (e.g., by Paterson [12] and this author [6]).
Donald M. Kaplan
openalex +4 more sources
Sketch-Driven Regular Expression Generation from Natural Language and Examples [PDF]
Transactions of the Association for Computational Linguistics, 2021 Recent systems for converting natural language descriptions into regular expressions (regexes) have achieved some success, but typically deal with short, formulaic text and can only produce simple regexes. Real-world regexes are complex, hard to describe
Xi Ye +4 more
doaj +2 more sources