Techniques For Ranking Character Searches

• US 20140244632A1
• Filed: 02/28/2013
• Published: 08/28/2014
• Est. Priority Date: 02/28/2013
• Status: Active Grant

• Current Assignee: Meta Platforms, Inc. (f/k/a Facebook, Inc.)
• Original Assignee: Meta Platforms, Inc. (f/k/a Facebook, Inc.)
• Inventors: Tseng, Kuan-Yu, Huang, Lin-Shung, Chiang, Yueh-Hsuan, Chen, Chun-Yang
• Granted Patent: US 9,195,716 B2
• Time in Patent Office: Days
• US Class Current: 707/723
• CPC Class Codes: G06F 16/24578 using ranking
• CPC Class Codes: G06F 16/313 Selection or weighting of terms for indexing
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques

Abstract

Techniques for asynchronous rendering are described. An apparatus may comprise a character set converter application, an index server, and a ranking application. The character set converter application may receive a search string comprised of one or more first character set characters, and convert the search string to one or more second character set characters that are different than the first character set. The index server may execute a search on the converted search string to obtain ranked individual search results. The ranking application may compare any first character set characters in the ranked individual search results to the first character set characters in the search string and sub-rank the ranked individual search results based on the strength of any matches. Other embodiments are described and claimed.

Claims

1. An apparatus, comprising:

a processor circuit;

a character set converter application operative on the processor circuit to receive a search string over a network from a requesting device, the search string comprised of one or more first character set characters, and convert the first character set characters of the search string to one or more second character set characters, the second character set different from the first character set;

an index server operative to execute a search on the second character set search string to obtain one or more ranked individual search results, the search executed against a search database comprised of first and second character set characters; and

a ranking application operative on the index server to compare any first character set characters in the ranked individual search results to the first character set characters in the search string, and sub-rank the ranked individual search results based on a match strength between the first character set characters of the search string and the first character set characters of the individual search results.

2. The apparatus of claim 1, the first character set and the second character set comprising any one of a Roman character set, a Chinese character set, a Japanese character set, a Russian character set, a Korean character set, a European character set, and an Arabic character set.

3. The apparatus of claim 1, the search string comprising one or more characters of the first character set and one or more characters of the second character set.

4. The apparatus of claim 1, the ranking application further operative to:

raise a sub-ranking of a ranked individual search result when there is a match between a first character set character in the search string and a first character set character in the individual search result;

lower the sub-ranking of a ranked individual search result when there is not a match between a first character set character in the search string and a first character set character in the individual search result; and

leave the sub-ranking of a ranked individual search result unchanged when there is no first character set character in the search string.

5. The apparatus of claim 4, the ranking application further operative to:

determine how many first character set characters in the search string and first character set characters in the ranked individual search result match;

assign a highest sub-ranking to the ranked individual search result when all the first character set characters in the search string match with first character set characters in the individual search result; and

assign a raised sub-ranking but not a highest sub-ranking to the ranked individual search result when some of the first character set characters in the search string match with first character set characters in the individual search result.

6. The apparatus of claim 5, the ranking application further operative to re-rank the ranked individual search results based on the sub-ranking results.

7. The apparatus of claim 6, the ranking application further operative to return the re-ranked individual search results to the requesting device over the network.

8. A computer implemented method, comprising:

receiving a search string comprised of one or more first character set characters;

converting the first character set characters of the search string to one or more second character set characters, the second character set different than the first character set;

executing a search on the second character set search string to obtain one or more ranked individual search results;

comparing any first character set characters in the ranked individual search results to the first character set characters in the search string; and

determining a sub-ranking component for the ranked individual search results based on a match strength between the first character set characters of the search string and the first character set characters of the individual search results.

9. The computer implemented method of claim 8, the first character set and the second character set comprising any one of a Roman character set, a Chinese character set, a Japanese character set, a Russian character set, a Korean character set, a European character set, and an Arabic character set.

10. The computer implemented method of claim 8, the search string comprising one or more characters of the first character set and one or more characters of the second character set.

11. The computer implemented method of claim 8, determining the sub-ranking component comprising:

raising a sub-ranking of a ranked individual search result when there is a match between a first character set character in the search string and a first character set character in the individual search result;

lowering the sub-ranking of a ranked individual search result when there is not a match between a first character set character in the search string and a first character set character in the individual search result; and

leaving the sub-ranking of a ranked individual search result unchanged when there is no first character set character in the search string.

12. The computer implemented method of claim 11, determining the sub-ranking component further comprising:

determining how many first character set characters in the search string and first character set characters in the ranked individual search result match;

assigning a highest sub-ranking to the ranked individual search result when all the first character set characters in the search string match with first character set characters in the individual search result; and

assigning a raised sub-ranking but not a highest sub-ranking to the ranked individual search result when some of the first character set characters in the search string match with first character set characters in the individual search result.

13. The computer implemented method of claim 12, comprising re-ranking the ranked individual search results based on the sub-ranking component results.

14. The computer implemented method of claim 13, comprising returning the re-ranked individual search results to a requesting device.

15. A computer-readable storage medium comprising instructions that, when executed, cause a system to:

receive a search string comprised of one or more first character set characters;

convert the first character set characters of the search string to one or more second character set characters, the second character set different than the first character set;

execute a search on the second character set search string to obtain one or more ranked individual search results;

compare any first character set characters in the ranked individual search results to the first character set characters in the search string; and

determine a sub-ranking component for the ranked individual search results based on a match strength between the first character set characters of the search string and the first character set characters of the individual search results.

16. The computer-readable storage medium of claim 15, the first character set and the second character set comprising any one of a Roman character set, a Chinese character set, a Japanese character set, a Russian character set, a Korean character set, a European character set, and an Arabic character set.

17. The computer-readable storage medium of claim 15, the search string comprising one or more characters of the first character set and one or more characters of the second character set.

18. The computer-readable storage medium of claim 15, comprising further instructions that, when executed, cause a system to:

raise a sub-ranking of a ranked individual search result when there is a match between a first character set character in the search string and a first character set character in the individual search result;

lower the sub-ranking of a ranked individual search result when there is not a match between a first character set character in the search string and a first character set character in the individual search result; and

leave the sub-ranking of a ranked individual search result unchanged when there is no first character set character in the search string.

19. The computer-readable storage medium of claim 18, comprising further instructions that, when executed, cause a system to:

determine how many first character set characters in the search string and first character set characters in the ranked individual search result match;

assign a highest sub-ranking to the ranked individual search result when all the first character set characters in the search string match with first character set characters in the individual search result; and

assign a raised sub-ranking but not a highest sub-ranking to the ranked individual search result when some of the first character set characters in the search string match with first character set characters in the individual search result.

20. The computer-readable storage medium of claim 19, comprising further instructions that, when executed, cause a system to re-rank the ranked individual search results based on the sub-ranking component results.

21. The computer-readable storage medium of claim 20, comprising further instructions that, when executed, cause a system to return the re-ranked individual search results to a requesting device.