Passenger origin determination method and system, storage medium and electronic equipment

Abstract

The invention belongs to the technical field of data governance, and provides a passenger origin determination method and system, a storage medium and electronic equipment, and the method comprises the steps: building corresponding English name Chinese pinyin rule matching models according to passenger originals, and enabling one English name Chinese pinyin rule matching model to correspond to one passenger origin; matching the English name of the passenger with the pinyin rule matching model of all the English names; and determining a passenger origin corresponding to the passenger English name according to a matching result of the passenger English name and the English name pinyin rule matching model. The algorithm is simple, the calculation is fast, and the establishment of the English name pinyin rule matching model does not depend on a large number of data samples; when a plurality of passenger sources are matched, a unique passenger source corresponding to a passenger English name can be selected by counting the ticket booking number of the passenger English name in each passenger source.

Description

Technical Field

[0001] The present disclosure belongs to the technical field of data governance, and particularly relates to a method, a system, a storage medium, and an electronic device for determining the place of origin of passengers. Background Art

[0002] In the process of civil aviation market analysis, the analysis of the place of origin of passengers is a very important means of market analysis. The place of origin of civil aviation passengers refers to an area with a certain population scale and economic capacity that can provide a certain number of air travel passengers to the travel destination. The prerequisite for the analysis of the place of origin is that information such as the nationality, place of birth, and living area of the passengers is clear and known.

[0003] In most scenarios, when passengers book seats through the civil aviation seat reservation system, they need to provide clear passenger information, including information such as name, ID number, and place of origin (such as nationality). However, in certain specific scenarios, such as when booking international tickets, passengers only need to enter their English names when booking seats through the civil aviation seat reservation system, without the need to provide other information.

[0004] Therefore, after airlines obtain the seat reservation data of passengers with uncertain places of origin (such as nationality), they need to determine the true place of origin of the passengers in order to analyze various regional market conditions of these passengers (such as the tourist hot destination countries of the passenger groups from the place of origin, the average international travel time, the hot ticket booking time, the popular international flights, the popular international routes, the distribution of the advance ticket booking time, the popular domestic departure cities for international travel, the average travel ticket price for each destination country, etc.). For domestic airlines, there is an urgent need for a method to determine the place of origin of passengers under the condition of knowing the English names of the passengers. Summary of the Invention

[0005] To solve the above problems, the present disclosure provides a method, a system, a storage medium, and an electronic device for determining the place of origin of passengers. By establishing a matching model for the Chinese pinyin rules of English names, the English names of passengers are matched with the matching model for the Chinese pinyin rules of English names, and the place of origin of the passengers corresponding to the English names is determined according to the matching result. It can directly match the place of origin of passengers based on the pinyin schemes used in different places of origin of passengers; when multiple places of origin of passengers are matched, the only place of origin of passengers corresponding to the English names of passengers can be selected by counting the number of seat reservations of the English names of passengers in each place of origin of passengers.

[0006] The present invention is realized through the following technical solutions:

[0007] In a first aspect, an embodiment of the present disclosure provides a method for determining the place of origin of passengers, including:

[0008] According to the place of origin of the passenger, a corresponding Chinese pinyin rule matching model for English names is established, and one Chinese pinyin rule matching model for English names corresponds to one place of origin of the passenger;

[0009] Match the passenger's English name with all Chinese pinyin rule matching models for English names;

[0010] Determine the place of origin of the passenger corresponding to the passenger's English name according to the matching result of the passenger's English name and the Chinese pinyin rule matching model for English names.

[0011] Furthermore,

[0012] Generate all pinyin combinations according to the pinyin scheme of the place of origin corresponding to the Chinese pinyin rule matching model for English names, and determine the number of characters and syllables corresponding to all pinyin combinations;

[0013] All pinyin combinations with the same number of syllables are arranged in descending order according to the number of characters corresponding to the pinyin combination.

[0014] Furthermore,

[0015] Obtain the passenger's English name, and determine the number of letters and the specific content of the letter string of the passenger's English name;

[0016] Starting from the front section of the unmatched part of the letter string of the spelling, match it with the pinyin combination corresponding to the Chinese pinyin rule matching model for English names. Among the successfully matched pinyin combinations, the pinyin combination with the largest number of characters is determined as the target pinyin combination;

[0017] Remove the target pinyin combination from the front section of the letter string of the spelling, retain the remaining unmatched part of the letter string of the spelling, and continue to match it with the pinyin combination corresponding to the Chinese pinyin rule matching model for English names until all letters in the letter string of the spelling are matched, and determine the matching result of the passenger's English name and the Chinese pinyin rule matching model for English names.

[0018] Furthermore,

[0019] Determine the maximum number of characters of the pinyin combination corresponding to the Chinese pinyin rule matching model for English names. If the number of letters in the letter string of the passenger's English name is greater than the maximum number of characters, starting from the first letter of the unmatched part of the letter string, intercept a sub-letter string with the number of letters equal to the maximum number of characters;

[0020] Use all or part of the letters starting from the first letter of the sub-letter string to match with the pinyin combination corresponding to the Chinese pinyin rule matching model for English names;

[0021] If multiple pinyin combinations are matched for the sub-letter string, select the pinyin combination with the largest number of characters among the multiple matched pinyin combinations as the target pinyin combination.

[0022] Further,

[0023] Determine the maximum number of characters in the pinyin combination corresponding to the English name pinyin rule matching model. If the number of letters in the spelling letter string of the passenger's English name is greater than the maximum number of characters, starting from the first letter of the unmatched part of the spelling letter string, intercept a sub-letter string with the number of letters equal to the maximum number of characters;

[0024] Use all the letters of the sub-letter string to match with the pinyin combination corresponding to the English name pinyin rule matching model;

[0025] If the target pinyin combination is not matched in the sub-letter string, then starting from the end of the sub-letter string, reduce the letters one by one. Each sub-letter string after reducing one letter is matched with the pinyin combination corresponding to the English name pinyin rule matching model once until the target pinyin combination is matched, or until the sub-letter string is reduced to no letters and then stop the matching.

