×

Method and system for performing searches for television content using reduced text input

  • US 10,277,952 B2
  • Filed: 08/24/2015
  • Issued: 04/30/2019
  • Est. Priority Date: 11/09/2004
  • Status: Active Grant
First Claim
Patent Images

1. A method for indexing items for reduced text searching, the method comprising:

  • accessing a first name of a plurality of names in a namespace, wherein the first name is associated with words of a first content descriptor corresponding to a first item, and wherein the first name comprises at least two words; and

    prior to receiving input from a user;

    computing a first prefix for a first word of the first name by;

    retrieving a parameter from a storage device, wherein the parameter indicates an upper bound on a size of the first prefix;

    comparing the parameter to the number of characters of the first word to determine whether the parameter is less than the number of characters of the first word;

    in response to determining that the parameter is less than the number of characters of the first word;

    generating a first substring of the first word, wherein the first substring comprises a first letter of the first word, wherein a number of characters of the first substring is less than a number of characters of the first word, and, wherein the number of characters of the first substring is equal to the parameter;

    appending a space character to the first substring that includes the number of characters less than the number of characters in the first word;

    generating a first set of nodes in a data structure for each character in the first substring, wherein each node of the first set is linked in a sequence matching a sequence of the characters of the first sub string; and

    associating each node of the first set with the first item;

    computing a second prefix for a second word of the first name by;

    generating a second substring of the second word, wherein the second substring comprises a first letter of the second word, and wherein a number of characters of the second substring is less than a number of characters of the second word;

    generating a second set of nodes in the data structure for each character in the second substring, wherein each node of the second set is linked in a sequence matching a sequence of the characters of the second substring; and

    associating each node of the second set with the first item; and

    linking a node of the second set corresponding to a first character of the second word with a node of the first set corresponding to the space character.

View all claims
  • 8 Assignments
Timeline View
Assignment View
    ×
    ×