Patents by Inventor Danni MA

Danni MA 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).

  • Systems and methods for unsupervised paraphrase mining
    Patent number: 12412046
    Abstract: Disclosed embodiments relate to aligning pairs of sentences. Techniques can include receiving a plurality of sentences; generating a graph for each of at least two sentences of the plurality of sentences, wherein generating a graph for each sentence of the at least two sentences comprises: identifying one or more tokens for the sentence; and connecting via edges the one or more tokens; generating a combined graph for the at least two sentences wherein generating a combined graph comprises: aligning the identified tokens of the at least two sentences of the plurality of sentences; identifying matching and non-matching tokens between the at least two sentences based on the alignment; and merging matching tokens into a combined graph node.
    Type: Grant
    Filed: August 8, 2023
    Date of Patent: September 9, 2025
    Assignee: Recruit Co., Ltd.
    Inventors: Behzad Golshan, Chen Chen, Wang-Chiew Tan, Danni Ma
  • SYSTEMS AND METHODS FOR UNSUPERVISED PARAPHRASE MINING
    Publication number: 20240020485
    Abstract: Disclosed embodiments relate to aligning pairs of sentences. Techniques can include receiving a plurality of sentences; generating a graph for each of at least two sentences of the plurality of sentences, wherein generating a graph for each sentence of the at least two sentences comprises: identifying one or more tokens for the sentence; and connecting via edges the one or more tokens; generating a combined graph for the at least two sentences wherein generating a combined graph comprises: aligning the identified tokens of the at least two sentences of the plurality of sentences; identifying matching and non-matching tokens between the at least two sentences based on the alignment; and merging matching tokens into a combined graph node.
    Type: Application
    Filed: August 8, 2023
    Publication date: January 18, 2024
    Applicant: Recruit Co., Ltd.
    Inventors: Behzad GOLSHAN, Chen Chen, Wang-Chiew Tan, Danni Ma
  • Systems and methods for unsupervised paraphrase mining
    Patent number: 11741312
    Abstract: Disclosed embodiments relate to aligning pairs of sentences. Techniques can include receiving a plurality of sentences; generating a graph for each of at least two sentences of the plurality of sentences, wherein generating a graph for each sentence of the at least two sentences comprises: identifying one or more tokens for the sentence; and connecting via edges the one or more tokens; generating a combined graph for the at least two sentences wherein generating a combined graph comprises: aligning the identified tokens of the at least two sentences of the plurality of sentences; identifying matching and non-matching tokens between the at least two sentences based on the alignment; and merging matching tokens into a combined graph node.
    Type: Grant
    Filed: August 31, 2020
    Date of Patent: August 29, 2023
    Assignee: RECRUIT CO., LTD.
    Inventors: Behzad Golshan, Chen Chen, Wang-Chiew Tan, Danni Ma
  • SYSTEMS AND METHODS FOR UNSUPERVISED PARAPHRASE MINING
    Publication number: 20220067298
    Abstract: Disclosed embodiments relate to aligning pairs of sentences. Techniques can include receiving a plurality of sentences; generating a graph for each of at least two sentences of the plurality of sentences, wherein generating a graph for each sentence of the at least two sentences comprises: identifying one or more tokens for the sentence; and connecting via edges the one or more tokens; generating a combined graph for the at least two sentences wherein generating a combined graph comprises: aligning the identified tokens of the at least two sentences of the plurality of sentences; identifying matching and non-matching tokens between the at least two sentences based on the alignment; and merging matching tokens into a combined graph node.
    Type: Application
    Filed: August 31, 2020
    Publication date: March 3, 2022
    Inventors: Behzad GOLSHAN, Chen CHEN, Wang-Chiew TAN, Danni MA