Note : Les descriptions sont présentées dans la langue officielle dans laquelle elles ont été soumises.
CA 02845194 2014-03-07
CLASSIFICATION OF AMBIGUOUS
GEOGRAPHIC REFERENCES
BACKGROUND
A. Field of the Invention
Systems and methods described herein relate to search engines and, more
particularly, to
techniques for classifying text as relevant to geographic regions.
B. Description of Related Art
The World Wide Web ("web") contains a vast amount of information. Locating a
desired portion
of the information, however, can be challenging. This problem is compounded
because the amount of
information on the web and the number of new users inexperienced at web
searching are growing
rapidly.
Search engines attempt to return hyperlinks to web pages in which a user is
interested.
Generally, search engines base their determination of the user's interest on
search terms (called a
search query) entered by the user. The goal of the search engine is to provide
links to high quality,
relevant results (e.g., web pages) to the user based on the search query.
Typically, the search engine
accomplishes this by matching the terms in the search query to a corpus of pre-
stored web pages. Web
pages that contain the users search terms are "hits" and are returned to the
user as links.
In an attempt to increase the relevancy and quality of the web pages returned
to the user, a
search engine may attempt to sort the list of hits so that the most relevant
and/or highest quality pages
are at the top of the list of hits returned to the user. For example, the
search engine may assign a rank or
score to each hit, where the score is designed to correspond to the relevance
or importance of the web
page.
Local search engines are search engines that attempt to return relevant web
pages within a
specific geographic region. When indexing documents for a local search engine,
it is desirable to be able
to, when appropriate, automatically associate documents, or sections of
documents, with specific
geographic regions. For example, a web page about a restaurant in New York
City should be associated
with New York City. In many cases, geographically specific web pages include
postal addresses or other
geographic information that unambiguously associates the web page with the
geographic region. In
other cases, however, the web page may be related to a specific geographic
region but yet may include
only partial postal address information or include other terms that may not be
easily recognized as being
associated with a specific geographic location. This makes it difficult to
determine the geographic region
with which the web page is associated.
SUMMARY OF THE INVENTION
One aspect of the invention is directed to a method of determining
geographical relevance of a
document. The method includes receiving at least one geo-relevance profile
associated with at least one
string in the document, obtaining a combined geo-relevance profile for the
document from the at least
one geo-relevance profile, and determining geographical relevance of the
document based on the
combined geo-relevance profile.
Another aspect of the invention is directed to a computer-readable medium that
contains
programming instructions for execution by a processor. The computer-readable
medium includes
programming instructions for receiving geo-relevance profiles associated with
respective strings in a
document, the geo-relevance profiles each defining the geographical relevance
of the string with respect
1
CA 02845194 2014-03-07
to geographical regions. The computer-readable medium further includes
programming instructions for
determining geographical relevance of the document based on the geo-relevance
profiles.
Yet another aspect of the invention is directed to a method for generating a
geo-relevance profile
for a string. The method includes determining a plurality of sections of
training text in which each section
of training text is associated with a geographical region, accumulating
occurrences of the string in the
plurality of selections of training text, and generating the geo-relevance
profile as a histogram based on
the accumulated occurrences of the string.
BRIEF DESCRIPTION OF THE DRAWINGS
The accompanying drawings, which are incorporated in and constitute a part of
this specification,
illustrate an embodiment of the invention and, together with the description,
explain the invention. In the
drawings,
Fig. 1 is a diagram illustrating general concepts consistent with aspects of
the invention;
Fig, 2 is an exemplary diagram of a network in which systems and methods
consistent with the
principles of the invention may be implemented;
Fig. 3 is an exemplary diagram of a client or server shown in Fig. 2;
Fig. 4 is a flow chart illustrating an exemplary procedure for training the
location classifier engine
shown in Figs. 1 and 2;
Fig. 5 is a diagram illustrating an exemplary document in which two geographic
signals are
present;
Fig, 6 is a diagram of a portion of an exemplary table illustrating training
data;
Figs. 7A-7C are diagrams illustrating exemplary geo-relevance profiles for
terms/phrases;
Fig. 8 is a diagram conceptually illustrating a table including exemplary
terms/phrases and their
corresponding geo-relevance profiles;
Fig. 9 is a flow chart illustrating exemplary operation of the location
classifier in determining
potentially relevant geographical areas for input documents;
Figs. 10A-10C illustrate combining multiple geo-relevance profiles to obtain a
combined profile;
and
Fig. 11 is a diagram illustrating an exemplary implementation of the location
classifier
implemented in the context of a search engine.
DETAILED DESCRIPTION
The following detailed description of the invention refers to the accompanying
drawings. The
detailed description does not limit the invention.
OVERVIEW
A location classifier is described herein that automatically classifies input
text, when appropriate,
to specific geographic regions(s). Fig. 1 is a diagram illustrating general
concepts consistent with
aspects of the invention, including a location classifier 100. As an example
of the operation of location
classifier 100, consider an input document, such as the exemplary document
shown in Fig. 1, describing
a business on Castro Street in Mountain View, California. Assume that the
document describes the
business as being on Castro Street in the bay area, but does not specifically
include a full postal address,
telephone number, and never explicitly states "Mountain View, California."
Location classifier 100 may recognize that the bi-grams "bay area" and "Castro
Street" in the
document are geographically significant. "Bay area,' by itself, is frequently
used to refer to the area
surrounding the San Francisco bay in California, but it is also commonly used
to refer to other bay
2
CA 02845194 2014-03-07
locations, such as the Green Bay area in Wisconsin. Additionally, Castro
Street, by itself, may be a
common street name. Location classifier 100 may resolve the individual
geographical ambiguity in "Bay
Area" and "Castro Street" by recognizing that the occurrence of both of these
phrases is likely to indicate
that the document pertains to the Castro Street located in Mountain View,
California.
Location classifier 100 may then generate a complete address or other location
identifier, such as
Mountain View, CA, 94043, as potentially corresponding to the business
mentioned in the document.
EXEMPLARY NETWORK OVERVIEW
Fig. 2 is an exemplary diagram of a network 200 in which systems and methods
consistent with
the principles of the invention may be implemented. Network 200 may include
clients 210 connected to a
server 220 via a network 240. Network 240 may include a local area network
(LAN), a wide area network
(WAN), a telephone network, such as the Public Switched Telephone Network
(PSTN), an Intranet, the
Internet, or a combination of networks. Two clients 210 and one server 220
have been illustrated as
connected to network 240 for simplicity. In practice, there may be more
clients and/or servers. Also, in
some instances, a client may perform the functions of a server and a server
may perform the functions of
a client.
A client 210 may include a device, such as a wireless telephone, a personal
computer, a
personal digital assistant (PDA), a lap top, or another type of computation or
communication device, a
thread or process running on one of these devices, and/or an object executable
by one of these devices.
Server 220 may include a server device that processes, searches, and/Or
maintains documents. Clients
210 and server 220 may connect to network 240 via wired, wireless, or optical
connections.
Server 220 may include a search engine 225 usable by clients 210. Search
engine 225 may be
a search engine, such as a query-based document search engine: In some
implementations, search
engine 225 may particularly be designed to return results local to geographic
regions. Search engine
225 may include location classifier 100. Location classifier 100 receives
input data that may include
partial addresses or terms/phrases having geographic relevance and may
generate one or more location
identifiers corresponding to geographic areas that correspond to the input
documents. Location classifier
100 may, for instance, be used by search engine 225 to associate documents,
such as web pages, with
geographic areas or to determine whether a user search query relates to a
specific geographic location.
A document, as the term is used herein, is to be broadly interpreted to
include any machine-
readable and machine-storable work product. A document may be an e-mail, a
search query, a file, a
combination of files, one or more files with embedded links to other files, a
news group posting, etc. In
the context of the Internet, a common document is a web page. Web pages often
include content and
may include embedded information (such as meta information, hyperlinks, etc.)
and/or embedded
instructions (such as JavaScript, etc.).
EXEMPLARY CLIENT/SERVER ARCHITECTURE
Fig. 3 is an exemplary diagram of a client 210 or server 220, referred to as
computing device
300, according to an implementation consistent with the principles of the
invention. Computing device
300 may include a bus 310, a processor 320, a main memory 330, a read only
memory (ROM) 340, a
storage device 350, an input device 360, an output device 370, and a
communication interface 380. Bus
310 may include a path that permits communication among the components of
computing device 300.
Processor 320 may include any type of conventional processor, microprocessor,
or processing
logic that may interpret and execute instructions. Main memory 330 may include
a random access
3
CA 02845194 2014-03-07
memory (RAM) or another type of dynamic storage device that stores information
and instructions for
execution by processor 320. ROM 340 may include a conventional ROM device or
another type of static
storage device that stores static information and instructions for use by
processor 320. Storage device
350 may include a magnetic and/or optical recording medium and its
corresponding drive.
Input device 360 may include a conventional mechanism that permits a user to
input information
to computing device 300, such as a keyboard, a mouse, a pen, voice recognition
and/or biometric
mechanisms, etc. Output device 370 may include a conventional mechanism that
outputs information to
the user, including a display, a printer, a speaker, etc. Communication
interface 380 may include any
transceiver-like mechaniSm that enables computing device 300 to communicate
with other devices and/or
systems. For example, communication interface 380 may include mechanisms for
communicating with
another device or system via a network, such as network 240.
Server 220, consistent with the principles of the invention, performs certain
searching or
document retrieval related operations through search engine 225 and/or
location classifier engine 100.
Search engine 225 and/or location classifier engine 100 may be stored in a
computer-readable medium,
such as memory 330. A computer-readable medium may be defined as one or more
physical or logical
memory devices and/or carrier waves.
The software instructions defining search engine 225 may be read into memory
330 from another
computer-readable medium, such as data storage device 350, or from another
device via communication
interface 380. The software instructions contained in memory 330 cause
processor 320 to perform
processes that will be described later. Alternatively, hardwired circuitry may
be used in place of or in
combination with software instructions to implement processes consistent with
the present invention.
Thus, implementations consistent with the principles of the invention are not
limited to any specific
combination of hardware circuitry and software.
TRAINING OF LOCATION
CLASSIFIER 100
Location classifier 100 may automatically generate geographic location
information for an input
document or section of a document. Before location classifier 100 can generate
the geographic location
information, it may be trained on a number of training documents. In one
implementation, the documents
may be web pages.
Fig. 4 is a flow chart illustrating exemplary procedures for training location
classifier 100.
Location classifier 100 may be trained on a large number of documents, such as
a large number
of web documents. Location classifier engine 100 may begin training by
retrieving a first of the
documents, (act 401), and locating known geographic signals within the
document (act 402). A known
geographic signal may include, for example, a complete address that
unambiguously specifies a
geographic location. The geographic signal can be located by, for example,
pattern matching techniques
that look for sections of text that are in the general form of an address. For
example, location classifier
engine 100 may look for zip codes as five digit integers located near a state
name or state abbreviation
and street names as a series of numerals followed by a string that includes a
word such as "street," "st.,"
"drive," etc. In this manner, location classifier 100 may locate the known
geographic signals as sections
of text that unambiguously reference geographic addresses.
Fig. 5 is a diagram illustrating an exemplary document 500 in which two
geographic signals are
present. As shown, document 500 includes a first geographic signal 505, a
paragraph of text 510, a
second geographic signal 515, and a second paragraph of text 520.
4
CA 02845194 2014-03-07
The first geographic signal, signal 505, is for a hypothetical coffee shop
called "Coffee Time" that
specifies, as a standard postal address, the location of Coffee Time. Location
classifier 100 may
recognize this address as a valid address based both on the structure of the
address and/or based on the
fact that the zip code, street name, and city name are all consistent with a
known location in California.
Similarly, location classifier 100 may recognize that geographic signal 515
also represents a valid
address that is unambiguously associated with a physical location. One of
ordinary skill in the art will
recognize that other techniques for determining whether a document is
associated with a geographic
location can be used, such as manual classification of documents.
Documents that are determined to be associated with valid geographic signals
in act 402 are
assumed to be documents that correspond to a known geographic region(s). If
the document currently
being processed is not such a document, such as a web document that is not
associated with a particular
geographic region, the next document may be processed (acts 403 and 405). For
documents that
include valid geographic signals, however, location classifier 100 may select
text from the document to
be used as training text associated with the found geographic signal(s) (act
404).
The text selected in act 404 as the training text associated with the document
may be selected in
a number of different ways. For example, a fixed window (e.g., a 100 term
window) around each
geographic signal may be selected as the training text. In other
implementations, the whole document
may be selected. In still other implementations, documents with multiple
geographic signals may be
segmented based on visual breaks in the document and the training text taken
from the segments. For
the document shown in Fig. 5, for instance, paragraph 510 may be associated
with address signal 505
and paragraph 520 may be associated with address signal 515.
Acts 402-405 may be repeated for each document in the corpus of documents that
are to be
used as training documents (act 406). In general, acts 401-405 serve to
generate training data in which
each of a number (usually a large number) of known locations are associated
with text. Fig. 6 is a
diagram of a portion of a table illustrating exemplary training data generated
in acts 402-405. Table 600
may include a number of location identifier fields 605 and corresponding
sections of text 610. Identifier
fields 605 may be based on the geographic signals and text sections 610 may
include the text selected
for each geographic signal. Thus, each located geographic signal may
correspond to an entry in table
600.
In one implementation, location identifier fields 605 may include the zip
codes corresponding to
the geographic signals identified in act 402. Zip codes are particularly
useful to use as an identifier for a
geographic location because zip codes that are close to one another
numerically tend to correspond to
locations that are close to one another geographically. Location identifiers
other than zip codes may,
however, also be used.
Two entries are particularly shown in table 600. These two entries correspond
to the two
geographic signals from document 500. The first entry includes the zip code
94040 as the located
identifier and paragraph 510 as the selected text. The second entry includes
the zip code 94041 as the
located identifier and paragraph 520 as the selected text.
Although the training data in table 600 is described herein as being generated
by location
classifier 100 in a same process as the rest of the training (i.e., acts 407-
410), the training data could be
generated ahead of time or by another component or device.
Consistent with an aspect of the invention, location classifier 100 operates,
in part, on the
premise that text in a document that is in the vicinity of a geographic signal
is biased towards using terms
5
CA 02845194 2014-03-07
or phrases that relate to the geographic signal. The training data obtained in
acts 401-406 may be
further processed by location classifier 100, as will be described below with
reference to acts 407-410, to
obtain geo-relevance profiles for certain terms/phrases.
Location classifier 100 may begin by accumulating, for a select term or
phrase, all occurrences of
the term/phrase (also referred to as a textual strings or just strings herein)
in the text selections 610
relative to the location identifiers for which the term/phrase occurs (act
407). In other words, location
classifier 100 may generate a histogram relating the number of occurrences of
the term/phrase to the
location identifiers. The histogram will also be referred to herein as the geo-
relevance profile of the
term/phrase.
Fig. 7A is a diagram illustrating an exemplary histogram 700 for the bi-gram
"capitol hill." As
shown, the histogram includes three dominant peaks, a large peak centered in
the vicinity of zip code
20515, which corresponds to the "Capitol Hill" area in Washington, DC, a
relatively small peak centered
in the vicinity of zip code 95814, which corresponds to the "Capitol Hill"
area in Sacramento, CA, and a
moderate peak centered in the vicinity of zip code 98104, which corresponds to
the "Capitol Hill" area in
Seattle, WA. Although text selections 610 potentially included numerous
references to "capitol hill," many
of which were associated with areas not in the vicinity of Washington, DC,
Sacramento, or Seattle,
histogram 700 illustrates that overall, "capitol hill" tends to be used when
referring to one of these three
locations. Washington, DC, which corresponds to the largest peak, can be
interpreted as the most likely
geographic region intended by a person using the phrase "capitol hill."
Fig. 73 is a diagram illustrating another exemplary histogram, histogram 710,
for the bi-gram
"bay area." Histogram 710 includes two peaks, a smaller one centered around
the Green Bay, WI, area,
and a larger peak defining the San Francisco, CA, bay area.
Location classifier 100 may perform act 407 for some or all of the
terms/phrases occurring in text
selections 610. In one implementation, location classifier 100 may generate a
histogram for all the bi-
grams (two word phrases) that occur in text 610. In other implementations,
histograms may also be
generated for longer phrases or single terms.
Certain occurrences of terms/phrases may be ignored when accumulating
occurrences of
terms/phrases. Some boilerplate language may occur frequently in a set of
training documents, although
the boilerplate language is not necessarily relevant for determining
geographical relevance. Accordingly,
in some implementations, terms to left and/or right of a select term/phrase
may also be examined, and
the term/phrase accumulated only when these terms are different than previous
instances of the terms to
the left or right of the term/phrase. Thus, if a term/phrase does not occur in
a legitimate new context, it
may be ignored.
Location classifier 100 may next select and store the generated histograms
that correspond to
geographically relevant terms/phrases (acts 408 and 409). The stored
histograms act as geo-relevance
profiles for the terms/phrases. Many of the terms/phrases for which histograms
are generated in act 407
may not be geographically relevant. Fig. 7C is a diagram of an exemplary
histogram 720 for the for the
bi-gram "live bookmarks." This phrase is not geographically relevant, and
accordingly, the histogram is
relatively flat, Histograms 700 and 710, however, include statistically
significant spikes that indicate that
these terms/phrases may be relevant to a particular geographic location. One
of ordinary skill in the art
will recognize that a number of known techniques could be used to determine
whether a histogram
includes statistically significant peaks.
Acts 408 and 409 may be repeated for a number of terms/phrases in text
selections 610 (act
6
CA 02845194 2014-03-07
410). In one implementation, location classifier 100 may examine the
geographical relevance of every bi-
gram present in text selections 610. In other implementations, single terms
could be examined for
geographical relevance or phrases having three or more terms could be
examined.
As a result of the training shown in Fig. 4, location classifier 100 may store
a number (potentially
a large number) of terms/phrases and their corresponding geo-relevance
profiles. Fig. 8 is a diagram
conceptually illustrating a table 800 including exemplary terms/phrases and
their corresponding geo-
relevance profiles.
In one implementation, the gee-relevance profiles stored in act 409 may be
normalized based on
the global distribution of zip codes in the training data. In this manner,
regions that are frequently
mentioned in the training data are not over emphasized in the geo-relevance
profiles.
OPERATION OF LOCATION
CLASSIFIER 100
Fig. 9 is a flow chart illustrating exemplary operation of location classifier
100 in determining
potentially relevant geographical areas for input documents.
Location classifier 100 may begin by receiving the input document (act 901).
Generally, the input
document will be one that includes potentially ambiguous references to
locations. The input document
may, for example, be a relatively short section of text, such as a search
query, or a longer block of text
such as a web document. Terms/phrases may be located in the input document
that correspond to the
terms/phrases stored in table 800 (act 902). In other words, the terms/phrases
that were previously
determined to have geographical relevance are identified.
The geo-relevance profiles for each of the identified terms/phrases may next
be combined to
generate a resultant geo-relevance profile for the input document (act 903).
In one implementation, the
gee-relevance profiles may be combined by multiplying each of the geo-
relevance profiles identified in
act 902. That is, for each zip code, the values for each histogram may be
multiplied together to obtain a
value for that zip code in the resultant histogram. Figs. 10A-10C illustrate
combining multiple gee-
relevance profiles to obtain a combined profile. In this example, assume that
the input document is a
page of text that contains two bi-grams that are present in table 800 (i.e.,
the input page contains two
gee-graphically relevant terms/phrases). The two bi-grams are "Castro Street"
and "Bay Area." The geo-
relevance profile for Castro Street is shown in Fig. 10A and the geo-relevance
profile for Bay Area is
shown in Fig. 10B. Fig. 10C illustrates the combined geo-relevance profile. As
shown, although the
histograms in Figs. 10A and 10B both include multiple peaks, when combined,
the peaks tend to cancel
each other except in areas where both profiles indicate geographical
relevance. Accordingly, the
combined geo-relevance profile of Fig. 10C correctly indicates that the
reference to "Castro Street" and
"Bay Area" is most likely a reference to the Castro Street located in the
Northern California Bay Area.
Based on the combined geo-relevance profile, such as the exemplary profile
shown in Fig. 10C,
location classifier 100 may generate output information defining potential
relevance of the input
documents to one or more geographical regions (act 904). The output
information may generally be
obtained by examining the combined geo-relevance profile for peaks. In the
example of Fig. 10C, for
instance, the output information may include zip codes of regions that include
Castro Street in Northern
California. In some implementations, the zip codes may also be associated with
values that relate the
likeliness or certainty that the area defined by the zip code is correct.
In one implementation, the document received in act 901 may be a partial
address, such as a
partial address taken from a web page, search query, or other source. The
output information may then
7
=
CA 02845194 2014-03-07
be used to disambiguate the partial address. For instance, if an address such
as "650 Castro Street is
identified in a document without a city or state, the address by itself is not
a complete address. If,
however, location classifier 100 concludes that the document is relevant to
the Mountain View zip code
94043, then the address is unambiguous and can be reduced to an exact
geographical location
(latitude/longitude).
EXEMPLARY IMPLEMENTATION
Fig. 11 is a diagram illustrating an exemplary implementation of location
classifier 100
implemented in the context of a search engine. A number of users 1105 may
connect to a search engine
1110 over a network 1115, such as the Internet. Search engine 1110 may be a
local search engine that
returns links to a ranked set of documents, from a database 1120, that are
related to a user query that
the user intends to apply to a certain geographical region.
Location classifier 100 may assist search engine 1110 in determining the
geographical relevance
(if any) of the documents in database 1120. In particular, location classifier
100 may geographically
classify each of the documents, or portions of the documents, that cannot be
otherwise positively
identified as being associated with a particular geographic area. This
geographic classification
information may then be stored in database 1120 as location identifiers with
their corresponding
documents that search engine 1110 may use in responding to user search
queries.
In another possible exemplary implementation, location classifier 100 may
operate on the search
queries received from users 1105. Location classifier 100 may thus provide
geographical relevance
information pertaining to a search query. This information may be used to
assist search engine 1110 in
returning relevant results to the user.
CONCLUSION
As described above, a location classifier generates location information based
on terms/phrases
in input text. The terms/phrases can include terms/phrases that would normally
be considered
geographically ambiguous.
It will be apparent to one of ordinary skill in the art that aspects of the
invention, as described
above, may be implemented in many different forms of software, firmware, and
hardware in the
implementations illustrated in the figures. The actual software code or
specialized control hardware used
to implement aspects consistent with the present invention is not limiting of
the present invention. Thus,
the operation and behavior of the aspects were described without reference to
the specific software code
-- it being understood that a person of ordinary skill in the art would be
able to design software and
control hardware to implement the aspects based on the description herein.
The foregoing description of preferred embodiments of the present invention
provides illustration
and description, but is not intended to be exhaustive or to limit the
invention to the precise form
disclosed. Modifications and variations are possible in light of the above
teachings or may be acquired
from practice of the invention. For example, although many of the operations
described above were
described in a particular order, many of the operations are amenable to being
performed simultaneously
or in different orders. Additionally, although the location classifier was
generally described as being part
of a search engine, it should be understood that the search engine may more
generally be separate from
the location classifier.
No element, act, or instruction used in the present application should be
construed as critical or
essential to the invention unless explicitly described as such. Also, as used
herein, the article "a" is
intended to potentially allow for one or more items. Where only one item is
intended, the term "one" or
8
CA 02845194 2014-03-07
similar language is used. Further, the phrase "based on" is intended to mean
"based, at least in part, on"
unless explicitly stated otherwise. The scope of the invention is defined by
the claims and their
equivalents.
=
9
