Patents by Inventor Alexander Balinsky

Alexander Balinsky 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: 20180225291
    Abstract: Examples associated with identifying documents are disclosed. One example includes identifying at least one document in a corpus of documents that contains at least one token. The token is identified from a search query. Relevance of the search query to each identified document is determined according to a Helmholtz score for each respective identified token.
    Type: Application
    Filed: August 21, 2015
    Publication date: August 9, 2018
    Inventors: Helen Balinsky, Boris Dadachev, Steven J. Simske, Alexander Balinsky
  • Publication number: 20170132311
    Abstract: Examples relate to providing keywords to generate policy conditions. Examples include a computing device to remove, from a corpus of documents, words that are common among classes in the corpus to create a reduced corpus. In some examples, the computing device is to identify a set of keywords for a particular one of the classes in the reduced corpus by identifying keywords that are common among documents in the particular class, and provide the set of keywords to generate a policy condition.
    Type: Application
    Filed: June 27, 2014
    Publication date: May 11, 2017
    Inventors: Helen Balinsky, Alexander Balinsky, Boris Dadachev, Shivaun Albright
  • Publication number: 20140195897
    Abstract: Methods, systems, and computer readable media with executable instructions, and/or logic are provided for text summarization. An example method of text summarization can include determining, via a computing system (674), a graph (314) with a small world structure, corresponding to a document (300) comprising text, wherein nodes (316) of the graph (314) correspond to text features (302, 304) of the document (300) and edges (318) between particular nodes (316) represent relationships between the text features (302, 304) represented by the particular nodes (316) (440). The nodes (316) (442) are ranked via the computing system (674), and those nodes (316) having importance in the small world structure (444) are identified via the computing system. Text features (302, 304) corresponding to the indentified nodes (316) are selected, via the computing system (674), as a summary (334) of the document (300) (446).
    Type: Application
    Filed: September 20, 2011
    Publication date: July 10, 2014
    Inventors: Helen Y. Balinsky, Alexander Balinsky, Steven J. Simske
  • Patent number: 8375022
    Abstract: Example embodiments relate to keyword determination based on a weight of meaningfulness. In example embodiments, a computing device may determine a number of occurrences of a word in a particular document and may then determine a weight of meaningfulness for the word based on the number of occurrences. The computing device may then add the word to a set of keywords for the document based on the weight of meaningfulness.
    Type: Grant
    Filed: November 2, 2010
    Date of Patent: February 12, 2013
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Helen Balinsky, Alexander Balinsky, Steven J Simske
  • Publication number: 20120109977
    Abstract: Example embodiments relate to keyword determination based on a weight of meaningfulness. In example embodiments, a computing device may determine a number of occurrences of a word in a particular document and may then determine a weight of meaningfulness for the word based on the number of occurrences. The computing device may then add the word to a set of keywords for the document based on the weight of meaningfulness.
    Type: Application
    Filed: November 2, 2010
    Publication date: May 3, 2012
    Inventors: Helen Balinsky, Alexander Balinsky, Steven J. Simske