Point of interest naming method and apparatus, electronic device, and storage medium

Abstract

The present disclosure provides a point of interest naming method and device, electronic equipment and storage medium, relates to the technical field of artificial intelligence, and particularly relates to the technical field of natural language processing. The specific implementation scheme is: identifying a name stem and a name branch of each candidate name in a candidate name set of a point of interest, obtaining a name stem set and a name branch set of the point of interest; determining a target name stem based on the name stem set; determining a target name branch based on the name branch set; and determining the name of the point of interest based on the target name stem and the target name branch. By using the embodiment of the present disclosure, the name of the point of interest is accurately and comprehensively named.

Description

TECHNICAL FIELD

[0001] The present disclosure relates to the field of artificial intelligence, in particular to the field of natural language processing, and more particularly to a point of interest naming method and device, electronic equipment and storage medium. BACKGROUND

[0002] In a geographic information system, each point of interest (POI) can include information such as a name, a category, coordinates, and the like. Comprehensive POI information is essential information for enriching a navigation map, and timely POI information points can remind users of branches of road conditions and detailed information of surrounding buildings, and can also facilitate users to find various places they need in navigation and select the most convenient and unobstructed road for path planning. Therefore, in a navigation map, the information of a point of interest can directly affect the user experience of the navigation map. SUMMARY

[0003] The present disclosure provides a point of interest naming method, device, electronic equipment and storage medium.

[0004] According to an aspect of the present disclosure, a point of interest naming method is provided, comprising:

[0005] identifying a name stem and a name branch of each candidate name in a candidate name set of a point of interest, to obtain a name stem set and a name branch set of the point of interest;

[0006] determining a target name stem based on the name stem set;

[0007] determining a target name branch based on the name branch set;

[0008] determining a name of the point of interest based on the target name stem and the target name branch.

[0009] According to another aspect of the present disclosure, a point of interest naming device is provided, comprising:

[0010] a name segmentation module configured to identify a name stem and a name branch of each candidate name in a candidate name set of a point of interest, to obtain a name stem set and a name branch set of the point of interest;

[0011] a stem determination module configured to determine a target name stem based on the name stem set;

[0012] a branch determination module configured to determine a target name branch based on the name branch set;

[0013] a name determination module configured to determine a name of the point of interest based on the target name stem and the target name branch.

[0014] According to another aspect of the present disclosure, an electronic device is provided, comprising:

[0015] at least one processor; and

[0016] a memory communicatively connected with the at least one processor; wherein

[0017] the memory stores instructions executable by the at least one processor, the instructions being executed by the at least one processor to enable the at least one processor to perform the method in any embodiment of the present disclosure.

[0018] According to another aspect of the present disclosure, a geographic information system is provided, comprising the electronic device of any embodiment of the present disclosure.

[0019] According to another aspect of the present disclosure, a non-transitory computer readable storage medium storing computer instructions is provided, the computer instructions being used to cause a computer to perform the method in any embodiment of the present disclosure.

[0020] According to another aspect of the present disclosure, a computer program product is provided, comprising a computer program which, when executed by a processor, implements the method in any embodiment of the present disclosure.

[0021] According to the technology of the present disclosure, the identification of the name stem and the name branch is first performed for each candidate name of the candidate name set of the point of interest, to obtain the name stem set and the name branch set, and then the target name stem and the target name branch are determined based on the two sets respectively, and then based on the target name stem and the target name branch, the point of interest name can be accurately and comprehensively determined.

[0022] It should be understood that the content described in this part is not intended to identify key or important features of the embodiments of the present disclosure, nor to limit the scope of the present disclosure. Other features of the present disclosure will become apparent through the following description. BRIEF DESCRIPTION OF DRAWINGS

[0023] The accompanying drawings are used to better understand the present scheme, and do not constitute a limitation on the present disclosure. Among them:

[0024] Figure 1 is a flowchart of the point of interest naming method of one embodiment of the present disclosure;

[0025] Figure 2A is a structural block diagram of a system for implementing the point of interest naming method of the embodiment of the present disclosure;