[0026] Further,

[0027] Obtain the passenger's English name, and determine the number and specific content of the letters in the spelling letter string of the passenger's English name;

[0028] Starting from the front section of the unmatched part, the spelling letter string is matched with the pinyin combination corresponding to the English name pinyin rule matching model. If the corresponding pinyin combination cannot be matched, then stop the matching, and the passenger's English name fails to match the English name pinyin rule matching model.

[0029] Further,

[0030] If the passenger's English name only matches one English name pinyin rule matching model successfully, then the passenger's place of origin corresponding to the passenger's English name is the place of origin corresponding to the successfully matched English name pinyin rule matching model;

[0031] If the passenger's English name matches two or more English name pinyin rule matching models successfully, then combine the passenger's historical information to determine the passenger's place of origin; the passenger's historical information includes: the number of ticket bookings of the passenger's English name in each place of origin.

[0032] Further,

[0033] Obtain the place of origin corresponding to the passenger's English name in the historical order through the ticket reservation system;

[0034] Based on the place of origin corresponding to the passenger's English name in the historical order, count the number of ticket bookings of the same passenger's English name in each place of origin;

[0035] Select the place of origin of the passenger with the largest number of bookings for the same English name of the passenger as the place of origin corresponding to the English name of the passenger.

[0036] In a second aspect, based on the same inventive concept, an embodiment of the present disclosure further provides a passenger place of origin determination system, which includes: a matching model establishment module, a name matching module, and a place of origin determination module. The matching model establishment module is used to establish a corresponding Chinese pinyin rule matching model for English names according to the place of origin of the passenger, and one Chinese pinyin rule matching model for English names corresponds to one place of origin of the passenger. The name matching module is used to match the English name of the passenger with all Chinese pinyin rule matching models for English names. The place of origin determination module is used to determine the place of origin corresponding to the English name of the passenger according to the matching result between the English name of the passenger and the Chinese pinyin rule matching model for English names.

[0037] In a third aspect, based on the same inventive concept, an embodiment of the present disclosure further provides a computer-readable storage medium storing one or more programs, which when executed, can implement the foregoing passenger place of origin determination method.

[0038] In a fourth aspect, based on the same inventive concept, an embodiment of the present disclosure further provides an electronic device, including a processor, a communication interface, the foregoing computer-readable storage medium, and a communication bus; wherein, the processor, the communication interface, and the computer-readable storage medium communicate with each other through the communication bus; wherein, the processor is used to execute the program stored in the foregoing computer-readable storage medium.

[0039] Compared with the prior art, the present disclosure has the following advantages:

[0040] 1. Based on the pinyin schemes used in different passenger places of origin, directly match the place of origin of the passenger. And when multiple places of origin of the passenger are matched, the only place of origin corresponding to the English name of the passenger can be selected by counting the number of bookings of the English name of the passenger in each place of origin of the passenger;

[0041] 2. The algorithm is simple, the calculation is fast, and when establishing the Chinese pinyin rule matching model for English names, it does not depend on a large number of data samples.

[0042] Other features and advantages of the present disclosure will be described in the following description, and in part, will be obvious from the description, or will be understood by implementing the present disclosure. The objectives and other advantages of the present disclosure can be achieved and obtained through the structures pointed out in the description, the claims, and the drawings. Description of the Drawings

[0043] To more clearly illustrate the technical solutions in the embodiments of the present disclosure or the prior art, the following will briefly introduce the accompanying drawings required for the description of the embodiments or the prior art. Obviously, the accompanying drawings in the following description are some embodiments of the present disclosure. For those of ordinary skill in the art, without creative efforts, other accompanying drawings can be obtained based on these drawings.

[0044] Figure 1 Flowchart of a method for determining the origin of passengers provided by an embodiment of the present disclosure;

[0045] Figure 2 Another flowchart of a method for determining the origin of passengers provided by an embodiment of the present disclosure;

[0046] Figure 3 Another flowchart of a method for determining the origin of passengers provided by an embodiment of the present disclosure;

[0047] Figure 4 Block diagram of a system for determining the origin of passengers provided by an embodiment of the present disclosure. Detailed implementation manners

[0048] To make the objectives, technical solutions, and advantages of the embodiments of the present disclosure clearer, the following will clearly and completely describe the technical solutions in the embodiments of the present disclosure with reference to the accompanying drawings in the embodiments of the present disclosure. Obviously, the described embodiments are some, but not all, of the embodiments of the present disclosure. All other embodiments obtained by those of ordinary skill in the art based on the embodiments of the present disclosure without creative efforts fall within the scope of protection of the present disclosure.

[0049] First aspect, Figure 1 A flowchart of a method for determining the origin of passengers provided by an embodiment of the present disclosure, as Figure 1 shown, an embodiment of the present disclosure provides a method for determining the origin of passengers, including:

[0050] S1: According to the origin of the passenger, establish a corresponding Chinese pinyin rule matching model for English names, and one Chinese pinyin rule matching model for English names corresponds to one passenger origin.

[0051] S2: Match the passenger's English name with all Chinese pinyin rule matching models for English names.

[0052] S3: Determine the passenger origin corresponding to the passenger's English name according to the matching result of the passenger's English name and the Chinese pinyin rule matching model for English names.

[0053] In the embodiments of the present disclosure, in order to determine whether the place of origin corresponding to a passenger's English name is any one of the Chinese Pinyin rule region, the First Wade-Giles Pinyin rule region, and the Second Wade-Giles Pinyin rule region based on the passenger's English name, three English name Chinese Pinyin rule matching models corresponding one by one to the Chinese Pinyin rule region, the First Wade-Giles Pinyin rule region, and the Second Wade-Giles Pinyin rule region are established. The passenger's English name is input into the three English name Chinese Pinyin rule matching models for matching, and based on the matching results, the place of origin corresponding to the passenger's English name is determined.

