Patents by Inventor Tetyana Chernenko

Tetyana Chernenko 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).

  • Publication number: 20240354511
    Abstract: Embodiments relate to systems and methods that improve the definition of semantic domains within incoming data, and accurately distribute data over those defined domains. In a particular embodiment, company-specific terminology and data governance (d.g.) domains are used to define “highly semantically loaded” terms within an incoming linguistic data corpus having existing semantic domains assigned thereto. Analyzing distribution patterns of such highly semantically loaded terms across the incoming linguistic data (and/or across the d.g. domains) enhances the accuracy of assignment of semantical domains and distribution of the data across these domains. Such improved semantic domains can improve operation of computers tasked with downstream processing of the linguistic data—e.g., by Natural Language Processing (NLP).
    Type: Application
    Filed: April 21, 2023
    Publication date: October 24, 2024
    Inventors: Tetyana Chernenko, Benjamin Schork, Marcus Danei
  • Patent number: 12067370
    Abstract: Translation capability for language processing determines an existence of an abbreviation, followed by non-exact matching to map the abbreviation to the original full term. A received string in a source language is provided as input to a translation service. Translation proposals in a different target language are received back. A ruleset (considering factors, e.g., camel case format, the presence of a concluding period, and/or consecutive consonants) is applied to generate abbreviation candidates from the translation proposals. Non-exact matching (referencing e.g., a comparison metric) may then be used to map the abbreviation candidates to text strings of their original full terms. A mapping of the abbreviation to the text string of the original full term is stored in a translation database comprising linguistic data. Embodiments leverage existing resources (e.g.
    Type: Grant
    Filed: June 8, 2021
    Date of Patent: August 20, 2024
    Assignee: SAP SE
    Inventors: Tetyana Chernenko, Anton Snitko, Jens Scharnbacher, Michail Vasiltschenko
  • Publication number: 20240176778
    Abstract: Term ambiguity is resolved by referencing a terminology database. An input is received comprising the term designated as ambiguous, and a string including the term. The term is posed as a query to the terminology database containing metadata of at least one type. Query results are returned including at least two possible meanings. Sequence(s) are extracted from the query results, each sequence including at least two pieces of metadata of a same type—one for each possible meaning of the ambiguous term. The metadata of each entry of a sequence is compared with the query result and corresponding scores are calculated. The scores are compared to determine a final meaning of the ambiguous term. Simpler embodiments considering one type of metadata (one sequence), may calculate and compare a listing of scores. Complex embodiments considering more than one type of metadata (multiple sequences), may calculate and compare a matrix of scores.
    Type: Application
    Filed: November 28, 2022
    Publication date: May 30, 2024
    Inventors: Tetyana Chernenko, Benjamin Schork, Marcus Danei
  • Publication number: 20220391601
    Abstract: Translation capability for language processing determines an existence of an abbreviation, followed by non-exact matching to map the abbreviation to the original full term. A received string in a source language is provided as input to a translation service. Translation proposals in a different target language are received back. A ruleset (considering factors, e.g., camel case format, the presence of a concluding period, and/or consecutive consonants) is applied to generate abbreviation candidates from the translation proposals. Non-exact matching (referencing e.g., a comparison metric) may then be used to map the abbreviation candidates to text strings of their original full terms. A mapping of the abbreviation to the text string of the original full term is stored in a translation database comprising linguistic data. Embodiments leverage existing resources (e.g.
    Type: Application
    Filed: June 8, 2021
    Publication date: December 8, 2022
    Inventors: Tetyana Chernenko, Anton Snitko, Jens Scharnbacher, Michail Vasiltschenko