BOOLEAN-QUERY COMPOSER
    1.
    发明申请

    公开(公告)号:US20170293676A1

    公开(公告)日:2017-10-12

    申请号:US15375641

    申请日:2016-12-12

    申请人: Quid, Inc.

    IPC分类号: G06F17/30

    摘要: Provided is a process of refining Boolean queries, the process including: obtaining a query; searching a corpus of documents based on the query; selecting narrowing terms that pertain to respective subsets of the responsive documents; selecting broadening terms related to the query; instructing the user's computing device to present a graphical user interface comprising: graphical representations of the narrowing terms; graphical representations of the broadening terms; and one or more user inputs by which the user refines the query by adding a selected narrowing term or a selected broadening term; obtaining a user selection of a broadening term or a narrowing term; forming a refined query based on the user selection; searching at least part of the corpus based on the refined query to identify refined responsive documents; and instructing the user's computing device to present an updated graphical user interface with information about the refined responsive documents.

    Boolean-query composer
    2.
    发明授权

    公开(公告)号:US09990417B2

    公开(公告)日:2018-06-05

    申请号:US15375641

    申请日:2016-12-12

    申请人: Quid, Inc.

    IPC分类号: G06F17/30

    摘要: Provided is a process of refining Boolean queries, the process including: obtaining a query; searching a corpus of documents based on the query; selecting narrowing terms that pertain to respective subsets of the responsive documents; selecting broadening terms related to the query; instructing the user's computing device to present a graphical user interface comprising: graphical representations of the narrowing terms; graphical representations of the broadening terms; and one or more user inputs by which the user refines the query by adding a selected narrowing term or a selected broadening term; obtaining a user selection of a broadening term or a narrowing term; forming a refined query based on the user selection; searching at least part of the corpus based on the refined query to identify refined responsive documents; and instructing the user's computing device to present an updated graphical user interface with information about the refined responsive documents.

    Boolean-query composer
    3.
    发明授权
    Boolean-query composer 有权
    布尔查询作曲家

    公开(公告)号:US09552412B1

    公开(公告)日:2017-01-24

    申请号:US15092938

    申请日:2016-04-07

    申请人: Quid, Inc.

    IPC分类号: G06F17/30

    摘要: Provided is a process of refining Boolean queries, the process including: obtaining a query; searching a corpus of documents based on the query; selecting narrowing terms that pertain to respective subsets of the responsive documents; selecting broadening terms related to the query; instructing the user's computing device to present a graphical user interface comprising: graphical representations of the narrowing terms; graphical representations of the broadening terms; and one or more user inputs by which the user refines the query by adding a selected narrowing term or a selected broadening term; obtaining a user selection of a broadening term or a narrowing term; forming a refined query based on the user selection; searching at least part of the corpus based on the refined query to identify refined responsive documents; and instructing the user's computing device to present an updated graphical user interface with information about the refined responsive documents.

    摘要翻译: 提供了一种精简布尔查询的过程,其过程包括:获取查询; 基于查询搜索文档语料库; 选择与响应文件的各个子集相关的缩小词; 选择与查询相关的扩展条款; 指示用户的计算设备呈现图形用户界面,包括:缩小项的图形表示; 扩展术语的图形表示; 以及一个或多个用户输入,通过所述用户输入,用户通过添加所选择的缩小项或所选择的扩展术语来优化所述查询; 获取用户选择扩展术语或缩小术语; 基于用户选择形成精细查询; 基于精确查询来搜索语料库的至少一部分,以识别精确的响应文档; 并且指示用户的计算设备向更新的图形用户界面呈现关于经精炼的响应文档的信息。

    Summarized network graph for semantic similarity graphs of large corpora

    公开(公告)号:US09836183B1

    公开(公告)日:2017-12-05

    申请号:US15264975

    申请日:2016-09-14

    申请人: Quid, Inc.

    摘要: Provided is a process including: obtaining a clustered graph, the clustered graph having three or more clusters, each cluster having a plurality of nodes of the graph, the nodes being connected in pairs by one or more respective edges; determining visual attributes of cluster icons based on amounts of nodes in clusters corresponding to the respective cluster icons; determining positions of the cluster icons in a graphical visualization of the clustered graph; obtaining, for each cluster, a respective subset of nodes in the respective cluster; determining visual attributes of node icons based on attributes of corresponding nodes in the subsets of nodes, each node icon representing one of the nodes in the respective subset of nodes; determining positions of the node icons in the graphical visualization based on the positions of the corresponding cluster icons of clusters having the nodes corresponding to the respective node icons; and causing the graphical visualization to be displayed.