73 search results - page 3 / 15 » Regular Expression Types for Strings in a Text Processing La... |
SPIRE
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. In this paper, we extend the SHIFT-AND approach by BaezaYates and Gonnet (CACM 35(10), 1992) to the matching problem for network expressions, which are regular expression...
NLPRS
2001
Springer
13 years 9 months ago
2001
Springer
It is important for future NLP systems to formulate the semantic equivalence (and more generally, the semantic similarity) of natural language expressions. In particular, paraphra...
ICS
2010
Tsinghua U.
13 years 10 months ago
2010
Tsinghua U.
We explore the intersection between an emerging class of architectures and a prominent workload: GPGPUs (General-Purpose Graphics Processing Units) and regular expression matching...
DBPL
2005
Springer
13 years 10 months ago
2005
Springer
Pattern matching mechanisms based on regular expressions feature in a number of recent languages for processing XML. The flexibility of these mechanisms demands novel approaches ...
WWW
2005
ACM
14 years 5 months ago
2005
ACM
On an abstract level, XML Schema increases the limited expressive power of Document Type Definitions (DTDs) by extending them with a recursive typing mechanism. However, an invest...