[0054] In some examples, according to the place of origin of the passenger, a corresponding English name Chinese Pinyin rule matching model is established, and one English name Chinese Pinyin rule matching model corresponds to one place of origin of the passenger, specifically including:

[0055] S11: According to the pinyin scheme of the place of origin corresponding to the English name Chinese Pinyin rule matching model, generate all pinyin combinations, and determine the number of characters and syllables corresponding to all pinyin combinations.

[0056] S12: All pinyin combinations with the same number of syllables are arranged in descending order according to the number of characters corresponding to the pinyin combination.

[0057] Specifically, in the Chinese Pinyin rule region, the First Wade-Giles Pinyin rule region, and the Second Wade-Giles Pinyin rule region, the pinyin methods are different. The Chinese Pinyin rule region adopts the Chinese Pinyin scheme, the First Wade-Giles Pinyin rule region adopts the First Wade-Giles Pinyin scheme, and the Second Wade-Giles Pinyin rule region adopts the Second Wade-Giles Pinyin scheme, which in turn leads to different spellings of the English name used when booking tickets. Therefore, three English name Chinese Pinyin rule matching models need to be established respectively to match the passenger's English name. When establishing the English name Chinese Pinyin rule matching model, all pinyin combinations can be traversed and arranged in a table according to the number of characters corresponding to the pinyin combination.

[0058] In some examples, matching the passenger's English name with all English name Chinese Pinyin rule matching models specifically includes:

[0059] S21: Obtain the passenger's English name, and determine the number of letters and the specific content of the letter string of the spelling of the passenger's English name.

[0060] Specifically, obtain the passenger's English name, determine the letter string of the spelling of the passenger's English name, process the letter string of the spelling. If there are spaces or symbols in the letter string of the spelling, remove the spaces and symbols, and only retain the letter part, and determine the number of letters and the specific content of the processed letter string of the spelling.

[0061] S22: Starting from the front segment of the unmatched part of the spelling letter string, match it with the corresponding pinyin combinations of the pinyin combination matching model for the Chinese phonetic transcription rules of English names. Among the successfully matched pinyin combinations, the pinyin combination with the largest number of characters is determined as the target pinyin combination.

[0062] Specifically, if the number of letters in the spelling letter string is greater than the maximum number of characters in the corresponding pinyin combination of the pinyin combination matching model for the Chinese phonetic transcription rules of English names, the spelling letter string can be intercepted from the first letter to obtain a sub-letter string with the number of letters equal to the maximum number of characters, and the sub-letter string is used to match the corresponding pinyin combination of the pinyin combination matching model for the Chinese phonetic transcription rules of English names. If the number of letters in the spelling letter string is less than or equal to the maximum number of characters in the corresponding pinyin combination of the pinyin combination matching model for the Chinese phonetic transcription rules of English names, the spelling letter string is directly used to match the corresponding pinyin combination of the pinyin combination matching model for the Chinese phonetic transcription rules of English names. The spelling letter string is matched with the corresponding pinyin combination of the pinyin combination matching model for the Chinese phonetic transcription rules of English names in the order from front to back, that is, the writing habit of the Chinese name is used to confirm the pinyin combination in the order from surname to given name. Starting from the first letter of the spelling letter string, letters can be added one by one to determine the successfully matched pinyin combination, and among the successfully matched pinyin combinations, the pinyin combination with the largest number of characters is determined as the target pinyin combination.

[0063] S23: Remove the target pinyin combination from the front segment of the spelling letter string, retain the unmatched part of the spelling letter string, and continue to match it with the corresponding pinyin combination of the pinyin combination matching model for the Chinese phonetic transcription rules of English names until all the letters in the spelling letter string are matched, and the matching result of the passenger's English name and the pinyin combination matching model for the Chinese phonetic transcription rules of English names is determined.

[0064] Specifically, remove the target pinyin combination from the front segment of the spelling letter string, retain the unmatched part of the spelling letter string, and continue to match it with the corresponding pinyin combination of the pinyin combination matching model for the Chinese phonetic transcription rules of English names, and so on until all the letters in the spelling letter string are matched. When the spelling letter string exactly corresponds to multiple target pinyin combinations and there are no extra letters, it can be regarded as a successful match.

[0065] It should be understood that regardless of the Chinese names in which region, the number of characters in the Chinese name has certain limitations. When there is only one target pinyin combination matched for a passenger's English name or the number of matched target pinyin combinations is too large, it may not be a Chinese name, so it can be determined as a failed match.

[0066] In some examples, starting from the front segment of the unmatched part of the spelling letter string, match it with the corresponding pinyin combinations of the pinyin combination matching model for the Chinese phonetic transcription rules of English names. Among the successfully matched pinyin combinations, the pinyin combination with the largest number of characters is determined as the target pinyin combination, specifically including:

[0067] S221: Determine the maximum number of characters in the pinyin combination corresponding to the English name pinyin rule matching model. If the number of letters in the spelling letter string of the passenger's English name is greater than the maximum number of characters, starting from the first letter of the unmatched part of the spelling letter string, intercept a sub-letter string with the number of letters equal to the maximum number of characters.

[0068] S222: Use all or part of the letters starting from the first letter of the sub-letter string to match with the pinyin combination corresponding to the English name pinyin rule matching model.

[0069] S223: If multiple pinyin combinations are matched by the sub-letter string, select the pinyin combination with the largest number of characters among the multiple matched pinyin combinations as the target pinyin combination.

[0070] Specifically, starting from the first letter of the spelling letter string, gradually increase the number of letters to determine the successfully matched pinyin combination. Select the pinyin combination with the largest number of characters among the successfully matched pinyin combinations as the target pinyin combination. It can be understood that the successfully matched pinyin combinations can be cached in the system or register, and no further limitation is made here.

