JP2022077150A - Character string comparison system - Google Patents

Abstract

To provide a character string comparison system for deriving and outputting a character string that corresponds to a matching target character string and that a user has intended to input.SOLUTION: A word matching system 10 includes: an input unit 11 for acquiring a user input character string and a matching target character string; a combination generation unit 12 for generating, as a combination character string, a user input character string and a plurality of patterns of changed character strings in which at least a part of a character included in the user input character is changed; a combination score calculation unit 13 for calculating a fluctuation score between the user input character string and each combination character string based on the ease of fluctuation between characters and for determining a plurality of candidate character strings from among each combination character string based on the fluctuation score; a comparison unit 14 for deriving a candidate character string that is close to the matching target character string as an output character string; and an output unit 15 for outputting the output character string.SELECTED DRAWING: Figure 2

Description

The present invention relates to a character string comparison system.

In Document 1, a term extraction unit that extracts terms from document data, a similarity calculation unit that calculates the similarity of any pair of extracted terms, and a pair of terms based on the similarity are candidates for notational fluctuation. A notational fluctuation detection device including a notational fluctuation candidate determination unit for determining whether or not the above is described. According to such a device, notational fluctuations in the input text data are specified.

Japanese Unexamined Patent Publication No. 2012-256197

Here, for example, when matching a name or the like in a database, the character string held in the database and the input character string may not completely match, and the matching may not be possible. In such a case, for example, even if the notation fluctuation can be specified, it cannot be determined whether the character string stored in the database and the input character string can be treated as the same data, and the above-mentioned collision is performed. I can't do it properly.

The present invention has been made in view of the above circumstances, and when the character string to be matched and the character string input by the user do not match, the character string corresponding to the character string to be matched is used by the user. The purpose is to derive and output the character string that was intended to be input.

The character string comparison system according to one aspect of the present invention includes a first character string input by the user, an acquisition unit for acquiring a second character string to be matched, a first character string, and the first character string. Based on the combination generator that generates the changed character string of multiple patterns in which at least a part of the characters included in the character string is changed as a combination character string, and the easiness of fluctuation between the characters stored in advance, the first A score calculation unit that calculates a fluctuation score between one character string and each combination character string and determines a plurality of candidate character strings from each combination character string based on the fluctuation score, and a second A comparison unit that compares the character string with each candidate character string and derives the output character string so that the candidate character string having a higher degree of approximation to the second character string is more likely to be derived as an output character string. It includes an output unit that outputs an output character string.

In the character string comparison system according to one aspect of the present invention, a plurality of patterns of combined character strings in which a part of the characters included in the first character string is changed are generated, and the combined characters are considered in consideration of the easiness of fluctuation between the characters. The fluctuation score of the column is calculated, a plurality of candidate character strings are determined based on the fluctuation score, and the output character approximated to the second character string is compared between the second character string and each candidate character string. The column is derived and the output string is output. For example, when matching names in the database, the information stored in the database and the input information are different from each other (problems such as notational fluctuations and variant characters), and the above-mentioned matching cannot be performed. be. In this respect, in the character string comparison system according to one aspect of the present invention, among the combined character strings, the character string close to the second character string is regarded as the output character string. Therefore, for example, the second character string is stored in the database in advance. By keeping the correct answer data as it is held, it is possible to output the character string corresponding to the second character string even if the input first character string does not match the second character string. Therefore, the above-mentioned collision and the like can be appropriately performed. Further, in the character string comparison system according to one aspect of the present invention, a candidate character string is determined from the combined character strings in consideration of the easiness of fluctuation between characters. As a result, a character string that is likely to fluctuate is used as a candidate character string. Therefore, for example, when a user makes an erroneous input, a character string that the user is likely to have truly wanted to input should be used as a candidate character string. Can be done. According to the character string comparison system as described above, when the character string to be matched and the character string input by the user do not match, the character string corresponding to the character string to be matched is input by the user. It is possible to derive and output the character string that was intended to be.

According to the present invention, when there is an error in the input character string, the correct character string that the user really wanted to input can be output.

