Patents by Inventor Kasper Dinkla

Kasper Dinkla 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: 11934419
    Abstract: The present disclosure relates to a method for displaying a search result in a user interface comprising a sequence of K table rows, a sequence of first type columns (named regular columns) and a sequence of B second type columns (named braided columns), the search result comprising values of attributes. The method includes creating a structure that includes a sequence table rows and a sequence of regular columns and a sequence of braided columns. The method selects a row of the sequence of rows and a braided column of the braided columns for displaying the search result. In each regular column a regular cell that is included in the selected row may be defined. From a braided column a braided cell may be defined that includes in the selected row and subsequent B?1 rows. The attributes values are displayed in the defined regular and braided cells.
    Type: Grant
    Filed: February 1, 2022
    Date of Patent: March 19, 2024
    Assignee: International Business Machines Corporation
    Inventors: Kasper Dinkla, Michele Dolfi, Christoph Auer, Birgit Monika Pfitzmann, Peter Willem Jan Staar
  • Publication number: 20230252309
    Abstract: A computer-implemented method, a computer program product, and a computer system for building a knowledge graph. A computer system converts user inputs as to a partial topology of a knowledge graph that a user wants to build into one or more initial nodes corresponding to respective natural language descriptions. A computer system interprets the respective natural language descriptions using natural language processing to match the one or more initial nodes against reference data. A computer system, based on matched reference data, obtains a valid topology of nodes and edges, wherein the nodes and edges are mapped onto the matched reference data. A computer system, based on the valid topology, generates a data flow linking to the matched reference data via associations of the nodes and edges and the matched reference data. A computer system builds an executable knowledge graph from the data flow.
    Type: Application
    Filed: February 7, 2022
    Publication date: August 10, 2023
    Inventors: Birgit Monika Pfitzmann, Christoph Auer, Kasper Dinkla, Michele Dolfi, Peter Willem Jan Staar
  • Publication number: 20230244682
    Abstract: The present disclosure relates to a method for displaying a search result in a user interface comprising a sequence of K table rows, a sequence of first type columns (named regular columns) and a sequence of B second type columns (named braided columns), the search result comprising values of attributes. The method includes creating a structure that includes a sequence table rows and a sequence of regular columns and a sequence of braided columns. The method selects a row of the sequence of rows and a braided column of the braided columns for displaying the search result. In each regular column a regular cell that is included in the selected row may be defined. From a braided column a braided cell may be defined that includes in the selected row and subsequent B?1 rows. The attributes values are displayed in the defined regular and braided cells.
    Type: Application
    Filed: February 1, 2022
    Publication date: August 3, 2023
    Inventors: Kasper Dinkla, Michele Dolfi, Christoph Auer, Birgit Monika Pfitzmann, Peter Willem Jan Staar
  • Publication number: 20230132061
    Abstract: Information extraction systems and computer-implemented methods for producing a searchable representation of information contained in a corpus of documents by generating a document structure graph for each document, the graph indicating a structural hierarchy of document items in that document based on a predefined hierarchy of predetermined item-types, and linking document items to a parent document item in the structural hierarchy, for each document, generating a knowledge graph including first nodes, representing document items in the corpus and second nodes representing language items identified in those document items, interconnecting the first nodes and second nodes by edges representing a defined relation between items represented by the nodes interconnected by that edge, storing the knowledge graph in a knowledge graph database, and producing the searchable representation by traversing edges of the graph in response to input search queries.
    Type: Application
    Filed: October 22, 2021
    Publication date: April 27, 2023
    Inventors: Birgit Monika Pfitzmann, Christoph Auer, Kasper Dinkla, Michele Dolfi, Peter Willem Jan Staar
  • Publication number: 20220292121
    Abstract: The present disclosure relates to a method for searching a graph representing content of digital objects. A set of operations for traversing the graph may be determined according to a search request. The set of operations may be executed, resulting in intermediate result vectors of nodes and a result vector of nodes, wherein the result vector of nodes is associated with a result set of one or more object units of the digital objects. Intermediate result vectors may be selected from of the intermediate result vectors. A set of result entities may be identified. The set of result entities are entities which are part of the object units and part of entities represented by nodes of said selected intermediate result vectors. The set of result entities and the result set of object units may be provided as a result of the search request.
    Type: Application
    Filed: March 12, 2021
    Publication date: September 15, 2022
    Inventors: Birgit Monika Pfitzmann, Kasper Dinkla, Michele Dolfi, Christoph Auer, Peter Willem Jan Staar, André Carvalho