[0071] In some examples, starting from the front section of the unmatched part of the spelling letter string, match with the pinyin combination corresponding to the English name pinyin rule matching model. Among the successfully matched pinyin combinations, select the pinyin combination with the largest number of characters as the target pinyin combination, specifically including:

[0072] S221’: Determine the maximum number of characters in the pinyin combination corresponding to the English name pinyin rule matching model. If the number of letters in the spelling letter string of the passenger's English name is greater than the maximum number of characters, starting from the first letter of the unmatched part of the spelling letter string, intercept a sub-letter string with the number of letters equal to the maximum number of characters.

[0073] S222’: Use all the letters of the sub-letter string to match with the pinyin combination corresponding to the English name pinyin rule matching model.

[0074] S223’: If the target pinyin combination is not matched by the sub-letter string, then starting from the end of the sub-letter string, gradually reduce the number of letters. Each sub-letter string after reducing one letter is matched with the pinyin combination corresponding to the English name pinyin rule matching model once until the target pinyin combination is matched, or until the sub-letter string is reduced to no letters and then stop matching.

[0075] Specifically, starting from the first letter of the spelling letter string, a sub-letter string with the number of letters equal to the maximum number of characters is intercepted. The complete sub-letter string is matched with the corresponding pinyin combination of the English name Chinese pinyin rule matching model. If the complete sub-letter string fails to match the target pinyin combination, each time one letter is reduced, it is matched with the pinyin combination corresponding to the first matching model until the target pinyin combination is matched, or until the sub-letter string is reduced to no letters, then the matching stops. Through this method, a pinyin combination with the maximum number of characters and successful matching can be directly determined, eliminating the process of selecting from multiple matching results, saving computing time and storage space.

[0076] It should be understood that the interception starts from the end of the sub-letter string to ensure that the first letter of the sub-letter string is the first letter of the spelling letter string or the remaining spelling letter string that has not been matched. The sub-letter string is only used for description here. During the process of system practice for matching, the sub-letter string may not be generated, and no additional computing process will be generated.

[0077] In some examples, matching the English name of the passenger with all English name Chinese pinyin rule matching models specifically includes:

[0078] S21: Obtain the English name of the passenger, and determine the number of letters and specific content of the spelling letter string of the English name of the passenger.

[0079] S22’: Starting from the front section of the unmatched part of the spelling letter string, match it with the corresponding pinyin combination of the English name Chinese pinyin rule matching model. If the corresponding pinyin combination cannot be matched, then stop the matching, and the English name of the passenger fails to match the English name Chinese pinyin rule matching model.

[0080] Specifically, during the process of matching the spelling letter string with the English name Chinese pinyin rule matching model, when there is a part of the spelling letter string that cannot be matched with the pinyin combination in the English name Chinese pinyin rule matching model, the English name of the passenger is regarded as a failed match with the English name Chinese pinyin rule matching model.

[0081] In some examples, according to the matching result of the English name of the passenger and the English name Chinese pinyin rule matching model, determine the passenger's place of origin corresponding to the English name of the passenger, specifically including:

[0082] S31: If the English name of the passenger only matches one English name Chinese pinyin rule matching model successfully, then the passenger's place of origin corresponding to the English name of the passenger is the passenger's place of origin corresponding to the successfully matched English name Chinese pinyin rule matching model.

[0083] S32: If the English name of the passenger matches successfully with two or more English name Chinese pinyin rule matching models, then combine the passenger's historical information to determine the passenger's place of origin; the passenger's historical information includes: the number of ticket bookings of the passenger's English name in each passenger's place of origin.

[0084] Specifically, since the English name of the passenger may be matched with multiple English name Chinese pinyin rule matching models, three situations may occur. First, the English name of the passenger fails to match with all multiple English name Chinese pinyin rule matching models, and the English name of the passenger is not any of the passenger's places of origin corresponding to each English name Chinese pinyin rule matching model; second, the English name of the passenger only matches successfully with one English name Chinese pinyin rule matching model, then the passenger's place of origin corresponding to the English name of the passenger is the passenger's place of origin corresponding to the English name Chinese pinyin rule matching model that matches successfully; third, the English name of the passenger matches successfully with two or more English name Chinese pinyin rule matching models. At this time, it is necessary to combine the passenger's historical information to determine the passenger's place of origin. The passenger's historical information includes: the number of ticket bookings of the passenger's English name in each passenger's place of origin.

[0085] In some examples, if the English name of the passenger matches successfully with two or more English name Chinese pinyin rule matching models, then combine the passenger's historical information to determine the passenger's place of origin, specifically including:

[0086] S321: Obtain the passenger's place of origin corresponding to the English name of the passenger in the historical order through the ticket reservation system.

[0087] S322: Based on the passenger's place of origin corresponding to the English name of the passenger in the historical order, count the number of ticket bookings of the same English name of the passenger in each passenger's place of origin.

[0088] S323: Select the passenger's place of origin with the largest number of ticket bookings of the same English name of the passenger as the passenger's place of origin corresponding to the English name of the passenger.

[0089] In the method for determining the passenger's place of origin provided in the embodiments of the present disclosure, by establishing an English name Chinese pinyin rule matching model, the English name of the passenger is matched with the English name Chinese pinyin rule matching model, and the passenger's place of origin corresponding to the English name of the passenger is determined according to the matching result. The method for determining the passenger's place of origin provided in the embodiments of the present disclosure can directly match the passenger's place of origin based on the pinyin schemes used in different passenger's places of origin; when multiple passenger's places of origin are matched, the only passenger's place of origin corresponding to the English name of the passenger can be selected by counting the number of ticket bookings of the English name of the passenger in each passenger's place of origin. The method for determining the passenger's place of origin provided in the embodiments of the present disclosure has a simple algorithm, fast calculation, and does not rely on a large number of data samples when establishing the English name Chinese pinyin rule matching model.

