×

Systems and methods for structured stem and suffix language models

  • US 9,899,019 B2
  • Filed: 08/31/2015
  • Issued: 02/20/2018
  • Est. Priority Date: 03/18/2015
  • Status: Active Grant
First Claim
Patent Images

1. A non-transitory computer-readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by one or more processors of an electronic device, cause the electronic device to:

  • receive an input from a user;

    determine, using a first n-gram language model, a first probability of a stem based at least on a first portion of a previously-input word in the received input;

    determine, using a second n-gram language model, a second probability of a first suffix based at least on a second portion of the previously-input word in the received input;

    determine, using a third n-gram language model, a third probability of a second suffix different from the first suffix based at least on a third portion of the previously-input word in the received input, wherein the third n-gram language model includes a tense suffix n-gram language model, and the determining of the third probability of the second suffix includes determining the third probability of a tense suffix based at least in part on a second tense suffix of the previously-input word;

    determine a fourth probability of at least one predicted word based on the first probability, the second probability and the third probability; and

    provide an output of the at least one predicted word to the user based on the fourth probability, wherein providing the output comprises at least one of displaying the predicted word or providing an audible playback of the predicted word.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×