1. A string pattern conceptualization method, particularly for a pattern of words, comprising: setting, via a processor, a reference string set comprising a plurality of strings; finding, inside the reference string set comprising the plurality of strings, at least two specific tuples of substring triples that each comprise a prefix substring, a middle substring, and a suffix substring; and considering each tuple as a candidate for representing a related concept; where: each concatenation of the substring triples is an explicit member of the reference string set; each middle substring of the substring triples is unequal to another middle substring within the substring triples found inside the reference string set; each prefix substring of the substring triples is equal to all other prefix substrings within the substring triples found inside the reference string set; each suffix substring of the substring triples is equal to all other suffix substrings within the substring triples found inside the reference string set; and either the prefix substring of the substring triples or the suffix substring of the substring triples is not empty.