[0090] In the embodiments of the present disclosure, the process of determining the origin of a passenger using the passenger's English name is mainly described using the Chinese names of Chinese and Chinese - origin passengers. In actual use, the origin of a passenger determined using the passenger's English name can be other countries or regions. When establishing a matching model for the Chinese - phonetic - alphabet rules of English names, the pinyin scheme can be adjusted to the pinyin scheme, syllable scheme, or spelling scheme of the languages used in other countries or regions.

[0091] It should be understood that when determining the origin of a passenger through the passenger's English name in the present disclosure, the determined pinyin combinations based on the passenger's English name do not include tones and corresponding specific Chinese characters. Therefore, it does not collect passenger privacy and will not affect passenger privacy.

[0092] Embodiment 1:

[0093] In the embodiments of the present disclosure, taking the origin of a passenger determined through the passenger's English name including the Chinese - phonetic - alphabet rule region, the first Wade - Giles pinyin rule region, and the second Wade - Giles pinyin rule region as an example for illustration.

[0094] S101: Establish a matching model for the Chinese - phonetic - alphabet rules of English names corresponding to the origin of a passenger. The same matching model for the Chinese - phonetic - alphabet rules of English names corresponds to a unique origin of a passenger.

[0095] The matching model for the Chinese - phonetic - alphabet rules of English names includes a first matching model, a second matching model, and a third matching model. Among them, the origin of a passenger corresponding to the first matching model is the Chinese - phonetic - alphabet rule region, the origin of a passenger corresponding to the second matching model is the first Wade - Giles pinyin rule region, and the origin of a passenger corresponding to the third matching model is the second Wade - Giles pinyin rule region. The pinyin methods in the Chinese - phonetic - alphabet rule region, the first Wade - Giles pinyin rule region, and the second Wade - Giles pinyin rule region are different. The Chinese - phonetic - alphabet rule region adopts the Chinese - pinyin scheme, the first Wade - Giles pinyin rule region adopts the first Wade - Giles pinyin scheme, and the second Wade - Giles pinyin rule region adopts the second Wade - Giles pinyin scheme. As a result, the spelling of the English name used for booking tickets will also be different. Therefore, three models need to be established to match the passenger's English name.

[0096] Taking the establishment of the first matching model as an example for specific illustration.

[0097] Step a: Generate all pinyin combinations according to the Chinese - pinyin scheme adopted by the Chinese - phonetic - alphabet rule region, and determine the number of characters corresponding to all pinyin combinations.

[0098] Step b: For all pinyin combinations with the same number of syllables, arrange each pinyin combination in a traversal order from largest to smallest according to the number of characters corresponding to the pinyin combination; all pinyin combinations can be arranged in a traversal order according to the number of characters corresponding to the pinyin combination in the form of a table.

[0099] Table 1 is the first pinyin combination table corresponding to the first matching model. As shown in Table 1, the pinyin combination table includes the number of characters of English letters, the pinyin combinations of the Chinese pinyin scheme, and the number of syllables of the pinyin combinations. For all pinyin combinations with the same number of syllables, the pinyin combinations are integrated according to the number of characters corresponding to the pinyin combinations, and all pinyin combinations are traversed and arranged from largest to smallest according to the number of characters corresponding to the pinyin combinations. Considering the special cases of pinyin combinations, the number of syllables of some pinyin combinations is two. For example, xua, cua, zua, corresponding to Xu A, Cu A, Zu A, etc. To consider the occurrence of this situation, the pinyin combinations with two or more syllables are arranged at the end of the pinyin combination table.

[0100] It can be understood that the second matching model can correspondingly generate a second pinyin combination table, which includes the number of characters of English letters, the pinyin combinations of the first Wade-Giles pinyin scheme, and the number of syllables of the pinyin combinations; the third matching model can correspondingly generate a third pinyin combination table, which includes the number of characters of English letters, the pinyin combinations of the second Wade-Giles pinyin scheme, and the number of syllables of the pinyin combinations. Generating the pinyin combination table is not a necessary procedure, and other methods can be used to traverse and arrange each pinyin combination from largest to smallest according to the number of characters corresponding to the pinyin combination.

[0101]

[0102] Table 1

[0103] It should be understood that the English name Chinese pinyin rule matching model must determine all pinyin combinations. Since there are cultural differences and customs in different regions, when determining all pinyin combinations, special cases need to be considered. For example, the last two rows in Table 1 are not pinyin combinations in the traditional sense. In order to avoid ignoring special Chinese names caused by different cultural differences and customs during the name matching process, some non-traditional pinyin combinations can be added to the English name Chinese pinyin rule matching model.

[0104] S102: Obtain the basic information of the passenger, determine the English name of the passenger, and input the English name of the passenger into all English name Chinese pinyin rule matching models.

[0105] Through the ticket reservation system, obtain the basic information of the passenger. The basic information of the passenger includes the English name of the passenger. After determining the English name of the passenger, input the English name of the passenger into all English name Chinese pinyin rule matching models. In the embodiments of the present disclosure, it includes the first matching model, the second matching model, and the third matching model, and input the English name of the passenger into the first matching model, the second matching model, and the third matching model.

[0106] S103: Match the English names of passengers with all the English name Chinese pinyin rule matching models to obtain the matching results of each passenger's English name and the English name Chinese pinyin rule matching model.

[0107] As Figure 2 shown, continue to take the first matching model as an example for specific illustration.

[0108] Step a: Obtain the English name of the passenger and determine the number and specific content of the letters in the spelling letter string of the English name of the passenger.

[0109] Step b: Starting from the front segment of the un-matched part of the spelling letter string, match it with the pinyin combinations in the first pinyin combination table corresponding to the first matching model. If there is a successfully matched pinyin combination, select the pinyin combination with the largest number of characters among the successfully matched pinyin combinations as the target pinyin combination.

