substring

(redirected from Subword)
Also found in: Dictionary, Thesaurus.

substring

[′səb‚striŋ]
(computer science)
A sequence of successive characters within a string.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.

substring

A subset of an alphanumeric field or variable. The substring function in a programming language is used to extract the subset; for example, the programming expression substr(prodcode,4,3) extracts characters 4, 5 and 6 out of a product code field or variable.
Copyright © 1981-2019 by The Computer Language Company Inc. All Rights reserved. THIS DEFINITION IS FOR PERSONAL USE ONLY. All other reproduction is strictly prohibited without permission from the publisher.
Mentioned in ?
References in periodicals archive ?
Equivalently, by De Morgan's law, we "negate" this construction and forbid all words which contain any of the subwords 11, [bar.1]1, 1[bar.1], or [bar.1][bar.1].
In this subsection, we find the average of the sum of the values of first letters of the occurrences of the subword 112 in all compositions of n.
This article proposes hardware mechanisms for dynamically exploiting narrow width operations and subword parallelism without programmer intervention or compiler support.
A sequence of consecutive letters within [pi] = [[pi].sub.1][[PI].sub.2] X x x [[pi].sub.n] [member of] [[k].sup.n] starting with the letter in the i-th position and isomorphic to a subword [sigma] will be referred to as an occurrence of [sigma] at index i.
Table 4 summarizes the instructional components in the intervention, which was, for theoretical reasons (Berninger, 1998), aimed at all levels of language -- subword (layer 1), word (layer 2), and text (layer 3).
Subword complexity of profinite words and subgroups of free profinite semigroups.
A finite word [nu] is said to be a subword of another (finite or infinite) word z, if there exist two indices i and j, such that [nu] = [z.sub.i][z.sub.i+1]...[z.sub.j].
(Note that 1-letter words play no role in Scrabble.) A subword of a word is a sequence of at least 2 letters obtainable by removing (possibly zero) letters from the beginning and end; it is proper if at least one letter is removed.
Bender and Fred Kochman, The distribution of subword counts is usually normal, European J.
One reason for this is that, sometimes, even those intervals that are isomorphic to principal order ideals are actually making use of the fact that a reduced word for the minimum element in the interval can be formed by deleting an arbitrary subword of symbols from a reduced word of the maximum element in the interval.
Often, the operation of a monoid is called multiplication, so it is fitting that a "subword" of a free word is called a "factor." For example, in the free monoid over alphabet {a, b, c, d, r}, the word cadabra is a factor of abracadabra because abracadabra is the product of abra and cadabra.
In fact, our results here apply to a more general situation, namely to generalized subword order (see, for example, [MS12, SV06]) where the underlying poset is a rooted forest.