Sentence examples for given string from inspiring English sources

When users plug their headphones into the jack in the modified A.T.M., the computer-driven text-to-speech technology will translate the given string of characters and read them aloud by way of the sound card.

For any given string of characters, we can tell if it is a proof.

A suffix tree, which provides us with a linear space full-text index of a given string, is a fundamental data structure for string processing and information retrieval.

While writing IPv6-capable applications, situations where it is needed to extract a numeric IPv6 address from a given string (such as a URL) will be encountered.

Shortest common supersequence (SCS) is a classical NP-hard problem, where a string to be constructed that is the supersequence of a given string set.

We design an efficient algorithm that decides whether or not a given string is a pseudoknot of a regular language L. Our algorithm runs in linear time if L is given by a deterministic finite automaton.

Pedal harp, musical instrument in which pedals control a mechanism raising the pitch of given strings by a semitone (single action) or by both a semitone and a whole tone (double action).

Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string tsol that is within a Hamming distance of d to each of the given strings.

In this paper, we focus on the edit distance between two given strings where block-edit operations are allowed and better fitting to the human natural edit behaviors.

Mutations with descriptions that did not match any of the given strings were discarded from further analysis.

This table shows whether each of the given strings is I-compatible, L-compatible, or R-compatible with C ∑.