[0110] At the first match, the un-matched part of the spelling letter string is the original complete spelling letter string. It can be seen from the first pinyin combination table corresponding to the first matching model that among the pinyin combinations, the pinyin combination with the largest number of characters includes 6 letters. If the number of letters in the spelling letter string is greater than 6, start from the first letter of the spelling letter string and intercept a sub-letter string including 6 letters. All the letters and partial letters starting from the first position of the sub-letter string are matched with the spelling combinations in the first pinyin combination table. You can start from the first letter of the spelling letter string and gradually add letters to determine the successfully matched pinyin combinations, and select the pinyin combination with the largest number of characters among the successfully matched pinyin combinations as the target pinyin combination. For example: the successfully matched pinyin combinations include zhang, zhan, zha, and zhang is selected as the target pinyin combination. If the number of letters in the spelling letter string is less than 6, then use the complete spelling letter string to match the pinyin combinations in the first pinyin combination table corresponding to the first matching model. You can start from the first letter of the spelling letter string and gradually add letters to determine the successfully matched pinyin combinations, and select the pinyin combination with the largest number of characters among the successfully matched pinyin combinations as the target pinyin combination. During this process, the successfully matched pinyin combinations can be cached in the system or register. Similarly, the determined target pinyin combinations can also be cached in the system or register.

[0111] Step c: After removing the target pinyin combination from the spelling letter string, starting from the front segment of the un-matched part of the spelling letter string, match it with the pinyin combinations in the first pinyin combination table corresponding to the first matching model. If there is a successfully matched pinyin combination, select the pinyin combination with the largest number of characters among the successfully matched pinyin combinations as the target pinyin combination. For example: After removing zhang from the front segment of the spelling letter string, repeat step b for the un-matched part of the spelling letter string to determine the next target pinyin combination. Repeat step c until all the letters in the spelling letter string are matched.

[0112] In step b and step c, if it is impossible to determine the target matching model in any one of these steps, it is determined that the English name of the passenger fails to match the first matching model.

[0113] Furthermore, in step b and step c, when matching the spelling letter string with the pinyin combinations in the first pinyin combination table corresponding to the first matching model, it can also be: according to the maximum number of characters in the pinyin combination corresponding to the first matching model, starting from the first letter of the spelling letter string, intercept a sub-letter string including the number of letters equal to the maximum number of characters, and match all the letters in the sub-letter string with the pinyin combinations corresponding to the first matching model. If the complete sub-letter string fails to match the target pinyin combination, then starting from the end of the sub-letter string, reduce one letter at a time. Each time a letter is reduced, match it with the pinyin combinations corresponding to the first matching model until a successful match is found, or the sub-letter string is reduced to no letters and the matching stops, and it is determined that the English name of the passenger fails to match the first matching model.

[0114] Specifically, the maximum number of characters in the pinyin combination corresponding to the first matching model is 6. Starting from the first letter of the spelling letter string, intercept a sub-letter string of 6 letters and match it with the pinyin combinations corresponding to the first matching model. If the complete sub-letter string fails to match the target pinyin combination, then starting from the end of the sub-letter string, reduce one letter. At this time, the number of letters in the sub-letter string is 5. Then match it again with the pinyin combinations corresponding to the first matching model, and so on, until a successfully matched pinyin combination is determined, or the sub-letter string is reduced to 0 letters and the matching stops, and it is determined that the English name of the passenger fails to match the first matching model. Through this method, a pinyin combination with the largest number of characters and a successful match can be directly determined, saving the process of selecting from multiple matching results and saving computing time and storage space.

[0115] It is understandable that intercepting from the end of the sub-letter string ensures that the first letter of the sub-letter string is the first letter of the spelling letter string or the remaining spelling letter string that has not been matched. The sub-letter string is only used for description here. During the actual matching process of the system, the sub-letter string may not be generated, and no additional computing process will be generated.

[0116] Further, continuing with the first matching model as an example, if the last letter of the target pinyin combination is 'n' or 'g', it is necessary to determine whether the first letter of the unmatched part of the pinyin letter string is any one of 'a', 'e', 'i', 'o', 'u'; if the first letter of the unmatched part of the pinyin letter string is any one of 'a', 'e', 'i', 'o', 'u', then it is necessary to determine whether, when 'n' or 'g' is used as the first letter of the unmatched part of the pinyin letter string, a successfully matched pinyin combination can be obtained. If, when 'n' or 'g' is used as the first letter of the unmatched part of the pinyin letter string, a successfully matched pinyin combination can be obtained, and moreover, after removing 'n' or 'g' from the original target pinyin combination, there exists a pinyin combination, then remove the last letter 'n' or 'g' from the original target pinyin combination to determine the new target pinyin combination, and use 'n' or 'g' as the first letter of the unmatched part of the pinyin letter string for subsequent matching.

[0117] In the embodiments of the present disclosure, in steps b and c, there are parts of the spelling letter string that cannot be matched with the pinyin combinations in the first pinyin combination table corresponding to the first matching model, that is, only part of the spelling letter string can be successfully matched with the pinyin combinations in the first pinyin combination table, and there are some letters that cannot be matched, then it is regarded that the passenger's English name fails to match the first matching model and the matching is not completed. Furthermore, the place of origin of the passenger corresponding to this passenger's English name is not the Chinese pinyin rule area corresponding to the first matching model.

[0118] Further, continuing with the first matching model and the Chinese pinyin rule area as an example, the names of Han people usually consist of 2 to 3 Chinese characters. Considering the extremely rare cases of compound surnames or the use of both parents' surnames, Chinese names generally do not exceed 4 Chinese characters. Also, since the number of syllables in the Chinese pinyin of each Chinese character is 1. For the spelling letter string corresponding to the passenger's English name, if four or fewer target pinyin combinations are matched, that is, when the pinyin combinations of four Chinese characters are determined, it can be determined that this passenger is probably of Han ethnicity.

[0119] It can be understood that the number of corresponding Chinese character pinyin combinations can be determined through the number of target pinyin combinations that can be matched from the passenger's English name, and then the passenger's English names in non-Chinese pinyin rule areas, the first Wade-Giles pinyin rule area, and the second Wade-Giles pinyin rule area can be screened out.