It is a figure explaining the outline of the word matching system which concerns on this embodiment. It is a functional block diagram of the word matching system of FIG. It is a table which shows an example of a data set. It is a figure which shows an example of the easiness of fluctuation information which is stored. It is a figure which shows an example of the fluctuation score calculation of a combination character string. It is a figure which shows an example of a conversion dictionary (fluctuation easiness information). It is a flowchart which shows the processing of the word matching system which concerns on this embodiment. It is a figure which shows the hardware composition of the word matching system which concerns on this embodiment.

Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings. In the description of the drawings, the same reference numerals are used for the same or equivalent elements, and duplicate description is omitted.

FIG. 1 is a diagram illustrating an outline of a word matching system 10 (character string comparison system) according to the present embodiment. The word matching system 10 is, for example, a system in a certain community (local government or the like) that collates information such as a name or address input by a user with these information registered in advance in a database. In the word matching system 10, when the information (character string) input by the user and the information (character string) registered in the database in advance do not match, the character string input by the user has a notational fluctuation or a variant character. Conversion (details will be described later) is performed in consideration of the possibility that the input in is generated, and it is possible to collate with the information (character string) registered in advance in the database.

As shown in FIG. 1, the word matching system 10 acquires information from the terminal 1. The terminal 1 is a communication terminal capable of accepting input from a user and capable of communicating, and is a PC, a tablet terminal, a PC, or the like installed in a community (local government). Further, the word matching system 10 acquires a character string to be matched (a character string that matches a character string input from the user) from the database 50 via the terminal 1. The database 50 is a data set for a character string to be matched. As shown in FIG. 3, the database 50 stores a plurality of character strings for each type (category). In the example shown in FIG. 3, the database 50 is a database that manages information associated with a resident's card, and the types are a resident ID, a name, an address, and a date of birth.

As shown in FIG. 1, the terminal 1 accepts input of input data (character string) from the user. The character string here is, for example, a character string for a name, an address, or the like. The terminal 1 may accept input of the type (name, address, etc.) of the character string together with the character string. Then, the terminal 1 acquires the character string to be matched from the database 50. The terminal 1 may acquire all the character strings stored in the database 50, or may acquire only the character strings of the same type as the character strings input by the user. That is, for example, when the terminal 1 accepts the input of the character string of the name from the user, the terminal 1 may acquire only the character string whose type is the name from the database 50. The acquisition of information from the database 50 by the terminal 1 may be performed based on an instruction from the word matching system 10. The terminal 1 uses a user input character string (first character string), which is a character string input from the user, and a matching target character string (second character string), which is a character string acquired from the database 50, as words. It is transmitted to the matching system 10.

The word matching system 10 accepts the input of the user input character string and the matching target character string from the terminal 1. Then, the word matching system 10 generates a plurality of patterns of changed character strings in which at least a part of the characters included in the user input character string is changed. For example, in the example shown in FIG. 5, five patterns of modified character strings "Taro Watanabe", "Taro Watanabe", "Taro Watanabe", "Taro Watanabe", and "Taro Watanabe" are generated from the user input character string "Taro Watanabe". ing. The word matching system 10 generates a user input character string and a plurality of patterns of changed character strings as a combination character string.

Then, the word matching system 10 calculates a fluctuation score between the user input character string and the combination character string based on the fluctuation easiness between the characters stored in advance, and each of them is based on the fluctuation score. Determine multiple candidate character strings from the combination character strings. The easiness of fluctuation here is the easiness of notational fluctuation between characters. In the present embodiment, the higher the ease of fluctuation between characters, the lower the fluctuation score between character strings. The word matching system 10 determines a plurality of candidate character strings so that a combination character string having a lower fluctuation score is more likely to be determined as a candidate character string.

Then, the word matching system 10 compares the matching target character string with each candidate character string, and derives the candidate character string closest to (approximate) to the matching target character string as an output character string among the candidate character strings. .. Further, the word matching system 10 derives an approximation score indicating the degree of approximation between the output character string and the matching target character string. The approximation score has input data from the user (specifically, a candidate character string derived from the user input character string in consideration of easiness of fluctuation) in the database 50 that stores the matching target character string. It is a score indicating the possibility. The word matching system 10 transmits the output character string, the fluctuation score of the output character string, and the approximation score of the output character string to the terminal 1. The terminal 1 outputs these information. When the degree of approximation score is lower than the predetermined value, the terminal 1 has input data from the user in the database 50 (specifically, a candidate character string derived from the user input character string in consideration of easiness of fluctuation). ) Does not exist, the output character string may not be output, and a notation indicating that it does not exist may be output.