[0026] Figure 2B is a structural block diagram of the main name selection module in the system for implementing the point of interest naming method of the embodiment of the present disclosure;

[0027] Figure 2Cis a structural block diagram of a branch selection module in a system for implementing a point of interest naming method according to an embodiment of the present disclosure;

[0028] Figure 2D is a structural block diagram of a name combination module in a system for implementing a point of interest naming method according to an embodiment of the present disclosure;

[0029] Figure 3 is a structural block diagram of a point of interest naming device according to an embodiment of the present disclosure;

[0030] Figure 4 is a structural block diagram of a point of interest naming device according to another embodiment of the present disclosure;

[0031] Figure 5 is a block diagram of an electronic device for implementing a point of interest naming method according to an embodiment of the present disclosure. DETAILED DESCRIPTION

[0032] Exemplary embodiments of the present disclosure are described herein with reference to the accompanying drawings, which are included to provide a thorough understanding of embodiments of the present disclosure by a person of ordinary skill in the art, and should be considered in connection with the following detailed description, but do not limit the scope of the present disclosure. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the present disclosure. Also, for the sake of brevity and clarity, descriptions of well-known functions and constructions are omitted herein.

[0033] In a geographic information system, naming strategies for point of interest names are generally divided into offline strategies and online strategies. Because of the high upgrade cost of online strategies, offline methods are generally used to upgrade point of interest names. Data in the system is exported, and information mining is performed on the data to generate point of interest names. However, offline strategies are scattered and trivial, and there are contradictions between multiple strategies, which leads to repeated intervention of point of interest names, which greatly affects the user experience of the point of interest.

[0034] To this end, an embodiment of the present disclosure provides a point of interest naming scheme, which can accurately and comprehensively name the names of points of interest and improve user experience.

[0035] Figure 1 is a flowchart of a point of interest naming method according to an embodiment of the present disclosure. As shown in Figure 1 , the method can include the following steps:

[0036] S110, identifying a name stem and a name branch of each candidate name in a candidate name set of a point of interest to obtain a name stem set and a name branch set of the point of interest;

[0037] S120, determining a target name stem based on the name stem set;

[0038] S130, determining a target name branch based on the name branch set;

[0039] In S140, the name of the point of interest is determined based on the target name stem and the target name branch.

[0040] Exemplarily, in a geographic information system, a point of interest can include a house, a shop, a mall, a square, a bus stop, a mailbox, etc.

[0041] Exemplarily, the candidate name set can include one or more candidate names. The candidate name can be a name that has been used by the point of interest, and can be from different systems, websites, etc. For example, the name A1 that has been recently used by the point of interest A in the navigation system B1, the name A2 that has been recently used by the point of interest A in the navigation system B2, and the names A3 and A4 that have been used by the point of interest A in the navigation system B3.

[0042] Exemplarily, the candidate name set can be pre-processed, which can include whitelist or blacklist filtering, timeliness filtering, keyword filtering, etc. For example, filtering candidate names containing sensitive words, filtering candidate names recorded in the blacklist, and filtering candidate names that are not within a set time period.

[0043] Exemplarily, the candidate name can include only the name stem, or can include the name stem and one or more name branches. The structure of the candidate name is identified, and at least the name stem of the candidate name is obtained. In the case where the candidate name includes the name branch, the identification result can also include the name branch. Each candidate name in the candidate name set is identified, and the name stem and the name branch of each candidate name are obtained, and the name stems of the candidate names are collected into the name stem set, and the name branches of the candidate names are collected into the name branch set.

[0044] Exemplarily, the target name stem can be obtained in the following manner: determining the target name stem in the name stem set; or performing semantic identification on each name stem in the name stem set to obtain semantic features corresponding to the name stem set, and generating the target name stem based on the semantic features corresponding to the name stem set.

[0045] Exemplarily, the target name branch can be obtained in the following manner: determining the target name branch in the name branch set; or performing semantic identification on each name branch in the name branch set to obtain semantic features corresponding to the name branch set, and generating the target name branch based on the semantic features corresponding to the name branch set.

