Patents by Inventor Jonathan Moskowitz

Jonathan Moskowitz 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: 12282739
    Abstract: A method for analyzing a digital message for presence of a non-compliant expression within the digital message is disclosed. The digital message may be created using a computing device including a text input hardware device and may contain at least one segment. The method includes capturing keystrokes at the text input hardware device, analyzing the keystrokes to capture the digital message including an end of the segment, and assessing the segment for presence of a concept flag in at the segment, wherein the concept flag is associated with the non-compliant expression. Assessing may include obtaining a relation pattern for the concept flag, generating a dependency parse graph for the segment, and comparing the dependency parse graph to the relation pattern. If at least a portion of the dependency parse graph matches the relation pattern, then concluding that the segment contains the concept flag associated with the non-compliant expression.
    Type: Grant
    Filed: February 17, 2023
    Date of Patent: April 22, 2025
    Assignee: FairWords, Inc.
    Inventors: Vadim Polosatov, Jonathan Moskowitz
  • Publication number: 20230385545
    Abstract: A method for analyzing a digital message for presence of a non-compliant expression within the digital message is disclosed. The digital message may be created using a computing device including a text input hardware device and may contain at least one segment. The method includes capturing keystrokes at the text input hardware device, analyzing the keystrokes to capture the digital message including an end of the segment, and assessing the segment for presence of a concept flag in at the segment, wherein the concept flag is associated with the non-compliant expression. Assessing may include obtaining a relation pattern for the concept flag, generating a dependency parse graph for the segment, and comparing the dependency parse graph to the relation pattern. If at least a portion of the dependency parse graph matches the relation pattern, then concluding that the segment contains the concept flag associated with the non-compliant expression.
    Type: Application
    Filed: February 17, 2023
    Publication date: November 30, 2023
    Applicant: FairWords, Inc.
    Inventors: Vadim Polosatov, Jonathan Moskowitz