Next, with reference to FIG. 2, the details of the function of the word matching system 10 will be described. FIG. 2 is a functional block diagram of the word matching system 10 of FIG. As shown in FIG. 2, the word matching system 10 has an input unit 11 (acquisition unit), a combination generation unit 12, a combination score calculation unit 13 (score calculation unit), and a comparison unit 14 as functional configurations. And an output unit 15.

The input unit 11 acquires the user input character string (first character string) input by the user and the matching target character string (second character string) to be matched from the terminal 1. The input unit 11 outputs the acquired information to the combination generation unit 12. The input unit 11 acquires only a character string having the same type as the user input character string from the database 50 (data set) in which a plurality of character strings for each type are stored in advance as the matching target character string via the terminal 1. You may. For example, the input unit 11 first acquires a user input character string, and then instructs the terminal 1 to acquire a character string of the same type as the user input character string, so that the type is the same as the user input character string. Only the character string may be acquired via the terminal 1. For example, when the data set is stored in a tabular format as in the database 50 shown in FIG. 3, the input unit 11 is a column for acquiring a character string for the terminal 1 (for example, a column of “name”). May be specified and only the character string having the same type as the user input character string may be acquired. Further, when the data set is structured but not in tabular form (for example, text line by line) or when the data set is not structured (for example, text on the Web), the input unit 11 may be used. For example, a category may be assigned to each character string by unique expression extraction, and only the character string to which a specific category is assigned may be acquired.

The combination generation unit 12 generates a user input character string and a plurality of patterns of changed character strings in which at least a part of the characters included in the user input character string is changed as a combination character string. For example, as shown in FIG. 5, when the user input character string "Taro Watanabe" is input, the combination generation unit 12 has the user input character string (1) "Taro Watanabe" and the "Taro Watanabe". 5 patterns of changed character strings that change one or two of the characters included in the character string (2) "Taro Watanabe", (3) "Taro Watanabe", (4) "Taro Watanabe", (5) "Taro Watanabe" and (6) "Taro Watanabe" are generated as a combination character string. The combination generation unit 12 outputs the combination character string to the combination score calculation unit 13.

The combination score calculation unit 13 calculates the fluctuation score between the user input character string and each combination character string based on the fluctuation easiness between the characters stored in advance, and each of them is based on the fluctuation score. Determine multiple candidate character strings from the combination character strings. The word matching system 10 stores in advance the fluctuation score between characters, which indicates the ease of fluctuation between characters. FIG. 4 is a diagram showing an example of stored fluctuation easiness information. As shown in FIG. 4, in the word matching system 10, fluctuation easiness information is stored as, for example, three columns of data separated by tabs. In the fluctuation easiness information shown in FIG. 4, for example, "sawa", "sawa", and "1704" are separated by tabs. This indicates that the fluctuation score between "Sawa" and "Sawa" is "1704". The easiness of fluctuation here is the easiness of notational fluctuation between characters. In the present embodiment, the higher the ease of fluctuation between characters, the lower the fluctuation score between characters. Then, the combination score calculation unit 13 calculates the fluctuation score between the character strings by totaling the fluctuation scores between the characters included in the character string (details will be described later).

The combination score calculation unit 13 calculates the fluctuation score between the character strings for each combination character string in consideration of the editing distance from the user input character string. The edit distance is defined by the minimum number of operations required for "inserting", "editing", and "replacement" when transforming one character string into another, and makes the two character strings the same as each other. It shows the cost required to do so. For example, in the example shown in FIG. 5, the user input character string "Taro Watanabe" and one of the combination character strings (1) "Taro Watanabe" (same as the user input character string) are all characters. The editing distance is "0" because they are the same, and the editing distance is different from the user input character string "Taro Watanabe" and one of the combination character strings (2) "Taro Watanabe". The editing distance is "2" because "1" is two characters different from "Taro Watanabe" which is a user input character string and (3) "Taro Watanabe" which is one of the combination character strings.

The combination score calculation unit 13 calculates the fluctuation score between character strings in consideration of the editing distance as described above and the fluctuation score between characters. Specifically, the combination score calculation unit 13 calculates the fluctuation score between character strings based on the following mathematical formula.
Fluctuation score between character strings = Σ (editing distance x exp (fluctuation score between characters x -1))

