Searching hypertext based multilingual web information

• US 20060059132A1
• Filed: 07/29/2005
• Published: 03/16/2006
• Est. Priority Date: 07/30/2004
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Zhang, Ling
• Granted Patent: US 7,711,682 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/9566 URL specific, e.g. using aliases, detecting broken or misspelled links
• CPC Class Codes: G06F 16/9577 Optimising the visualization of content, e.g. distillation of HTML documents

Abstract

The present invention provides methods, apparatus and systems for searching hypertext based multilingual Web information when searching on a network for keywords to be queried. A method includes: a receiving step for receiving keywords input by a user; a native language hypertext searching step for searching on the network, according to the keywords to be queried, for all hypertexts whose representing language is the same as a language representing the keywords and which matches the keywords to be queried; extracting hyperlinks related to an arbitrary language from all the searched hypertexts; a hyperlink ranking step for ranking the extracted hyperlinks according to the correlativity of the hyperlinks with the keywords to be queried; and returning to the user ranked search result. Thereby, an accurate cross language searching can be provided without extra machine translation effort, being more accurate and objective than machine translation, even than human translation.

Claims

1. A method for searching hypertext based multilingual Web information when searching on a network for keywords to be queried, comprising the following steps:

a receiving step for receiving keywords input by a user;

a native language hypertext searching step for searching the network, according to the keywords to be queried, for all hypertexts having a representing language the same as a language representing the keywords and which matches the keywords to be queried;

a hyperlink extracting step for extracting hyperlinks related to an arbitrary language from all the searched hypertexts;

a hyperlink ranking step for ranking the extracted hyperlinks according to the correlativity of the hyperlinks with the keywords to be queried; and

an output step for returning to the user a ranked search result.

2. The method of claim 1, wherein in the hyperlink ranking step, the hyperlink which is pointed to most includes the information matched most with the keyword to be queried.

3. The method of claim 1, wherein:

at the native language hypertext searching step, Web pages are downloaded in advance from the Internet and data indexing is conducted, for quickly searching for the hypertext matched with the keyword to be queried; and

the hyperlink ranking step performs ranking on the hyperlinks according to hypertext similarity with respect to the keyword to be queried and hyperlink ranks.

4. The method of claim 3, wherein the hypertext similarity with respect to the keyword to be queried is determined as follows:

$S<br><br>\left(d_i,Q\right)=\frac{\underset{j=1}{\overset{n}{\sum <br><br>}}<br><br>d_{\mathrm{ij}}-q_j}{\sqrt{\underset{j=1}{\overset{n}{\sum <br><br>}}<br><br>d_{\mathrm{ij}}^2-\underset{j=1}{\overset{n}{\sum <br><br>}}<br><br>q_j^2}}$

where d_i represents the i'"'"'th hypertext in a Web page d, d_ij represents the j'"'"'th dimension of the i'"'"'th hypertext, q_j represents the j'"'"'th dimension of a keyword Q, and S represents the hypertext similarity d_i with the keyword Q.

5. The method of claim 3, wherein the hyperlink rank is determined through the following iterative computation:

$\mathrm{PR}<br><br>\left(v\right)=\mathrm{\varepsilon <br><br>}/n+\left(1-\mathrm{\varepsilon <br><br>}\right)<br><br>\text{\hspace{1em}<br><br>}<br><br>\underset{u,v\in <br><br>G}{\sum <br><br>}<br><br>\mathrm{PR}<br><br>\left(u\right)/\mathrm{outlink}<br><br>\left(u\right)$

where PR(v) refers to the rank of a Web page v, outlink(u) refers to the number of all the hyperlinks in a Web page u, n is the number of all Web pages, and ε

is an adjusting parameter.

6. The method of claim 4, wherein after conducting comprehensive evaluation according to the following computation, ranking is performed according to the comprehensive evaluation value:

$\begin{array}{c}\mathrm{PR}<br><br>\left(v\right)=\mathrm{\varepsilon <br><br>}/n+\left(1-\mathrm{\varepsilon <br><br>}\right)<br><br>\text{\hspace{1em}<br><br>}<br><br>\underset{u,v\in <br><br>G}{\sum <br><br>}<br><br>\mathrm{PR}<br><br>\left(u\right)/\mathrm{outlink}<br><br>\left(u\right)\\ R<br><br>\left(d\right)=\mathrm{PR}<br><br>\left(d\right)<br><br>\left\{1+\mathrm{\delta <br><br>}·<br><br>S<br><br>\left(d,Q\right)\right\}\end{array}$

where PR(v) refers to the rank of a Web page v, outlink(u) refers to the number of all the hyperlinks in a Web page u, n is the number of all Web pages, and ε

is an adjusting parameter;

R(d) is the comprehensive evaluation value, S represents the similarity of the hypertext d_i included in the Web page d with the keyword Q, and parameter δ

is used to adjust the weights of PR(d) and S in the computation of R(d).

14. A program storage device readable by machine, tangibly embodying a program of instructions executable by the machine to perform method steps for searching hypertext based multilingual Web information, said method steps comprising the steps of claim 1.

16. An article of manufacture comprising a computer usable medium having computer readable program code means embodied therein for causing searching hypertext based multilingual Web information when searching on a network for keywords to be queried, the computer readable program code means in said article of manufacture comprising computer readable program code means for causing a computer to effect the steps of A method for comprising the steps:

of claim 2.

17. A program storage device readable by machine, tangibly embodying a program of instructions executable by the machine to perform method steps for searching hypertext based multilingual Web information, said method steps comprising the steps of claim 3.