[0046] Exemplarily, after the target name stem and the target name branch are determined, a combination manner of the target name stem and the target name branch is determined based on a relationship between the target name stem and the target name branch, and the target name stem and the target name branch are combined in the combination manner to obtain the name of the point of interest. The combination manner can include a position of the branch inserted into the stem, for example, a head, a middle or a tail.

[0047] In the present example, the splitting of the name stem and the name branch is performed for each candidate name in the candidate name set to obtain the name stem set and the name branch set, and the target name stem and the target name branch are determined based on the two sets, so that based on the target name stem and the target name branch, the point of interest name which is accurate and comprehensive can be obtained.

[0048] In some embodiments, the name stem can be scored based on the attribute information of the name stem and the scoring rule corresponding to the attribute information, and then the target name stem is determined based on the quality score of each name stem.

[0049] Exemplarily, in the above step S120, the target name stem is determined based on the name stem set, which can include:

[0050] The quality score of each name stem is determined based on at least one attribute information of each name stem in the name stem set and a scoring rule corresponding to each attribute information in the at least one attribute information.

[0051] The target name stem is determined in the name stem set based on the quality score of each name stem.

[0052] In the present example, the quality of the name stem is accurately evaluated by using different scoring rules from different dimensions to score the quality of the name stem. Furthermore, the target name stem determined in the name stem set based on the quality score of each name stem is also more accurate and comprehensive.

[0053] In some embodiments, based on the at least one attribute information of each name stem in the name stem set and the scoring rule corresponding to each attribute information in the at least one attribute information, the score of each name stem corresponding to each attribute information can be obtained, and then the score of each name stem corresponding to each attribute information is weighted and normalized to obtain the quality score of each name stem.

[0054] In some embodiments, the name stem with the highest quality score can be selected as the target name stem in the name stem set.

[0055] Exemplarily, the attribute information of the name stem can include at least one of the following: a component of the name stem, a source of a candidate name to which the name stem belongs, a historical use time of the candidate name to which the name stem belongs, and a number of occurrences of the name stem in a candidate name set.

[0056] In the present example, the name stem can be scored from multiple perspectives of the component, authenticity, timeliness, and frequency of use.

[0057] Exemplarily, the component of the name stem can include a core word (CORE), a regional word (LOC), an attribute word (SCO), a suffix (SUFF), and the like.

[0058] The scoring rule for scoring the component structure of the name stem can be: in the case where the name stem includes a core word, the component score of the name stem can be increased by 0.5; in the case where the name stem includes a regional word, the component score of the name stem can be increased by 0.1; in the case where the name stem includes an attribute word, the component score of the name stem can be increased by 0.3; and in the case where the name stem includes a suffix, the component score of the name stem can be increased by 0.1. Before scoring, the score of each name stem in the name stem set can be reset to zero or unified to a certain value. Then, each name stem is scored according to the above scoring rule for the component structure, to obtain a total component score of each name stem.

[0059] Exemplarily, the source of the candidate name to which the name stem belongs can include a real source or a non-real source. The real source can be obtained by actually shooting the scene of the point of interest. For example, the name of a store is obtained by shooting the signboard of the store.

[0060] The scoring rule for scoring the authenticity of the name stem can be: in the case where the source of the candidate name to which the name stem belongs is a real source, the authenticity score of the name stem can be 1; and in the case where the source of the candidate name to which the name stem belongs is a non-real source, the authenticity score of the name stem can be 0.

[0061] Exemplarily, in the case where there are multiple historical use times of the candidate name to which the name stem belongs, the average use time can be selected, or the most recent use time can be selected.

[0062] For example, the score rule for scoring the timeliness of the name stem based on the historical recent use time can be: in the case that the historical recent use time is in the first interval, the timeliness score of the name stem is 12; in the case that the historical recent use time is in the second interval, the timeliness score of the name stem is 11; in the case that the historical recent use time is in the third interval, the timeliness score of the name stem is 1. For example, if the recent use time is within one month from the current time, the score is 12, if the recent use time is within two months from the current time, the timeliness score of the name stem is 11, and so on.

