-
公开(公告)号：US10255272B2
公开(公告)日：2019-04-09
申请号：US15472977
申请日：2017-03-29
申请人： Quid, Inc.
摘要： Provided is a process of modifying semantic similarity graphs representative of pair-wise similarity between documents in a corpus, the method comprising obtaining a semantic similarity graph that comprises more than 500 nodes and more than 1000 weighted edges, each node representing a document of a corpus, and each edge weight indicating an amount of similarity between a pair of documents corresponding to the respective nodes connected by the respective edge; obtaining an n-gram indicating that edge weights affected by the n-gram are to be increased or decreased; expanding the n-gram to produce a set of expansion n-grams; adjusting edge weights of edges between pairs of documents in which members of the expanded n-gram set co-occur.
-
公开(公告)号：US09645999B1
公开(公告)日：2017-05-09
申请号：US15226093
申请日：2016-08-02
申请人： Quid, Inc.
CPC分类号： G06F17/2785 , G06F17/2775 , G06F17/30011 , G06F17/30705 , G06F17/30713 , G06F17/30958
摘要： Provided is a process of modifying semantic similarity graphs representative of pair-wise similarity between documents in a corpus, the method comprising obtaining a semantic similarity graph that comprises more than 500 nodes and more than 1000 weighted edges, each node representing a document of a corpus, and each edge weight indicating an amount of similarity between a pair of documents corresponding to the respective nodes connected by the respective edge; obtaining an n-gram indicating that edge weights affected by the n-gram are to be increased or decreased; expanding the n-gram to produce a set of expansion n-grams; adjusting edge weights of edges between pairs of documents in which members of the expanded n-gram set co-occur.
-
公开(公告)号：US09767165B1
公开(公告)日：2017-09-19
申请号：US15206703
申请日：2016-07-11
申请人： Quid, Inc.
IPC分类号： G06F17/30
CPC分类号： G06F17/30867 , G06F17/30719
摘要： Provided is a process including: obtaining a corpus having a plurality of document collections, each of which is associated with features; for a given document collection, computing a pertinence score for each feature; ranking the features based on the features' pertinence scores; selecting a first set of features based on a first coverage score thereof and a threshold; re-ranking the first set of features based on the features' relevance to the document collection; and selecting a second set of features from the first set of features based on a second coverage score thereof and the threshold, the second set of features being used for summarizing the document collection.
-
公开(公告)号：US09715495B1
公开(公告)日：2017-07-25
申请号：US15379724
申请日：2016-12-15
申请人： Quid, Inc.
CPC分类号： G06F17/2785 , G06F17/30713 , G06F17/30958
摘要： Provided is a process of enhancing or suppressing measures of relationships between documents based on the relationships arising from text pertaining to selected topics, the process including: obtaining a corpus of documents; obtaining a set of topics by self-extracting topics according to the tokens present in text of the documents or manual provision; receiving a selected topic among the set of topics, the selection indicating that relationships between the documents are to be enhanced or suppressed in virtue of the relationships arising from text relating to the selected topic; forming a relationship graph of the documents, wherein: the relationships between pairs of the documents are determined based on co-occurrence of n-grams in the pairs of the documents, and wherein the relationships are enhanced or suppressed in response to co-occurring n-grams being in the respective set of n-grams of the selected topic.
-
公开(公告)号：US10769381B2
公开(公告)日：2020-09-08
申请号：US15629001
申请日：2017-06-21
申请人： Quid, Inc.
IPC分类号： G06F16/27 , G06F16/30 , G06F40/30 , G06F16/35 , G06F16/901
摘要： Provided is a process of enhancing or suppressing measures of relationships between documents based on the relationships arising from text pertaining to selected topics, the process including: obtaining a corpus of documents; obtaining a set of topics by self-extracting topics according to the tokens present in text of the documents or manual provision; receiving a selected topic among the set of topics, the selection indicating that relationships between the documents are to be enhanced or suppressed in virtue of the relationships arising from text relating to the selected topic; forming a relationship graph of the documents, wherein: the relationships between pairs of the documents are determined based on co-occurrence of n-grams in the pairs of the documents, and wherein the relationships are enhanced or suppressed in response to co-occurring n-grams being in the respective set of n-grams of the selected topic.
-
公开(公告)号：US20180173699A1
公开(公告)日：2018-06-21
申请号：US15629001
申请日：2017-06-21
申请人： Quid, Inc.
摘要： Provided is a process of enhancing or suppressing measures of relationships between documents based on the relationships arising from text pertaining to selected topics, the process including: obtaining a corpus of documents; obtaining a set of topics by self-extracting topics according to the tokens present in text of the documents or manual provision; receiving a selected topic among the set of topics, the selection indicating that relationships between the documents are to be enhanced or suppressed in virtue of the relationships arising from text relating to the selected topic; forming a relationship graph of the documents, wherein: the relationships between pairs of the documents are determined based on co-occurrence of n-grams in the pairs of the documents, and wherein the relationships are enhanced or suppressed in response to co-occurring n-grams being in the respective set of n-grams of the selected topic.
-
公开(公告)号：US20180039620A1
公开(公告)日：2018-02-08
申请号：US15472977
申请日：2017-03-29
申请人： Quid, Inc.
CPC分类号： G06F17/2785 , G06F17/2775 , G06F17/30011 , G06F17/30705 , G06F17/30713 , G06F17/30958
摘要： Provided is a process of modifying semantic similarity graphs representative of pair-wise similarity between documents in a corpus, the method comprising obtaining a semantic similarity graph that comprises more than 500 nodes and more than 1000 weighted edges, each node representing a document of a corpus, and each edge weight indicating an amount of similarity between a pair of documents corresponding to the respective nodes connected by the respective edge; obtaining an n-gram indicating that edge weights affected by the n-gram are to be increased or decreased; expanding the n-gram to produce a set of expansion n-grams; adjusting edge weights of edges between pairs of documents in which members of the expanded n-gram set co-occur.
-
-
-
-
-
-
搜索结果
7 条记录 (耗时 0.016 秒)
