发明名称 |
Method for identifying the integrity of information |
摘要 |
A preferred method for identifying at least one of a grammatical, linguistic and/or conceptual integrity of a data corpus is disclosed. In a preferred method, the associations between several word elements of a data corpus are identified. Then, the word elements experiencing several associations are used for identifying the continuum between associations and the number of word elements involved and/or not involved in the associations which is then used for identifying at least one of a: linguistic, semantic, grammatical, conceptual or other integrity or coherence of the analyzed data corpus, such as a query for optionally displaying a data corpus understanding and/or selecting a particular search behavior or other. |
申请公布号 |
US9063923(B2) |
申请公布日期 |
2015.06.23 |
申请号 |
US201012661612 |
申请日期 |
2010.03.18 |
申请人 |
IQINTELL, INC. |
发明人 |
Williams Frank John |
分类号 |
G06F17/27;G06F17/21;G10L21/00 |
主分类号 |
G06F17/27 |
代理机构 |
Apogee Law Group P.C. |
代理人 |
Gulliver Gregory B.;Apogee Law Group P.C. |
主权项 |
1. A method of determining integrity of a data string consisting of a plurality of n word elements, the method comprising:
a) using a first word element of the n word elements, determining if the first word element may be associated with any of the remaining n−1 word elements that follow using a conceptual associative protocol; b) for each of the remaining n−1 word elements that follow that may be associated with the first word element using the conceptual associative protocol, forming an association consisting of the first word element in a first position of the association and the corresponding word element of the remaining n−1 word elements in a second position of the association; c) repeating steps a) and b) with each and every one of the remaining n−1 word elements; d) storing the associations formed in steps a) through c) in an association table; and e) performing an integrity analysis of the associations stored in the association table by determining if each and every word element of the n word elements matches at least one other word element of an association of the association table. |
地址 |
Huntington Beach CA US |