[0063] For example, based on the number of occurrences of the name stem in the candidate name set, the number of occurrences score of the name stem can be obtained. The more the number of occurrences, the higher the number of occurrences score of the name stem.

[0064] In the case that the composition score, the authenticity score, the timeliness score and the number of occurrences score of the name stem have been determined, the scores are weighted and normalized to obtain the quality score of the name stem.

[0065] In some embodiments, the target name branch can be filtered, such as whitelist or blacklist filtering, keyword filtering, timeliness filtering, etc. The target name stem can also be used to filter the target name branch.

[0066] For example, in the above step S130, based on the name branch set, the target name branch is determined, which can include:

[0067] Based on the target name stem, the target name branch is determined in the name branch set.

[0068] In this example, the target name branch is determined by using the target name stem and the name branch set, so that the obtained target name branch is more accurate.

[0069] For example, based on the similarity between the target name stem and each name branch in the name branch set, a part of the name branches in the name branch set are filtered, and then the target name branch is determined in the filtered name branch set. If the similarity between the target name stem and the name branch is greater than a set similarity threshold, the name branch is removed from the name branch set.

[0070] In some embodiments, the target name branch can be screened based on the similarity between the name branch and the target name stem and the number of occurrences of each name branch in the candidate name set.

[0071] For example, the above determination of the target name branch in the name branch set based on the target name stem can include:

[0072] The target name branch is determined in the name branch set based on the similarity between each name branch in the name branch set and the target name trunk and the number of occurrences of each name branch in the candidate name set.

[0073] In this example, the target name branch is determined in combination of the similarity between the name branch and the target name trunk and the number of occurrences in the candidate name set. This considers both the relationship between the name branch and the target name trunk and the frequency of use of the name branch, so that the selected target name branch is more targeted and accurate, and the accuracy of the name of the point of interest is further improved.

[0074] For example, based on the similarity between each name branch in the name branch set and the target name trunk, the name branch in the name branch set that does not satisfy the set condition is filtered, and the target name branch is determined in the filtered name branch set based on the number of occurrences of each name branch in the candidate name set.

[0075] In some embodiments, the target name branch can also be determined in the name branch set based only on the number of occurrences of each name branch in the candidate name set.

[0076] After obtaining the target name trunk and the target name branch according to the above embodiments, the name of the point of interest is obtained by combining the two.

[0077] For example, in the above step S140, the name of the point of interest is determined based on the target name trunk and the target name branch, including:

[0078] In the case where the target name trunk does not contain the target name branch, the target name trunk and the target name branch are combined to obtain the name of the point of interest.

[0079] In this example, it can be avoided that the name of the point of interest includes repeated branches and reduce redundancy.

[0080] In some embodiments, the name obtained by combining the target name trunk and the target name branch can include multiple, and one can be selected as the name of the point of interest.

[0081] In some embodiments, if the target name trunk already contains the target name branch, the two do not need to be combined.

[0082] For example, in the above step S150, the name of the point of interest is determined based on the target name trunk and the target name branch, including:

[0083] In the case where the target name trunk contains the target name branch, the target name trunk is determined as the name of the point of interest.

[0084] In the present example, the point of interest name can be avoided to include repeated branches, and reduce redundancy.

[0085] Figure 2A is a structural block diagram of a system implementing the point of interest naming method of the embodiments of the present disclosure; Figure 2B is a structural block diagram of a main name selection module in the system implementing the point of interest naming method of the embodiments of the present disclosure; Figure 2C is a structural block diagram of a branch selection module in the system implementing the point of interest naming method of the embodiments of the present disclosure; Figure 2D is a structural block diagram of a name combination module in the system implementing the point of interest naming method of the embodiments of the present disclosure.

