Internationalization during navigation
Summary by NHIP
Navigation Internationalization
The method processes navigation requests by scoring keywords associated with a destination language and a native language. It translates and ranks these keywords only when scores exceed a threshold, otherwise retrieving abstract keywords for translation.
Claim Score by NHIP
Abstract
Embodiments of the present invention provide systems and methods for internationalization of real-world features during navigation. The method includes receiving a request for navigation to a landmark in a particular language. The method further includes retrieving keywords from a database associated with the landmark, and scoring the keywords based on their level of recognition to a user. The highest ranked keywords are then sent to the user to navigate to the landmark.

Term
Projected expiry 24 August 2035.
- Priority and filed
- Granted
- Today
- Projected expiry
20 claims: 3 independent, 17 dependent
- 1Broadest claimClaim Score 35, narrow(NHIP)A method for internationalization of navigation, the method comprising:receiving, by one or more processors, from a requestor, a request comprising a target destination and a native language;retrieving, by one or more processors, from a database, a plurality of keywords, wherein the plurality of keywords are associated with the native language and a destination language;scoring, by one or more processors, each of the plurality of keywords;determining, by one or more processors, whether a score associated with each of the plurality of keywords exceeds a threshold value;responsive to determining that a score associated with each of the plurality of keywords exceeds the threshold value, translating, by one or more processors, the plurality of keywords from the destination language to the native language;sending, by one or more processors, the translated plurality of keywords to the requestor, wherein the translated plurality of keywords are used to navigate to the target destination;ranking, by one or more processors, the translated plurality of keywords, based on an order of familiarity to a user;implementing, by one or more processors, a set of high ranked keywords as navigation keywords to navigate to the target destination;and navigating, by one or more processors, to the target destination using GPS signals and the set of high ranked keywords.
- 8A computer program product for internationalization of navigation, the computer program product comprising:a computer readable storage medium and program instructions stored on the computer readable storage medium, the program instructions comprising: program instructions to receive, from a requestor, a request comprising a target destination and a native language;program instructions to retrieve, from a database, a plurality of keywords, wherein the plurality of keywords are associated with the native language and a destination language;program instructions to score each of the plurality of keywords;program instructions to determine whether a score associated with each of the plurality of keywords exceeds a threshold value;program instructions to, responsive to determining that a score associated with each of the plurality of keywords exceeds the threshold value, translate the plurality of keywords from the destination language to the native language;program instructions to send the translated plurality of keywords to the requestor, wherein the translated plurality of keywords are used to navigate to the target destination;program instructions to rank the translated plurality of keywords, based on an order of familiarity to a user;program instructions to implement a set of high ranked keywords as navigation keywords to navigate to the target destination;and program instructions to navigate to the target destination using GPS signals and the set of high ranked keywords.
- 15A computer system for internationalization of navigation, the computer system comprising:one or more computer processors;one or more computer readable storage media;program instructions stored on the one or more computer readable storage media for execution by at least one of the one or more processors, the program instructions comprising: program instructions to receive, from a requestor, a request comprising a target destination and a native language;program instructions to retrieve, from a database, a plurality of keywords, wherein the plurality of keywords are associated with the native language and a destination language;program instructions to score each of the plurality of keywords;program instructions to determine whether a score associated with each of the plurality of keywords exceeds a threshold value;program instructions to, responsive to determining that a score associated with each of the plurality of keywords exceeds the threshold value, translate the plurality of keywords from the destination language to the native language;program instructions to send the translated plurality of keywords to the requestor, wherein the translated plurality of keywords are used to navigate to the target destination;program instructions to rank the translated plurality of keywords, based on an order of familiarity to a user;program instructions to implement a set of high ranked keywords as navigation keywords to navigate to the target destination;and program instructions to navigate to the target destination using GPS signals and the set of high ranked keywords.
Independent claims3
70 paragraphs in 4 sections, as filed
BACKGROUND OF THE INVENTION
0001The present invention relates generally to the field of navigation, and more particularly to the internationalization of real-world features during navigation.
0002When a user travels to a new location, directions to assist in finding routes, landmarks, and translating the destination language are often used. Translators, which translate the language of a travel destination country into the language of the native country of a user, are known. Often, the contents of the translation may still be difficult for the user to understand.
SUMMARY
0003According to an embodiment of the present invention, a method for internationalization of navigation is provided, the method comprising: receiving, by one or more processors, from a requestor, a request comprising a target destination and a native language; retrieving, by one or more processors, from a database, a plurality of keywords, wherein the plurality of keywords are associated with the native language and a destination language; scoring, by one or more processors, each of the plurality of keywords; determining, by one or more processors, whether a score associated with each of the plurality of keywords exceeds a threshold value; responsive to determining that a score associated with each of the plurality of keywords exceeds the threshold value, translating, by one or more processors, the plurality of keywords from the destination language to the native language; and sending, by one or more processors, the translated plurality of keywords to the requestor, wherein the translated plurality of keywords are used to navigate to the target destination.
0004According to another embodiment of the present invention, a computer program product for internationalization of navigation is provided, the computer program product comprising: a computer readable storage medium and program instructions stored on the computer readable storage medium, the program instructions comprising: program instructions to receive, from a requestor, a request comprising a target destination and a native language; program instructions to retrieve, from a database, a plurality of keywords, wherein the plurality of keywords are associated with the native language and a destination language; program instructions to score each of the plurality of keywords; program instructions to determine whether a score associated with each of the plurality of keywords exceeds a threshold value; program instructions to, responsive to determining that a score associated with each of the plurality of keywords exceeds the threshold value, translate the plurality of keywords from the destination language to the native language; and program instructions to send the translated plurality of keywords to the requestor, wherein the translated plurality of keywords are used to navigate to the target destination.
0005According to another embodiment of the present invention, a computer system for internationalization of navigation is provided, the computer system comprising: one or more computer processors; one or more computer readable storage media; program instructions stored on the one or more computer readable storage media for execution by at least one of the one or more processors, the program instructions comprising: program instructions to receive, from a requestor, a request comprising a target destination and a native language; program instructions to retrieve, from a database, a plurality of keywords, wherein the plurality of keywords are associated with the native language and a destination language; program instructions to score each of the plurality of keywords; program instructions to determine whether a score associated with each of the plurality of keywords exceeds a threshold value; program instructions to, responsive to determining that a score associated with each of the plurality of keywords exceeds the threshold value, translate the plurality of keywords from the destination language to the native language; and program instructions to send the translated plurality of keywords to the requestor, wherein the translated plurality of keywords are used to navigate to the target destination.
BRIEF DESCRIPTION OF THE DRAWINGS
0006<figref idref="DRAWINGS">FIG. 1</figref> depicts a block diagram illustrating a distributed data processing environment, in accordance with an embodiment of the present invention;
0007<figref idref="DRAWINGS">FIG. 2A</figref> depicts a flowchart illustrating operational steps for retrieving keywords and extracting information related to a home country or language of a user, in accordance with an embodiment of the present invention;
0008<figref idref="DRAWINGS">FIG. 2B</figref> depicts a flowchart illustrating operational steps for extracting and classifying keyword information, in accordance with an embodiment of the present invention;
0009<figref idref="DRAWINGS">FIG. 2C</figref> depicts a flowchart illustrating operational steps for navigation using internationalization, in accordance with an embodiment of the present invention;
0010<figref idref="DRAWINGS">FIG. 3A</figref> depicts a block diagram of an example of making use of map information and social media to extract features of a destination, in accordance with an embodiment of the present invention;
0011<figref idref="DRAWINGS">FIG. 3B</figref> depicts a block diagram of an example of internationalization with familiar words for the respective countries, in accordance with an embodiment of the present invention;
0012<figref idref="DRAWINGS">FIG. 4</figref> depicts an example calculation of a level of recognition for keywords, in accordance with an embodiment of the present invention;
0013<figref idref="DRAWINGS">FIGS. 5A-D</figref> are example database tables, in accordance with an embodiment of the present invention;
0014<figref idref="DRAWINGS">FIG. 6</figref> is an example taxonomy tree for extracting keywords from a language, when there are no equivalent translations from one language to a second language, in accordance with an embodiment of the present invention; and
0015<figref idref="DRAWINGS">FIG. 7</figref> depicts a block diagram of components of a computing device, in accordance with an embodiment of the present invention.
DETAILED DESCRIPTION
0016Embodiments of the present invention provide systems and methods for extracting multiple features from a destination and its surroundings during navigation, using existing map and social media information, and translating the features into words that are recognizable by a user, based on the native country and/or language of the user.
0017The present invention will now be described in detail with reference to the Figures. <figref idref="DRAWINGS">FIG. 1</figref> depicts a block diagram illustrating a distributed data processing environment, generally designated <b>100</b>, in accordance with an embodiment of the present invention. Modifications to distributed data processing environment <b>100</b> may be made by those skilled in the art without departing from the scope of the invention as recited by the claims. In an exemplary embodiment, distributed data processing environment <b>100</b> includes social media sites <b>120</b>A-N and computing device <b>130</b>, interconnected via network <b>110</b>.
0018Network <b>110</b> can be, for example, a local area network (LAN), a wide area network (WAN) such as the Internet, or a combination of the two, and can include wired, wireless, or fiber optic connections. In general, network <b>110</b> can be any combination of connections and protocols that will support communication and/or access between computing device <b>130</b> and social media sites <b>120</b>A-N.
0019Social media sites <b>120</b>A-N may be any existing social media sites from which features of a checkpoint or destination and the current surroundings may be extracted. For example, social media sites <b>120</b>A-N may include blogs, Twitter, map information sites, Facebook, etc.
0020Computing device <b>130</b> includes user interface (UI) <b>132</b> and navigation program <b>134</b>. In various embodiments of the present invention, computing device <b>130</b> can be a laptop computer, a tablet computer, a netbook computer, a personal computer (PC), a desktop computer, a personal digital assistant (PDA), a smart phone, a thin client, a wearable device, or any programmable electronic device capable of executing computer readable program instructions. Computing device <b>130</b> may include internal and external hardware components, as depicted and described in further detail with respect to <figref idref="DRAWINGS">FIG. 7</figref>.
0021UI <b>132</b> may be, for example, a graphical user interface (GUI) or a web user interface (WUI) and can display text, documents, web browser windows, user options, application interfaces, and instructions for operation, and includes the information (such as graphic, text, and sound) a program presents to a user and the control sequences the user employs to control the program. UI <b>132</b> is capable of receiving data, user commands, and data input modifications from a user. UI <b>132</b> is also capable of communicating with navigation program <b>134</b>.
0022Navigation program <b>134</b> extracts features of a checkpoint or current destination from social media sites <b>120</b>A-N during navigation, translates the extracted features into familiar words and expressions of the country of the user, and further uses the translated features for navigating the user to a destination. In this exemplary embodiment, navigation program <b>134</b> sorts feature points in accordance with an order of familiarity to the current user, translates higher ranking feature points into a user's home language, and uses determined highest ranking feature point keywords as navigation keywords.
0023Databases <b>136</b> may be one or more databases for storing navigation information. In this exemplary embodiment, databases <b>136</b> reside locally on computing device <b>130</b>, however, it is to be understood that in other embodiments, databases <b>136</b> may be remote databases, accessed via a network, such as network <b>110</b>. Databases <b>136</b> may include information such as social networking services (SNS) information (i.e., social networking sites) by country and/or language, keywords information, keywords by a street view, calculation criteria for keywords, and navigation characteristics by country and/or language from SNS.
0024<figref idref="DRAWINGS">FIG. 2A</figref> depicts a flowchart <b>200</b> illustrating operational steps for retrieving keywords and extracting information related to a home country or language of a user, in accordance with an embodiment of the present invention.
0025In step <b>202</b>, navigation program <b>134</b> receives landmark information. In this exemplary embodiment, navigation program <b>134</b> receives the latitude and longitude coordinates and/or the address of a landmark. The landmark information may be, for example, input by a user, retrieved from a field of view of a user, automatically retrieved from social media sites <b>120</b>A-N (e.g., retrieved landmark from a blog), or retrieved from GPS or map information.
0026In step <b>204</b>, navigation program <b>134</b> retrieves social networking services (SNS) information. In this exemplary embodiment, navigation program <b>134</b> retrieves SNS information from databases <b>136</b>, based on the native country and/or language of the user. The SNS information database is depicted in further detail with respect to <figref idref="DRAWINGS">FIG. 5A</figref>.
0027In step <b>206</b>, navigation program <b>134</b> retrieves information related to a landmark or street view. In this exemplary embodiment, navigation program <b>134</b> retrieves information from databases <b>136</b> related to a specified landmark. Databases <b>136</b> can store SNS information related to various regions, and navigation program <b>134</b> can retrieve the corresponding region information for the specified landmark. In this exemplary embodiment, navigation program <b>134</b> also retrieves the street view of the received specified landmark or address. Street view information is retrieved from a street view database of databases <b>136</b> (depicted further in <figref idref="DRAWINGS">FIG. 5B</figref>).
0028In step <b>208</b>, navigation program <b>134</b> extracts keywords, translates the keywords, and stores the keywords. In this exemplary embodiment, navigation program <b>134</b> extracts the keywords of the received landmark using text mining. For example, for a user from the United States visiting the Imperial Palace landmark in Japan, navigation program <b>134</b> may extract, and translate from Japanese to English, the keywords ‘ruins of a castle’ and ‘emperor’. The extracted keywords for the landmark are then stored in a keywords database of databases <b>136</b>. In this exemplary embodiment, navigation program <b>134</b> also extracts the keywords of a landmark using image analysis (e.g., using the street view of the landmark). The extracted keywords from the image analysis are then translated to the native language of the user, and stored in a street view keywords database of databases <b>136</b> (depicted further in <figref idref="DRAWINGS">FIG. 5B</figref>).
0029<figref idref="DRAWINGS">FIG. 2B</figref> depicts a flowchart <b>210</b> illustrating operational steps for extracting and classifying keyword information, in accordance with an embodiment of the present invention.
0030In step <b>212</b>, navigation program <b>134</b> retrieves keywords related to the country and/or language of the user. In this exemplary embodiment, navigation program <b>134</b> retrieves stored keywords from the keyword database of databases <b>136</b> (step <b>208</b> of <figref idref="DRAWINGS">FIG. 2A</figref>).
0031In step <b>214</b>, navigation program <b>134</b> retrieves calculation criteria for the retrieved keywords of step <b>212</b>. In this exemplary embodiment, calculation criteria for a set of keywords is stored in a database of databases <b>136</b> (depicted further in <figref idref="DRAWINGS">FIG. 5C</figref>), and is created using an existing corpus of navigation criteria by region. For example, criteria for a specific region may include a language, a brand name, and/or a shop name. In a region of the United States, the language is English and a recognized brand may be Chevrolet®, while in a region of Japan, the language is Japanese and a recognized brand may be Toyota®.
0032In step <b>216</b>, navigation program <b>134</b> classifies the keywords and updates a taxonomy tree. In this exemplary embodiment, navigation program <b>134</b> classifies the keywords extracted from the keyword SNS database of databases <b>136</b>, and adds them to a taxonomy tree, which is used to infer relationships between received keywords in the native language of the user (described in further detail with respect to <figref idref="DRAWINGS">FIG. 6</figref>).
0033In step <b>218</b>, navigation program <b>134</b> calculates a navigation criteria value based on a native country and/or language of a current user. In this exemplary embodiment, navigation program <b>134</b> uses the retrieved calculation criteria for each keyword, and calculates a navigation criteria value based on a region. For example, if the criteria is ‘language’ and the region is ‘Japan’, a keyword written in Kanji may receive a score of ‘100’ (i.e., easy to navigate for a native of Japan), while a keyword written in English may receive a score of ‘40’ (i.e., not as relatively easy to navigate for a native of Japan). The calculated navigation criteria values are stored in a navigation characteristics database of databases <b>136</b> (navigation criteria values are further depicted in <figref idref="DRAWINGS">FIG. 5D</figref>).
0034<figref idref="DRAWINGS">FIG. 2C</figref> depicts flowchart <b>220</b> illustrating operational steps for navigation using internationalization, in accordance with an embodiment of the present invention.
0035In step <b>222</b>, navigation program <b>134</b> receives a request from an external application. In this exemplary embodiment, navigation program <b>134</b> receives a request in the form of coordinates of a destination (i.e., latitude and longitude of a destination) and the native country and/or language of the user. For example, navigation program <b>134</b> may receive a request for the coordinates of a location (e.g., a landmark) in Japan, and an indication that the home country of the user is the United States and that the native language of the user (i.e., most familiar language to the user) is English.
0036In step <b>224</b>, navigation program <b>134</b> retrieves keywords related to the native country or language of the user and the destination country or language of the user. In this exemplary embodiment, navigation program <b>134</b> identifies the destination of the user (e.g., address, sightseeing location name, etc.) from the received coordinates. For example, navigation program <b>134</b> may identify that a user is at the Imperial Palace in Japan, and provide the address of the location, based on the received coordinates. Navigation program <b>134</b> then retrieves keywords from databases <b>136</b> which are recognizable to the user, based on the indicated native country and/or language of the user (e.g., English in the current example), as well as keywords of the destination language of the user (e.g., Japanese in the current example). For example, the keywords ‘Emperor’ and ‘ruins of a castle’ may be recognizable to English speakers from the United States that the location is the Imperial Palace of Japan.
0037In step <b>226</b>, navigation program <b>134</b> scores the retrieved keywords. In this exemplary embodiment, navigation program <b>134</b> uses information stored in the navigation criteria values database of databases <b>136</b> to determine a score for each retrieved keyword. For example, a keyword score value may be based partially on a level of recognition of a keyword in a certain native country or language. The method for scoring retrieved keywords is described in further detail with respect to <figref idref="DRAWINGS">FIG. 4</figref>.
0038In step <b>228</b>, navigation program <b>134</b> determines whether the keyword scores exceed a threshold. In this exemplary embodiment, navigation program <b>134</b> compares the determined score for each retrieved keyword to a predetermined threshold score value. The predetermined threshold score value may be based partially on a level of recognition in a native language of general feature information (i.e., color of a structure) and characteristic feature information (i.e., trademark logo) of the retrieved keywords.
0039If, in step <b>228</b>, navigation program <b>134</b> determines that the keyword scores do not exceed a threshold, then, in step <b>230</b>, navigation program <b>134</b> retrieves abstract keywords related to the destination country or language of the user. In this exemplary embodiment, keywords with a low score (i.e., below a predetermined threshold value) correspond to words with a low level of recognition in the native language of the user, which means there may not be any native language keywords directly corresponding to the destination language keywords. Thus, navigation program <b>134</b> then retrieves abstract keywords of the retrieved keywords in the destination language from a taxonomy tree, until the program identifies a keyword(s) in the native language of the user, which may be a candidate for a navigation keyword. This process is described in more detail with respect to <figref idref="DRAWINGS">FIG. 6</figref>.
0040If, in step <b>228</b>, navigation program <b>134</b> determines that the scores do exceed a threshold, then, in step <b>232</b>, navigation program <b>134</b> translates the corresponding keywords and sends the translated keywords to the requesting external application. In this exemplary embodiment, a keyword with a high score (i.e., exceeds a threshold score value) corresponds to a keyword with a high level of recognition in the indicated native language. When keywords with a high score value are determined, these keywords are then translated into the native language (i.e., the indicated language of the user) and sent to the original requesting application, which can use the translated keywords to fulfill a user request.
0041<figref idref="DRAWINGS">FIG. 3A</figref> depicts a block diagram of an example of making use of map information and social media to extract features of a destination, in accordance with an embodiment of the present invention.
0042Map <b>300</b> depicts an example of a real-world location, including buildings <b>302</b>, <b>304</b>, <b>306</b>, and <b>308</b>. In this example, building <b>308</b> is the destination building. Navigation program <b>134</b> receives landmark information (i.e., step <b>202</b> of <figref idref="DRAWINGS">FIG. 2A</figref>) and retrieves SNS information based on the received landmark (i.e., step <b>204</b> of <figref idref="DRAWINGS">FIG. 2A</figref>). In this example, navigation program <b>134</b> receives the name (i.e., the destination landmark information) “Tempura-Maruchu”, a restaurant in Japan, from an American native visiting Japan. Navigation program <b>134</b> mines social media sites <b>120</b>A-N, and finds a food blog which describes and provides a review of the restaurant. In this example, from the food blog information, navigation program <b>134</b> mines information related to the landmark (i.e., step <b>206</b> of <figref idref="DRAWINGS">FIG. 2A</figref>). For example, navigation program <b>134</b> may extract, from the text of the food blog, the features of: ‘an adjacent building is brown’, the restaurant is located in a ‘black building’, and ‘there is a purple shop curtain’ at the front of the restaurant. A user can then easily navigate to destination building <b>308</b> (i.e., the restaurant) based on the extracted features of building <b>308</b> being a black colored building, its purple shop curtain <b>310</b>, and it being adjacent to brown building <b>304</b>.
0043<figref idref="DRAWINGS">FIG. 3B</figref> depicts a block diagram of an example of internationalization with familiar words for the respective countries, in accordance with an embodiment of the present invention.
0044Map <b>350</b> depicts an example of a real-world location, including buildings <b>352</b>, <b>356</b>, <b>358</b>, and traffic signal <b>362</b>. In this example, the third floor of building <b>356</b> is the destination. Navigation program <b>134</b> retrieves keywords related to the native country and/or language of the current user and related to the destination country and/or language (i.e., step <b>224</b> of <figref idref="DRAWINGS">FIG. 2C</figref>) and scores the retrieved keywords based on a level of recognition (i.e., step <b>226</b> of <figref idref="DRAWINGS">FIG. 2C</figref>). In this example, navigation program <b>134</b> extracts certain features about the surroundings of a particular landmark (i.e., building <b>356</b>). For example, navigation program <b>134</b> may extract the features of: a) an adjacent building is brown; b) an adjacent building is silver; c) a “Family Mart” store is in an adjacent building; d) a “Seven-Eleven” store is in an adjacent building; e) it is the second building after the traffic signal; and f) it is a flesh colored building. Navigation program <b>134</b> determines, from the indicated native language, the extracted features which may have the highest recognition for the particular user. For example, if the native language of the user is Japanese and the destination country is Japan, then navigation program <b>134</b> may describe the destination landmark using the keywords “third floor of the building which is between the Seven-Eleven (i.e., store <b>354</b>) and the Family Mart (i.e., store <b>360</b>)”, as both the Seven-Eleven chain and the Family Mart chain are characteristic feature keywords with a high level of recognition to natives of Japan. In the same example, if the native language of the user is English, then navigation program <b>134</b> may describe the destination landmark using the keywords “third floor of the building between the Seven-Eleven (i.e., store <b>354</b>) and the brown building (i.e., building <b>358</b>)”, as the level of recognition for the Seven-Eleven chain of stores is high, while the level of recognition for the Family Mart chain of stores is low for native English speakers. Using the same example, if the native country of the user is South Africa, then navigation program <b>134</b> may describe the destination landmark using the keywords “the building between the building (i.e., <b>352</b>) next to the traffic signal (i.e., <b>362</b>) and the brown building (i.e., <b>358</b>)”, as the level of recognition for both the Seven-Eleven and the Family Mart chain of stores is low for natives of South Africa. Using more common features, such as the color of a building and general structures (i.e., a traffic signal) are more readily recognizable to native South Africans in this example.
0045<figref idref="DRAWINGS">FIG. 4</figref> depicts an example calculation of a level of recognition for keywords, in accordance with an embodiment of the present invention.
0046In this example, navigation program <b>134</b> calculates the scores of the retrieved keywords (step <b>226</b> of <figref idref="DRAWINGS">FIG. 2C</figref>). As depicted in <figref idref="DRAWINGS">FIG. 4</figref>, feature words <b>402</b> are retrieved from various social media sites <b>120</b>A-N and assigned a feature degree, based partially on a recognition of general feature information, such as a color of a structure, the height of a structure, the presence/absence of traffic lights, etc. In this example the first three keywords <b>402</b>A, words <b>1</b>, <b>2</b>, and <b>3</b> have the highest ranked feature degree (90, 90, and 80, respectively). The feature degree for the keywords is then multiplied by a level of recognition of the keywords in a native country, level of recognition <b>404</b>. In this example, words <b>1</b> and <b>6</b> have a low level of recognition in the native language, while words <b>2</b>, <b>3</b>, and <b>5</b> have a high level of recognition. The level of recognition of a word in a native language may be determined based partially on characteristic feature information, such as store names, chain store names, trademarks, logos, etc. The product of feature words <b>402</b> and level of recognition <b>404</b> is calculation results <b>406</b>, in which each of the keywords are ranked. In this exemplary embodiment, the highest ranked three words are then sent to a user in order to fulfill a request for landmark information. As depicted in <figref idref="DRAWINGS">FIG. 4</figref>, in this example, words <b>2</b>, <b>3</b>, and <b>5</b> are the highest ranked keywords, which means they have the highest level of recognition of features in the example native language, and thus are sent to a requesting user or application.
0047<figref idref="DRAWINGS">FIGS. 5A-D</figref> are example database tables, in accordance with an embodiment of the present invention.
0048Database table <b>500</b> depicts an example of SNS information based on the country or language of the user. As depicted in <figref idref="DRAWINGS">FIG. 5A</figref>, information associated with the language, region, SNS local name (e.g., Twitter, Facebook, etc.), SNS English name, type of the SNS name, and web address are stored. This information may be stored in databases <b>136</b>, and may be retrieved by navigation program <b>134</b>, based on the native country and/or language of the user (i.e., step <b>204</b> of <figref idref="DRAWINGS">FIG. 2A</figref>).
0049Database table <b>510</b> depicts an example of a keywords database of SNS information and of street view information. As depicted in <figref idref="DRAWINGS">FIG. 5B</figref>, information associated with the coordinates of a landmark (i.e., latitude and longitude), language, region, keywords, an extraction from SNS, and a last update date for the website from which the SNS information was extracted are stored. This information may be stored in databases <b>136</b> (i.e., steps <b>206</b> and <b>208</b> of <figref idref="DRAWINGS">FIG. 2A</figref>), and may be retrieved by navigation program <b>134</b> based on the native country and/or language of a requesting user (i.e., step <b>224</b> of <figref idref="DRAWINGS">FIG. 2C</figref>).
0050Database table <b>520</b> depicts an example of calculation criteria for a set of keywords. As depicted in <figref idref="DRAWINGS">FIG. 5C</figref>, information associated with the navigation criteria based on a region are stored. Navigation criteria may include a language, brand name, and shop name, etc., while a region and criteria based on the region are stored for each associated navigation criteria. The information associated with database table <b>520</b> is gathered from various sources of existing information, and may be retrieved by navigation program <b>134</b> based on a determined set of keywords (i.e., step <b>214</b> of <figref idref="DRAWINGS">FIG. 2B</figref>).
0051Database table <b>530</b> depicts an example of navigation characteristics based on a native country or language, from SNS. As depicted in <figref idref="DRAWINGS">FIG. 5D</figref>, information associated with a language, region, value, criteria, and a score for each are stored in the database. This information may be stored in databases <b>136</b> (i.e., step <b>218</b> of <figref idref="DRAWINGS">FIG. 2B</figref>) and retrieved by navigation program <b>134</b> in order to compare the characteristics of a native country or language to a set of keywords (i.e., step <b>228</b> of <figref idref="DRAWINGS">FIG. 2C</figref>).
0052<figref idref="DRAWINGS">FIG. 6</figref> is an example taxonomy tree <b>600</b> for extracting keywords from a language, when there are no equivalent translations from one language to a second language, in accordance with an embodiment of the present invention.
0053Taxonomy tree <b>600</b> depicts keywords <b>602</b>, <b>604</b>A-C, <b>606</b>A-B, and <b>608</b>. In this example, a native English speaker is in Japan as the destination country. Navigation program <b>134</b> receives information about a landmark (e.g., Kamarakura's large statue of Buddha, a landmark located in Japan). Keywords related to the landmark are extracted by navigation program <b>134</b> in both English (i.e., the native language) and Japanese (i.e., the destination language). In this example, many Japanese words are related to the landmark, however, there are no English results which are equivalent translations of the Japanese words. Thus, navigation program <b>134</b> retrieves abstract keywords related to the destination language keywords (i.e., step <b>230</b> of <figref idref="DRAWINGS">FIG. 2C</figref>). In this example, keyword <b>602</b> “statute” may be extracted as an abstract keyword. Further the abstract keywords <b>604</b>A-C of “full”, “half”, and “bust” may be extracted and branch off of keyword <b>602</b>, to show their inferred relationship to keyword <b>602</b>. The abstract keywords <b>606</b>A and <b>606</b>B of “seated” and “standing”, respectively, may also be extracted and placed in their inferred relationship to the already extracted words (e.g., “seated” evolves from “full” and “statue” and “standing” evolves from “half” and “statue”). Finally, one such abstract keyword in the destination language can be translated to ‘seated statue’ in the native language of the user. Navigation program <b>134</b> can recognize that the phrase ‘seated statue’ may be recognizable to a native English speaker as describing the particular landmark <b>608</b>, and can be a candidate for a navigation keyword, which can be used to direct the user to the particular landmark <b>608</b>.
0054<figref idref="DRAWINGS">FIG. 7</figref> is a block diagram of internal and external components of a computing device, generally designated <b>700</b>, which is representative of the computing devices of <figref idref="DRAWINGS">FIG. 1</figref>, in accordance with an embodiment of the present invention. It should be appreciated that <figref idref="DRAWINGS">FIG. 7</figref> provides only an illustration of one implementation and does not imply any limitations with regard to the environments in which different embodiments may be implemented. Many modifications to the depicted environment may be made.
0055Computing device <b>700</b> includes communications fabric <b>708</b>, which provides communications between computer processor(s) <b>702</b>, memory <b>704</b>, cache <b>706</b>, persistent storage <b>710</b>, communications unit <b>714</b>, and input/output (I/O) interface(s) <b>712</b>. Communications fabric <b>708</b> can be implemented with any architecture designed for passing data and/or control information between processors (such as microprocessors, communications and network processors, etc.), system memory, peripheral devices, and any other hardware components within a system. For example, communications fabric <b>708</b> can be implemented with one or more buses.
0056Memory <b>704</b> and persistent storage <b>710</b> are computer-readable storage media. In this embodiment, memory <b>704</b> includes random access memory (RAM). In general, memory <b>704</b> can include any suitable volatile or non-volatile computer readable storage media. Cache <b>706</b> is a fast memory that enhances the performance of processors <b>702</b> by holding recently accessed data, and data near recently accessed data, from memory <b>704</b>.
0057Program instructions and data used to practice embodiments of the present invention may be stored in persistent storage <b>710</b> and in memory <b>704</b> for execution by one or more of the respective processors <b>702</b> via cache <b>706</b>. In an embodiment, persistent storage <b>710</b> includes a magnetic hard disk drive. Alternatively, or in addition to a magnetic hard disk drive, persistent storage <b>710</b> can include a solid state hard drive, a semiconductor storage device, read-only memory (ROM), erasable programmable read-only memory (EPROM), flash memory, or any other computer readable storage media that is capable of storing program instructions or digital information.
0058The media used by persistent storage <b>710</b> may also be removable. For example, a removable hard drive may be used for persistent storage <b>710</b>. Other examples include optical and magnetic disks, thumb drives, and smart cards that are inserted into a drive for transfer onto another computer readable storage medium that is also part of persistent storage <b>710</b>.
0059Communications unit <b>714</b>, in these examples, provides for communications with other data processing systems or devices, including resources of network <b>110</b>. In these examples, communications unit <b>714</b> includes one or more network interface cards. Communications unit <b>714</b> may provide communications through the use of either or both physical and wireless communications links. Program instructions and data used to practice embodiments of the present invention may be downloaded to persistent storage <b>710</b> through communications unit <b>714</b>.
0060I/O interface(s) <b>712</b> allows for input and output of data with other devices that may be connected to computing device <b>700</b>. For example, I/O interface <b>712</b> may provide a connection to external devices <b>716</b> such as a keyboard, keypad, a touch screen, and/or some other suitable input device. External devices <b>716</b> can also include portable computer-readable storage media such as, for example, thumb drives, portable optical or magnetic disks, and memory cards. Software and data used to practice embodiments of the present invention (e.g., software and data) can be stored on such portable computer-readable storage media and can be loaded onto persistent storage <b>710</b> via I/O interface(s) <b>712</b>. I/O interface(s) <b>712</b> also connect to a display <b>718</b>.
0061Display <b>718</b> provides a mechanism to display data to a user and may be, for example, a computer monitor, or a television screen.
0062The present invention may be a system, a method, and/or a computer program product. The computer program product may include a computer readable storage medium (or media) having computer readable program instructions thereon for causing a processor to carry out aspects of the present invention.
0063The computer readable storage medium can be a tangible device that can retain and store instructions for use by an instruction execution device. The computer readable storage medium may be, for example, but is not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. A non-exhaustive list of more specific examples of the computer readable storage medium includes the following: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a static random access memory (SRAM), a portable compact disc read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanically encoded device such as punch-cards or raised structures in a groove having instructions recorded thereon, and any suitable combination of the foregoing. A computer readable storage medium, as used herein, is not to be construed as being transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission media (e.g., light pulses passing through a fiber-optic cable), or electrical signals transmitted through a wire.
0064Computer readable program instructions described herein can be downloaded to respective computing/processing devices from a computer readable storage medium or to an external computer or external storage device via a network, for example, the Internet, a local area network, a wide area network and/or a wireless network. The network may comprise copper transmission cables, optical transmission fibers, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. A network adapter card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium within the respective computing/processing device.
0065Computer readable program instructions for carrying out operations of the present invention may be assembler instructions, instruction-set-architecture (ISA) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, state-setting data, or either source code or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C++ or the like, and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The computer readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider). In some embodiments, electronic circuitry including, for example, programmable logic circuitry, field-programmable gate arrays (FPGA), or programmable logic arrays (PLA) may execute the computer readable program instructions by utilizing state information of the computer readable program instructions to personalize the electronic circuitry, in order to perform aspects of the present invention.
0066Aspects of the present invention are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer readable program instructions.
0067These computer readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer readable program instructions may also be stored in a computer readable storage medium that can direct a computer, a programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer readable storage medium having instructions stored therein comprises an article of manufacture including instructions which implement aspects of the function/act specified in the flowchart and/or block diagram block or blocks.
0068The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable apparatus or other device to produce a computer implemented process, such that the instructions which execute on the computer, other programmable apparatus, or other device implement the functions/acts specified in the flowchart and/or block diagram block or blocks.
0069The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts or carry out combinations of special purpose hardware and computer instructions.
0070The descriptions of the various embodiments of the present invention have been presented for purposes of illustration, but are not intended to be exhaustive or limited to the embodiments disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the invention. The terminology used herein was chosen to best explain the principles of the embodiment, the practical application or technical improvement over technologies found in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein.
Contents4
10 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6 Sheet 7 Sheet 8 Sheet 9 Sheet 10
Every citation, both ways
| Document | Relation | Office | Cited during |
|---|---|---|---|
| US2002111791A1 | Cites | United States of America | Applicant |
| US2005080632A1 | Cites | United States of America | Applicant |
| US2005114114A1 | Cites | United States of America | Applicant |
| US2006025995A1 | Cites | United States of America | Applicant |
| US2006053012A1 | Cites | United States of America | Applicant |
| US2006069562A1 | Cites | United States of America | Applicant |
| US2006206331A1 | Cites | United States of America | Applicant |
| US2007033043A1 | Cites | United States of America | Applicant |
| US2007162281A1 | Cites | United States of America | Applicant |
| US2007219776A1 | Cites | United States of America | Applicant |
| US2007239423A1 | Cites | United States of America | Applicant |
| US2008033720A1 | Cites | United States of America | Applicant |
| US2008077386A1 | Cites | United States of America | Applicant |
| US2008275699A1 | Cites | United States of America | Applicant |
| US2009144049A1 | Cites | United States of America | Applicant |
| US2009234570A1 | Cites | United States of America | Applicant |
| US2009234650A1 | Cites | United States of America | Applicant |
| US2009248395A1 | Cites | United States of America | Applicant |
| US2009259466A1 | Cites | United States of America | Applicant |
| US2010057435A1 | Cites | United States of America | Applicant |
| US2010088190A1 | Cites | United States of America | Applicant |
| US2010106497A1 | Cites | United States of America | Applicant |
| US2010169073A1 | Cites | United States of America | Applicant |
| US2010204978A1 | Cites | United States of America | Applicant |
| US2011046953A1 | Cites | United States of America | Applicant |
| US2011191100A1 | Cites | United States of America | Applicant |
| US2011218806A1 | Cites | United States of America | Applicant |
| US2012179448A1 | Cites | United States of America | Applicant |
| WO2013144435A1 | Cites | World Intellectual Property Organization (WIPO) | Applicant |
| US2013144621A1 | Cites | United States of America | Applicant |
| US2013204627A1 | Cites | United States of America | Applicant |
| US2013282360A1 | Cites | United States of America | Applicant |
| JP2014153095A | Cites | Japan | Applicant |
| US2014214414A1 | Cites | United States of America | Applicant |
| US2015088485A1 | Cites | United States of America | Applicant |
| US2015127339A1 | Cites | United States of America | Applicant |
| US2015127349A1 | Cites | United States of America | Applicant |
| US2015134322A1 | Cites | United States of America | Applicant |
| US2015186530A1 | Cites | United States of America | Applicant |
| US2016132291A1 | Cites | United States of America | Applicant |
| US2017059348A1 | Cites | United States of America | Applicant |
| US2017059349A1 | Cites | United States of America | Applicant |
| US5293584A | Cites | United States of America | Applicant |
| US5815196A | Cites | United States of America | Applicant |
| US5884247A | Cites | United States of America | Applicant |
| US6301554B1 | Cites | United States of America | Applicant |
| US6567778B1 | Cites | United States of America | Applicant |
| US7269504B2 | Cites | United States of America | Applicant |
| US7343290B2 | Cites | United States of America | Applicant |
| US7424363B2 | Cites | United States of America | Applicant |
| US7912637B2 | Cites | United States of America | Applicant |
| US8073677B2 | Cites | United States of America | Applicant |
| US8374791B2 | Cites | United States of America | Applicant |
| US8527258B2 | Cites | United States of America | Applicant |
| US8909771B2 | Cites | United States of America | Applicant |
| US9153229B2 | Cites | United States of America | Applicant |
| JPH08124092A | Cites | Japan | Applicant |
| US20020111791A1 | Cites | United States of America | Applicant |
| US20050080632A1 | Cites | United States of America | Applicant |
| US20050114114A1 | Cites | United States of America | Applicant |
| US20060025995A1 | Cites | United States of America | Applicant |
| US20060053012A1 | Cites | United States of America | Applicant |
| US20060069562A1 | Cites | United States of America | Applicant |
| US20060206331A1 | Cites | United States of America | Applicant |
| US20070033043A1 | Cites | United States of America | Applicant |
| US20070162281A1 | Cites | United States of America | Applicant |
| US20070219776A1 | Cites | United States of America | Applicant |
| US20070239423A1 | Cites | United States of America | Applicant |
| US20080033720A1 | Cites | United States of America | Applicant |
| US20080077386A1 | Cites | United States of America | Applicant |
| US20080275699A1 | Cites | United States of America | Applicant |
| US20090144049A1 | Cites | United States of America | Applicant |
| US20090234570A1 | Cites | United States of America | Applicant |
| US20090234650A1 | Cites | United States of America | Applicant |
| US20090248395A1 | Cites | United States of America | Applicant |
| US20090259466A1 | Cites | United States of America | Applicant |
| US20100057435A1 | Cites | United States of America | Applicant |
| US20100088190A1 | Cites | United States of America | Applicant |
| US20100106497A1 | Cites | United States of America | Applicant |
| US20100169073A1 | Cites | United States of America | Applicant |
| US20100204978A1 | Cites | United States of America | Applicant |
| US20110046953A1 | Cites | United States of America | Applicant |
| US20110191100A1 | Cites | United States of America | Applicant |
| US20110218806A1 | Cites | United States of America | Applicant |
| US20120179448A1 | Cites | United States of America | Applicant |
| US20130144621A1 | Cites | United States of America | Applicant |
| US20130204627A1 | Cites | United States of America | Applicant |
| US20130282360A1 | Cites | United States of America | Applicant |
| US20140214414A1 | Cites | United States of America | Applicant |
| US20150088485A1 | Cites | United States of America | Applicant |
| US20150127339A1 | Cites | United States of America | Applicant |
| US20150127349A1 | Cites | United States of America | Applicant |
| US20150134322A1 | Cites | United States of America | Applicant |
| US20150186530A1 | Cites | United States of America | Applicant |
| US20160132291A1 | Cites | United States of America | Applicant |
| US20170059348A1 | Cites | United States of America | Applicant |
| US20170059349A1 | Cites | United States of America | Applicant |
| JP08124092A | Cites | Japan | Applicant |
| “Kotoku-in” Wikipedia, the free encyclopedia, page last modified on Mar. 25, 2015, at 20:45, 4 pages, <https://en.wikipedia.org/wiki/Kotoku-in>. | Non-patent | – | Applicant |
| “Method and System for Supplementing Driving Directions for People Navigating in Unfamiliar Areas”, An IP.com Prior Art Database Technical Disclosure, IP.com No. 000239609, IP.com Electronic Publication: Nov. 19, 2014, pp. 1-4. | Non-patent | – | Applicant |
6 members in 1 office
Members6
| Document | Office | Kind | |
|---|---|---|---|
| US2017059348A1 | United States of America | A1 | |
| US2017059349A1 | United States of America | A1 | |
| US9683862B2 | United States of America | B2 | |
| US2017177568A1 | United States of America | A1 | |
| US9689699B2 | United States of America | B2 | |
| US9934219B2This record | United States of America | B2 |
53 transactions on the USPTO file
Allowed after 1 non-final rejection and 1 RCE.
- Non-final rejections
- 1
- Final rejections
- 0
- RCEs
- 1
- Appeals
- 0
Over time
Point at a mark for the transactionTransactions
| Event | Code | |
|---|---|---|
| Expire PatentEXP. | EXP. | |
| Maintenance Fee Reminder MailedREM. | REM. | |
| Payment of Maintenance Fee, 4th Year, Large EntityM1551 | M1551 | |
| Recordation of Patent Grant MailedPGM/ | PGM/ | |
| Patent Issue Date Used in PTA CalculationAllowedPTAC | PTAC | |
| Email NotificationEML_NTR | EML_NTR | |
| Issue Notification MailedAllowedWPIR | WPIR | |
| Dispatch to FDCD1935 | D1935 | |
| Application Is Considered Ready for IssuePILS | PILS | |
| Issue Fee Payment VerifiedN084 | N084 | |
| Issue Fee Payment ReceivedIFEE | IFEE | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Notice of AllowanceAllowedMN/=. | MN/=. | |
| Notice of Allowance Data Verification CompletedAllowedN/=. | N/=. | |
| Information Disclosure Statement consideredIDSC | IDSC | |
| Disposal for a RCE / CPA / R129AbandonedABN9 | ABN9 | |
| Electronic Information Disclosure StatementEIDS. | EIDS. | |
| Request for Continued Examination (RCE)RCEX | RCEX | |
| Information Disclosure Statement (IDS) FiledWIDS | WIDS | |
| Workflow - Request for RCE - BeginBRCE | BRCE | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Notice of AllowanceAllowedMN/=. | MN/=. | |
| Notice of Allowance Data Verification CompletedAllowedN/=. | N/=. | |
| Reasons for AllowanceEX.R | EX.R | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Response after Non-Final ActionA... | A... | |
| Paralegal or electronic terminal disclaimer approvedP574 | P574 | |
| Terminal Disclaimer FiledDIST | DIST | |
| Email NotificationEML_NTR | EML_NTR | |
| PG-Pub Issue NotificationPG-ISSUE | PG-ISSUE | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Non-Final RejectionNon-final rejectionMCTNF | MCTNF | |
| Non-Final RejectionNon-final rejectionCTNF | CTNF | |
| Information Disclosure Statement consideredIDSC | IDSC | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Application Dispatched from OIPEOIPE | OIPE | |
| Email NotificationEML_NTR | EML_NTR | |
| Application ready for PDX access by participating foreign officesCCRDY | CCRDY | |
| Application Is Now CompleteCOMP | COMP | |
| Filing ReceiptFLRCPT.O | FLRCPT.O | |
| Sent to Classification ContractorPGPC | PGPC | |
| FITF set to YES - revise initial settingFTFS | FTFS | |
| Cleared by OIPE CSRL194 | L194 | |
| Patent Term Adjustment - Ready for ExaminationPTA.RFE | PTA.RFE | |
| PTO/SB/69-Authorize EPO Access to Search ResultsSREXR141 | SREXR141 | |
| Applicants have given acceptable permission for participating foreignAPPERMS | APPERMS | |
| Information Disclosure Statement (IDS) FiledWIDS | WIDS | |
| IFW Scan & PACR Auto Security ReviewSCAN | SCAN | |
| Entity Status Set To Undiscounted (Initial Default Setting or Status Change)BIG. | BIG. | |
| Initial Exam Team nnIEXX | IEXX |
7 legal events, as the office reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | |
|---|---|---|
| Lapsed due to failure to pay maintenance feeLapsedFP | FP | |
| Lapse for failure to pay maintenance feesLapsedPATENT EXPIRED FOR FAILURE TO PAY MAINTENANCE FEES (ORIGINAL EVENT CODE: EXP.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITYLAPS | LAPS | |
| Information on status: patent discontinuationPATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362STCH | STCH | |
| Fee payment procedureMAINTENANCE FEE REMINDER MAILED (ORIGINAL EVENT CODE: REM.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITYFEPP | FEPP | |
| Maintenance fee paymentMAFP | MAFP | |
| Information on status: patent grantGrantedPATENTED CASESTCF | STCF | |
| AssignmentAS | AS |
Numbers
- Publication
- 09934219
- Application
- 15450468
Titles
- English
- Internationalization during navigation
Patent term adjustment
- Applicant delay
- −89 days
- Net adjustment
- 0 days
Classification
- CPC, 10
- G06F17/289
- G01C21/3605
- G06F40/58
- G01C21/3626
- G06F17/2765
- G01C21/3644
- G06F17/30696
- G06F16/338
- G06F40/263
- G06F40/279
- IPC, 4
- G06F17 28
- G01C21 36
- G06F17 30
- G06F17 27
- USPC, 1
- 001001000