Results 11 to 20 of about 1,296,078 (273)
On String Matching with Mismatches [PDF]
Algorithms, 2015 In this paper, we consider several variants of the pattern matching with mismatches problem. In particular, given a text \(T=t_1 t_2\cdots t_n\) and a pattern \(P=p_1p_2\cdots p_m\), we investigate the following problems: (1) pattern matching with mismatches: for every \(i, 1\leq i \leq n-m+1\) output, the distance between \(P\) and \(t_i t_{i+1 ...
Marius Nicolae, Sanguthevar Rajasekaran
openaire +2 more sources
Pattern Matching in Strings [PDF]
, 1998 The present chapter describes a few standard algorithms used for processing texts.
Crochemore, Maxime, Hancart, Christophe
openaire +5 more sources
Elastic-Degenerate String Matching via Fast Matrix Multiplication [PDF]
SIAM journal on computing (Print), 2019 An elastic-degenerate (ED) string is a sequence of $n$ sets of strings of total length $N$, which was recently proposed to model a set of similar sequences. The ED string matching (EDSM) problem is to find all occurrences of a pattern of length $m$ in an
G. Bernardini +4 more
semanticscholar +1 more source
DeezyMatch: A Flexible Deep Learning Approach to Fuzzy String Matching
Conference on Empirical Methods in Natural Language Processing, 2020 We present DeezyMatch, a free, open-source software library written in Python for fuzzy string matching and candidate ranking. Its pair classifier supports various deep neural network architectures for training new classifiers and for fine-tuning a ...
Kasra Hosseini +2 more
semanticscholar +1 more source
Using string-matching to analyze hypertext navigation [PDF]
, 2006 A method of using string-matching to analyze hypertext navigation was developed, and evaluated using two weeks of website logfile data. The method is divided into phases that use: (i) exact string-matching to calculate subsequences of links that were ...
Ruddle, R.A.
core +1 more source
String Matching and 1d Lattice Gases [PDF]
, 2005 We calculate the probability distributions for the number of occurrences $n$ of a given $l$ letter word in a random string of $k$ letters. Analytical expressions for the distribution are known for the asymptotic regimes (i) $k \gg r^l \gg 1$ (Gaussian ...
A. D. Barbour +38 more
core +1 more source
String matching with lookahead
Discrete Applied Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Peltola, Hannu, Tarhio, Jorma
openaire +4 more sources
Theoretical Computer Science, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Choffrut, Christian, Haddad, Yael
openaire +2 more sources
Cross-Document Pattern Matching [PDF]
, 2012 We study a new variant of the string matching problem called cross-document string matching, which is the problem of indexing a collection of documents to support an efficient search for a pattern in a selected document, where the pattern itself is a ...
A. Andersson +14 more
core +7 more sources
Neveu-Schwarz Five-Branes at Orbifold Singularities and Holography [PDF]
, 1998 We consider Type IIB Neveu-Schwarz five-branes transverse to C^2/Z_n orbifolds and conjecture that string theory on the near horizon geometry is dual to the decoupled theory on the branes. We analyze the conformal field theory describing the near horizon
Abolhassani +30 more
core +4 more sources