[0086] As shown in Figure 2A , the system is divided into three parts, including a main name selection module, a branch selection module and a name combination module. First, the candidate name set is divided into main names and branches to obtain a main name set and a branch set. The main name set is input into the main name selection module to obtain a target main name. The branch set is input into the branch selection module to obtain a target branch. The candidate name set can also be input into the branch selection module to be divided into branches, and the target branch is obtained after screening. The target main name and the target branch are input into the name combination module to obtain a new name of the point of interest.

[0087] As shown in Figure 2B , in the main name selection module, first, the main name set (name stem set) is filtered, which can include state filtering, hierarchical filtering, whitelist filtering and keyword filtering. Then, the main name set is classified, i.e., the main names of the same name are classified into one category to obtain main name name1, main name name2, ···, and main name name n.

[0088] Next, each main name is scored by scoring the name composition component, name timeliness, name authenticity and name occurrence frequency of the main name (name stem), and the scores obtained are weighted and normalized to obtain the quality score of each main name, and the main name with the highest quality score is selected as the target main name. The weights of the above scoring can be: name authenticity is greater than name timeliness, name timeliness is greater than name occurrence frequency, and name occurrence frequency is greater than name composition component.

[0089] The main name selection module includes a scoring mechanism, which can perform the following operations:

[0090] The scoring agency assigns scores to each component of the main name, which may include: 0.5 points for containing the keyword "CORE"; 0.1 points for containing the region "LOC"; 0.3 points for containing the business attribute "SCO"; and 0.1 points for containing the suffix "SUFF". The scores for each component of the main name are then normalized to obtain a normalized score for each component.

[0091] The scoring agency assigns a score to the authenticity of each main name, which may include: if the source of the main name is an actual source, the authenticity score is 1 point; if the source of the main name is not an actual source, the authenticity score is 0 points. The authenticity score of each main name is then normalized to obtain a normalized authenticity score for each main name.

[0092] The scoring agency assigns a score to the timeliness of each main name, which may include: determining the most recent usage time of each main name; if the most recent usage time is within one month of the current time, the main name's timeliness score is 12 points; if it is within two months, the main name's timeliness score is 11 points, and so on; if it is within 12 months, the main name's timeliness score is 1 point; if it is more than 12 months, the main name's timeliness score is 0.5 points. The timeliness score of each main name is then normalized to obtain a normalized timeliness score for each main name.

[0093] The scoring organization assigns a score to the frequency of each main name's appearance, including: counting the number of times each main name appears in the candidate name set; the more times it appears, the higher the score. For example, one point is awarded for each appearance. The score for each main name's appearance is then normalized to obtain a normalized score.

[0094] like Figure 2C As shown, in the branch selection module, the branch set is filtered, including status filtering, timeliness filtering, and keyword filtering. Then, each branch in the filtered branch set is voted on, and the branch that appears most frequently in the candidate name set is determined as the target branch. Alternatively, the candidate name set can be filtered as described above, then further split to obtain branches, and the frequency of each branch in the candidate name set can be counted; the branch that appears most frequently in the candidate name set is determined as the target branch.

[0095] like Figure 2DAs shown, in the combined name module, the target main name and the target branch are combined to obtain a new name. If there are multiple new names, redundant names are eliminated, and the names are compared with each other to finally select one name.

[0096] Figure 3 This is a structural block diagram of a point-of-interest naming device according to an embodiment of this disclosure.

[0097] like Figure 3 As shown, the point of interest naming device may include:

[0098] The name segmentation module 310 is used to identify the name trunk and name branches of each candidate name in the candidate name set of the interest point, so as to obtain the name trunk set and name branch set of the interest point;

[0099] The backbone determination module 320 is used to determine the target name backbone based on the name backbone set;

[0100] Branch determination module 330 is used to determine the target name branch based on the name branch set;

[0101] The name determination module 340 is used to determine the name of the point of interest based on the target name trunk and the target name branches.

