Results 1 to 10 of about 7,473,929 (357)
Analyzing Catastrophic Backtracking Behavior in Practical Regular Expression Matching [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We develop a formal perspective on how regular expression matching works in Java, a popular representative of the category of regex-directed matching engines.
Martin Berglund +2 more
doaj +6 more sources
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
Comparison of Web Scraping Techniques : Regular Expression, HTML DOM and Xpath
International Conference Industrial, Enterprise, and System Engineering, 2019 Data collection is the initial stage of research. There are various data sources on the internet that can be used in the research process. The process of taking data or information from sites on the internet is called web scraping.
Rohmat Gunawan +3 more
openalex +2 more sources
Regular Expression Search on Compressed Text [PDF]
, 2019 We present an algorithm for searching regular expression matches in compressed text. The algorithm reports the number of matching lines in the uncompressed text in time linear in the size of its compressed version.
Ganty, Pierre, Valero, Pedro
core +2 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
Regular Expression Matching and Operational Semantics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Many programming languages and tools, ranging from grep to the Java String library, contain regular expression matchers. Rather than first translating a regular expression into a deterministic finite automaton, such implementations typically match the ...
Asiri Rathnayake, Hayo Thielecke
doaj +4 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
Exploring efficient grouping algorithms in regular expression matching. [PDF]
PLoS ONE, 2018 BACKGROUND:Regular expression matching (REM) is widely employed as the major tool for deep packet inspection (DPI) applications. For automatic processing, the regular expression patterns need to be converted to a deterministic finite automata (DFA ...
Chengcheng Xu, Jinshu Su, Shuhui Chen
doaj +2 more sources
PaREM: A Novel Approach for Parallel Regular Expression Matching [PDF]
IEEE International Conference on Computational Science and Engineering, 2014 Regular expression matching is essential for many applications, such as finding patterns in text, exploring substrings in large DNA sequences, or lexical analysis.
Suejb Memeti, Sabri Pllana
openalex +3 more sources
(Un)Decidability Results for Word Equations with Length and Regular Expression Constraints [PDF]
, 2013 We prove several decidability and undecidability results for the satisfiability and validity problems for languages that can express solutions to word equations with length constraints.
Ganesh, Vijay +3 more
core +3 more sources