Results 231 to 240 of about 1,296,078 (273)

On approximate string matching

1983
An algorithm is given for computing the edit distance as well as the corresponding sequence of editing steps (insertions, deletions, changes, transpositions of adjacent symbols) between two strings a1a2...am and b1b2...bn. The algorithm needs time 0(s·min(m,n)) and space 0(s2) where s is the edit distance, that is, the minimum number of editing steps ...
openaire   +1 more source

The String-to-Dictionary Matching Problem

2011 Data Compression Conference, 2011
The String-to-Dictionary Matching Problem is defined, in which a string is searched for in all the possible concatenations of the elements of a given dictionary, with applications to compressed matching in variable to fixed-length encodings, such as Tunstall's.
Shmuel T. Klein, Dana Shapira
openaire   +1 more source

A New String Matching Algorithm

International Journal of Computer Mathematics, 2003
In this paper a new exact string-matching algorithm with sub-linear average case complexity has been presented. Unlike other sub-linear string-matching algorithms it never performs more than n text character comparisons while working on a text of length n. It requires only O(mþs) extra pre-processing time and space, where m is the length of the pattern
Mustaq Ahmed, M. Kaykobad, Rezaul Alam Chowdhury   +2 more
openaire   +1 more source

String-matching with automata

Nord. J. Comput., 2004
Summary: We present an algorithm to search in a text for the patterns of a regular set. Unlike many classical algorithms, we assume that the input of the algorithm is a deterministic automaton and not a regular expression. Our algorithm is based on the notion of failure function and mainly consists of efficiently constructing a new deterministic ...
openaire   +1 more source

Fastest Pattern Matching in Strings

Journal of Algorithms, 1994
Summary: An algorithm is presented that substantially improves the algorithm of Boyer and Moore for pattern matching in strings, both in the worst case and in the average. Both the Boyer and Moore algorithm and the new algorithm assumes that the characters in the pattern and in the text are taken from a given alphabet \(\Sigma\) of finite size. The new
openaire   +2 more sources

Fast approximate string matching

Software: Practice and Experience, 1988
AbstractApproximate string matching is an important operation in information systems because an input string is often an inexact match to the strings already stored. Commonly known accurate methods are computationally expensive as they compare the input string to every entry in the stored dictionary. This paper describes a two‐stage process.
Olumide Owolabi, Douglas R. McGregor
openaire   +1 more source

Constant-Space String-Matching

1988
We present a string-matching algorithm with the following properties: it is linear in time with a small multiplicative constant during all its phases; it preprocesses the string and scans the searched text with constant memory space in addition to the strings.
openaire   +2 more sources

Schema Matching with Large Language Models: an Experimental Study

VLDB Workshops
Large Language Models (LLMs) have shown useful applications in a variety of tasks, including data wrangling. In this paper, we investigate the use of an off-the-shelf LLM for schema matching.
Marcel Parciak, Brecht Vandevoort, Frank Neven, L. Peeters, Stijn Vansummeren   +4 more
semanticscholar   +1 more source

Average Optimal String Matching in Packed Strings

2013
In this paper we are concerned with the basic problem of string pattern matching: preprocess one or multiple fixed strings over alphabet σ so as to be able to efficiently search for all occurrences of the string(s) in a given text T of length n. In our model, we assume that text and patterns are tightly packed so that any single character occupies logσ
Djamal Belazzougui, Mathieu Raffinot
openaire   +1 more source

Approximate string matching with gaps.

Nord. J. Comput., 2002
Summary: We consider several new versions of approximate string matching with gaps. The main characteristic of these new versions is the existence of gaps in the matching of a given pattern in a text. Algorithms are devised for each version and their time and space complexities are stated.
Crochemore, Maxime, Iliopoulos, Costas S., Makris, C., Rytter, Wojciech, Tsakalidis, A., Tsichlas, K.   +5 more
openaire   +2 more sources