Now, for each combination character string shown in FIG. 5, it is assumed that the fluctuation score with the user input character string is calculated by the above formula. Then, as shown in FIG. 6, it is assumed that the word matching system 10 stores a fluctuation score indicating the ease of fluctuation between each character. As shown in FIG. 6, such a fluctuation score between characters may be stored as a conversion dictionary in which a fluctuation score is calculated once two characters are determined. In the example shown in FIG. 6, the fluctuation score when the "edge" included in the user input character string is "邊" is "a", and the fluctuation score when the "edge" is "邉" is "". It is said that the fluctuation score when "b" is "b" and "邊" is "side" is "c", and the fluctuation score when "ro" is "ro" is "d". In this case, the editing distance from the user input character string is "0" (all characters are the same) (1) For "Taro Watanabe", the fluctuation score for the user input character string is based on the above formula. It is calculated as "0". Further, for (2) "Taro Watanabe" whose editing distance from the user input character string is "1", the fluctuation score for the user input character string is calculated as "1 x a" based on the above mathematical formula. Further, for (3) "Taro Watanabe" whose editing distance from the user input character string is "2", the fluctuation score for the user input character string is calculated as "1 x a + 1 x d" based on the above formula. .. Further, for (4) "Taro Watanabe" whose editing distance from the user input character string is "1", the fluctuation score for the user input character string is calculated as "1 x b" based on the above mathematical formula. Further, for (5) "Taro Watanabe" whose editing distance from the user input character string is "2", the fluctuation score for the user input character string is calculated as "1 × b + 1 × d" based on the above formula. .. Further, for (6) "Taro Watanabe" whose editing distance from the user input character string is "1", the fluctuation score for the user input character string is calculated as "1 × d" based on the above mathematical formula.

The combination score calculation unit 13 determines a plurality of candidate character strings from each combination character string based on the fluctuation score calculated in this way. The combination score calculation unit 13 uses, for example, all combination character strings whose fluctuation score is smaller than a predetermined value as candidate character strings. Alternatively, the combination score calculation unit 13 may use a combination character string having a small fluctuation score up to a predetermined order as a candidate character string. The combination score calculation unit 13 outputs each candidate character string and the fluctuation score of each candidate character string to the comparison unit 14.

The comparison unit 14 compares the matching target character string with each candidate character string, and sets the output character string so that the candidate character string having a higher degree of closeness to the matching target character string is more likely to be derived as an output character string. Derived. The comparison unit 14 derives, for example, a candidate character string that is closest (closest) to the matching target character string as an output character string. The comparison unit 14 may derive a plurality of character strings as output character strings. The degree of approximation between character strings may be derived from, for example, the editing distance. Further, the comparison unit 14 derives an approximation score indicating the degree of approximation between the output character string and the matching target character string. The approximation score has input data from the user (specifically, a candidate character string derived from the user input character string in consideration of easiness of fluctuation) in the database 50 that stores the matching target character string. It is a score indicating the possibility. The comparison unit 14 transmits the output character string, the fluctuation score of the output character string, and the approximation score of the output character string to the output unit 15.

The output unit 15 outputs an output character string. Specifically, the output unit 15 transmits (outputs) the output character string, the fluctuation score of the output character string, and the approximation score of the output character string to the terminal 1.

Next, the process performed by the word matching system 10 will be described with reference to FIG. 7. FIG. 7 is a flowchart showing the processing of the word matching system 10 according to the present embodiment.

As shown in FIG. 7, in the word matching system 10, input of character string data (user input character string and matching target character string) is first received from the terminal 1 (step S1). Subsequently, in the word matching system 10, a user input character string and a plurality of patterns of changed character strings in which at least a part of the characters included in the user input character string are changed are generated as a combination character string (step S2). ).

Subsequently, in the word matching system 10, a fluctuation score between a user input character string and a combination character string is calculated based on the fluctuation easiness (fluctuation frequency) between characters stored in advance, and the fluctuation score is calculated. A plurality of candidate character strings are determined from each combination character string based on (step S3).

Subsequently, in the word matching system 10, the matching target character string and each candidate character string are compared, and the candidate character string that most closely matches the matching target character string member is derived as an output character string (step S4). Finally, in the word matching system 10, the output character string, the fluctuation score of the output character string, and the approximation score of the output character string are transmitted to the terminal 1 (step S5).

Next, the operation and effect of the word matching system 10 according to the present embodiment will be described.

