Patents by Inventor Dafna Sheinwald
Dafna Sheinwald 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: 10810375Abstract: A method comprising: operating at least one hardware processor for: receiving, as input, at least one named entity, modifying said named entity based on a plurality of modification rules to generate a set of candidate named entities corresponding to said named entity, and identifying, for at least one candidate named entity in said set of candidate named entities, an article in a knowledge base of articles, wherein a title of said article matches said candidate named entity.Type: GrantFiled: July 8, 2018Date of Patent: October 20, 2020Assignee: International Business Machines CorporationInventors: Yosi Mass, Amir Menczel, Dafna Sheinwald, Ilya Shnayderman, Noam Slonim
-
Publication number: 20200012719Abstract: A method comprising: operating at least one hardware processor for: receiving, as input, at least one named entity, modifying said named entity based on a plurality of modification rules to generate a set of candidate named entities corresponding to said named entity, and identifying, for at least one candidate named entity in said set of candidate named entities, an article in a knowledge base of articles, wherein a title of said article matches said candidate named entity.Type: ApplicationFiled: July 8, 2018Publication date: January 9, 2020Inventors: Yosi Mass, Amir Menczel, Dafna Sheinwald, Ilya Shnayderman, Noam Slonim
-
Patent number: 9697276Abstract: A method includes associating, in a graph including graph nodes connected via of edges, a respective node weight with each of the graph nodes, and organizing the graph nodes into ancestor nodes, each of the ancestor nodes having one or more descendent nodes so that the ancestor and the descendent nodes include all the graph nodes. For a given descendent node, a respective path to one or more of the ancestor nodes is identified, each of the respective paths including one or more edges, and a given ancestor node having a shortest of the identified paths is determined. A respective edge weight is assigned to each of the one or more edges in the shortest path, and, for the given descendent node, a node loss value is calculated based on the node weight and the respective edge weight of the each of the one or more edges.Type: GrantFiled: December 29, 2014Date of Patent: July 4, 2017Assignee: International Business Machines CorporationInventors: Gadi Aleksandrowicz, Doron Cohen, David Konopnicki, Oded Margalit, Haggai Roitman, Dafna Sheinwald, Michal Shmueli-Scheuer
-
Publication number: 20170032018Abstract: A method includes associating, in a graph including graph nodes connected via of edges, a respective node weight with each of the graph nodes, and organizing the graph nodes into ancestor nodes, each of the ancestor nodes having one or more descendent nodes so that the ancestor and the descendent nodes include all the graph nodes. For a given descendent node, a respective path to one or more of the ancestor nodes is identified, each of the respective paths including one or more edges, and a given ancestor node having a shortest of the identified paths is determined. A respective edge weight is assigned to each of the one or more edges in the shortest path, and, for the given descendent node, a node loss value is calculated based on the node weight and the respective edge weight of the each of the one or more edges.Type: ApplicationFiled: December 29, 2014Publication date: February 2, 2017Inventors: Gadi Aleksandrowicz, Doron Cohen, David Konopnicki, Oded Margalit, Haggai Roitman, Dafna Sheinwald, Michal Shmueli-Scheuer
-
Patent number: 8972440Abstract: A semantic query over a corpus of data is constructed using a graphical user interface to create an aggregation of graphical representations of annotations associated with a plurality of data elements contained within the corpus of data and graphical representations of search terms contained within the plurality of data elements. The aggregation includes at least one annotation and at least one search term. The relative positions of the graphical representations of the annotations and the search terms are manipulated within the aggregation within the graphical user interface to express relationships among the annotations and search terms, yielding a visual spatial representation of the semantic query. The annotations, search terms and expressed relationships define the semantic query that is used to search the corpus of data.Type: GrantFiled: June 25, 2013Date of Patent: March 3, 2015Assignee: International Business Machines CorporationInventors: Branimir Konstantinov Boguraev, Eric William Brown, Youssef Drissi, David Angelo Ferrucci, Paul Turquand Keyser, Anthony Tom Levas, Dafna Sheinwald
-
Patent number: 8856021Abstract: Method, system, and computer program product are provided for scoring of crowd-computing inputs. A group of data is provided to crowd-computing participants and the participants are requested to provide candidate members or the group of data. The computer-implemented method performed includes: receiving an input by a participant, wherein the input is a candidate member; counting multiple inputs of the same candidate member by participants; validating a candidate member; rewarding the participants inputting the candidate member, with a higher reward for participants who input the candidate member earlier than other participants; and supplying the rewards to participants once the candidate member has been validated.Type: GrantFiled: June 12, 2011Date of Patent: October 7, 2014Assignee: International Business Machines CorporationInventors: David Carmel, Ido Guy, Dafna Sheinwald, Itai Turbahn
-
Publication number: 20130290370Abstract: A semantic query over a corpus of data is constructed using a graphical user interface to create an aggregation of graphical representations of annotations associated with a plurality of data elements contained within the corpus of data and graphical representations of search terms contained within the plurality of data elements. The aggregation includes at least one annotation and at least one search term. The relative positions of the graphical representations of the annotations and the search terms are manipulated within the aggregation within the graphical user interface to express relationships among the annotations and search terms, yielding a visual spatial representation of the semantic query. The annotations, search terms and expressed relationships define the semantic query that is used to search the corpus of data.Type: ApplicationFiled: June 25, 2013Publication date: October 31, 2013Inventors: Branimir Konstantinov BOGURAEV, Eric William BROWN, Youssef DRISSI, David Angelo FERRUCCI, Paul Turquand KEYSER, Anthony Tom LEVAS, Dafna SHEINWALD
-
Patent number: 8510327Abstract: A semantic query over a corpus of data is constructed using a graphical user interface to create an aggregation of graphical representations of annotations associated with a plurality of data elements contained within the corpus of data and graphical representations of search terms contained within the plurality of data elements. The aggregation includes at least one annotation and at least one search term. The relative positions of the graphical representations of the annotations and the search terms are manipulated within the aggregation within the graphical user interface to express relationships among the annotations and search terms, yielding a visual spatial representation of the semantic query. The annotations, search terms and expressed relationships define the semantic query that is used to search the corpus of data.Type: GrantFiled: May 10, 2011Date of Patent: August 13, 2013Assignee: International Business Machinees CorporationInventors: Branimir Konstantinov Boguraev, Eric William Brown, Youssef Drissi, David Angelo Ferrucci, Paul Turquand Keyser, Anthony Tom Levas, Dafna Sheinwald
-
Publication number: 20120316889Abstract: Method, system, and computer program product are provided for scoring of crowd-computing inputs. A group of data is provided to crowd-computing participants and the participants are requested to provide candidate members or the group of data. The computer-implemented method performed includes: receiving an input by a participant, wherein the input is a candidate member; counting multiple inputs of the same candidate member by participants; validating a candidate member; rewarding the participants inputting the candidate member, with a higher reward for participants who input the candidate member earlier than other participants; and supplying the rewards to participants once the candidate member has been validated.Type: ApplicationFiled: June 12, 2011Publication date: December 13, 2012Applicant: International Business Machines CorporationInventors: David Carmel, Ido Guy, Dafna Sheinwald, Itai Turbahn
-
Patent number: 8332417Abstract: A method and system for searching using contextual data are provided. The method includes receiving one or more areas of data captured by a user from a display, the data including content and context or structure. The method converts the area of captured data to one or more extensible markup language (XML) representations of the content and context or structure. The method provides multiple hierarchical textual instances with formatting (for example, as hypertext markup language instances) corresponding to the XML representations. A query is generated for searching in a search engine for each textual instance. The one or more areas of data captured by a user include an indication of whether the area of data is selected for content, context, or both.Type: GrantFiled: June 30, 2009Date of Patent: December 11, 2012Assignee: International Business Machines CorporationInventors: Ariel Farkash, Ohad Greenshpan, Ksenya Kveler, Dafna Sheinwald
-
Publication number: 20120078955Abstract: A semantic query over a corpus of data is constructed using a graphical user interface to create an aggregation of graphical representations of annotations associated with a plurality of data elements contained within the corpus of data and graphical representations of search terms contained within the plurality of data elements. The aggregation includes at least one annotation and at least one search term. The relative positions of the graphical representations of the annotations and the search terms are manipulated within the aggregation within the graphical user interface to express relationships among the annotations and search terms, yielding a visual spatial representation of the semantic query. The annotations, search terms and expressed relationships define the semantic query that is used to search the corpus of data.Type: ApplicationFiled: May 10, 2011Publication date: March 29, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: BRANIMIR KONSTANTINOV BOGURAEV, ERIC William BROWN, YOUSSEF DRISSI, DAVID ANGELO FERRUCCI, PAUL TURQUAND KEYSER, ANTHONY TOM LEVAS, DAFNA SHEINWALD
-
Patent number: 7895232Abstract: A computer-implemented method for searching a corpus of documents includes defining a query as a twig including a root annotation operator having an associated tag specifying a span and having an associated expression indicative of one or more terms whose occurrence within the span will satisfy the query. An object is recursively selected from a group of objects that consists of the tag and the expression, and is used in advancing through the corpus until a candidate document is found that contains the tag and satisfies the expression. The candidate document is evaluated to determine whether the one or more terms indicated by the expression occur within the span in the candidate document so as to satisfy the annotation operator.Type: GrantFiled: December 25, 2007Date of Patent: February 22, 2011Assignee: International Business Machines CorporationInventors: Benjamin Sznajder, Dafna Sheinwald, Sivan Yogev
-
Publication number: 20100332470Abstract: A method and system for searching using contextual data are provided. The method includes receiving one or more areas of data captured by a user from a display, the data including content and context or structure. The method converts the area of captured data to one or more extensible markup language (XML) representations of the content and context or structure. The method provides multiple hierarchical textual instances with formatting (for example, as hypertext markup language instances) corresponding to the XML representations. A query is generated for searching in a search engine for each textual instance. The one or more areas of data captured by a user include an indication of whether the area of data is selected for content, context, or both.Type: ApplicationFiled: June 30, 2009Publication date: December 30, 2010Applicant: International Business Machines CorporationInventors: Ariel Farkash, Ohad Greenshpan, Ksenya Kveler, Dafna Sheinwald
-
Publication number: 20090164424Abstract: A computer-implemented method for searching a corpus of documents includes defining a query as a twig including a root annotation operator having an associated tag specifying a span and having an associated expression indicative of one or more terms whose occurrence within the span will satisfy the query. An object is recursively selected from a group of objects that consists of the tag and the expression, and is used in advancing through the corpus until a candidate document is found that contains the tag and satisfies the expression. The candidate document is evaluated to determine whether the one or more terms indicated by the expression occur within the span in the candidate document so as to satisfy the annotation operator.Type: ApplicationFiled: December 25, 2007Publication date: June 25, 2009Inventors: Benjamin Sznajder, Dafna Sheinwald, Sivan Yogev
-
Publication number: 20080235228Abstract: A method for processing data includes reading respective initial substrings of the strings in a group, and computing respective codewords for the initial substrings. The codewords indicate differences between the substrings and point to the strings from which the substrings were respectively read. The codewords are arranged in a heap, which includes a tree of nodes. Each node has no more than two children and has a respective codeword pointing to a string that is in a predetermined ordinal relation, based on the lexicographical ordering, to the strings pointed to by the codewords of the children of the node. A list of one or more of the strings is output in accordance with a lexicographical ordering by selecting one or more of the nodes in the heap and reading the strings that are pointed to by the corresponding codewords.Type: ApplicationFiled: March 21, 2007Publication date: September 25, 2008Inventors: Carmel Gerda Kent, Dafna Sheinwald
-
Publication number: 20070033165Abstract: A computer-implemented method, for searching a corpus of documents having an index, includes receiving a complex query, which includes a plurality of words conjoined by operators including a root operator and at least one intermediate operator. Respective advancement potentials are assigned to the words in the complex query. A query processor applies a consultation method to the words and operators in the complex query in order to choose one of the words responsively to the advancement potentials. The query processor advances through the index in order to find a document containing the chosen one of the words, and evaluates the document to determine whether the document satisfies the complex query.Type: ApplicationFiled: August 2, 2005Publication date: February 8, 2007Applicant: International Business Machines CorporationInventors: Dafna Sheinwald, Benjamin Sznajder
-
Publication number: 20050015293Abstract: A collaboration enhanced workflow system includes an interface unit at least to provide an interface to a workflow system for performing a selected workflow and an interface to a collaboration system within which the actors of the current instance of the selected workflow can collaborate.Type: ApplicationFiled: July 16, 2003Publication date: January 20, 2005Applicant: International Business Machines CorporationInventors: Horst Henn, Matthias Kloppmann, Frank Leymann, Yoelle Maarek, Michael Rodeh, Juergen Schaeck, Thomas Schaeck, Dafna Sheinwald
-
Patent number: 6832264Abstract: A method for compressing a target string of symbols includes identifying a set of reference strings stored by a computer, and matching a plurality of successive substrings in the target string to respective segments found in one or more of the reference strings. Respective segment specifiers are assigned to the substrings that identify the respective segments to which they are matched, and an ordered list of the specifiers is output.Type: GrantFiled: August 31, 2000Date of Patent: December 14, 2004Assignee: International Business Machines CorporationInventors: Dafna Sheinwald, Michael Factor
-
Patent number: 6668304Abstract: Apparatus for performing a data transaction, including at least one storage device which is adapted to receive data as a succession of data blocks for storage at respective physical locations therein and control circuitry. The control circuitry is configured to convey the succession of data blocks to the at least one storage device while writing to the at least one storage device, together with at least some of the data blocks, parameters indicative of the identity of the data transaction, the identity of the recorder of the transaction state, and a location of a subsequent data block in the succession. The control circuitry is also configured to transform a state of the data so as to complete (commit or abort) the data transaction using some of the indicative parameters. In the event of a failure of the apparatus before a transaction is completed, i.e., committed or aborted, the apparatus facilitates complete recovery using data stored in the data blocks.Type: GrantFiled: August 30, 2000Date of Patent: December 23, 2003Assignee: International Business Machines CorporationInventors: Julian Satran, Israel Gold, Dafna Sheinwald
-
Patent number: 6636941Abstract: Apparatus for electronic data storage, including a non-volatile memory, adapted to receive a succession of data blocks for storage at respective locations therein. The apparatus includes a controller which is configured to convey the succession of data blocks to the non-volatile memory, while writing to the non-volatile memory, together with at least some of the data blocks, a pointer value to the location of a subsequent data block in the succession. The apparatus preferably includes services that are usually performed by higher level file systems, such as allocation and deletion of blocks. Furthermore, the apparatus facilitates stable storage operations so that block contents are maintained intact in case of a write failure.Type: GrantFiled: July 6, 2000Date of Patent: October 21, 2003Assignee: International Business Machines CorporationInventors: Israel Gold, Julian Satran, Dafna Sheinwald