Patents by Inventor Fabio Ciulla
Fabio Ciulla has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 10769381Abstract: 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.Type: GrantFiled: June 21, 2017Date of Patent: September 8, 2020Assignee: Quid, Inc.Inventors: Ruggero Altair Tacchi, Fabio Ciulla, Wojciech Musial, Robert Goodson
-
Patent number: 10678823Abstract: Provided is a process including: obtaining a graph comprising nodes and edges, each of the edges having a value indicating an amount of similarity between objects corresponding to the two linked nodes; selecting a parameter for influencing the graph; assessing each of the nodes based on the selected influencing parameter, wherein assessing comprises, with respect to each adjacent node in the graph sharing an edge with the node: determining the value indicating the amount of similarity between the object corresponding to the node and the object corresponding to the adjacent node; and determining a score related to the edge shared with the node, the score determined based on the similarity-amount value and a value of the selected influencing parameter for the node, such that edges are removed, weakened, added, or strengthened; and preparing, based on the graph, instructions to display at least part of the graph.Type: GrantFiled: December 15, 2016Date of Patent: June 9, 2020Assignee: Quid, Inc.Inventors: Ruggero Altair Tacchi, Fabio Ciulla
-
Patent number: 10552468Abstract: Provided is a process including obtaining a corpus having a plurality of time-stamped documents; detecting topics in the unstructured natural language text; determining temporal-metrics of the topics based on time-stamps of documents to which the topics pertain; and predicting based on the temporal-metrics, whether a given topic among the plurality of topics will appear in future time-stamped documents.Type: GrantFiled: November 1, 2017Date of Patent: February 4, 2020Assignee: Quid, Inc.Inventors: Fabio Ciulla, Ruggero Altair Tacchi, Robert Goodson
-
Patent number: 10255272Abstract: 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.Type: GrantFiled: March 29, 2017Date of Patent: April 9, 2019Assignee: Quid, Inc.Inventors: Fabio Ciulla, Wojciech Musial, Ruggero Altair Tacchi
-
Publication number: 20180173699Abstract: 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.Type: ApplicationFiled: June 21, 2017Publication date: June 21, 2018Inventors: Ruggero Altair Tacchi, Fabio Ciulla, Wojciech Musial
-
Publication number: 20180121539Abstract: Provided is a process including obtaining a corpus having a plurality of time-stamped documents; detecting topics in the unstructured natural language text; determining temporal-metrics of the topics based on time-stamps of documents to which the topics pertain; and predicting based on the temporal-metrics, whether a given topic among the plurality of topics will appear in future time-stamped documents.Type: ApplicationFiled: November 1, 2017Publication date: May 3, 2018Inventors: Fabio Ciulla, Ruggero Altair Tacchi, Robert Goodson
-
Publication number: 20180039620Abstract: 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.Type: ApplicationFiled: March 29, 2017Publication date: February 8, 2018Inventors: Fabio Ciulla, Wojciech Musial, Ruggero Altair Tacchi
-
Publication number: 20170329844Abstract: Provided is a process including: obtaining a graph comprising nodes and edges, each of the edges having a value indicating an amount of similarity between objects corresponding to the two linked nodes; selecting a parameter for influencing the graph; assessing each of the nodes based on the selected influencing parameter, wherein assessing comprises, with respect to each adjacent node in the graph sharing an edge with the node: determining the value indicating the amount of similarity between the object corresponding to the node and the object corresponding to the adjacent node; and determining a score related to the edge shared with the node, the score determined based on the similarity-amount value and a value of the selected influencing parameter for the node, such that edges are removed, weakened, added, or strengthened; and preparing, based on the graph, instructions to display at least part of the graph.Type: ApplicationFiled: December 15, 2016Publication date: November 16, 2017Inventors: Ruggero Altair Tacchi, Fabio Ciulla
-
Publication number: 20170228435Abstract: Provided is a process including: obtaining a semantic similarity graph having nodes corresponding to documents in an analyzed corpus and edges indicating semantic similarity between pairs of the documents; for at least a plurality of nodes in the graph, evaluating accuracy of the edges based on neighboring nodes and an external corpus by performing operations including: identifying the neighboring nodes based on adjacency to the respective node in the graph; selecting documents from an external corpus based on references in the selected documents to entities mentioned in the documents of the neighboring nodes; and determining how semantically similar the respective node is to the selected documents.Type: ApplicationFiled: August 5, 2016Publication date: August 10, 2017Inventors: Ruggero Altair Tacchi, Fabio Ciulla
-
Patent number: 9715495Abstract: 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.Type: GrantFiled: December 15, 2016Date of Patent: July 25, 2017Assignee: Quid, Inc.Inventors: Ruggero Altair Tacchi, Fabio Ciulla, Wojciech Musial
-
Patent number: 9645999Abstract: 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.Type: GrantFiled: August 2, 2016Date of Patent: May 9, 2017Assignee: Quid, Inc.Inventors: Fabio Ciulla, Wojciech Musial, Ruggero Altair Tacchi
-
Patent number: 9558265Abstract: Provided is a process including: obtaining a graph comprising nodes and edges, each of the edges having a value indicating an amount of similarity between objects corresponding to the two linked nodes; selecting a parameter for influencing the graph; assessing each of the nodes based on the selected influencing parameter, wherein assessing comprises, with respect to each adjacent node in the graph sharing an edge with the node: determining the value indicating the amount of similarity between the object corresponding to the node and the object corresponding to the adjacent node; and determining a score related to the edge shared with the node, the score determined based on the similarity-amount value and a value of the selected influencing parameter for the node, such that edges are removed, weakened, added, or strengthened; and preparing, based on the graph, instructions to display at least part of the graph.Type: GrantFiled: May 12, 2016Date of Patent: January 31, 2017Assignee: Quid, Inc.Inventors: Ruggero Altair Tacchi, Fabio Ciulla
-
Patent number: 9436760Abstract: Provided is a process including: obtaining a semantic similarity graph having nodes corresponding to documents in an analyzed corpus and edges indicating semantic similarity between pairs of the documents; for at least a plurality of nodes in the graph, evaluating accuracy of the edges based on neighboring nodes and an external corpus by performing operations including: identifying the neighboring nodes based on adjacency to the respective node in the graph; selecting documents from an external corpus based on references in the selected documents to entities mentioned in the documents of the neighboring nodes; and determining how semantically similar the respective node is to the selected documents.Type: GrantFiled: February 5, 2016Date of Patent: September 6, 2016Assignee: Quid, Inc.Inventors: Ruggero Altair Tacchi, Fabio Ciulla