The word matching system 10 according to the present embodiment includes a user input character string input by the user, an input unit 11 for acquiring a matching target character string to be matched, a user input character string, and the user input character string. A combination generation unit 12 that generates a plurality of patterns of changed character strings in which at least a part of the characters is changed as a combination character string, and a user input character string based on the easiness of fluctuation between characters stored in advance. The combination score calculation unit 13 that calculates the fluctuation score between each combination character string and determines a plurality of candidate character strings from each combination character string based on the fluctuation score, the matching target character string and each. It includes a comparison unit 14 that compares with a candidate character string and derives a candidate character string that most closely matches the matching target character string as an output character string, and an output unit 15 that outputs an output character string.

In the word matching system 10 according to the present embodiment, a plurality of patterns of combined character strings in which some of the characters included in the user input character string are changed are generated, and fluctuations of the combined character strings are taken into consideration in consideration of fluctuations between characters. A score is calculated, a plurality of candidate character strings are determined based on the fluctuation score, and an output character string close to the matching target character string is derived by comparing the matching target character string with each candidate character string. The output character string is output. For example, when collating a name or the like in the database 50, the information held in the database 50 and the information input by the user are different from each other (problems such as notation fluctuation and variant characters), and the above-mentioned collation or the like is performed. There are some things you can't do. In this respect, in the word matching system 10 according to the present embodiment, among the combined character strings, the character string close to the matching target character string is regarded as the output character string, so that the matching target character string is stored in the database 50 in advance. By setting it as correct answer data, even if the input user input character string does not match the matching target character string, it is possible to output the character string corresponding to the matching target character string, and the above-mentioned collision etc. Can be done properly. Further, in the word matching system 10 according to the present embodiment, a candidate character string is determined from the combined character strings in consideration of the ease of fluctuation between characters. As a result, a character string that is likely to fluctuate is used as a candidate character string. Therefore, for example, when a user makes an erroneous input, a character string that the user is likely to have truly wanted to input should be used as a candidate character string. Can be done. According to the word matching system 10 as described above, when the matching target character string and the user input character string do not match, the character string corresponding to the matching target character string is intended to be input by the user. It is possible to derive and output the character string that was used.

The output unit 15 may output the fluctuation score of the output character string together with the output character string. As a result, the degree of fluctuation between the user input character string and the output character string is output, and the plausibility of the output character string (the probability that the output character string is intended by the user). Height) can be shown.

The combination score calculation unit 13 may calculate the fluctuation score of each combination character string in consideration of the editing distance from the user input character string. By considering the editing distance, it is possible to select a character string that is easily erroneously input as a candidate character string in consideration of the similarity between the character strings.

The input unit 11 may acquire a character string having the same type as the user input character string as a matching target character string from the database 50 in which a plurality of character strings are stored in advance for each type. Character strings of the same type are compared, so that the accuracy of the comparison process can be improved and the comparison process can be simplified.

Finally, the hardware configuration of the word matching system 10 will be described with reference to FIG. The word matching system 10 (word matching server) described above is physically configured as a computer device including a processor 1001, a memory 1002, a storage 1003, a communication device 1004, an input device 1005, an output device 1006, a bus 1007, and the like. May be good.

In the following description, the word "device" can be read as a circuit, a device, a unit, or the like. The hardware configuration of the word matching system 10 may be configured to include one or more of the devices shown in the figure, or may be configured to include some of the devices.

For each function in the word matching system 10, by loading predetermined software (program) on hardware such as the processor 1001 and the memory 1002, the processor 1001 performs an operation, and communication by the communication device 1004, the memory 1002, and the storage are performed. It is realized by controlling the reading and / or writing of the data in 1003.

Processor 1001 operates, for example, an operating system to control the entire computer. The processor 1001 may be composed of a central processing unit (CPU) including an interface with a peripheral device, a control device, an arithmetic unit, a register, and the like. For example, the control function of the combination score calculation unit 13 of the word matching system 10 may be realized by the processor 1001.

Further, the processor 1001 reads a program (program code), a software module and data from the storage 1003 and / or the communication device 1004 into the memory 1002, and executes various processes according to these. As the program, a program that causes a computer to execute at least a part of the operations described in the above-described embodiment is used. For example, the control function of the combination score calculation unit 13 of the word matching system 10 may be realized by a control program stored in the memory 1002 and operated by the processor 1001, or may be realized in the same manner for other functional blocks. good. Although it has been described that the various processes described above are executed by one processor 1001, they may be executed simultaneously or sequentially by two or more processors 1001. Processor 1001 may be mounted on one or more chips. The program may be transmitted from the network via a telecommunication line.

