substring

A flat rope a rope with no concatenation or substring nodes has a depth of1.

扁平rope（flat rope）没有连接节点或子串节点的深度（depth）为1。

互联网摘选

The time complexity of traditional substring reduction algorithms is O ( n~ 2), which is ineffective for large-scale corpora.

传统的子串归并算法时间复杂度为O（n2），在大规模语料库的处理中效率低下。

互联网摘选

String. substring() is implemented in the Java language by building a new String sharing the original character array.

substring（）在Java语言中是通过创建一个共享原始字符数组的新String而实现的。

互联网摘选

A pointer to the substring to be inserted.

需要插入的子链的指针.

互联网摘选

Expected ';'delimiter in connection substring'{ 0 }'after value'{ 1 } '.

在连接子字符串 “ {0}”中的值 “ {1}”后需要 “; ”分隔符.

互联网摘选

Substring returns all results that contain the search string.

“子字符串”选项:返回所有包含搜索字符串的结果.

互联网摘选

The depth of concatenation and substring ropes is one more than the depth of the deepest node they enclose.

有连接和子串的rope的深度比它们所拥有的最深节点的深度大1。

互联网摘选

Extract a substring from a string based upon a pattern match.

基于模式匹配从字符串中提取子字符串.

互联网摘选

Extracts a substring that contains only the characters not in a set.

功能:从字符串位置0开始查找,提取首次仅仅出现在匹配字符表里的连续的子字符串.

互联网摘选

The substring starts at a specified character position and has a specified length.

子字符串从指定的字符位置开始且具有指定的长度.

互联网摘选

Returns the index of the first character of a specified substring in a string.

返回指定子串首字符在串中的索引.

互联网摘选

Improved Algorithm for BM String Matching Based on Prefix Substring

基于前缀的BM串匹配改进算法

互联网摘选

Expected ';'delimiter in connection substring'{ 0 } '.

在连接子字符串 “ {0}”中需要 “; ”分隔符.

互联网摘选

The following code example uses regular expressions to look for exact substring matches.

下面的代码示例使用正则表达式查找完全匹配的子字符串.

互联网摘选

In Figure 5, the substring of length 1 from the first byte of the string has been specified.

在图5中，已经指定字符串第一个字节的长度为1的子字符串。

互联网摘选

next, it breaks the $cols value into two parts: the substring before the first space, and everything after the first space.

接下来，它将$cols值分为两部分：第一个空格之前的子串，和之后的所有内容。

互联网摘选

The substring starts at a specified character position.

子字符串从指定的字符位置开始.

互联网摘选