Patent ID: 8311795

Claim:
A string pattern conceptualization method, particularly for a pattern of words, comprising: setting, via a processor, a reference set (SET_r_i) comprising a plurality of strings (STR_n_i); inside the reference set (SET_r_i), finding specific N-tuples ([Y 1 _i|Y 2 _i| . . . |Ym_i]) of substring triples (X_i,Y 1 _i,Z_i; X_i,Y 2 _i,Z_i; . . . ; X_i,Ym_i,Z_i) with N≧2 and m=1 . . . N; and considering each N-tuple ([Y 1 _i|Y 2 _i| . . . |Ym_i]) as a candidate for representing related concepts; where: each concatenation (X_i Y 1 _i Z_i; X_i Y 2 _i Z_i; . . . ; X_i Ym_i Z_i) of the substrings triples (X_i,Y 1 _i,Z_i; X_i,Y 2 _i,Z_i; . . . ; X_i,Ym_i,Z_i) is an explicit member of the reference set (SET_r_i); each middle substring (Y 1 _i, Y 2 _i, . . . , Ym_i) out of middle substrings (Y 1 _i, Y 2 _i, . . . , Ym_i) is unequal to another middle substring (Y 1 _i, Y 2 _i, . . . ,Ym_i) out of middle substrings (Y 1 _i, Y 2 _i, . . . ,Ym_i) within the substring triples (X_i,Y 1 _i,Z_i; X_i,Y 2 _i,Z_i; . . . ; X_i,Ym_i,Z_i) found inside the reference set (SET_r_i); each prefix substring (X_i) is equal to all other prefix substrings (X_i) within the substring triples (X_i,Y 1 _i,Z_i; X_i,Y 2 _i,Z_i; . . . ; X_i,Ym_i,Z_i) found inside the reference set (SET_r_i); each suffix substring (Z_i) is equal to all other prefix substrings (Z_i) within the substring triples (X_i,Y 1 _i,Z_i; X_i,Y 2 _i,Z_i; . . . ; X_i,Ym_i,Z_i) found inside the reference set (SET_r_i); and either the prefix substring (X_i) or the suffix substring (Z_i) is not empty.