“Normalized Google distance”的意思、由来-开放百科全书

词条

Normalized Google distance

释义

Introduction
Google Distribution and Google Code
Properties
Applications
References
Related Literature

The Normalized Google Distance (NGD) is a semantic similarity measure derived from the number of hits returned by the Google search engine for a given set of keywords.^[1] Keywords with the same or similar meanings in a natural language sense tend to be "close" in units of Normalized Google Distance, while words with dissimilar meanings tend to be farther apart.

Specifically, the Normalized Google Distance (NGD) between two search terms x and y is

where N is the total number of web pages searched by Google multiplied by the average number of singleton search terms occurring on pages; f(x) and f(y) are the number of hits for search terms x and y, respectively; and f(x, y) is the number of web pages on which both x and y occur.

If the then x and y are viewed as alike as possible, but if then x and y are very different.

If the two search terms x and y never occur together on the same web page, but do occur separately, the NGD between them is infinite. If both terms always occur together, their NGD is zero.

Example: On 9 April 2013, googling for "Shakespeare" gave 130,000,000 hits;

googling for "Macbeth" gave 26,000,000 hits; and googling

for "Shakespeare Macbeth" gave 20,800,000 hits.

The number of pages indexed by Google was estimated by the number

of hits of the search term "the," which was 25,270,000,000 hits. Assuming

there are about 1,000 search terms on the average page this gives .

Hence

.

"Shakespeare" and "Macbeth" are

very much alike according to the relative semantics supplied by Google.

Introduction

The Normalized Google Distance is derived from the earlier Normalized Compression Distance.

.^[2]^[3]

Namely, objects can be given literally, like the literal four-letter genome of a mouse,

or the literal text of Macbeth by Shakespeare. The similarity of these objects is given by the NCD. For

simplicity we take it that all meaning of the object

is represented by the literal object itself. Objects can also be

given by name, like 'the four-letter genome of a mouse,'

or 'the text of Macbeth by Shakespeare.' There are

also objects that cannot be given literally, but only by name,

and that acquire their meaning from their contexts in background common

knowledge in humankind, like 'home" or "red." The similarity between names for objects is

given by the NGD.

Google Distribution and Google Code

The probabilities of Google search terms, conceived as

the frequencies of page counts returned by Google divided by

the number of pages indexed by Google (multplied by the average number

of search terms in those pages),

approximate the actual relative frequencies of those search terms

as actually used in society. Based on this premise,

the relations represented by the

normalized Google distance

approximately capture

the assumed true semantic

relations governing the search terms. In the NGD the World Wide Web

and Google is used. Other text corpora

can be Wikipedia, the King James version of the

Bible or the Oxford English Dictionary together with appropriate search engines.

Properties

The following properties are proved in:^[1]

The NGD is roughly in between 0 and . It can be slightly negative. For example, "red red" gives about 20% more hits of Google on the World Wide Web than "red." (Mid 2013 there were 4.260.000.000 hits for "red" and 5.500.000.000 hits for "red red". Presently, "red red" now returns far fewer results than "red".) If the then we view x and y as very dissimilar.
The NGD is not a metric. In the beginning we have seen that the NGD is zero for x and y that are not equal provided x and y do always occur together on the same web page. From the NGD formula we see that it is symmetric. The triangle property is not satisfied by the NGD. However, these results are theoretic. It is hard to come up with practical examples of the World Wide Web using Google that violate the triangle property.

Applications

Applications to colors versus numbers, primes versus non-primes and so are given in,^[1]

as well as a randomized massive experiment using WordNet categories. In the primes versus non-primes case

and the WordNet experiment the NGD method is augmented with a Support Vector Machine classifier.

The experiments consist of 25 positive examples and 25 negative ones. The WordNet experiment consisted of 100 random WordNet categories. The NGD method had a success rate of 87.25%. That is the mean is

0.8725 while the standard deviation was 0.1169. These rates are about agreement with the WordNet categories which represent the knowledge of researchers with PhD's which entered them. It is rare to see agreement less than 75%.

References

1. ^¹²[https://arxiv.org/abs/cs.CL/0412098 The Google similarity distance on ArXiv.org] or R.L. Cilibrasi and P.M.B. Vitanyi, The Google similarity distance , IEEE Trans. Knowledge and Data Engineering, 19:3(2007), 370–383 or https://arxiv.org/abs/cs.CL/0412098
2. ^[https://arxiv.org/abs/cs.CV/0312044 Clustering by Compression on ArXiv.org] or R.L. Cilibrasi and P.M.B. Vitanyi, Clustering by Compression, IEEE Trans. Information Theory, 51:12(2005).
3. ^{{cite web|url=http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=1362909&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D1362909 |title=M. Li, X. Chen, X. Li, B. Ma, P.M.B. Vitanyi, The similarity metric, IEEE Trans. Inform. Th., 50:12(2004), 3250- 3264 |doi=10.1109/TIT.2004.838101 |publisher=Ieeexplore.ieee.org |date=2011-09-27 |accessdate=2012-11-03}}

Related Literature

M. Li and P.M.B. Vitanyi, An Introduction to Kolmogorov Complexity and Its Applications, Springer, 2008, Third Edition
[https://www.newscientist.com/article.ns?id=dn6924 Google's search for meaning] at Newscientist.com.
J. Poland and Th. Zeugmann (2006), Clustering the Google Distance with Eigenvectors and Semidefinite Programming
A. Gupta and T. Oates (2007), Using Ontologies and the Web to Learn Lexical Semantics (Includes comparison of NGD to other algorithms.)
Wong, W., Liu, W. & Bennamoun, M. (2007) Tree-Traversing Ant Algorithm for Term Clustering based on Featureless Similarities. In: Data Mining and Knowledge Discovery, Volume 15, Issue 3, Pages 349–381. {{doi|10.1007/s10618-007-0073-y}} (the use of NGD for term clustering)

2 : Computational linguistics|Statistical distance

随便看

开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。