Sentence examples for string match from inspiring English sources

The answers were lexicographically correct, nevertheless, the string to string match failed using the equality algorithm.

Exact string match produced a low inter-annotator agreement of 55.5% and machine-annotator agreement of 48.7%.

This paper proposed a bit-parallel multiple approximate string match algorithm, and developed a GPU implementation which achieved speedups about 28 relative to a single-thread CPU code.

A string match was used to evaluate the Action types and a machine-annotator agreement of 91.9% was achieved (See Table 3).

Because we plan to use Myers algorithm to match the Snort signatures against a packet traces, we re-implement the string match to fit our needs.

Abstracts that contained GO terms were identified by exact string match.

The classical ARG and 2D string matching methods are evaluated.

So it requires a high- performance string matching algorithm.

The string matching with swaps problem is the problem of string matching in the presence of local swaps.

The string matching algorithm also calculates the extent to which the strings have matched.

The Myers algorithm is an approximate string matching algorithm.