会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 51. 发明专利
    • AN IN-APP CONVERSATIONAL QUESTION ANSWERING ASSISTANT FOR PRODUCT HELP
    • AU2019201531B2
    • 2021-08-12
    • AU2019201531
    • 2019-03-05
    • ADOBE INC
    • CHANG WALTERBRANDT JONATHANKIM DOO SOON
    • G06F16/31G06F16/332G06N5/04
    • Techniques of directing a user to content based on a semantic interpretation of a query input by the user involves generating links to specific content in a collection of documents in response to user string query, the links being generated based on an answer suggestion lookahead index. The answer suggestion lookahead index references a mapping between a plurality of groups of semantically equivalent terms and a respective link to specific content of the collection of documents. These techniques are useful for the generalized task of natural language question answering. Computer 120 Network Interface 122 Processing Units 124 Memory 126 Document Collection Knowledge Graph Acquisition Manager Generation Manager Document Data 132 Knowledge Graph Topic Data134 Data 142 Semantic Annotation Subtopic:Data1 j36 Data 144 Contet Dat 138Display Content Data138 Aggregated Link 190 Link Data 139 Data 146 Search Query Log Answer Suggestion Acquisition Manager LookaheadIndex 150 Manager 160 Search Query Log Answer Suggestion Data 152 Lookahead Index Data Query Data154 162 Semantically Link Data 156 Equivalent Term Data 164 User Query Acquisition Answer Card Manager 170 Presentation Manager User Query Data 172 DisplayManager182 Display Interface 128
    • 60. 发明专利
    • SYSTEM AND METHOD FOR PORTABLE DOCUMENT INDEXING USING N-GRAM WORD DECOMPOSITION
    • CA2192435C
    • 2006-04-04
    • CA2192435
    • 1996-04-10
    • REBUS TECHNOLOGY INC
    • RANGARAJAN VIJAYAKUMARRAVICHANDRAN NATARAJAN
    • G06F16/31G06F17/27
    • A system and method provides for indexing and retrieval of stored documents using a decomposition of words in the documents in n-grams, or linear word subunits. The documents are indexed as pages in a number of banks. For each bank there is a bank index. The individual n-greens are identified for each page and are stored is the bank index. Each bank index further contains an entry map that indicates whether a given n-gram is present in any of the pages of the bank, and then provides an index to a page map that further indicates which page in the bank contains the n-gram. When a search query is input, the query words are decomposed into their n-grams. The query word n-grams are compared first with entry maps to determine if the query word n-grams appear on any page in the bank. If so, the associated page map is traversed to determine which page in the bank contains the query word n-grams. The n-grams on the page are compared with the query word n-grams to determine the presence of a match therebetween. Matching pages are flagged. When all pages in all blanks have been processed, the pages are consolidated with respect to the documents to which they belong, resulting in a list of documents that match the search query. The results are displayed to a user.