[0102] Figure 4 This is a structural block diagram of a point-of-interest naming device according to another embodiment of this disclosure. Figure 4 As shown, the point of interest naming device includes a name segmentation module 410, a trunk determination module 420, a branch determination module 430, and a name determination module 440. These modules have the same functions as 310, 320, 330, and 340 in the above embodiments, and will not be described in detail here.

[0103] For example, the backbone determination module 420 includes:

[0104] Scoring unit 421 is used to determine the quality score of each name backbone based on at least one attribute information of each name backbone in the name backbone set and the scoring rule corresponding to each attribute information in the at least one attribute information.

[0105] The backbone filtering unit 422 is used to determine the target name backbone in the name backbone set based on the quality score of each name backbone.

[0106] For example, the attribute information of the name backbone includes at least one of the following: the components of the name backbone, the source of the candidate names to which the name backbone belongs, the historical usage time of the candidate names to which the name backbone belongs, and the number of times the name backbone appears in the candidate name set.

[0107] Exemplarily, the branch determining module 430 is specifically configured to:

[0108] determine a target name branch in the name branch set based on the target name stem.

[0109] Exemplarily, the branch determining module 430 comprises:

[0110] a branch screening unit 431 configured to determine a target name branch in the name branch set based on a similarity between each name branch in the name branch set and the target name stem and a number of occurrences of the each name branch in the candidate name set.

[0111] Exemplarily, the name determining module 440 comprises:

[0112] a name combining unit 441 configured to combine the target name stem and the target name branch to obtain the name of the point of interest in a case where the target name stem does not contain the target name branch.

[0113] Exemplarily, the name determining module 440 comprises:

[0114] a point of interest name determining unit 442 configured to determine the target name stem as the name of the point of interest in a case where the target name stem contains the target name branch.

[0115] The functions of each unit, module or sub-module in each apparatus in the embodiments of the present disclosure can refer to the corresponding description in the method embodiments described above, which will not be repeated here.

[0116] According to the embodiments of the present disclosure, the present disclosure further provides an electronic device, a readable storage medium and a computer program product.

[0117] According to the embodiments of the present disclosure, the present disclosure further provides a geographic information system, which can comprise the electronic device in the embodiments of the present disclosure.

[0118] Figure 5 A schematic block diagram of an example electronic device 500 that can be used to implement embodiments of the present disclosure is shown. The electronic device is intended to represent various forms of digital computers, such as laptops, desktops, tablets, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. The electronic device can also represent various forms of mobile devices, such as personal digital assistants, cellular telephones, smart phones, wearable devices, and other similar computing devices. The components shown here, their connections and relationships, and their functions, are meant to be examples only, and are not intended to limit implementations of the present disclosure described and / or claimed in this document.

[0119] like Figure 5 As shown, the electronic device 500 includes a computing unit 501, which can perform various appropriate actions and processes according to a computer program stored in a read-only memory (ROM) 502 or a computer program loaded from a storage unit 508 into a random access memory (RAM) 503. The RAM 503 may also store various programs and data required for the operation of the electronic device 500. The computing unit 501, ROM 502, and RAM 503 are interconnected via a bus 504. An input / output (I / O) interface 505 is also connected to the bus 504.

[0120] Multiple components in electronic device 500 are connected to I / O interface 505, including: input unit 506, such as keyboard, mouse, etc.; output unit 507, such as various types of monitors, speakers, etc.; storage unit 508, such as disk, optical disk, etc.; and communication unit 509, such as network card, modem, wireless transceiver, etc. Communication unit 509 allows electronic device 500 to exchange information / data with other devices through computer networks such as the Internet and / or various telecommunications networks.

[0121] The computing unit 501 can be a variety of general-purpose and / or special-purpose processing components with processing and computing capabilities. Some examples of the computing unit 501 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various special-purpose artificial intelligence (AI) computing chips, various computing units running machine learning model algorithms, a digital signal processor (DSP), and any suitable processor, controller, microcontroller, etc. The computing unit 501 performs the various methods and processes described above, such as the point-of-interest (POI) naming method. For example, in some embodiments, the POI naming method may be implemented as a computer software program tangibly contained in a machine-readable medium, such as storage unit 508. In some embodiments, part or all of the computer program may be loaded and / or installed on the electronic device 500 via ROM 102 and / or communication unit 509. When the computer program is loaded into RAM 503 and executed by the computing unit 501, one or more steps of the POI naming method described above may be performed. Alternatively, in other embodiments, the computing unit 501 may be configured to perform the POI naming method by any other suitable means (e.g., by means of firmware).

