Providing suggestion and translation thereof in accordance with a partial user entry

• US 9,384,267 B2
• Filed: 11/05/2012
• Issued: 07/05/2016
• Est. Priority Date: 07/10/2008
• Status: Active Grant

• Current Assignee: Google LLC (Alphabet Inc.)
• Original Assignee: Google Inc. (Alphabet Inc.)
• Inventors: Choi, Yung, Lee, Haimin, Lee, Dong-Hwi, Jang, Jungshik
• Primary Examiner(s): MORRISON, JAY A
• Application Number:
  US13/669,329
• Publication Number:
  US 20130066895A1
• Time in Patent Office: 1,338 Days
• Field of Search: None
• US Class Current: 1/1
• CPC Class Codes: G06F 16/3322 using system suggestions G06F16/3325 takes precedence
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques

Abstract

Systems and methods for providing suggestion and translation thereof in accordance with a partial user entry are disclosed. In some embodiments, a method includes: at a computer system with one or more processors and memory storing one or more programs for execution by the one or more processors, obtaining a partial search query; predicting from the partial search query a set of predicted complete queries relevant to the partial search query, wherein the partial search query and the set of predicted complete queries are in a first language; subsequent to the predicting, obtaining translations of at least a subset of the set of predicted complete queries, the translations are in a second language different from the first language, and the second language is predicted based, at least in part, on the partial search query; and formatting both the set of predicted complete queries and the corresponding translations for display.

Claims

1. A method, comprising:

at a computing system with one or more processors and memory storing one or more programs for execution by the one or more processors,

obtaining a partial search query;

mapping the partial search query to an entry in a chunk table, the entry in the chunk table having at least one pointer to a complete query in a first language in a token table, wherein an entry in the token table matches a complete query in the first language to a translation of the complete query in a second language; and

formatting both a set of complete queries in the first language and the matching translations for display, wherein the set is determined from the pointers for the entry in the chunk table.

2. The method of claim 1, wherein the token table is populated based on complete queries previously submitted by a community of users that also exist in a dictionary database having translations from the first language to the second language.

3. The method of claim 1, the token table further including entries matching complete queries in the first language to synonyms in the first language and the method further comprising:

formatting a synonym of a first complete query in the set of complete queries in the first language for display in place of or in addition to a translation of the first complete query.

4. The method of claim 1, wherein the second language is determined based on one of:

Unicode of the partial search query;

or statistics based on search queries submitted by a community of users.

5. The method of claim 1, further comprising:

in accordance with a determination that the partial search query includes a misspelled term;

obtaining a correct spelling of the misspelled term; and

forming a modified partial search query in accordance with the partial search query and the correct spelling,

wherein the modified partial search query is used as the partial search query in the mapping.

6. The method of claim 1, wherein, when the set of complete queries in the first language includes the partial search query, the partial search query is formatted for display at a top position of the set of complete queries.

7. The method of claim 1, the token table further including entries matching complete queries in the first language to expansions in the first language and the method further comprising:

formatting an expansion of a first complete query in the set of complete queries for display concurrently with a translation of the first complete query.

8. The method of claim 1, wherein the entry in the chunk table is a first entry and the chunk table includes at least a second entry, the second entry having a pointer that also points to the entry in the token table.

9. A computing system, comprising:

one or more processors; and

memory to store data and one or more programs to be executed by the one or more processors, the one or more programs including instructions for;

obtaining a partial search query;

mapping the partial search query to an entry in a chunk table, the entry in the chunk table having at least one pointer to a complete query in a first language in a token table, wherein an entry in the token table matches a complete query in the first language to a translation of the complete query in a second language; and

formatting both a set of complete queries in the first language and the matching translations for display, wherein the set is determined from the pointers for the entry in the chunk table.

10. The computer system of claim 9, wherein the token table is populated based on complete queries previously submitted by a community of users that also exist in a dictionary database having translations from the first language to the second language.

11. The computer system of claim 9, the token table entries further include an entry matching a complete query in the first language to a synonym in the first language and wherein the one or more programs further comprise instructions for:

formatting a synonym of a first complete query in the set of complete queries in the first language for display in place of or in addition to a translation of the first complete query.

12. The computer system of claim 9, wherein the second language is determined based on one of:

Unicode of the partial search query;

or

statistics based on search queries submitted by a community of users.

13. The computer system of claim 9, wherein the one or more programs further comprise instructions for:

in accordance with a determination that the partial search query includes a misspelled term;

obtaining a correct spelling of the misspelled term; and

forming a modified partial search query in accordance with the partial search query and the correct spelling,

wherein the modified partial search query is used as the partial search query in the mapping.

14. The computer system of claim 9, wherein, when the set of complete queries in the first language includes the partial search query, the partial search query is formatted for display at a top position of the set of complete queries.

15. The computer system of claim 9, the token table further including entries matching complete queries in the first language to expansions in the first language and wherein the one or more programs further comprise instructions for:

formatting an expansion of a first complete query in the set of complete queries for display concurrently with a translation of the first complete query.

16. The computer system of claim 9, wherein the entry in the chunk table is a first entry and the chunk table includes at least a second entry, the second entry having a pointer that also points to the entry in the token table.

17. A non-transitory computer readable storage medium storing one or more programs for execution by one or more processors of a computer system, the one or more programs comprising instructions for:

obtaining a partial search query;

mapping the partial search query to an entry in a chunk table, the entry in the chunk table having at least one pointer to a complete query in a first language in a token table, wherein an entry in the token table matches a complete query in the first language to a translation of the complete query in a second language; and

formatting both a set of complete queries in the first language and the matching translations for display, wherein the set is determined from the pointers for the entry in the chunk table.

18. The non-transitory computer readable storage medium of claim 17, wherein the token table is populated based on complete queries previously submitted by a community of users that also exist in a dictionary database having translations from the first language to the second language.

19. The non-transitory computer readable storage medium of claim 17, the token table further including entries matching complete queries in the first language to synonyms in the first language and wherein the one or more programs further comprise instructions for:

formatting a synonym of a first complete query in the set of complete queries in the first language for display in place of or in addition to a translation of the first complete query.

20. The non-transitory computer readable storage medium of claim 17, wherein the second language is determined based on one of:

Unicode of the partial search query;

or

statistics based on search queries submitted by a community of users.

21. The non-transitory computer readable storage medium of claim 17, wherein the one or more programs further comprise instructions for:

in accordance with a determination that the partial search query includes a misspelled term;

obtaining a correct spelling of the misspelled term; and

forming a modified partial search query in accordance with the partial search query and the correct spelling,

wherein the modified partial search query is used as the partial search query in the mapping.

22. The non-transitory computer readable storage medium of claim 17, wherein, when the set of complete queries in the first language includes the partial search query, the partial search query is formatted for display at a top position of the set of complete queries.

23. The non-transitory computer readable storage medium of claim 17, the token table further including entries matching complete queries in the first language to expansions in the first language and wherein the one or more programs further comprise instructions for:

formatting an expansion of a first complete query in the set of complete queries for display concurrently with a translation of the first complete query.

24. The non-transitory computer readable storage medium of claim 17, wherein the entry in the chunk table is a first entry and the chunk table includes at least a second entry, the second entry having a pointer that also points to the entry in the token table.