WO2015027835A1 - Système et terminal d'interrogation de codes postaux d'adresses postales - Google Patents

Système et terminal d'interrogation de codes postaux d'adresses postales Download PDF

Info

Publication number
WO2015027835A1
WO2015027835A1 PCT/CN2014/084607 CN2014084607W WO2015027835A1 WO 2015027835 A1 WO2015027835 A1 WO 2015027835A1 CN 2014084607 W CN2014084607 W CN 2014084607W WO 2015027835 A1 WO2015027835 A1 WO 2015027835A1
Authority
WO
WIPO (PCT)
Prior art keywords
address
level
user
query
communication address
Prior art date
Application number
PCT/CN2014/084607
Other languages
English (en)
Chinese (zh)
Inventor
王国印
贾西贝
Original Assignee
深圳市华傲数据技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 深圳市华傲数据技术有限公司 filed Critical 深圳市华傲数据技术有限公司
Publication of WO2015027835A1 publication Critical patent/WO2015027835A1/fr

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24—Querying
    • G06F16/245—Query processing
    • G06F16/2455—Query execution
    • G06F16/24553—Query execution of query operations
    • G06F16/24558—Binary matching operations
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/29—Geographical information databases

Definitions

  • the present invention relates to the field of zip code inquiry, and in particular to a system and terminal for querying a zip code by a communication address.
  • the e-commerce and logistics industries are inseparable from the communication address (also known as the mailing address, referred to as the address) and the postal code. These data need to be provided by the user.
  • the current main practices of some e-commerce websites and the logistics industry are as follows: The complete address and address corresponding zip code; through the drop-down list to provide provinces, provinces below the prefecture-level city and prefecture-level cities below the districts and counties, these relatively fixed addresses for users to choose, the rest of the address and zip code manually input by the user; The entered address and zip code are convenient for the next time to use again.
  • Some other websites currently solve the first problem, which is to help users get the zip code corresponding to the address.
  • they often use database technology to implement the system.
  • string fuzzy queries like %XXX% to participate in the search.
  • this method is large.
  • the query of data volume is very inefficient.
  • the database-based query makes the user's input format and content greatly restricted.
  • the user first selects the name of the provincial administrative region (including the province, special administrative region, autonomous region, and municipality), and then selects the prefecture-level administrative region (Including the name of the prefecture-level city, autonomous prefecture, region, and alliance level, and then the name of the county-level administrative region (including the municipal district, county, flag, SAR, forest area, autonomous county, and autonomous flag, etc.), and the last user enters the township level and Village roads, etc.
  • the input process of the query is very mechanical.
  • the address format is required to satisfy four levels, that is, provincial, prefecture-level, district-level, and then other specific addresses.
  • levels that is, provincial, prefecture-level, district-level, and then other specific addresses.
  • not all addresses satisfy this situation.
  • prefecture-level city level between the municipality and the provinces directly under the central government or the county-level cities under the jurisdiction of the municipality.
  • Some special prefecture-level cities do not have district-level and county-level, such as Zhongshan, Guangdong province.
  • the present invention has been made to solve one of the above drawbacks. Therefore, the present invention provides a system and terminal for querying a postal code by a communication address, which helps the user input a prompt to make the query format more free; based on the named entity identification technology, the level of the user input address metadata can be identified, thereby realizing the address.
  • the step-by-step query and the completion of the communication address make the query result more accurate.
  • the user can also obtain the query result by means of a two-dimensional code, or link the map for positioning.
  • an embodiment of the present invention provides a system for querying a postal code by a communication address, the system comprising a communication address input subsystem and a postal code query subsystem; and the address input subsystem promptly prompts the user to input text, The user determines the communication address to be queried according to the prompt list address; the zip code query subsystem normalizes the communication address to be queried and retrieves the closest standardized communication address, Returns the zip code corresponding to the standardized communication address.
  • the determining the communication address to be queried may further include: the user may not select the address in the prompt list, and determine the communication address to be queried only according to the user input text.
  • the real-time prompt includes: automatically changing the prompt content as the user inputs each increment of the text; the step of implementing the prompt content is specifically: acquiring an address text input by the current user and performing pre-processing to delete extra spaces; The segmentation obtains the address metadata and labels all the address levels; obtains the final place name entity annotation sequence by the place name entity identification, and generates a Query query statement; retrieves the index address file to obtain the prompt list address content.
  • the preprocessing further comprises: converting a full-width character of a number or a letter into a half-width character; wherein the dictionary is stored in a pre-processing process using a dual array-based Trie tree data structure.
  • the prompt list address includes: The obtained prompt list addresses are arranged in descending order according to the closest standard address.
  • the standardizing the communication address to be queried includes the following specific steps: obtaining a communication address to be queried determined by the user and performing pre-processing; performing address segmentation to obtain address metadata, and labeling all address levels; Obtain the final list of place name entities and generate a Query query statement; parse the Query query statement and retrieve the index file to compare with it to obtain the closest communication address; perform address completion to generate a standardized communication address, and return the standardized communication address The postal code corresponding to the address.
  • the corresponding zip code is determined according to a lowest address level value of the marked address.
  • the returning the zip code corresponding to the standardized communication address may further include: selecting the determined zip code query result, the user may obtain the map location; or sending the zip code query result to the mobile terminal device by using the two-dimensional code.
  • the address segmentation adopts a binary model segmentation method; the named entity recognition technology identifies the most likely address level of each place name metadata in the place name entity annotation result.
  • Another embodiment of the present invention provides a terminal for querying a zip code by using a communication address
  • the terminal includes: a user input prompting unit and a zip code query unit, wherein the user inputs a prompting unit for real-time Prompting the user to input and receive the communication address to be queried finally determined by the user;
  • the zip code query unit is configured to retrieve a standardized communication address that is closest to the communication address to be queried, and receive a post corresponding to the standardized communication address coding.
  • the invention makes the query format more free by helping the user input prompts; the named entity identification technology can identify the level of the user input address metadata, thereby implementing the level-by-level query of the address, and simultaneously completing the communication address, so that the search is performed. The result is more accurate.
  • the user can also obtain the query result in two-dimensional code, or link the map for positioning.
  • FIG. 1 is a schematic flowchart of a system for querying a postal code by using a communication address according to an embodiment of the present invention.
  • 2 is a detailed flow chart of an address input subsystem implemented by an embodiment of the present invention.
  • FIG. 3 is a detailed flow chart of an address input subsystem implemented by an embodiment of the present invention.
  • FIG. 4 is a schematic diagram of an example of address completion in a postal code query subsystem implemented by an embodiment of the present invention. detailed description
  • the system and terminal for querying the zip code of the communication address provided by the invention provide the user with the prompt to make the query format more free; the named entity identification technology can identify the level of the user input address metadata, thereby realizing the address
  • the query is step by step, and the communication address is complemented at the same time, so that the query result is more accurate.
  • the user can also obtain the query result by means of a two-dimensional code, or link the map for positioning.
  • Step S110 Address
  • the input subsystem prompts the user to input the text in real time, and the user determines the communication address to be queried according to the prompt list address.
  • step S110 The detailed process of step S110 is as shown in FIG. 2, specifically: Step S111: Obtain the address text input by the user, and perform pre-processing on the obtained address text, and the pre-processing mainly includes turning the full angle of the number or letter. Change to half-width characters and remove extra spaces.
  • This input prompt automatically changes the prompt content as the user inputs each increase in the text, and can also save the real-time prompt.
  • the user can directly input the communication address text to be queried in the address input prompting system, and if the real-time prompt is selected, Then the obtained hint list addresses are arranged in descending order according to the closest standard address.
  • Step S112 The address text is divided into addresses.
  • the word segmentation method used in full-text indexing is a binary model, that is, the longest Chinese word length in the index is 2, and the length of Chinese place names is generally more than 2, and each identified address metadata is identified to generate a PhraseQuery check.
  • the syntax is used to filter out the words consisting of the last word of the previous address metadata and the first word of the next address metadata in the adjacent two address metadata.
  • the constructed PhraseQuery query syntax is: "Guangdong City" "Shenzhen City", that is, each place name metadata is enclosed in double quotes. In this way, it is possible to filter out the results of the query caused by the words "deep-deep” and greatly improve the accuracy.
  • Dictionary-based word segmentation usually has a positive (left to right) match and a reverse (from right to left) match.
  • the inverse matching is half the error rate of the positive matching segmentation.
  • the cross ambiguity is defined as: ABC three consecutive Chinese characters, AB and BC can be words; in general, Chinese BC constituent words The probability is greater.
  • Address segmentation is based on the address metadata dictionary using the inverse maximum matching algorithm to scan the user input address text from right to left to achieve the address segmentation.
  • the dictionary uses a double array (Double Array) based Trie tree. The data structure is stored.
  • Step S113 Perform address labeling.
  • address metadata is required, which can be obtained from Wikipedia and the National Bureau of Statistics regarding the address metadata of the Chinese administrative division, and from the complete communication address by address segmentation and identification technology.
  • the address metadata contains the following data: provincial administrative district names (including provinces, autonomous regions, municipalities and special administrative regions), prefecture-level administrative district names (prefecture-level cities, autonomous prefectures, regions, and alliances), and county-level administrative districts (including municipal districts, County-level cities, counties, autonomous counties, flags, autonomous flags, special zones and forest areas), township-level administrative district names (including townships, Town, street, Sumu, district office), other address data (including road name, village name, community name, building name and square name).
  • the address metadata dictionary should contain various aliases for place names, and its format is defined as: Address metadata dictionary consists of multiple lines, each line becomes a term (Term), each Term should contain the address level corresponding to the place name and place name (level ) , where the name is key, the address level is the attribute or value of the key.
  • the address metadata dictionary contains 2 items for each Term, that is, the address level corresponding to the place name and the place name. They are separated by a semicolon semicolon ";”, and some place names contain multiple address levels (such as some standard versions).
  • the alias of the address is also an alias for other standard version addresses. The different level levels are separated by a comma ",".
  • the usual formats are as follows: Provincial administrative districts, one prefecture-level administrative district, one county-level administrative district, one township-level administrative district, one other (this format is often used in the Internet), for example: Fuyang City, Anhui province Huxiaozhai Village, Chenqiao Village Committee, Guanji Town, County; County-level administrative district, a township-level administrative district, and other (when the county-level administrative district is a county-level city, county, autonomous county, flag, autonomous flag, special zone and forest area) You can omit the prefecture-level administrative district. This format is often used on ID cards.
  • Table 1 Five-level hierarchical model of address level. For convenience of processing, the value of level is set to 1, 2, 3, 4, 0 in order according to the address level. That is, “1" represents the address level as one level, “2" represents the address level as level 2, "3" represents the address level as level 3, "4" represents the address level as level 4, and "0" represents the address level as level 5, "0" represents the address level as level 5 .
  • the address level can be obtained from the attribute of each place name in the address metadata dictionary. If the segmented address does not exist in the dictionary, the address is an unrecognized address, and the address level is marked as level 0. Step S114: Perform geographical name entity identification.
  • the geographical name entity identification is to identify the most likely address level of each place name in the result of the place name entity labeling, for example, an address sequence: "Guangdong Shenzhen Baoan Xixiang” is the full name of "Xixiang Street, Bao'an District, Shenzhen City, Guangdong province”; The results after the points and labels are: “Guangdong (1) Shenzhen (2, 4) Baoan (3) Xixiang (2, 4)"; The correct labeling sequence is: “Guangdong (1) Shenzhen (2) Baoan (3) Xixiang (4)".
  • the system uses dynamic programming algorithm plus backtracking (Viterbi algorithm) to find the most accurate labeling sequence.
  • the observation value and state in Viterbi algorithm are address levels. At this time, the algorithm becomes a first-order Markov process.
  • the toponymic entity identification includes two parts, one part is a processing flow for obtaining an optimal address level labeling sequence by the Viterbi algorithm, and the other part is to correct an optimal labeling level sequence that does not satisfy the rule according to the knowledge of the context, so that the recognition result is obtained. More precise.
  • the value in Pi is set according to experience or prior knowledge.
  • the value of each value in the following follows the following principles: The higher the administrative level of the address, the higher the initial probability, such as the initial probability of the provincial level is greater than the prefecture level.
  • A ⁇ ⁇ 0.05, 0.45, 0.25, 0.15, 0.10 ⁇ ;
  • the most probable sequence of labels is the first type of labeling. Therefore, the result of the dynamic programming algorithm output is also the first type of labeling status "Guangdong (1) Shenzhen (2) Baoan (3) Xixiang (4)".
  • the address entered is: "Hebei Shijiazhuang Pingshan Ancient Moon", the address sequence marked is: “Hebei (1, 2, 4) Shijiazhuang (2, 4) Pingshan (2, 3, 4) Ancient Moon (4) ", this
  • the labeling level of each address in the labeling sequence is interpreted as: “Hebei” may be an alias of "Hebei City”, or an alias of "Hebei District” in Tianjin, or an alias of "Hebei Township”; “Shijiazhuang” It can be an alias for "Shijiazhuang City” and “Shijiazhuang Town”; "Pingshan” can be an alias for "Pingshan County” or “Pingshan District” or “Pingshan Town”.
  • the optimal labeling sequence is: "Hebei (1) Shijiazhuang (2) Pingshan (3) Ancient Moon (4)”.
  • the prefecture-level city marked as the three-level address is its direct predecessor address, if not corrected.
  • the rules are stored in the opposite manner as described above, that is, the alias of the prefecture-level city to which the county or county-level city belongs is the context, for example, (Taihe Yiyang). Therefore, when this context is satisfied, the level of the label is modified, and no modification is made when it is not satisfied.
  • the second-level address and the fourth-level address have the same name, mainly in the county-level city or county alias and the same name of the township alias. Since the four-level address can appear multiple times in a complete address, Sometimes the secondary address is marked on level 4. At this time, it is also necessary to discriminate according to the context.
  • the sequence of the note. Examples are as follows:
  • the input address is: "Heihe River Heilongjiang Wudalianchi Xinfa Township and Mincun”
  • the optimal labeling sequence is: "Heilongjiang (1) Heihe (2) Wudalianchi (4) Xinfa Township (4) and Mincun (0)”
  • This The "Five Dalian Pool” was marked at the fourth level address level, in fact it is a county-level city.
  • the sequence of labels after correction according to the context is: "Heilongjiang (1) Heihe (2) Wudalianchi (2) Xinfa Township (4) and Mincun (0) ", similar to the solution with the same alias in the district and county, for townships and counties
  • the rule reserved by the system is that the alias is the context of the prefecture-level city of the county or county-level city, for example (Wudao Pool Ihehe). Therefore, when this context is satisfied, the level of the label is modified, and no modification is made when it is not satisfied.
  • a mechanism is also provided to correct the optimal label sequence according to the context.
  • the method of processing is to eliminate the ambiguity caused by the alias according to the address context (an alias corresponds to multiple address levels). The result is more accurate.
  • Step S120 The postal code query subsystem normalizes the communication address to be queried and retrieves the closest standardized communication address, and returns the zip code corresponding to the standardized communication address.
  • the index file is composed of a plurality of documents, each of which contains fields: an address field, a complete standard address. ; ZIP code domain, the zip code associated with the full standard address; the lowest level of the address, the administrative level of the lowest level address in the address.
  • the data field value of the lowest level field is as follows:
  • An address text whose value corresponding to the lowest address level field is calculated as follows: First, the address text is preprocessed. The preprocessing includes deleting extra spaces, and the full-width characters are converted into half-width characters; the second is address segmentation and address labeling;
  • the address level in the labeling sequence is defined as follows:
  • the lowest address is mapped to the lowest level value of the address field level: l ⁇ province; 2 ⁇ city ; 3 ⁇ district; 4 ⁇ town; 0 ⁇ all.
  • step S120 The detailed process diagram of step S120 is shown in FIG. 3, which is specifically as follows:
  • Step S121 Acquire a communication address to be queried determined by the user and perform pre-processing.
  • the address input subsystem Since in the address input subsystem, there may be an address text selected by the user to input by itself, and the input prompt function provided by the system is not used, it is necessary to pre-process the pre-queried communication address confirmed by the user, the pre-processing process and the content and The same is true in the address input subsystem.
  • Step S122 Perform address segmentation to obtain address metadata, and mark all address levels.
  • Step S123 obtaining the final place name entity labeling sequence by the place name entity identification, and generating a Query query statement.
  • Step S124 Parse the Query query statement and retrieve the index file to compare with the index file to obtain the closest communication address.
  • Step S125 Perform address restoration to generate a standardized communication address, and return a zip code corresponding to the standardized communication address.
  • step S 121 of the zip code query subsystem is The specific implementation process of the S 124 step implementation process refers to the specific implementation process in the address input subsystem, and the address completion process is mainly described here, as follows:
  • the system When the user submits a query request, the system returns the result of the query and ranks the address most similar to the address text entered by the user. Because the reference data is not collected too much, plus every year there are new buildings, roads, communities, etc., there are some administrative divisions, etc., so that the address in the first location is the address after the district and county location. There is a discrepancy with the address entered by the user. The system uses address completion technology to modify the most similar return results to make it closer to the user's requirements.
  • Address completion is a technique to improve the results of queries based on user input, making the results closer to the needs of users.
  • Address replenishment is mainly used at a certain level of address, and it is difficult to collect all of them.
  • the new addition is relatively large, mainly concentrated on the four-level and five-level addresses.
  • the order of the address level entered by the user is normal, that is, there is no one or two level address appearing after the level four or five level address.
  • the four-level address and the subsequent part of the address level input by the user are identified, and are stitched to the third-level address in the address with the most similar search result.
  • An example of address completion is shown in Figure 4.
  • step S125 the corresponding zip code is determined according to the lowest address level value of the marked address, and finally the zip code corresponding to the standardized communication address is returned, and the determined zip code query result can be selected, and the user can obtain the map location or pass the two-dimensional The code sends the postal code query result to the mobile terminal device.
  • Another embodiment of the present invention provides a terminal for a communication address query zip code
  • the terminal includes: a user input prompting unit and a zip code query unit, wherein the user input prompting unit is configured to prompt the user to input and Receiving a communication address to be queried finally determined by the user; The normalized communication address closest to the communication address to be queried is retrieved, and the zip code corresponding to the standardized communication address is received.
  • the invention makes the query format more free by helping the user input prompts; the named entity identification technology can identify the level of the user input address metadata, thereby implementing the level-by-level query of the address, and simultaneously completing the communication address, so that the search is performed. The result is more accurate.
  • the user can also obtain the query result in two-dimensional code, or link the map for positioning.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Computational Linguistics (AREA)
  • Remote Sensing (AREA)
  • Document Processing Apparatus (AREA)
  • Information Transfer Between Computers (AREA)

Abstract

La présente invention concerne un système d'interrogation de codes postaux d'adresses postales, ledit système comprenant un sous-système d'entrée d'adresse postale et un sous-système d'interrogation de code postal ; au moyen dudit sous-système d'entrée d'adresse postale invitant un utilisateur à entrer du texte en temps réel, l'utilisateur détermine l'adresse postale devant être interrogée d'après la liste d'adresses suggérée ; ledit sous-système d'interrogation de code postal normalise l'adresse postale devant être interrogée et retrouve l'adresse postale normalisée la plus proche tout en retournant également le code postal correspondant à ladite adresse postale normalisée. La présente invention concerne un système d'interrogation de codes postaux d'adresses postales, ledit système comprenant un sous-système d'entrée d'adresse postale et un sous-système d'interrogation de code postal ; au moyen dudit sous-système d'entrée d'adresse postale invitant un utilisateur à entrer du texte en temps réel, l'utilisateur détermine l'adresse postale devant être interrogée d'après la liste d'adresses suggérée ; ledit sous-système d'interrogation de code postal normalise l'adresse postale devant être interrogée et retrouve l'adresse postale normalisée la plus proche tout en retournant également le code postal correspondant à ladite adresse postale normalisée. La présente invention concerne également un terminal d'interrogation de codes postaux d'adresses postales.
PCT/CN2014/084607 2013-08-27 2014-08-18 Système et terminal d'interrogation de codes postaux d'adresses postales WO2015027835A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201310377867.4A CN103440312B (zh) 2013-08-27 2013-08-27 一种通信地址查询邮政编码的系统及终端
CN201310377867.4 2013-08-27

Publications (1)

Publication Number Publication Date
WO2015027835A1 true WO2015027835A1 (fr) 2015-03-05

Family

ID=49694005

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2014/084607 WO2015027835A1 (fr) 2013-08-27 2014-08-18 Système et terminal d'interrogation de codes postaux d'adresses postales

Country Status (2)

Country Link
CN (1) CN103440312B (fr)
WO (1) WO2015027835A1 (fr)

Families Citing this family (22)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103440312B (zh) * 2013-08-27 2019-01-22 深圳市华傲数据技术有限公司 一种通信地址查询邮政编码的系统及终端
CN103473289A (zh) * 2013-08-30 2013-12-25 深圳市华傲数据技术有限公司 一种通信地址补全的装置及方法
CN103914569B (zh) * 2014-04-24 2018-09-07 百度在线网络技术（北京）有限公司 输入提示方法、装置及字典树模型的创建方法、装置
CN104156415B (zh) * 2014-07-31 2017-04-12 沈阳锐易特软件技术有限公司 解决医疗数据标准编码对照问题的映射处理系统及方法
CN104200369B (zh) * 2014-08-27 2019-12-31 北京京东尚科信息技术有限公司 一种确定商品配送范围的方法和装置
CN106326233B (zh) * 2015-06-18 2019-10-11 菜鸟智能物流控股有限公司 地址提示方法及装置
CN105069056B (zh) * 2015-07-24 2018-02-06 湖北文理学院 基于字符串匹配的身份证住址信息解析方法及系统
CN106469372B (zh) * 2015-08-14 2020-06-12 菜鸟智能物流控股有限公司 一种地址映射方法及装置
CN105224522A (zh) * 2015-09-29 2016-01-06 小米科技有限责任公司 地理位置信息识别方法及装置
CN105653060A (zh) * 2015-12-30 2016-06-08 浙江慧脑信息科技有限公司 一种多功能地址输入方法
CN107025232A (zh) * 2016-01-29 2017-08-08 阿里巴巴集团控股有限公司 物流系统中地址信息的处理方法及装置
CN105975099B (zh) * 2016-04-28 2020-02-04 百度在线网络技术（北京）有限公司 输入法的实现方法和装置
CN106055650A (zh) * 2016-05-31 2016-10-26 深圳市永兴元科技有限公司 地址标准化方法和装置
CN106777377A (zh) * 2017-02-09 2017-05-31 辛国臣 物流单号生成方法及装置
CN108256718B (zh) * 2017-05-04 2022-04-29 平安科技（深圳）有限公司 保单服务任务分配方法、装置、计算机设备和存储设备
CN109033225A (zh) * 2018-06-29 2018-12-18 福州大学 中文地址识别系统
CN109344254B (zh) * 2018-09-20 2020-12-18 鼎富智能科技有限公司 一种地址信息分类方法及装置
CN110334162B (zh) * 2019-05-09 2021-11-09 德邦物流股份有限公司 地址识别方法及装置
CN112100161B (zh) * 2019-09-17 2021-05-28 上海寻梦信息技术有限公司 数据处理方法及系统、电子设备及存储介质
CN110688851B (zh) * 2019-09-26 2023-07-28 亿企赢网络科技有限公司 一种提取地址文本的关键信息的方法、装置及介质
CN112528174B (zh) * 2020-11-27 2024-07-26 暨南大学 基于知识图谱和多重匹配的地址修整补全方法及应用
CN113569564B (zh) * 2021-07-30 2024-03-19 拉扎斯网络科技（上海）有限公司 一种地址信息的处理、显示方法和装置

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101339638A (zh) * 2007-07-03 2009-01-07 周磊 一种订购平台的商品配送范围与收货地址自动匹配的方法和系统
CN102737060A (zh) * 2011-04-14 2012-10-17 商业对象软件有限公司 地理编码应用中的模糊搜索
CN103440312A (zh) * 2013-08-27 2013-12-11 深圳市华傲数据技术有限公司 一种通信地址查询邮政编码的系统及终端

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102955833B (zh) * 2011-08-31 2015-11-25 深圳市华傲数据技术有限公司 一种通讯地址识别、标准化的方法

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101339638A (zh) * 2007-07-03 2009-01-07 周磊 一种订购平台的商品配送范围与收货地址自动匹配的方法和系统
CN102737060A (zh) * 2011-04-14 2012-10-17 商业对象软件有限公司 地理编码应用中的模糊搜索
CN103440312A (zh) * 2013-08-27 2013-12-11 深圳市华傲数据技术有限公司 一种通信地址查询邮政编码的系统及终端

Also Published As

Publication number Publication date
CN103440312A (zh) 2013-12-11
CN103440312B (zh) 2019-01-22

Similar Documents

Publication Publication Date Title
WO2015027835A1 (fr) Système et terminal d'interrogation de codes postaux d'adresses postales
WO2015027836A1 (fr) Procédé et système de reconnaissance d'entité de nom d'endroit
CN102955833B (zh) 一种通讯地址识别、标准化的方法
CN109344213B (zh) 一种基于字典树的中文地理编码方法
CN105069056B (zh) 基于字符串匹配的身份证住址信息解析方法及系统
CN110909170B (zh) 兴趣点知识图谱构建方法、装置、电子设备及存储介质
CN106909611B (zh) 一种基于文本信息抽取的酒店自动匹配方法
CN102955832B (zh) 一种通讯地址识别、标准化的系统
US20170116224A1 (en) Address Search Method and Device
CN106874287B (zh) 一种兴趣点 poi 地址编码的处理方法及装置
CN107609052A (zh) 一种基于语义三角的领域知识图谱的生成方法及装置
WO2015027837A1 (fr) Dispositif et procédé d'exécution d'adresse postale
CN106886565B (zh) 一种基础房型自动聚合方法
CN116414824A (zh) 行政区划信息识别和标准化处理的方法、装置及存储介质
CN115630648A (zh) 面向人机对话的地址要素解析方法、系统与计算机可读介质
CN115185986A (zh) 省市区地址信息匹配方法、装置、计算机设备及存储介质
CN112948717B (zh) 一种基于多因素约束的海量空间poi搜索方法及系统
CN111738008B (zh) 基于多层模型的实体识别方法、装置、设备及存储介质
CN111401051B (zh) 快递信息解析方法及系统
CN112417812B (zh) 地址标准化方法、系统及电子设备
CN114398886A (zh) 一种基于预训练的地址提取和标准化方法
CN114792091A (zh) 基于词汇增强的中文地址要素解析方法、设备及存储介质
CN116414808A (zh) 详细地址规范化的方法、装置、计算机设备和存储介质
CN116821271B (zh) 一种基于音形码的地址识别和规范化方法及系统
CN113190596B (zh) 一种地名地址混合匹配的方法和装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 14839043

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 14839043

Country of ref document: EP

Kind code of ref document: A1