19. A program storage device readable by machine, tangibly embodying a program of instructions executable by the machine to perform method steps for searching hypertext based multilingual Web information, said method steps comprising the steps of claim 4.

7. A system to search hypertext based multilingual Web information for searching on a network for keywords to be queried, comprising:

receiving means for receiving keywords input by a user;

native language hypertext searching means for searching on the network, according to the keywords to be queried, for all hypertexts whose representing language is the same as a language representing the keywords and which matches the keywords to be queried;

hyperlink extracting means for extracting hyperlinks related to an arbitrary language from all the searched hypertexts;

hyperlink ranking means for ranking the extracted hyperlinks according to the correlativity of the hyperlinks with the keywords to be queried; and

an output means for returning to the user ranked search result.

8. The system of claim 7, wherein after the ranking by the hyperlink ranking means, the hyperlink which is pointed to most includes the information matched most with the keyword to be queried.

9. The system of claim 7, wherein:

the native language hypertext searching means downloads Web pages in advance from the Internet and conducts data indexing, for quickly searching for the hypertext matched with the keyword to be queried; and

the hyperlink ranking means performs ranking on the hyperlinks according to hypertext similarity with respect to the keyword to be queried and hyperlink ranks.

10. The system of claim 9, wherein the similarity of the hypertext with respect to the keyword to be queried is determined as follows:

$S<br><br>\left(d_i,Q\right)=\frac{\underset{j=1}{\overset{n}{\sum <br><br>}}<br><br>d_{\mathrm{ij}}-q_j}{\sqrt{\underset{j=1}{\overset{n}{\sum <br><br>}}<br><br>d_{\mathrm{ij}}^2-\underset{j=1}{\overset{n}{\sum <br><br>}}<br><br>q_j^2}}$

where d_i represents the i'"'"'th hypertext in a Web page d, d_ij represents the j'"'"'th dimension of the i'"'"'th hypertext, q_j represents the j'"'"'th dimension of a keyword Q, and S represents the hypertext similarity d_i with the keyword Q.

11. The system of claim 9, wherein the hyperlink rank is determined through the following iterative computation:

$\mathrm{PR}<br><br>\left(v\right)=\mathrm{\varepsilon <br><br>}/n+\left(1-\mathrm{\varepsilon <br><br>}\right)<br><br>\text{\hspace{1em}<br><br>}<br><br>\underset{u,v\in <br><br>G}{\sum <br><br>}<br><br>\mathrm{PR}<br><br>\left(u\right)/\mathrm{outlink}<br><br>\left(u\right)$

where PR(v) refers to the rank of a Web page v, outlink(u) refers to the number of all the hyperlinks in a Web page u, n is the number of all Web pages, and ε

is an adjusting parameter.

12. The system of claim 10, wherein after conducting comprehensive evaluation according to the following computation, ranking is performed according to the comprehensive evaluation value:

$\begin{array}{c}\mathrm{PR}<br><br>\left(v\right)=\mathrm{\varepsilon <br><br>}/n+\left(1-\mathrm{\varepsilon <br><br>}\right)<br><br>\text{\hspace{1em}<br><br>}<br><br>\underset{u,v\in <br><br>G}{\sum <br><br>}<br><br>\mathrm{PR}<br><br>\left(u\right)/\mathrm{outlink}<br><br>\left(u\right)\\ R<br><br>\left(d\right)=\mathrm{PR}<br><br>\left(d\right)<br><br>\left\{1+\mathrm{\delta <br><br>}·<br><br>S<br><br>\left(d,Q\right)\right\}\end{array}$

where PR(v) refers to the rank of a Web page v, outlink(u) refers to the number of all the hyperlinks in a Web page u, n is the number of all Web pages, and ε

is an adjusting parameter;

R(d) is the comprehensive evaluation value, S represents the similarity of the hypertext d_i included in the Web page d with the keyword Q, and parameter δ

is used to adjust the weights of PR(d) and S in the computation of R(d).

15. A computer program product comprising a computer usable medium having computer readable program code means embodied therein for causing a search of hypertext based multilingual Web information, the computer readable program code means in said computer program product comprising computer readable program code means for causing a computer to effect the functions of claim 7.

18. A computer program product comprising a computer usable medium having computer readable program code means embodied therein for causing a search of hypertext based multilingual Web information, the computer readable program code means in said computer program product comprising computer readable program code means for causing a computer to effect the functions of claim 8.

20. A computer program product comprising a computer usable medium having computer readable program code means embodied therein for causing a search of hypertext based multilingual Web information, the computer readable program code means in said computer program product comprising computer readable program code means for causing a computer to effect the functions of claim 9.

13. An article of manufacture comprising a computer usable medium having computer readable program code means embodied therein for causing searching hypertext based multilingual Web information when searching on a network for keywords to be queried, the computer readable program code means in said article of manufacture comprising computer readable program code means for causing a computer to effect the steps of A method for comprising the following steps:

a receiving step for receiving keywords input by a user;

a native language hypertext searching step for searching the network, according to the keywords to be queried, for all hypertexts having a representing language the same as a language representing the keywords and which matches the keywords to be queried;

p1 a hyperlink extracting step for extracting hyperlinks related to an arbitrary language from all the searched hypertexts;

a hyperlink ranking step for ranking the extracted hyperlinks according to the correlativity of the hyperlinks with the keywords to be queried; and

an output step for returning to the user a ranked search result.