The memory 1002 is a computer-readable recording medium, and is composed of at least one such as a ROM (Read Only Memory), an EPROM (Erasable Programmable ROM), an EEPROM (ElectricallyErasable Programmable ROM), and a RAM (Random Access Memory). You may. The memory 1002 may be referred to as a register, a cache, a main memory (main storage device), or the like. The memory 1002 can store a program (program code), a software module, or the like that can be executed to implement the wireless communication method according to the embodiment of the present invention.

The storage 1003 is a computer-readable recording medium, for example, an optical disk such as a CD-ROM (Compact Disc ROM), a hard disk drive, a flexible disk, an optical magnetic disk (for example, a compact disk, a digital versatile disk, a Blu-ray). It may consist of at least one (registered trademark) disk), smart card, flash memory (eg, card, stick, key drive), floppy (registered trademark) disk, magnetic strip, and the like. The storage 1003 may be referred to as an auxiliary storage device. The storage medium described above may be, for example, a database, server or other suitable medium containing memory 1002 and / or storage 1003.

The communication device 1004 is hardware (transmission / reception device) for communicating between computers via a wired and / or wireless network, and is also referred to as, for example, a network device, a network controller, a network card, a communication module, or the like.

The input device 1005 is an input device (for example, a keyboard, a mouse, a microphone, a switch, a button, a sensor, etc.) that receives an input from the outside. The output device 1006 is an output device (for example, a display, a speaker, an LED lamp, etc.) that outputs to the outside. The input device 1005 and the output device 1006 may have an integrated configuration (for example, a touch panel).

Further, each device such as the processor 1001 and the memory 1002 is connected by a bus 1007 for communicating information. The bus 1007 may be composed of a single bus or may be composed of different buses between the devices.

Further, the word matching system 10 includes hardware such as a microprocessor, a digital signal processor (DSP), an ASIC (Application Specific Integrated Circuit), a PLD (Programmable Logic Device), and an FPGA (Field Programmable Gate Array). It may be configured by, and a part or all of each functional block may be realized by the hardware. For example, the processor 1001 may be implemented on at least one of these hardware.

Although the present embodiment has been described in detail above, it is clear to those skilled in the art that the present embodiment is not limited to the embodiment described in the present specification. This embodiment can be implemented as an amendment or modification without departing from the spirit and scope of the present invention as determined by the description of the scope of claims. Therefore, the description of the present specification is for the purpose of illustration and does not have any limiting meaning to the present embodiment.

Each aspect / embodiment described herein includes LTE (Long Term Evolution), LTE-A (LTE-Advanced), SUPER 3G, IMT-Advanced, 4G, 5G, FRA (Future Radio Access), W-CDMA. (Registered Trademarks), GSM (Registered Trademarks), CDMA2000, UMB (Ultra Mobile Broad-band), IEEE 802.11 (Wi-Fi), IEEE 802.16 (WiMAX), IEEE 802.20, UWB (Ultra-Wide) Band), Bluetooth®, and other systems that utilize suitable systems and / or extended next-generation systems based on them may be applied.

The processing procedures, sequences, flowcharts, and the like of each aspect / embodiment described in the present specification may be rearranged in order as long as there is no contradiction. For example, the methods described herein present elements of various steps in an exemplary order and are not limited to the particular order presented.

The input / output information and the like may be stored in a specific place (for example, a memory) or may be managed by a management table. Information to be input / output may be overwritten, updated, or added. The output information and the like may be deleted. The input information or the like may be transmitted to another device.

The determination may be made by a value represented by 1 bit (0 or 1), by a boolean value (Boolean: true or false), or by comparing numerical values (for example, a predetermined value). It may be done by comparison with the value).

Each aspect / embodiment described in the present specification may be used alone, in combination, or may be switched and used according to the execution. Further, the notification of predetermined information (for example, the notification of "being X") is not limited to the explicit notification, but is performed implicitly (for example, the notification of the predetermined information is not performed). May be good.

