Sciweavers

127 search results - page 13 / 26
» Regular Expression Matching with Multi-Strings
Sort
View
JUCS
2010
130views more  JUCS 2010»
13 years 7 months ago
On the Linear Number of Matching Substrings
Abstract: We study the number of matching substrings in the pattern matching problem. In general, there can be a quadratic number of matching substrings in the size of a given text...
Yo-Sub Han
IC3
2009
13 years 6 months ago
A New Approach towards Bibliographic Reference Identification, Parsing and Inline Citation Matching
A number of algorithms and approaches have been proposed towards the problem of scanning and digitizing research papers. We can classify work done in the past into three major appr...
Deepank Gupta, Bob Morris, Terry Catapano, Guido S...
SEMWEB
2010
Springer
13 years 6 months ago
Combining Approximation and Relaxation in Semantic Web Path Queries
We develop query relaxation techniques for regular path queries and combine them with query approximation in order to support flexible querying of RDF data when the user lacks know...
Alexandra Poulovassilis, Peter T. Wood
CPM
2005
Springer
105views Combinatorics» more  CPM 2005»
14 years 2 months ago
Reducing the Size of NFAs by Using Equivalences and Preorders
Abstract. The efficiency of regular expression matching algorithms depends very much on the size of the nondeterministic finite automata (NFA) obtained from regular expressions. R...
Lucian Ilie, Roberto Solis-Oba, Sheng Yu
TREC
2004
13 years 10 months ago
Bangor at TREC 2004: Question Answering Track
This paper describes the participation of the School of Informatics, University of Wales, Bangor in the 2004 Text Retrieval Conference. We present additions and modications to the...
Terence Clifton, William John Teahan