发明名称 |
STRING PATTERN CONCEPTUALIZATION METHOD AND PROGRAM PRODUCT FOR STRING PATTERN CONCEPTUALIZATION |
摘要 |
A conceptualization method uses maximum or other substrings of a string pattern to find specific N-tuples of substring triples with N>=2 and m=1 . . . N inside a reference set (SET_r_i) of strings (STR_n_i). Each N-tuple is considered as a candidate for representing related concepts. Each concatenation of the substrings triples is an explicit member of the reference set (SET_r_i). Each middle substring out of middle substrings is unequal to another middle substring out of middle substrings within the substring triples 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 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 found inside the reference set (SET_r_i). Either the prefix substring (X_i) or the suffix substring (Z_i) is not empty.
|
申请公布号 |
US2009187560(A1) |
申请公布日期 |
2009.07.23 |
申请号 |
US20080347070 |
申请日期 |
2008.12.31 |
申请人 |
INTERNATIONAL BUSINESS MACHINES CORPORATION |
发明人 |
ARNING ANDREAS;SEIFFERT ROLAND |
分类号 |
G06F7/20;G06F17/30 |
主分类号 |
G06F7/20 |
代理机构 |
|
代理人 |
|
主权项 |
|
地址 |
|