Software, whether called software, firmware, middleware, microcode, hardware description language, or other names, is an instruction, instruction set, code, code segment, program code, program, subprogram, software module. , Applications, software applications, software packages, routines, subroutines, objects, executable files, execution threads, procedures, features, etc. should be broadly interpreted.

Further, software, instructions, and the like may be transmitted and received via a transmission medium. For example, the software may use wired technology such as coaxial cable, fiber optic cable, twist pair and digital subscriber line (DSL) and / or wireless technology such as infrared, wireless and microwave to website, server, or other. When transmitted from a remote source, these wired and / or wireless technologies are included within the definition of transmission medium.

The information, signals, etc. described herein may be represented using any of a variety of different techniques. For example, data, instructions, commands, information, signals, bits, symbols, chips, etc. that may be referred to throughout the above description are voltages, currents, electromagnetic waves, magnetic fields or magnetic particles, light fields or photons, or any of these. It may be represented by a combination of.

The terms described in the present specification and / or the terms necessary for understanding the present specification may be replaced with terms having the same or similar meanings.

Further, the information, parameters, etc. described in the present specification may be represented by an absolute value, a relative value from a predetermined value, or another corresponding information. ..

User terminals may be mobile communication terminals, subscriber stations, mobile units, subscriber units, wireless units, remote units, mobile devices, wireless devices, wireless communication devices, remote devices, mobile subscriber stations, access terminals, etc. It may also be referred to as a mobile device, wireless device, remote device, handset, user agent, mobile client, client, or some other suitable term.

The terms "determining" and "determining" as used herein may include a wide variety of actions. "Judgment", "decision" is, for example, calculating, computing, processing, deriving, investigating, looking up (eg, table, database or another). It may include searching in the data structure), considering that the confirmation (ascertaining) is "judgment" and "decision". Also, "judgment" and "decision" are receiving (for example, receiving information), transmitting (for example, transmitting information), input (input), output (output), and access. It may include (for example, accessing data in memory) to be regarded as "judgment" or "decision". In addition, "judgment" and "decision" are considered to be "judgment" and "decision" when the things such as solving, selecting, choosing, establishing, and comparing are regarded as "judgment" and "decision". Can include. That is, "judgment" and "decision" may include considering some action as "judgment" and "decision".

The phrase "based on" as used herein does not mean "based on" unless otherwise stated. In other words, the statement "based on" means both "based only" and "at least based on".

As used herein by designations such as "first", "second", etc., any reference to that element does not generally limit the quantity or order of those elements. These designations can be used herein as a convenient way to distinguish between two or more elements. Thus, references to the first and second elements do not mean that only two elements can be adopted there, or that the first element must somehow precede the second element.

As long as "include", "including", and variations thereof are used herein or within the scope of the claims, these terms are similar to the term "comprising". In addition, it is intended to be inclusive. Moreover, the term "or" as used herein or in the claims is intended to be non-exclusive.

In the present specification, a plurality of devices shall be included unless the device has only one device apparently in context or technically.

The entire disclosure is intended to include the plural, unless the context clearly indicates the singular.

10 ... word matching system, 11 ... input unit (acquisition unit) 12 ... combination generation unit, 13 ... combination score calculation unit (score calculation unit), 14 ... comparison unit, 15 ... output unit, 50 ... database.

Claims (4)

An acquisition unit that acquires the first character string input by the user and the second character string to be matched.
A combination generation unit that generates a combination character string of the first character string and a plurality of patterns of change character strings in which at least a part of the characters included in the first character string is changed.
The fluctuation score between the first character string and each combination character string is calculated based on the fluctuation easiness between the characters stored in advance, and each combination character string is calculated based on the fluctuation score. A score calculation unit that determines multiple candidate character strings from among
The output character string is compared with the second character string and each candidate character string so that the candidate character string having a higher degree of approximation to the second character string is more likely to be derived as an output character string. And the comparison part to derive
A character string comparison system including an output unit that outputs the output character string. The character string comparison system according to claim 1, wherein the output unit outputs the fluctuation score of the output character string together with the output character string. The character string comparison system according to claim 1 or 2, wherein the score calculation unit calculates the fluctuation score of each combination character string in consideration of the editing distance from the first character string. The acquisition unit acquires, as the second character string, a character string having the same type as the first character string from a data set in which a plurality of character strings are stored in advance for each type. The character string comparison system according to any one of 3 to 3.

Images