[0120] In the embodiments of the present disclosure, there are a first matching model, a second matching model, and a third matching model. After obtaining the passenger's English name and determining the number and specific content of the letters in the spelling letter string of the passenger's English name, all three matching models perform matching and determine the matching results. The matching results include successful matching and failed matching.

[0121] S104: Determine the place of origin of the passenger corresponding to the passenger's English name according to the matching results of the passenger's English name and each English name Chinese pinyin rule matching model.

[0122] Such asFigure 3 As shown, if the matching results of the passenger's English name with the first matching model, the second matching model, and the third matching model are all matching failures, it indicates that the passenger's place of origin corresponding to this passenger's English name is not a region with Chinese Pinyin rules, the first Wade-Giles Pinyin rules region, and the second Wade-Giles Pinyin rules region.

[0123] If the passenger's English name only matches successfully with the first matching model, the passenger's place of origin corresponding to the passenger's English name is a region with Chinese Pinyin rules. If the passenger's English name only matches successfully with the second matching model, the passenger's place of origin corresponding to the passenger's English name is the first Wade-Giles Pinyin rules region. If the passenger's English name only matches successfully with the third matching model, the passenger's place of origin corresponding to the passenger's English name is the second Wade-Giles Pinyin rules region.

[0124] If the spelling letter string of the passenger's English name matches successfully with two or more of the first matching model, the second matching model, and the third matching model, the passenger's place of origin is determined in combination with the passenger's historical information. The passenger's historical information includes: the booking quantity of the passenger's English name in each passenger's place of origin.

[0125] The acquisition method of the passenger's historical information can be to collect historical orders through the ticket reservation system, obtain information such as the passenger's English name, the passenger's place of origin, and the number of people in the historical orders; based on the information such as the passenger's English name, the passenger's place of origin, and the number of people in the historical orders, count the booking quantity of the passenger's English name in each passenger's place of origin; select the passenger's place of origin with the largest booking quantity of the same passenger's English name as the passenger's place of origin corresponding to the passenger's English name; for example, if the same passenger's English name matches successfully with the first matching model, the second matching model, and the third matching model at the same time, count the booking quantity of this passenger's English name in the region with Chinese Pinyin rules, the first Wade-Giles Pinyin rules region, and the second Wade-Giles Pinyin rules region respectively, and select the passenger's place of origin with the largest booking quantity of this passenger's English name as the passenger's place of origin corresponding to this passenger's English name.

[0126] Furthermore, a probability statistical table can be made according to the passenger's English name and the passenger's place of origin. The probability statistical table includes the passenger's English name, the passenger's place of origin, and the name attribution probability corresponding to the passenger's place of origin.

[0127] In the embodiments of the present disclosure, taking the regions with Chinese Pinyin rules, the first Wade-Giles Pinyin rules region, and the second Wade-Giles Pinyin rules region as examples of the passenger's place of origin, the booking quantities of the same passenger's English name in the regions with Chinese Pinyin rules, the first Wade-Giles Pinyin rules region, and the second Wade-Giles Pinyin rules region are respectively confirmed. Taking the region with Chinese Pinyin rules as an example for the calculation method of the name attribution probability, the name attribution probability in the region with Chinese Pinyin rules = (the booking quantity of the same passenger's English name in the region with Chinese Pinyin rules) / (the total booking quantity of the same passenger's English name in the regions with Chinese Pinyin rules, the first Wade-Giles Pinyin rules region, and the second Wade-Giles Pinyin rules region).

[0128] In a second aspect, Figure 4 FIG. is a block diagram of a passenger place of origin determination system provided by an embodiment of the present disclosure. As Figure 4 shown, based on the same inventive concept, an embodiment of the present disclosure further provides a passenger place of origin determination system. The system includes: a matching model establishment module, a name matching module, and a place of origin determination module. The matching model establishment module is used to establish a corresponding Chinese Pinyin rule matching model for English names according to the passenger's place of origin, and one Chinese Pinyin rule matching model for English names corresponds to one passenger's place of origin. The name matching module is used to match the passenger's English name with all Chinese Pinyin rule matching models for English names. The place of origin determination module is used to determine the passenger's place of origin corresponding to the passenger's English name according to the matching result between the passenger's English name and the Chinese Pinyin rule matching model for English names.

[0129] In a third aspect, based on the same inventive concept, an embodiment of the present disclosure further provides a computer-readable storage medium storing one or more programs, which can implement the aforementioned passenger place of origin determination method when the one or more programs are executed.

[0130] In a fourth aspect, based on the same inventive concept, an embodiment of the present disclosure further provides an electronic device, including a processor, a communication interface, the aforementioned computer-readable storage medium, and a communication bus. Among them, the processor, the communication interface, and the computer-readable storage medium communicate with each other through the communication bus. Among them, the processor is used to execute the program stored in the aforementioned computer-readable storage medium.

[0131] It should be noted that the electrical connections between the above-mentioned various units do not necessarily represent direct connections between the lines. Indirect connection methods can be applied to the embodiments of the present disclosure as long as the purpose of the present disclosure is achieved.

[0132] Although the present disclosure has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that they can still modify the technical solutions described in the foregoing embodiments or perform equivalent replacements for some of the technical features; and these modifications or replacements do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present disclosure.

Claims

1. A method for determining the origin of passengers, characterized in that, The method includes: Establish a corresponding Chinese Pinyin rule matching model for English names according to the passenger's place of origin, and one such Chinese Pinyin rule matching model for English names corresponds to one passenger's place of origin; Match the passenger's English name with all the Chinese Pinyin rule matching models for English names; Determine the passenger's place of origin corresponding to the passenger's English name according to the matching result of the passenger's English name and the Chinese Pinyin rule matching model for English names.

