About: Normalized Google distance     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

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. 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 . "Shakespeare" and "Macbeth" arevery much alike according to the relative semantics supplied by Google.

AttributesValues
rdfs:label
  • Normalized Google distance (en)
rdfs:comment
  • 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. 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 . "Shakespeare" and "Macbeth" arevery much alike according to the relative semantics supplied by Google. (en)
sameAs
dbp:wikiPageUsesTemplate
Subject
prov:wasDerivedFrom
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
Link from a Wikipage to another Wikipage
has abstract
  • 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. 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 googlingfor "Shakespeare Macbeth" gave 20,800,000 hits.The number of pages indexed by Google was estimated by the numberof hits of the search term "the" which was 25,270,000,000 hits. Assumingthere are about 1,000 search terms on the average page this gives .Hence . "Shakespeare" and "Macbeth" arevery much alike according to the relative semantics supplied by Google. (en)
foaf:isPrimaryTopicOf
is Wikipage redirect of
is Link from a Wikipage to another Wikipage of
is known for of
Faceted Search & Find service v1.17_git151 as of Feb 20 2025


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 933 MB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software