[0122] The various embodiments of the systems and techniques described above can be implemented in digital electronic circuitry, integrated circuitry, a field programmable gate array (FPGA), an application specific integrated circuit (ASIC), a system on a chip (SOC), a complex programmable logic device (CPLD), computer hardware, firmware, software, and / or combinations thereof. These various embodiments can include implementation in one or more computer programs that are executable and / or interpretable on a programmable system including at least one programmable processor, which can be special or general purpose, coupled to receive data and instructions from, and to transmit data and instructions to, a storage system, at least one input device, and at least one output device.

[0123] Program code for carrying out methods of the present disclosure can be written in any combination of one or more programming languages. The program code can be provided to a processor or controller of a general purpose computer, special purpose computer, or other programmable processing apparatus to produce a machine, such that the program code, when executed by the processor or controller, implements the functions / acts specified in the flowcharts and / or block diagrams. The program code can be executed entirely on a machine, partially on a machine, partially on a machine and partially on a remote machine or entirely on a remote machine or server.

[0124] In the context of the present disclosure, a machine-readable medium can be a tangible medium that contains or stores a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium can be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium can include but is not limited to an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of the machine-readable storage medium will include one or more lines of electrical connections, portable computer disks, hard disk drives, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or Flash memory), optical fibers, portable compact disc read-only memories (CD-ROMs), optical storage devices, magnetic storage devices, or any suitable combination of the foregoing.

[0125] To provide for interaction with a user, the systems and techniques described here can be implemented on a computer having a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user and a keyboard and a pointing device (e.g., a mouse or a trackball) by which the user can provide input to the computer. Other kinds of devices can be used to provide for interaction with a user as well; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form, including acoustic, speech, or tactile input.