2. The method according to claim 1, characterized in that, The step of establishing a corresponding Chinese Pinyin rule matching model for English names according to the passenger's place of origin, where one Chinese Pinyin rule matching model for English names corresponds to one passenger's place of origin, includes: Generate all Pinyin combinations according to the Pinyin scheme of the passenger's place of origin corresponding to the Chinese Pinyin rule matching model for English names, and determine the number of characters and syllables corresponding to all the Pinyin combinations; Arrange all the Pinyin combinations with the same number of syllables in descending order according to the number of characters corresponding to the Pinyin combination.

3. The method according to claim 1, characterized in that The step of matching the passenger's English name with all the Chinese Pinyin rule matching models for English names includes: Obtain the passenger's English name and determine the number and specific content of the letters in the spelling letter string of the passenger's English name; Starting from the front section of the unmatched part of the spelling letter string, match it with the Pinyin combination corresponding to the Chinese Pinyin rule matching model for English names. Among the successfully matched Pinyin combinations, the Pinyin combination with the largest number of characters is determined as the target Pinyin combination; Remove the target Pinyin combination from the front section of the spelling letter string, retain the remaining unmatched part of the spelling letter string, and continue to match it with the Pinyin combination corresponding to the Chinese Pinyin rule matching model for English names until all the letters in the spelling letter string are matched, and determine the matching result of the passenger's English name and the Chinese Pinyin rule matching model for English names.

4. The method according to claim 3, wherein The step of starting from the front section of the unmatched part of the spelling letter string, matching it with the Pinyin combination corresponding to the Chinese Pinyin rule matching model for English names, and determining the Pinyin combination with the largest number of characters among the successfully matched Pinyin combinations as the target Pinyin combination includes: Determine the maximum number of characters in the Pinyin combination corresponding to the Chinese Pinyin rule matching model for English names. If the number of letters in the spelling letter string of the passenger's English name is greater than the maximum number of characters, start from the first letter of the unmatched part of the spelling letter string and intercept a sub-letter string with the number of letters equal to the maximum number of characters; Use all or part of the letters starting from the first letter of the sub-letter string to match with the Pinyin combination corresponding to the Chinese Pinyin rule matching model for English names; If the sub-letter string matches multiple Pinyin combinations, select the Pinyin combination with the largest number of characters among the multiple matched Pinyin combinations as the target Pinyin combination.

5. The method according to claim 3, wherein The step of starting from the front section of the unmatched part of the spelling letter string, matching it with the Pinyin combination corresponding to the Chinese Pinyin rule matching model for English names, and determining the Pinyin combination with the largest number of characters among the successfully matched Pinyin combinations as the target Pinyin combination includes: Determine the maximum number of characters of the pinyin combination corresponding to the English name Chinese pinyin rule matching model. If the number of letters in the spelling letter string of the passenger's English name is greater than the maximum number of characters, starting from the first letter of the unmatched part of the spelling letter string, intercept a sub-letter string with the number of letters equal to the maximum number of characters; Use all the letters of the sub-letter string to match with the pinyin combination corresponding to the English name Chinese pinyin rule matching model; If the target pinyin combination is not matched in the sub-letter string, starting from the end of the sub-letter string, reduce the letters one by one. Each sub-letter string after reducing one letter is matched with the pinyin combination corresponding to the English name Chinese pinyin rule matching model once until the target pinyin combination is matched or the sub-letter string is reduced to no letters, then stop the matching.

6. The method according to claim 1, characterized in that, The matching of the passenger's English name with all English name Chinese pinyin rule matching models includes: Obtain the passenger's English name, and determine the number and specific content of the letters in the spelling letter string of the passenger's English name; Starting from the front of the unmatched part, the spelling letter string is matched with the pinyin combination corresponding to the English name Chinese pinyin rule matching model. If the corresponding pinyin combination cannot be matched, stop the matching, and the passenger's English name fails to match the English name Chinese pinyin rule matching model.

7. The method according to claim 1, wherein Determining the passenger's place of origin corresponding to the passenger's English name according to the matching result of the passenger's English name and the English name Chinese pinyin rule matching model includes: If the passenger's English name only matches successfully with one English name Chinese pinyin rule matching model, the passenger's place of origin corresponding to the passenger's English name is the place of origin corresponding to the English name Chinese pinyin rule matching model that matches successfully; If the passenger's English name matches successfully with two or more English name Chinese pinyin rule matching models, combine the passenger's historical information to determine the place of origin; the passenger's historical information includes: the number of ticket bookings of the passenger's English name in each place of origin.

8. The method according to claim 7, wherein When the passenger's English name matches successfully with two or more English name Chinese pinyin rule matching models, combining the passenger's historical information to determine the place of origin includes: Obtain the place of origin of the passenger corresponding to the passenger's English name in the historical order through the ticket reservation system; Based on the place of origin of the passenger corresponding to the passenger's English name in the historical order, count the number of ticket bookings of the same passenger's English name in each place of origin; Select the place of origin with the largest number of ticket bookings of the same passenger's English name as the place of origin corresponding to the passenger's English name.

9. A passenger origin determination system, characterized in that, The system includes: a matching model establishment module, a name matching module, and a place of origin determination module; The matching model establishment module is used to establish a corresponding English name Chinese pinyin rule matching model according to the passenger's place of origin. One English name Chinese pinyin rule matching model corresponds to one place of origin of the passenger; The name matching module is used to match the English name of the passenger with all the English name Chinese phonetic spelling rule matching models; The place of origin determination module is used to determine the place of origin of the passenger corresponding to the English name of the passenger according to the matching result of the English name of the passenger and the English name Chinese phonetic spelling rule matching model.

10. A computer-readable storage medium storing one or more programs, characterized in that when the one or more programs are executed, the passenger place of origin determination method described in any one of claims 1-8 can be implemented.

11. An electronic device, comprising a processor, a communication interface, the computer-readable storage medium according to claim 10, and a communication bus; wherein, The processor, communication interface, and computer-readable storage medium communicate with each other through a communication bus; characterized in that the processor is used to execute the programs stored in the computer-readable storage medium.

Images