US008706747B2
(12) United States Patent (10) Patent No.: US 8,706,747 B2 Mittal et al. (45) Date of Patent: Apr. 22, 2014
(54) SYSTEMIS AND METHODS FOR SEARCHING (56) References Cited USING QUERIES WRITTEN IN A DIFFERENT CHARACTER-SET AND/OR LANGUAGE U.S. PATENT DOCUMENTS FROM THE TARGET PAGES 4,674,112 A 6, 1987 Kondraske et al. 4,754.474. A 6, 1988 Feinson (75) Inventors: Vibhu Mittal, Sunnyvale, CA (US); Jay 5,337,347 A 8/1994 Halstead-Nussloch et al. M. Ponte, Mountain View, CA (US); 5,495,608 A 2f1996 Antoshenkov Mehran Sahami, Redwood City, CA 5,634,053 A * 5/1997 Noble et al...... 7O7/4 (US); Sanjay Ghemawat, Mountain 5,634,134 A * 5/1997 Kumai et al...... 715,223 View, CA (US); John A. Bauer, Mountain View, CA (US) (Continued) (73) Assignee: Google Inc., Mountain View, CA (US) FOREIGN PATENT DOCUMENTS CA 251 1293 6, 2004 (*) Notice: Subject to any disclaimer, the term of this EA CA2323856 4/2002 patent is extended or adjusted under 35 U.S.C. 154(b) by 656 days. (Continued) OTHER PUBLICATIONS (21) Appl. No.: 10/676,724 Resnik P. et al., “The Web as a Parallel Corpus', Computational (22) Filed: Sep. 30, 2003 Linguistics MIT Press for Assoc. Comput. Linguistics USA, Jul. 2002, pp. 1-29, v. 29, No. 3. (65) Prior Publication Data (Continued) US 2004/0261021 A1 Dec. 23, 2004 Related U.S. Application Data Primary Examiner — Susan Chen (63) Continuation-in-part of application No. 09/748,431, (74) Attorney, Agent, or Firm — Fish & Richardson P.C. filed on Dec. 26, 2000, now Pat. No. 7,136,854. (57) ABSTRACT (60) Provisional application No. 60/216,530, filed on Jul. 6, 2OOO. Methods and apparatus consistent with the invention allow a user to Submit an ambiguous search query and to receive (51) Int. C. relevant search results. Queries can be expressed using char G06F 7700 (2006.01) acter sets and/or languages that are different from the char G06F 7/30 (2006.01) acter set and/or language of at least some of the data that is to G06F 7/2 (2006.01) be searched. A translation betweenthese charactersets and/or (52) U.S. C. languages can be performed by examining the use of terms in USPC ...... 707/760; 707/756; 704/10 aligned text. Probabilities can be associated with each pos (58) Field of Classification Search sible translation. Refinements can be made to these probabili USPC ...... 707/3, 5, 4:704/7, 9; 709/201, 223: ties by examining user interactions with the search results. 34O7995.12 See application file for complete search history. 18 Claims, 15 Drawing Sheets
900
902
ANCORSONT 906
DENTFY ANCORS WRITENIN OTHERLANGUAGES CHARACTERSETS 908 THAT POINT TODENTIFEEDPAGES
ANALY2EANCHORSTODETERMINE LKELY TRANSLATON 910 US 8,706,747 B2 Page 2
(56) References Cited 2002fOO 19731 A1 2/2002 Masui et al. 2002fOO21311 A1 2/2002 Shechter et al. U.S. PATENT DOCUMENTS 2002fOO28697 A1 3, 2002 Davies 2002fOO383O8 A1 3/2002 Cappi 5,701,469 A 12/1997 Brandli et al. 2002fOO59069 A1 5, 2002 HSu et al. 5,724,593 A * 3/1998 Hargrave et al...... 7O4/7 2002/0077811 A1 6/2002 Koenig et al. 5,745,894 A 4, 1998 Burrows et al. 2002fOO87514 A1 T/2002 Payne et al. 5,758,145 A 5/1998 Bhargava et al. 2002fO091511 A1 7/2002 Hellwig et al. 5,778, 157 A 7, 1998 Oatman et al. 2002/0133481 A1 9, 2002 Smith et al. 5,818,437 A 10, 1998 Grover et al. 2002fO152203 A1 10, 2002 Ostergaard et al. 5,845,273 A 12/1998 Jindal 2002fO184197 A1 12/2002. He et al. 5,915,251 A 6, 1999 Burrows et al. 2002fO184206 A1 12/2002 Evans 5,945,928 A 8, 1999 Kushler et al. 2002fO194388 A1 12/2002 Boloker et al. 5,953,073 A 9, 1999 Kozina et al. 2003, OO23420 A1 1/2003 Goodman 5,953,541 A 9/1999 King et al. 2003.0035519 A1 2/2003 Warmus 5,974,121 A 10, 1999 Perera 2003.0054830 A1 3/2003 Williams et al. 5,978,792 A 1 1/1999 Bhargava et al. 2003/0073451 Al 42003 Kraft 5,978,820 A 11/1999 Mase et al. 2003/0078.914 A1 4/2003 Witbrock 5.987,446 A * 1 1/1999 Corey et al...... 1f1 2003/0088,554 A1 5/2003 Ryan et al. 6,011,554 A 1, 2000 King et al. 2003. O104839 A1 6/2003 Kraft et al. 6,018,736 A 1/2000 Gilai et al. 2003. O105623 A1 6/2003 Cyr et al. 6,026,411 A 2/2000 Delp 2003/O125947 A1 7/2003 Yudkowsky 6,038,365 A 3, 2000 Yamagami 2003. O135490 A1 7/2003 Barrett et al. 6,061,718 A 5, 2000 Nelson 2003. O149686 A1 8, 2003 Drissi 6,070,140 A 5, 2000 Tran 2003/0171929 A1 9, 2003 Falcon et al. 6,107,944. A * 8/2000 Behr et al...... 340,995.12 2003. O187658 A1 10, 2003. Selin et al. 6,131,082 A * 10, 2000 Hargrave et al...... 7O4/7 2003/0204394 A1 10/2003 Garudadri et al. 6,169,999 B1 1/2001 Kanno 2004/O128135 A1 7/2004 Anastasakos et al. 6,226,635 B1 5/2001 Katariya 2004O163032 A1 8, 2004 Guo et al. 6,247,010 B1* 6/2001 Doi et al...... 707/3 2004/0192355 A1 9, 2004. Nowlan 6.256,630 B1 7/2001 Gilai et al. 2004/0252051 A1 12/2004 Johnson 6,278,992 B1 8, 2001 Curtis et al. 2004/0261021 A1 12/2004 Mittal et al. 6,286,064 B1 9/2001 King et al. 2005/0O275.24 A1 2, 2005 Wu et al. 6,307.548 B1 10, 2001 Flinchem et al. 2005, OO60448 A1 3/2005 Gutowitz 6,307.549 B1 10/2001 King et al. 2005, 0071332 A1 3/2005 Ortega et al. 6,353,820 B1 3/2002 Edwards et al. 2005/0102259 A1 5/2005 Kapur 6,360,196 Bl 3/2002 Poznanski et al. 2005.0114312 A1 5, 2005 Mosescu 6,377,961 B1 4/2002 Ryu 2005, 0131687 A1 6, 2005 Sorrentino 6,377.965 B1 4/2002 Hachamovitch et al. 2005/0188330 A1 8/2005 Griffin 6.421,662 B1 7/2002 Karten 2005/O198056 A1 9, 2005 Dumais et al. 6,453,315 B1* 9/2002 Weissman et al...... 707/5 2005/0246365 A1 11/2005 Lowsles et al. 6,470,333 B1 * 10/2002 Baclawski ...... 1f1 2005/0270270 Al 12/2005 Chadha 6,484, 179 B1 11/2002 Roccaforte 2005/0289141 A1 12/2005 Baluja 6,529,903 B2 3/2003 Smith et al. 2005/0289479 A1 12/2005 Yoshida et al. 6,542,170 B1 4/2003 Williams et al. 2006.0099963 A1 5/2006 Stephens 6,601,026 B2 * 7/2003 Appelt et al...... TO4/9 2006/0142997 Al 6/2006 Jakobsen et al. 6,606,486 B1 8/2003 Cubbage et al. 2006/0230350 A1 10/2006 Baluja 6,633,846 B1 10/2003 Bennett et al. 2007/0061211 A1 3, 2007 Ramer 6,714.905 B1* 3/2004 Chang et al...... TO4/9 2007/0061244 A1 3, 2007 Ramer 6,795,822 B1 9/2004 Matsumoto et al. 2007/0061321 A1 3/2007 Venkataraman et al. 6,947,770 B2 9/2005 Rydbeck 2007/O195063 A1 8/2007 Wagner et al. 6,968,179 B1 1 1/2005 De Vries 2008. O104.043 A1 5/2008 Garget al. 7,103,854 B2 9, 2006 Fuchs et al. 2010/0093404 A1 4/2010 Baek et al. 7,120,574 B2 * 10/2006 Troyanova et al...... TO4/9 7,149,550 B2 12/2006 Kraft FOREIGN PATENT DOCUMENTS 7,159,191 B2 1/2007 Koivuniemi 7.283,992 B2 * 10/2007 Liu et al...... 1f1 EP O 597 611 5, 1994 7.366,668 B1 4/2008 Franz et al. EP 1 O72984 1, 2001 7,369,988 B1 5/2008 Thenthiruperai EP 1347 362 9, 2003 7,380,724 B2 6/2008 Unruh JP 09-259144 10, 1997 7.461,061 B2 12/2008 Aravamudan et al. JP 2000-163441 6, 2000 7,529,741 B2 5/2009 Aravamudan et al. JP 2002-092018 3, 2002 7,536,384 B2 5/2009 Venkataraman et al. JP 2002-251410 9, 2002 7,539,676 B2 5/2009 Aravamudan et al. KR 2002-0084739 11, 2002 7,644,054 B2 1/2010 Garget al. KR 20030044949 A 6, 2003 7,647,228 B2 1/2010 Silvera et al. RU 2O39376 C1 7, 1995 7,657,526 B2 2/2010 Aravamudan et al. WO WO98,0.0833 1, 1998 7,729,913 B1 6/2010 Lee et al. WO WOOO758O8 A1 12/2000 7,737,999 B2 6/2010 Ardhanari et al. WO WOO1.80079 10, 2001 7,739,280 B2 6/2010 Aravamudan et al. WO WO O2/O1400 1, 2002 7,774,294 B2 8/2010 Aravamudan et al. WO WOO2,093O2 1, 2002 7,774,341 B2 8/2010 Aravamudan et al. WO WOO3O42870 A1 5, 2003 7,779,011 B2 8/2010 Venkataraman et al. WO WO 2005/091825 10/2005 7,788,266 B2 8/2010 Venkataraman et al. 7,792,815 B2 9/2010 Aravamudan et al. OTHER PUBLICATIONS 7,835,998 B2 11/2010 Aravamudan et al. Official Decision of Grant from related Russian application No. 7,840,405 B1 11/2010 Lee et al. 2006 114696 issued on Jan. 23, 2009. 2001/0003184 A1 6/2001 Ching et al. Communication from related European Patent Application No. 2001/0032074 A1 10, 2001 Harris et al. 09151235.0 mailed Jul. 6, 2009, 7 pages. US 8,706,747 B2 Page 3
(56) References Cited Kuwahara, Yoshiko, Authorized Officer, International Bureau of WIPO, International application No. PCT/US2006/26152, filed Jun. OTHER PUBLICATIONS 30, 2006, in International Preliminary Reporton Patentability, mailed Mar. 26, 2009, 7 pages. Search Report from related European Patent Application No. Whitfield, Jacqueline A. Special Project Assistant, International 0915 1235.0 mailed May 4, 2009, 7 pages. Australian Patent Office, Australian Application No. 2005259925, Searching Authority, International application No. PCT/US05/ filed Jun. 24, 2005, in Office Action, mailed Feb. 18, 2010, 3 pages. 22962, filed Jun. 24, 2005, in International Search Report and Written United States Patent and Trademark Office, U.S. Appl. No. Opinion, mailed Sep. 7, 2007, 13 pages. 10/876,989, filed Jun. 30, 2005, in Office Action Mailed Jan. 3, 2007, Jun Gong and Peter Tarasewich, Alphabetically Constrained Keypad 18 pages. Designs for Text Entry on Mobile Devices, HCI Laboratory, College United States Patent and Trademark Office, U.S. Appl. No. of Computer & Information Science, Northeastern University, pp. 11/173,702, filed Jun. 30, 2005, in Office Action Mailed Aug. 13, 211-220, Apr. 2-7, 2005. 2007, 20 pages. International Preliminary Reporton Patentability for Application No. United States Patent and Trademark Office, U.S. Appl. No. PCT/US2007/082534, dated May 7, 2009, 6 pages. 10/876,989, filed Jun. 30, 2005, in Office Action Mailed Sep. 18, 2007, 14 pages. “Problem 6-Mobile phones' ACM SPPC International Collegiate United States Patent and Trademark Office, U.S. Appl. No. Programming Contest 2003, Sep. 20, 2003, http://www.sspcontest. 11/173,702, filed Jun. 30, 2005, in Office Action Mailed Apr. 1, 2008, org.2003/P6 Mobiles.pdf. 2 pages. 18 pages. United States Patent and Trademark Office, U.S. Appl. No. United States Patent and Trademark Office, U.S. Appl. No. 11/173,702, filed Jun. 3, 2005, in Office Action Mailed May 11, 2010, 1 1/173,702, filed Jun. 30, 2005, in Office Action Mailed Dec. 29, 17 pages. 2008, 29 pages. United State Patent and Trademark Office, U.S. Appl. No. United States Patent and Trademark Office, U.S. Appl. No. 10/876,989, filed Jun. 30, 2005, in Office Action Mailed Jun. 6, 2008, 10/876,989, filed Jun. 30, 2005, in Office Action Mailed Mar. 9, 2009, 23 pages. 17 pages. United States Patent and Trademark Office, U.S. Appl. No. Office Action dated Jul. 25, 2012 from related European Patent 11/173,702, filed Jun. 30, 2005, in Office Action Mailed Aug. 17, Application No. 11 172796.2, Jul. 25, 2012, 6 pages. 2009, 18 pages. Office Action issued in Chinese Patent Application No. United States Patent and Trademark Office, U.S. Appl. No. 200680031513.2, May 24, 2010, 10 pages. 10/876,989, filed Jun. 30, 2005, in Office Action Mailed Dec. 22, Office Action issued in Korean Patent Application No. 2011 2009, 23 pages. 7020833, Nov. 3, 2011, 6 pages. European Patent Office, Supplementary European Search Report & Office Action issued in Korean Patent Application No. 2006 Written Opinion for Application No. EP 057635.13.8, mailed Jul. 23, 2009, 3 pages. 7006282, Mar. 10, 2011, 7 pages. Wildstrom, Stephen H. "Honey, I Shrunk the Keyboard.” Business Search Report from related European Patent Application No. Week, May 10, 2004, p. 30. 11172796.2 mailed Oct. 26, 2011, 6 pages. Young, Lee W. Authorized Officer, International Searching Author Office Action from related Japanese Patent Application No. 2010 ity, International application No. PCT/US2006/26152, filed Jun. 30. 161104 dated Jun. 13, 2012, 5 pages. 2006, in International Search Report and Written Opinion, mailed Feb. 11, 2008, 9 pages. * cited by examiner U.S. Patent Apr. 22, 2014 Sheet 1 of 15 US 8,706,747 B2
LNETTO
0!1 U.S. Patent Apr. 22, 2014 Sheet 2 of 15 US 8,706,747 B2
¿OS$300&&
S33||830indiñO U.S. Patent Apr. 22, 2014 Sheet 3 of 15 US 8,706,747 B2
CAR REPAIR CARRENTAL
VIDEO RENTAL
DOCUMENT 1. DOCUMENT 2
WNE CHAMPAGNE BARTEMS
of MAET 3
FIG. 3 U.S. Patent Apr. 22, 2014 Sheet 4 of 15 US 8,706,747 B2
TERM LOCATIONour (DOCUMENT)
RENTAL OOCUMENTS 1 AND 2
REPAIR DOCUMENT 1
VOEO DOCUMENT 2
FG. 4A U.S. Patent Apr. 22, 2014 Sheet 5 of 15 US 8,706,747 B2
START
RECEIVE ALPANU MERC CUERY FROM USER 410
COMPARE ALPHAN.JMERC OLERY TO APHANUMERC INDEX 420
RETURN RELEVANT DOCUMENTS TO USER 430
FG. 4B U.S. Patent Apr. 22, 2014 Sheet 6 of 15 US 8,706,747 B2
START
RECEIVE SECUENCE"227" FROM USER 50
OBTAN INFORMATION MAPPNG "2". "2", AND "7" TO LETTERS 52O
TRANSLATE "227" TO LETTEREOUVALENTS 530
PROVIDE LETTEREQUIVALENTS TO SEARCH ENGINE USENGLOGICALOR" 540
OBTAIN SEARCH RESULTS 550
PRSSENT SEARCH RESULTS TO USER 560
F.G. 5A U.S. Patent Apr. 22, 2014 Sheet 7 Of 15 US 8,706,747 B2
F.G. 5B U.S. Patent Apr. 22, 2014 Sheet 8 of 15 US 8,706,747 B2
TERM LOCATION (DOCUMENT)
DOCUMENT 1
OOCUMENTS 1 AND 3
242672463 COCUMENT 3
DOCUMEN3
OOCUMENTS AND 2
737247 DOCUMENTS 1
DOCUMENT2
OCUMENT 3
FIG. 5C U.S. Patent Apr. 22, 2014 Sheet 9 Of 15 US 8,706,747 B2
RECEIVE SEQUENCE"22748367" FROM USER 610
OBTAIN INFORMATION MAPPING NUMERC COMPONENTS OF RECEIVED SEQUENCE TO LETTERS 620
TRANSLATE "22748367" TO LETTER EQUIVALENTS 630
PROVIDE LETTEREQUIVALENTS TO SEARCH ENGINE 640 USING LOGICAL"OR"
OBTAIN SEARCH RESULTS 650
PRESENT SEARCH RESULTS TO USER 660
FIG. 6 U.S. Patent Apr. 22, 2014 Sheet 10 of 15 US 8,706,747 B2
700
RECEIVE QUERY IN CHARACTER SETS1 702
TRANSLATE QUERY INTO CHARACTER 704 SET S2
SEARCH FOR RESPONSIVE 706 INFORMATION
RETURN RESULTS 708
FG. 7 U.S. Patent Apr. 22, 2014 Sheet 11 of 15 US 8,706,747 B2
800 802 804 806
Probability (%)
kanji - - - aOtherdkanji 812 814 FG. 8 U.S. Patent Apr. 22, 2014 Sheet 12 of 15 US 8,706,747 B2 900 RECEIVE TERM TO BE TRANSLATED 902 IDENTIFY ANCHORS THAT USE TERM 904 IDENTIFY PAGES TO WHICH IDENTIFIED ANCHORS POINT 906 IDENTIFY ANCHORS WRITTEN IN OTHER LANGUAGES / CHARACTER SETS 908 THAT POINT TO IDENTIFIED PAGES ANALYZE ANCHORS TO DETERMINE 910 LIKELY TRANSLATION FIG. 9 U.S. Patent Apr. 22, 2014 Sheet 13 of 15 US 8,706,747 B2 ?I-VNIOVJ L-VNIOVCI 9-VNIÐVA Ç-WNIOWd U.S. Patent Apr. 22, 2014 Sheet 14 of 15 US 8,706,747 B2 Probability(house=casa): 5/10 = 0.5 Probability(house=grande): 5/10 = 0.5 FIG 11A Probability(house=casa): 15/20 = 0.75 Probability(house=grande): 5/20 = 0.25 F.G. 11B U.S. Patent Apr. 22, 2014 Sheet 15 Of 15 US 8,706,747 B2 CS casita casino grande mansión residencia F.G. 12 US 8,706,747 B2 1. 2 SYSTEMS AND METHODS FOR SEARCHING As can be seen from the foregoing example, this form of USING QUERIES WRITTEN IN A DIFFERENT data entry is inefficient in that it requires eighteen keystrokes CHARACTER-SET AND/OR LANGUAGE to enter the nine alphanumeric characters (including the FROM THE TARGET PAGES space) corresponding to “ben Smith’. Similar difficulties may arise when typing queries using RELATED APPLICATIONS non-target-language keyboards. For example, Japanese text can be expressed using a variety of different character sets, This application is a continuation-in-part of U.S. patent including hiragana, katakana, and kanji, none of which are application Ser. No. 09/748,431, entitled “METHODS AND easily entered using a typical ASCII keyboard based on the APPARATUS FOR PROVIDING SEARCH RESULTS IN 10 Roman alphabet. In such a situation, the user will often make use of a word-processor Such as Ichitaro, produced by Just RESPONSE TO AN AMBIGUOUS SEARCH QUERY” System Corp. of Tokushima City, Japan, that is able to convert filed Dec. 26, 2000 now U.S. Pat. No. 7,136,854, which text written in romaji (a phonetic, Roman-alphabet represen claims priority under 35 U.S.C. S 119(e) to U.S. Provisional tation of Japanese) to katakana, hiragana, and kanji. Using the Application Ser. No. 60/216,530, entitled “DATA ENTRY 15 word processor, the user can type a query in romaji, and then AND SEARCH FOR HANDHELD DEVICES filed Jul. 6, cut-and-paste the translated text from the word processor's 2000, both of which are hereby incorporated by reference in screen into a search box on the browser. A drawback of this their entirety. approach is that it can be relatively slow and tedious, and requires the user to have access to a copy of the word proces BACKGROUND OF THE INVENTION Sor, which may not be feasible due to cost and/or memory constraints. 1. Field of the Invention There remains, therefore, a need for methods and apparatus The present invention relates generally to information for providing relevant search results in response to an search and retrieval. More specifically, systems and methods ambiguous search query. are disclosed for performing searches using queries that are 25 written in a characterset or language that is different from the SUMMARY OF THE INVENTION character set or language of at least Some of the documents that are to be searched. Methods and apparatus consistent with the present inven 2. Description of Related Art tion, as embodied and broadly described herein, provide rel Most search engines operate under the assumption that the 30 evant search results in response to an ambiguous search end user is entering search queries using something like a query. Consistent with the invention, Such a method includes conventional keyboard, where the input of alphanumeric receiving a sequence of ambiguous information components strings is not difficult. As Small devices become more com from a user. The method obtains mapping information that mon, however, this assumption is not always valid. For maps the ambiguous information components to less ambigu example, users may query search engines using a wireless 35 ous information components. This mapping information is telephone that supports the WAP (Wireless Application Pro used to translate the sequence of ambiguous information tocol) standard. Devices such as wireless telephones typically components into one or more corresponding sequences of have a data input interface wherein a particular action by the less ambiguous information components. One or more of user (e.g., pressing a key) may correspond to more than one these sequences of less ambiguous information are provided alphanumeric character. A detailed description of WAParchi 40 as an input to a search engine. The search results are obtained tecture is available at www1.wapforum.org/tech/documents/ from the search engine and are presented to the user. SPEC-WAPArch-19980439.pdf (“WAP 100 Wireless Appli In addition, systems and methods are disclosed for per cation Protocol Architecture Specification'). forming searches using queries that are expressed in character In the usual case, the WAP user navigates to the search sets or languages that are different from the character set or query page, and is presented with a form into which they input 45 language of at least some of the documents that are to be their search query. With conventional methods, the user may searched. Embodiments of the present invention allow users be required to press multiple keys to select a particular letter. to type queries using standard input devices (e.g., ASCII On a standard telephone keypad, for example, the user would keyboards), have the queries translated into the relevant forms select the letter “b' by pressing the “2 key twice, or would at a server (e.g., translate a query written in romaji into kata select the letter “s” by pressing the “7” key four times. 50 kana, hiragana, and/or kanji), and receive search results based Accordingly, to enter a query for “ben Smith', the user would on the converted forms. ordinarily need to enter the following string of key presses: It should be appreciated that the present invention can be 223366077776444844, which map to letters as follows: implemented in numerous ways, including as a process, an 22- sb apparatus, a system, a device, a method, or a computer read 33-se 55 able medium such as a computer readable storage medium, 66-en carrier wave, or a computer network wherein program 0->space instructions are sent over optical or electronic communica 7777-es tion lines. Several inventive embodiments are described 6-sm below. 444-si 60 In one embodiment, a method is described for automati 8-st cally translating query terms from one language and/or char 44-sh acter set to another. A first set of anchor text containing a After the user has entered their search request, the search given query term is identified, as are a set of documents (e.g., engine receives the word or words from the user, and proceeds web pages) to which the anchor text point. A second set of in much the same manner as if it had received the request from 65 anchor text, written in a second format and pointing to the a desktop browser wherein the user employed a conventional same set of documents, is then identified. The second set of keyboard. anchor text is then analyzed to obtain a probability that a US 8,706,747 B2 3 4 representation of the given query term in the first format ments of the invention and, together with the description, corresponds to a representation of the given query term in the serve to explain the advantages and principles of the inven second format. tion. In the drawings: In another embodiment, a probabilistic dictionary is cre FIG. 1 illustrates a block diagram of a system in which ated that maps terms written in a first format (e.g., a language methods and apparatus consistent with the present invention and/or character set) to a second format (e.g., another lan map be implemented; guage and/or character set). The probabilistic dictionary is used to translate a query written in the first format into the FIG. 2 illustrates a block diagram of a client device, con second format. The translated query is then used to perform a sistent with the invention; search, the results of which are returned to the user. In some FIG. 3 illustrates a diagram depicting three documents; embodiments, the user's interaction with the search results 10 FIG. 4a illustrates a conventional alphanumeric index; can be monitored, and used to update the probabilities in the FIG. 4b illustrates a flow diagram for providing search probabilistic dictionary. Also, in some embodiments the results in response to a conventional alphanumeric Search query itself could, prior to the search, be expanded to include query; alternative language and/or character set mappings. FIG. 5a illustrates a flow diagram, consistent with the In yet another embodiment, a method for creating a proba 15 invention, for providing search results in response to an bilistic dictionary is described. The probabilistic dictionary ambiguous search query; can be used to translate terms in a first format into a second FIG. 5b illustrates a diagram for mapping alphanumeric format. The dictionary is preferably created term-by-term, by information to numeric information; and identifying anchor text or other data containing the term. FIG. 6 illustrates another flow diagram, consistent with the Next, data that is aligned with the anchor text or other data is invention, for providing search results in response to an analyzed to determine a probability with which a given term ambiguous search query. in the first format maps onto one or more terms in the second FIG. 7 illustrates a method for performing a search in format. accordance with embodiments of the present invention. In yet another embodiment, a query provided in a first FIG. 8 illustrates a probabilistic dictionary of character-set language or character set is translated into a second language 25 translations. or characterset by comparing anchor text that contains one or FIG. 9 illustrates the use of parallel anchor text to build a more of the query terms and is written in the first language or probabilistic dictionary. character set with anchor text that corresponds to the first FIG. 10 illustrates a collection of documents linked using anchor text and is written in the second language or character anchor text. Set. 30 FIGS. 11A and 11B illustrate the calculation of likely In another embodiment, a computer program product is translations based on the anchor text shown in FIG. 10. provided for translating a term written in a first format into a FIG. 12 shows a probability distribution associated with an second format. The computer program product is operable to illustrative word translation. causea computer system to identify aligned anchortext and to determine a probability that a representation of a given term 35 DESCRIPTION OF SPECIFIC EMBODIMENTS in the first format corresponds to one or more terms in the second format. Reference will now be made in detail to embodiments of In another embodiment, a method is provided for perform the present invention as illustrated in the accompanying draw ing searches using potentially ambiguous queries. When a ings. The same reference numbers may be used throughout user enters a query in a first format, it is translated into a group 40 the drawings and the following description to refer to the of one or more variants written in a second format. A search same or like parts. The following description is presented to is then performed using the translated variants, and respon enable any person skilled in the art to make and use the sive information is returned to the user. For example, the first inventive body of work. Descriptions of specific embodi format might comprise a sequence of numbers entered using ments and applications are provided only as examples, and a telephone keypad, and the second format might comprise 45 various modifications will be readily apparent to those skilled alphanumeric text (e.g., English, romaji, romaja, pinyin, or in the art. For example, although many of the examples are the like). In some embodiments, the group of one or more described in the context of Internet web pages, it should be variants is selected by discarding translated variants that do understood that embodiments of the present invention could not appear in a predefined lexicon, and/or that contain pre be used to search other types of documents and/or informa defined low-probability character combinations. In some 50 tion, Such as books, newspapers, magazines, or the like. Simi embodiments, a probabilistic dictionary is used to further larly, although for the sake of illustration many of the translate the group of one or more variants into a third format examples describe the translation of Japanese text from before the search is performed. For example, the probabilistic romaji to katakana, hiragana, and/or kanji, those of ordinary dictionary can be used to translate the group of one or more skill in the art will appreciate that the systems and methods of variants from romaji, romaja, or pinyin into kanji, katakana, 55 the present invention can be applied to any Suitable transla hiragana, hangul, hanja, or traditional Chinese characters, tion. For example, without limitation, embodiments of the and a search can then be performed using the translated vari present invention could be used to search text written in, e.g., antS. traditional Chinese characters or Korean hangul or hanja These and other features and advantages of the present characters, based on queries received in some other format invention will be presented in more detail in the following 60 (e.g., pinyin or romaja). The general principles described detailed description and the accompanying figures which herein may be applied to other embodiments and applications illustrate by way of example the principles of the invention. without departing from the spirit and scope of the invention. Thus, the present invention is to be accorded the widest scope, BRIEF DESCRIPTION OF THE DRAWINGS encompassing numerous alternatives, modifications, and 65 equivalents consistent with the principles and features dis The accompanying drawings, which are incorporated in, closed herein. For purpose of clarity, details relating to tech and constitute a part of this specification illustrate embodi nical material that is known in the fields related to the inven US 8,706,747 B2 5 6 tion have not been described in detail so as not to include mechanisms for communicating with another device unnecessarily obscure the present invention. or system via a network, Such as network 140. As will be described in detail below, the client devices 110, A OVERVIEW consistent with the present invention, perform certain search ing-related operations. The client devices 110 may perform Methods and apparatus consistent with the invention allow these operations in response to processor 220 executing soft a user to Submit an ambiguous search query and to receive ware instructions contained in a computer-readable medium, potentially disambiguated search results. In one embodiment, such as memory 230. A computer-readable medium may be a sequence of numbers received from a user of a standard defined as one or more memory devices and/or carrier waves. telephone keypad is translated into a set of potentially corre 10 The software instructions may be read into memory 230 from sponding alphanumeric sequences. These potentially corre another computer-readable medium, Such as the data storage sponding alphanumeric sequences are provided as an input to device 250, or from another device via the communication a conventional search engine, using a boolean “OR” expres interface 280. The software instructions contained in memory Sion. In this manner, the search engine is used to help limit 230 causes processor 220 to perform search-related activities search results to those in which the user was likely interested. 15 described below. Alternatively, hardwired circuitry may be used in place of or in combination with Software instructions B. ARCHITECTURE to implement processes consistent with the present invention. Thus, the present invention is not limited to any specific FIG. 1 illustrates a system 100 in which methods and combination of hardware circuitry and software. apparatus, consistent with the present invention, may be The servers 120 and 130 may include one or more types of implemented. The system 100 may include multiple client computer systems, such as a mainframe, minicomputer, or devices 110 connected to multiple servers 120 and 130 via a personal computer, capable of connecting to the network 140 network 140. The network 140 may include a local area to enable servers 120 and 130 to communicate with the client network (LAN), a wide area network (WAN), a telephone devices 110. In alternative implementations, the servers 120 network, such as the Public Switched Telephone Network 25 and 130 may include mechanisms for directly connecting to (PSTN), an intranet, the Internet, or a combination of net one or more client devices 110. The servers 120 and 130 may works. Two client devices 110 and three servers 120 and 130 transmit data over network 140 or receive data from the have been illustrated as connected to network 140 for sim network 140 via a wired, wireless, or optical connection. plicity. In practice, there may be more or less client devices The servers may be configured in a manner similar to that and servers. Also, in some instances, a client device may 30 described above in reference to FIG. 2 for client device 110. perform the functions of a server and a server may perform the In an implementation consistent with the present invention, functions of a client device. the server 120 may include a search engine 125 usable by the The client devices 110 may include devices, such main client devices 110. The servers 130 may store documents (or frames, minicomputers, personal computers, laptops, per web pages) accessible by the client devices 110. Sonal digital assistants, or the like, capable of connecting to 35 the network 140. The client devices 110 may transmit data C. ARCHITECTURAL OPERATION over the network 140 or receive data from the network 140 via a wired, wireless, or optical connection. FIG. 3 illustrates a diagram depicting three documents, FIG. 2 illustrates an exemplary client device 110 consistent which may be stored for example on one of the servers 130. with the present invention. The client device 110 may include 40 A first document (Document 1) contains two entries—"car a bus 210, a processor 220, a main memory 230, a read only repair and “car rental' and is numbered '3' at its bottom. memory (ROM) 240, a storage device 250, an input device A second document (Document 2) contains the entry “video 260, an output device 270, and a communication interface rental'. A third document (Document 3) contains three 280. entries—"wine”, “champagne', and “bar items' and The bus 210 may include one or more conventional buses 45 includes a link (or reference) to Document 2. that permit communication among the components of the For the sake of illustrative simplicity, the documents shown client device 110. The processor 220 may include any type of in FIG. 3 only contain alphanumeric strings of information conventional processor or microprocessor that interprets and (e.g., “car”, “repair”, “wine', etc.). Those skilled in the art executes instructions. The main memory 230 may include a will recognize, however, that in other situations the docu random access memory (RAM) or another type of dynamic 50 ments could contain other types of information, such as pho storage device that stores information and instructions for netic, or audiovisual information. execution by the processor 220. The ROM 240 may include a FIG. 4a illustrates a conventional alphanumeric index, conventional ROM device or another type of static storage based on the documents shown in FIG. 3. The first column of device that stores static information and instructions for use the index contains a list of alphanumeric terms, and the sec by the processor 220. The storage device 250 may include a 55 ond column contains a list of the documents corresponding to magnetic and/or optical recording medium and its corre those terms. Some terms, such as the alphanumeric term “3. sponding drive. only correspond to (e.g., appear in) one document—in this The input device 260 may include one or more conven case Document 1. Other terms, such as “rental, correspond tional mechanisms that permit a user to input information to to multiple documents—in this case Documents 1 and 2. the client device 110. Such as a keyboard, a mouse, a pen, 60 FIG. 4b illustrates how a conventional search engine, Such Voice recognition and/or biometric mechanisms, etc. The out as search engine 125, would use the index illustrated in FIG. put device 270 may include one or more conventional mecha 4a to provide search results in response to an alphanumeric nisms that output information to the user, including a display, search query. The alphanumeric query may be generated a printer, a speaker, etc. The communication interface 280 using any conventional technique. For purposes of illustra may include any transceiver-like mechanism that enables the 65 tion, FIG. 4b depicts two alphanumeric queries: “car and client device 110 to communicate with other devices and/or “wine'. Under a conventional approach, search engine 125 systems. For example, the communication interface 280 may receives an alphanumeric query, such as “car (stage 410), US 8,706,747 B2 7 8 and uses the alphanumeric index to determine which docu user would receive an undesired result (Document 3) in addi ments correspond to that query (stage 420). In this example, tion to the desired result (Document 1). This may be an a conventional search engine 125 would use the index illus acceptable price to pay, however, for the benefit of the user trated in FIG. 4a to determine that “car corresponds to Docu only having to press three keys to formulate the search query. ment 1 and would return Document 1 (or a reference to it) to FIG. 6 illustrates another flow diagram, consistent with the the user as a search result. Similarly, a conventional search invention, of a preferred technique for providing search engine would determine that “wine' corresponds to Docu results in response to a numeric Search query, based on the ment 3 and would return Document 3 (or a reference to it) to documents and index shown in FIGS. 3 and 4a, respectively. the user (stage 430). This flow diagram demonstrates how increasing the size of FIG. 5a illustrates a flow diagram, consistent with the 10 the received sequence can help limit search results to those invention, of a preferred technique for providing search desired by the user. For the sake of illustrative ease, FIG. 6 results in response to a numeric Search query, based on the again describes a particular technique for processing a documents and index shown in FIGS. 3 and 4a, respectively. numeric query based on the mapping of a standard telephone For the sake of illustrative ease, FIG.5a describes a particular handset; but those skilled in the art will recognize that other technique for processing a numeric query based on the map 15 techniques consistent with the invention may be used. ping of a standard telephone handset, but those skilled in the At stage 610, a sequence “227 48367 (consisting of art will recognize that other techniques consistent with the numeric components “2”, “2”, “7”, “4”, “8”, “3”, “6”, “7”) is invention may be used. received from a user. For the sake of explanation, the At stage 510, a sequence “227 (consisting of numeric sequence “227 will be called a “number word' and the entire components “2, 2’, and “7”) is received from a user. At sequence “22748367 will be called a “number phrase.” The stage 520, information is obtained about how the numeric possible alphanumeric equivalents of a number word will be components map to letters. Assuming that the user entered the called “letter words' and the possible alphanumeric equiva information from a standard telephone keypad, this mapping lents of a number phrase will be called “letter phrases.” information is shown in FIG. 5b. As shown in FIG. 5b, the At stage 620, information is obtained about how the letters “a”, “b', and “c” each map to the number “2, the 25 numeric components map to letters. Assuming the same map letters “p”, “q, “r”, and “s” each map to the number “7”, and ping information is used as shown in FIG.5b, at stage 630, the so forth. number phrase “227 483.67” is translated into potentially At stage 530, using this mapping information, the sequence corresponding letter phrases. Based on the information “227 is translated into its potential alphanumeric equiva shown in FIG. 5b, there exist 11664 possible letter phrases lents. Based on the information shown in FIG.5b, there exist 30 that correspond to the sequence “227 483.67. 36 possible combinations of letters that correspond to the At stage 640, these letter phrases are provided as an input sequence “227, including the following: aap, bap, cap, abp. to a conventional search engine, such as that described in bbp. . . . bar . . . car . . . ccs. If numbers are included in the reference to FIGS. 4a and 4b, using a logical “OR” operation. possible combinations (e.g., “aa7), there would exist 80 For example, the search query provided to the search engine possible combinations. Rather than generating all possible 35 could be “aap gtdmp OR aap htdmp . . . OR bar alphanumeric equivalents, it may be desirable to limit the items . . . OR car items''. Although all possible letter generated equivalents based on Some lexicon. For example, it phrases may be provided to the search engine, a Subset may may be desirable to generate only those alphanumeric equiva instead be used by employing conventional techniques to lents that appearina dictionary, search engine log of previous eliminate letter phrases that are unlikely to be intended. search queries, etc.; or to otherwise limit the alphanumeric 40 At stage 650, search results are obtained from the search equivalents by using known statistical techniques (e.g., the engine. Because many search engines are designed to rank probability of certain words appearing together). highly those documents that contain the exact phrase sought, At stage 540, these alphanumeric equivalents are provided Document 3 would likely be the highest ranked search result as an input to a conventional search engine, Such as that (i.e., because it contains the exact phrase “bar items). No described in reference to FIGS. 4a and 4b, using a logical 45 other document in the example contains one of the other letter “OR” operation. For example, the search query provided to phrases generated at stage 620. Furthermore, many search the search engine could be “aap OR bap OR cap OR abp . . . engines downweight (or eliminate) search results that contain OR bar . . . OR car. Although all possible alphanumeric individual parts of a phrase but not the entire phrase. For equivalents may be provided to the search engine, a Subset example, Document 1 would be downweighted or eliminated may instead be used by using conventional techniques to 50 because it contains the letter word “car, which corresponds eliminate equivalents that are unlikely to be intended. For to the first part of the letter phrase, but it does not contain any example, one could generate a narrower list of possible com letter word that corresponds to the second part of the letter binations by using techniques that draw upon probabilistic phrase. Finally, letter phrases such as “aap htdmp' are effec information about the usage of letters or words: one could tively ignored because they contain no letter words that ignore combinations that begin with “qt” but include (and 55 appear in the search engine's index. favor) combinations that begin with “qu.” At stage 660, the search results are presented to the user. In At stage 550, search results are obtained from the search the example shown, the first result shown to the user would be engine. Because terms such as 'aap' and “abp' do not appear Document 3, which is likely most relevant to the user's query. in the search engine's index, they are effectively ignored. Document 1 may be eliminated altogether, because it does not Indeed, the only terms contained within the index shown in 60 contain one of the possible letter phrases. In this manner, the FIG. 4b are “car' and “bar, and so the only search results user is provided with the most relevant search results. returned are those that reference Documents 1 and 3. At stage Although the descriptions above in reference to FIGS. 5 560, these search results are presented to the user. The search and 6 are made in reference to receiving numeric information results may be presented in the same order provided by the and mapping it to alphanumeric information, those skilled in search engine, or may be reordered based on considerations 65 the art will recognize that other implementations are possible Such as the language of the user. Assuming that the user was consistent with the invention. For example, instead of receiv only interested in documents containing the term “bar, the ing a sequence of numbers corresponding to the keys pressed US 8,706,747 B2 9 10 by a user, the received sequence may consist of the first letters results, since words are often ambiguous, and queries will corresponding to the keys pressed by the user. In other words, often be too short to provide adequate contextual clues to instead of receiving "227, the received sequence may be resolve this ambiguity. For instance, the word “bank' can “aap’. Consistent with the invention, the equivalent letter refer to a river bank, a financial institution, or a maneuver by sequences generated in stages 530 or 630 could then be other an airplane, thus making it difficult to translate accurately in letter sequences (e.g., “bar”) that correspond to 'aap.” Indeed, the abstract. In addition, if the dictionary is not relatively large the received sequence may contain phonetic, audiovisual, or and/or frequently updated, it may not contain entries for all any other type of information components. the terms that the search engine may encounter, Such as sel Regardless of the form in which the sequence is received, it dom-used words, slang, idioms, proper names, and the like. is generally preferred that the received sequence be translated 10 Embodiments of the present invention can be used to over into a sequence that corresponds to the format in which infor come or ameliorate Some or all of these problems by using a mation is stored in the search engine's index. For example, if probabilistic dictionary to translate query terms from one the search engine's index is stored in alphanumeric format, language or character set (e.g., ASCII) to another (e.g., kanji). the received sequence should be translated into alphanumeric In a preferred embodiment, the probabilistic dictionary maps Sequences. 15 one set of terms to another set of terms, and associates a Furthermore, it is generally preferred that the mapping probability with each of the mappings. For convenience, a technique that is used to translate the received sequence of “term' or “token' will refer to words, phrases, and/or (more information components be the same technique that is generally) sequences of one or more characters that may employed at the user's device to map the user's input to the include spaces. information generated by the device. There may, however, be FIG.8 shows an example of a probabilistic dictionary 800 instances where it is preferable to use a different mapping such as that described above. The example probabilistic dic technique than is used for user input. tionary 800 shown in FIG.8 maps words written in romaji (a Embodiments of the present invention can also enable Roman alphabet representation of Japanese) to words written users to perform searches entered using non-target-language in kanji (a non-Roman, ideogram-based Japanese character keyboards. For example, a web page containing Japanese text 25 set). To facilitate explanation, FIG. 8 depicts romaji terms as may be written in kanji, while a user attempting to search that "