[0126] The systems and techniques described here can be implemented in a computing system that includes a back end component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front end component (e.g., a user computer having a graphical user interface or a Web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such back end, middleware, or front end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network (LAN), a wide area network (WAN), and the Internet.

[0127] The computer system can include clients and servers. A client and server are generally remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. The server can be a cloud server, a server of a distributed system, or a server combined with a blockchain.

[0128] It should be understood that various forms of flow shown above can be used, with steps reordered, added, or removed. For example, the steps recited in the present disclosure can be performed in parallel, in series, or in a different order, without limitation herein, so long as the desired results of the technology disclosed in the present disclosure are achieved.

[0129] The specific embodiments described above are not intended to limit the scope of the present disclosure. Those skilled in the art will understand that various modifications, combinations, sub-combinations, and alternatives can be made to the specific embodiments without departing from the spirit and principles of the present disclosure. Any further modifications, changes, improvements, and the like that come within the spirit and principles of the present disclosure should be considered within the scope of the present disclosure.

Claims

1. A point of interest naming method, comprising: identifying a name stem and a name branch of each candidate name in a candidate name set of a point of interest, to obtain a name stem set and a name branch set of the point of interest; determining a target name stem based on the name stem set; determining a target name branch based on the name branch set; determining a combination mode of the target name stem and the target name branch based on a relationship between the target name stem and the target name branch, and combining the target name stem and the target name branch according to the combination mode to determine a name of the point of interest, wherein the combination mode comprises inserting the target name branch into a head, a middle or a tail of the target name stem; wherein the determining the combination mode of the target name stem and the target name branch based on the relationship between the target name stem and the target name branch, and combining the target name stem and the target name branch according to the combination mode to determine the name of the point of interest comprises: in a case where the target name stem does not contain the target name branch, combining the target name stem and the target name branch according to the combination mode based on the relationship between the target name stem and the target name branch to obtain the name of the point of interest; further comprising determining the target name branch by using any one of the following filtering modes: filtering based on a similarity between each name branch in the name branch set and the target name stem to determine the target name branch; filtering based on a similarity between each name branch in the name branch set and the target name stem and a number of occurrences of the each name branch in the candidate name set to determine the target name branch; filtering based on a number of occurrences of each name branch in the name branch set in the candidate name set to determine the target name branch.

2. The method of claim 1, wherein, the determining the target name stem based on the name stem set comprises: determining a quality score of each name stem in the name stem set based on at least one attribute information of the each name stem and a scoring rule corresponding to each attribute information in the at least one attribute information; determining the target name stem in the name stem set based on the quality score of the each name stem.

3. The method of claim 2, wherein, the attribute information of the name stem comprises at least one of a component of the name stem, a source of a candidate name to which the name stem belongs, a historical use time of the candidate name to which the name stem belongs, and a number of occurrences of the name stem in the candidate name set.

4. The method according to any one of claims 1 to 3, wherein, the determining the combination mode of the target name stem and the target name branch based on the relationship between the target name stem and the target name branch, and combining the target name stem and the target name branch according to the combination mode to determine the name of the point of interest comprises: in a case where the target name stem contains the target name branch, determining the target name stem as the name of the point of interest.

5. A point of interest naming apparatus, comprising: a name splitting module configured to identify a name stem and a name branch of each candidate name in a candidate name set of a point of interest, to obtain a name stem set and a name branch set of the point of interest; a stem determining module configured to determine a target name stem based on the name stem set; a branch determining module configured to determine a target name branch based on the name branch set; a name determining module configured to determine a combination manner of the target name stem and the target name branch based on a relationship between the target name stem and the target name branch, to combine the target name stem and the target name branch according to the combination manner, to determine a name of the point of interest; wherein the combination manner comprises inserting the target name branch into a head, a middle or a tail of the target name stem; wherein the name determining module comprises: a name combining unit configured to, in a case where the target name stem does not contain the target name branch, combine the target name stem and the target name branch according to the combination manner based on the relationship between the target name stem and the target name branch, to obtain the name of the point of interest; wherein the branch determining module comprises a branch screening unit configured to determine the target name branch by using any one of the following filtering manners: filtering based on a similarity between each name branch in the name branch set and the target name stem, to determine the target name branch; filtering based on the similarity between each name branch in the name branch set and the target name stem and a number of occurrences of the each name branch in the candidate name set, to determine the target name branch; filtering based on the number of occurrences of each name branch in the name branch set in the candidate name set, to determine the target name branch.

6. The apparatus of claim 5, wherein, the stem determining module comprises: a scoring unit configured to determine a quality score of each name stem in the name stem set based on at least one attribute information of the each name stem and a scoring rule corresponding to each attribute information in the at least one attribute information; a stem screening unit configured to determine a target name stem in the name stem set based on the quality score of the each name stem.

7. The apparatus of claim 6, wherein, the attribute information of the name stem comprises at least one of the following: a component of the name stem, a source of a candidate name to which the name stem belongs, a historical use time of the candidate name to which the name stem belongs, and a number of occurrences of the name stem in the candidate name set.

8. The apparatus of any one of claims 5 to 7, wherein, the name determining module comprises: a point of interest name determining unit configured to, in a case where the target name stem contains the target name branch, determine the target name stem as the name of the point of interest.

9. An electronic device, comprising: at least one processor; and a memory connected to the at least one processor in communication; wherein, The memory stores instructions executable by the at least one processor, the instructions being executed by the at least one processor to enable the at least one processor to perform the method of any one of claims 1-4.

10. A geographic information system comprising the electronic device of claim 9.

11. A non-transitory computer-readable storage medium storing computer instructions for causing a computer to perform the method of any one of claims 1-4.

12. A computer program product comprising a computer program which, when executed by a processor, implements the method of any one of claims 1-4.

Images