JP2022069194A - Similar character string detection apparatus, method, program, and system - Google Patents

Abstract

To provide a similar character string detection apparatus, method, program, and system capable of improving the accuracy of detection of similar character strings.SOLUTION: In a similar character string detection system, a similar character string detection apparatus 10 comprises: a first score calculation unit 104 for calculating a first score by dividing the sum of each length of common character parts between a first character string and a second character string by the longer one of either the first character string length or the second character string length; a second score calculation unit 105 for calculating a second score by dividing the number of characters of the longest common part between the first character string and the second character string by the shorter one of either the first character string length or the second character strings length; and an output unit 107 for outputting a combination of similar character strings based on the first score or the second score.SELECTED DRAWING: Figure 2

Description

The present invention relates to similar string detectors, methods, programs, and systems.

Conventionally, a method of detecting a character string similar to a certain character string from a plurality of character strings has been known (Patent Document 1). Examples of the similarity used when detecting similar character strings include the Levenshtein distance and the Jaro-Winkler distance.

In the Levenshtein distance, the similarity is expressed by the number of edits (insertion, deletion, replacement of one character) required to make one character string into the other character string. In the Jaro-Winkler distance, the degree of similarity is expressed by the number of matching characters between character strings and the necessity of replacement. Therefore, the Levenshtein distance and Jaro-Winkler distance methods are suitable for detecting a character string having a slight difference (for example, a difference of only one character) due to a typo or the like.

Japanese Unexamined Patent Publication No. 2018-36744

However, with the Levenshtein distance and Jaro-Winkler distance methods, it is difficult to detect a character string in which the word orders of multiple words are interchanged. For example, suppose that there is a character string "50% solution" and a character string "solution (50%)". It is assumed that "50% solution" and "solution (50%)" are intended to be the same, that is, they should be judged to be similar. However, in the Levenshtein distance and Jaro-Winkler distance methods, character strings in which the word orders of a plurality of words are interchanged are judged to be completely different character strings.

Therefore, it is an object of the present invention to improve the accuracy of detecting similar character strings.

[1] The sum of the lengths of the character strings common between the first character string and the second character string is the length of the first character string and the length of the second character string. The first score calculation unit that calculates the first score divided by the longer of the strings, and
A similar character string detection device including an output unit that outputs a combination of similar character strings based on the first score.
[2] The maximum number of characters in the portion common between the first character string and the second character string is the length of the first character string and the length of the second character string. It also has a second score calculation unit, which calculates the second score divided by the shorter length.
The similar character string detection device according to [1], wherein the output unit outputs a combination of similar character strings based on the second score.
[3] The similar character string detecting device according to [1], wherein the length of each of the character strings common between the first character string and the second character string is 2 or more.
[4] The similar character string according to [2], wherein the longest number of characters in the portion common between the first character string and the second character string is the length of continuous character strings. Detection device.
[5] This is a method executed by a computer.
The sum of the lengths of the character strings common between the first character string and the second character string is the sum of the length of the first character string and the length of the second character string. And the step to calculate the first score divided by the longer of
A method including a step of outputting a combination of similar character strings based on the first score.
[6] Computer
The sum of the lengths of the character strings common between the first character string and the second character string is the sum of the length of the first character string and the length of the second character string. 1st score calculation unit, which calculates the 1st score divided by the longer length of
A program for functioning as an output unit that outputs a combination of similar character strings based on the first score.
[7] A system including a similar character string detection device and a user terminal.
The similar character string detection device is
The sum of the lengths of the character strings common between the first character string and the second character string is the sum of the length of the first character string and the length of the second character string. The first score calculation unit that calculates the first score divided by the longer length of
An output unit that outputs a combination of similar character strings based on the first score is provided.
The user terminal is
A system that displays a combination of similar strings.

In the present invention, the accuracy of detecting similar character strings can be improved.

It is a figure which shows the whole system configuration including the similar character string detection apparatus which concerns on one Embodiment of this invention. It is a figure which shows the functional block of the similar character string detection apparatus which concerns on one Embodiment of this invention. It is a flowchart which shows the flow of the similar character string detection processing which concerns on one Embodiment of this invention. It is a flowchart which shows the flow of the 1st score calculation process which concerns on one Embodiment of this invention. It is a flowchart which shows the flow of the 2nd score calculation process which concerns on one Embodiment of this invention. It is a flowchart which shows the flow of the common substring length operation processing which concerns on one Embodiment of this invention. It is a figure for demonstrating the operation of the common substring length which concerns on one Embodiment of this invention. It is a figure for demonstrating the operation of the common substring length which concerns on one Embodiment of this invention. It is a figure for demonstrating the operation of the common substring length which concerns on one Embodiment of this invention. It is a figure for demonstrating the operation of the common substring length which concerns on one Embodiment of this invention. It is a figure for demonstrating the operation of the common substring length which concerns on one Embodiment of this invention. It is a figure for demonstrating the operation of the common substring length which concerns on one Embodiment of this invention. It is a figure for comparing the accuracy of the similar character string detection. It is a figure for comparing the accuracy of the similar character string detection. It is a figure for comparing the accuracy of the similar character string detection. It is a figure which shows the hardware composition of the similar character string detection device and the user terminal which concerns on one Embodiment of this invention.

Hereinafter, each embodiment will be described with reference to the attached drawings. In the present specification and the drawings, the components having substantially the same functional configuration are designated by the same reference numerals, and duplicate description thereof will be omitted.

<Explanation of terms>
-A "character string" is a series of one or more characters.
-"Character string group" means a set consisting of a plurality of character strings.

In this embodiment, a character string included in each of the two character string groups (hereinafter referred to as a character string group 1 and a character string group 2) (that is, a character string and a character string group included in the character string group 1). A case of comparing (character strings included in 2) will be described. The character string group 1 and the character string group 2 may be different character string groups or may be the same character string group. However, this embodiment can also be applied to a case where a character string specified by a user or the like is compared with a character string included in a certain character string group.

<System configuration>
FIG. 1 is a diagram showing an overall system configuration including a similar character string detection device 10 according to an embodiment of the present invention. As shown in FIG. 1, the similar character string detection system 1 includes a similar character string detection device 10 and a user terminal 20. The similar character string detection device 10 can send and receive data to and from the user terminal 20 via an arbitrary network. Each will be described below.

The similar character string detection device 10 is a device (for example, a server) that performs processing for detecting a similar character string (hereinafter, also referred to as “similar character string”). Specifically, the similar character string detection device 10 detects a character string similar to a certain character string from the character string group.

The user terminal 20 is a terminal used by a user who causes the similar character string detection device 10 to detect a similar character string. Specifically, the user terminal 20 accepts the designation of the character string group input by the user. Further, the user terminal 20 notifies the similar character string detection device 10 of the designation of the received character string group. For example, the user terminal 20 is a personal computer or the like.

The similar character string detection device 10 may have a part or all of the functions of the user terminal 20.

<Functional block>
The similar character string detection device 10 includes a first score calculation unit 104 and an output unit 107. Hereinafter, the similar character string detection device 10 will be described in detail with reference to FIG. 2.

FIG. 2 is a diagram showing a functional block of the similar character string detection device 10 according to the embodiment of the present invention. As shown in FIG. 2, the similar character string detection device 10 includes a character string group acquisition unit 101, a character string selection unit 102, a common substring length calculation unit 103, a first score calculation unit 104, and a first. 2 The score calculation unit 105, the similar character string detection unit 106, and the output unit 107 can be provided. Each of these parts is realized by a process of causing the CPU of the similar character string detection device 10 to execute a program installed in the similar character string detection device 10. Each will be described below.

The character string group acquisition unit 101 acquires two character string groups (character string group 1 and character string group 2) to be compared. For example, the character string group acquisition unit 101 acquires two character string groups specified by the user on the user terminal 20. In addition, each character string group may be stored in the similar character string detection device 10, or may be stored in other than the similar character string detection device 10.

The character string selection unit 102 selects one character string from each character string group (that is, each of the character string group 1 and the character string group 2) acquired by the character string group acquisition unit 101.

The common substring length calculation unit 103 calculates the length of the character string common to the two character strings selected by the character string selection unit 102 (hereinafter, also referred to as “common substring length”).

The first score calculation unit 104 calculates the first score using the result calculated by the common substring length calculation unit 103.

The second score calculation unit 105 calculates the second score using the result calculated by the common substring length calculation unit 103.

The similar character string detection unit 106 detects a similar character string based on the score calculated by the first score calculation unit 104 or the second score calculation unit 105. In addition, only the first score may be used, or both the first score and the second score may be used. For example, the similar character string detection unit 106 detects a combination of character strings (that is, a combination of similar character strings) in descending order of score.

The output unit 107 outputs a similar character string detected by the similar character string detecting unit 106 (for example, displaying it on the user terminal 20 and storing it in the similar character string detecting device 10). For example, the output unit 107 outputs a combination of character strings (that is, a combination of similar character strings) in descending order of each score.

<Processing method>
FIG. 3 is a flowchart showing the flow of the similar character string detection process according to the embodiment of the present invention.

In step 1 (S1), the character string group acquisition unit 101 acquires two character string groups (character string group 1 and character string group 2) to be compared.

In step 2-1 (S2-1), the character string selection unit 102 selects an unprocessed character string from the character string group 1 acquired in S1. Let S1i be the i-th character string of the character string group 1.

In step 2-2 (S2-2), the character string selection unit 102 selects an unprocessed character string from the character string group 2 acquired in S1. Let S2j be the jth character string of the character string group 2.

In step 3 (S3), the common substring length calculation unit 103 and the first score calculation unit 104 (or the second score calculation unit 105) calculate the score. Specifically, the common substring length calculation unit 103 and the first score calculation unit 104 (or the second score calculation unit 105) calculate the scores of S1i and S2j.

In step 4 (S4), the first score calculation unit 104 or the second score calculation unit 105 determines whether or not the scores of all the character strings included in the character string group 2 have been calculated. If calculated, the process proceeds to step 5. If not calculated, the process returns to step 2-2, and the character string selection unit 102 adds 1 to j to select the j + 1th character string in the character string group 2.

In step 5 (S5), the similar character string detection unit 106 selects one or a plurality of character strings having a high score (for example, the character string having the highest score) among the character strings included in the character string group 2 in S1i. Save as a character string corresponding to.

In step 6 (S6), the first score calculation unit 104 or the second score calculation unit 105 determines whether or not the scores of all the character strings included in the character string group 1 have been calculated. If calculated, the process proceeds to step 7. If not calculated, the process returns to step 2-1 and the character string selection unit 102 adds 1 to i and selects the i + 1th character string in the character string group 1.

In step 7 (S7), the similar character string detection unit 106 detects a similar character string based on the score. In addition, only the first score may be used, or both the first score and the second score may be used. For example, the similar character string detection unit 106 detects a combination of character strings (that is, a combination of similar character strings) in descending order of score.

In step 8 (S8), the output unit 107 outputs the similar character strings detected in S5 and S7.

Subsequently, the details of S3 in FIG. 3 will be described. FIG. 4 is a flowchart showing the flow of the first score calculation process according to the embodiment of the present invention.

In step 11 (S11), the intersection character string length calculation unit 103 uses the intersection character of S1i (the i-th character string of the character string group 1) and S2j (the j-th character string of the character string group 2). Calculate the column length. If there are a plurality of common character strings between S1i and S2j, the character string length of each character string is calculated as the common substring length. Therefore, a plurality of common substring lengths can be calculated.

In step 12 (S12), the first score calculation unit 104 uses the sum of the common substring lengths calculated in S11 as the length of the character string of S1i (the i-th character string of the character string group 1) and S2j. Divide by the longer of the lengths of the character strings (jth character string of the character string group 2). The first score calculation unit 104 sets the value obtained by dividing the sum of the common substring lengths by the longer of the length of the character string of S1i and the length of the character string of S2j as the first score. The first score indicates that the larger the value, the more similar the character strings.

FIG. 5 is a flowchart showing the flow of the second score calculation process according to the embodiment of the present invention.

In step 21 (S21), the intersection character string length calculation unit 103 uses the intersection character of S1i (the i-th character string of the character string group 1) and S2j (the j-th character string of the character string group 2). Calculate the column length. Similar to S11, a plurality of common substring lengths can be calculated.

In step 22 (S22), the second score calculation unit 105 determines the longest common substring length (hereinafter, also referred to as “longest common substring length”) among the common substring lengths calculated in S21. Divide by the shorter of the length of the character string of S1i (the i-th character string of the character string group 1) and the length of the character string of S2j (the j-th character string of the character string group 2). The second score calculation unit 105 uses the value obtained by dividing the longest common substring length by the shorter of the length of the character string of S1i and the length of the character string of S2j as the second score. The second score indicates that the larger the value, the more similar the character strings.

The longest common substring length may be used instead of the longest common substring length described above. The longest common subsequence length is the number of characters that are common to two strings, and these characters do not have to be continuous.

Subsequently, the details of S11 in FIG. 4 and S21 in FIG. 5 will be described. FIG. 6 is a flowchart showing a flow of common substring length calculation processing according to an embodiment of the present invention. As shown in FIG. 7, the number of columns is the length of the character string of the character string S1 + 1, and the number of lines is the length of the character string of the character string S2 + 1. Table) is used. The common substring length calculation unit 103 assigns each character of the character string S1 in order from the second column from the left end. Further, the intersection character string length calculation unit 103 allocates each character of the character string S2 in order from the second line from the upper end.

In step 101 (S101), the intersection string length calculation unit 103 initializes the longest substring length to 0. Specifically, the intersection string length calculation unit 103 sets the value of each column of the first row (upper end row) and each row of the first column (leftmost column) to 0. That is, the longest substring length at this point is 0.

The intersection string length calculation unit 103 starts the search from the first character of the character string S1 and the character string S2. i indicates that it is the i-th character from the first character of the character string S1. j indicates that it is the jth character from the first character of the character string S2. The search is performed from i = 0 and j = 0 (that is, the first character).

In step 102 (S102), the intersection character string length calculation unit 103 determines whether or not the i-th character of the character string S1 and the j-th character of the character string S2 are equal. If they are equal, the process proceeds to step 103, and if they are not equal, the process proceeds to step 104. In step 104 (S104), the intersection character string length calculation unit 103 inputs 0 to the cells in the j + 1 row and i + 1 column of the table, and proceeds to step 105.

In step 103 (S103), the intersection string length calculation unit 103 sets the value of the cell in the i + 1 column of the j + 1 row of the table (table) plus 1 to the value of the cell in the i column of the j row. input. If the value is larger than the longest substring string length at that time, the value is updated as the longest substring string length.

In step 105 (S105), the intersection character string length calculation unit 103 determines whether or not the character at the rear end of the character string S1 has been searched. If the search is performed up to the character at the rear end, the process proceeds to step 106. If the character at the rear end is not searched, 1 is added to i and the process returns to S102.

In step 106 (S106), the intersection character string length calculation unit 103 determines whether or not the character at the rear end of the character string S2 has been searched. When the search is performed up to the character at the rear end, the process ends, and when the search is not performed up to the character at the rear end, 1 is added to j and the process returns to S102.

By the processing of S101 to S106, the comparison of all characters is completed. In the table, the intersection string length is the value of the cell in which the lower right cell is 0, or the cell in which the lower right cell does not exist, and a value other than 0 is input. .. The longest common substring length is the largest value among the values entered in the table.

<Calculation of common substring length>
7 to 12 are diagrams for explaining the calculation of the common substring length according to the embodiment of the present invention. It is assumed that two character strings of the character string S1 "ABCDEFG" and the character string S2 "AbcDE" are compared.

As shown in FIGS. 7 to 12, the number of columns is the length of the character string of the character string S1 + 1 (in the example, the length of "ABCDEFG": 7 plus 1 is 8), and the number of rows is. , The length of the character string of the character string S2 + 1 (in this example, the length of "AbcDE": 5 plus 1 6), a table for data storage is used. Each character of the character string S1 (in this example, "A", "B", "C", "D", "E", "F", "G") is assigned in order from the second column from the left end. Be done. Further, each character of the character string S2 (in this example, "A", "b", "c", "D", "E") is assigned in order from the second line from the upper end.

First, the longest substring length is initialized to 0. Specifically, the value of each column of the first row (uppermost row) and each row of the first column (leftmost column) is set to 0. That is, the longest substring length at this point is 0.

Hereinafter, the value of the result of comparing each character of the two character strings is input to the cell where the compared characters intersect. Specifically, when the two characters are equal, the value obtained by adding 1 to the value of the upper left cell of the cell where the compared characters intersect is input to the cell where the compared characters intersect. If the two characters are not equal, enter 0 in the cell where the compared characters intersect. When a value larger than the longest substring string length at that time is input, that value is updated as the longest substring string length.

First, the first character of each character string (in this example, "A" of the character string S1 and "A" of the character string S2) is compared. In this example, since both are equal, the value obtained by adding 1 to the value of the upper left cell of the cell where the compared characters intersect is input to the cell where the compared characters intersect (see FIG. 7).

Next, the first character of one character string and the second and subsequent characters of the other character string are compared. First, in this example, the second character "B" of the character string S1 and the first character "A" of the character string S2 are compared. In this example, since they are not equal, 0 is input to the square where the compared characters intersect (see FIG. 8). Similarly, the comparison between each character of the character string S1 and the first character of the character string S2 is completed (see FIG. 9).

Next, the second character of one character string and each character of the other character string are compared. First, in this example, the first character "A" of the character string S1 and the second character "b" of the character string S2 are compared. In this example, since they are not equal, 0 is input to the square where the compared characters intersect (see FIG. 10). Similarly, the comparison between each character of the character string S1 and the second character of the character string S2 is completed (see FIG. 11).

In this way, the value of the result of comparing each character of the two character strings is input to the cell where the characters intersect. In FIG. 12, the comparison of all characters is completed. The common substring length is a cell in which the lower right cell is 0, or a cell in which the lower right cell does not exist, and a value other than 0 is input (in the example of FIG. 12). , "1" in the square where A and A intersect, and "2" in the square where E and E intersect). That is, in the example of FIG. 12, the sum of the intersection string lengths is 3 (the sum of "1" and "2"). Further, the longest common substring length is the largest value (2 in the example of FIG. 12) among the values input to the table.

By using the methods described with reference to FIGS. 7 to 12, the common substring length can be calculated at high speed. It is assumed that two character strings, a character string S1 and a character string S2, are compared. The length of each string

とする。２つの文字列に共通する文字列を取得するために全探索的なアルゴリズムを用いると、文字列Ｓ２からの文字列の切り出し方が、

And. If a full-search algorithm is used to obtain a character string common to two character strings, the method of cutting out the character string from the character string S2 becomes

通りある。そして、切り出した文字列が文字列Ｓ１に含まれるか否かを確認する組み合わせが、各切り出しについて、

There is a street. Then, a combination for confirming whether or not the cut out character string is included in the character string S1 is used for each cutout.

通りある。したがって、２つの文字列に共通する文字列を取得するための組み合わせは、

There is a street. Therefore, the combination for obtaining the character string common to the two character strings is

通りある。Ｎ文字の比較にはＮ回の演算が必要なので、必要な比較のための演算の回数の合計は、

There is a street. Since N character comparison requires N operations, the total number of operations required for comparison is

である。つまり、演算コストは、

Is. In other words, the calculation cost is

で示される演算の回数に比例する。一方、図７～図１２で説明した手法の演算コストは

It is proportional to the number of operations indicated by. On the other hand, the calculation cost of the methods described in FIGS. 7 to 12 is

で示される演算の回数に比例し、本発明の演算原理の方が高速であるといえる。なお、演算コストは、

It can be said that the calculation principle of the present invention is faster in proportion to the number of operations indicated by. The calculation cost is

と

When

の積の演算の回数に比例する。

It is proportional to the number of operations of the product of.

<Other embodiments>
When calculating the score 1, the common substring length may be restricted. Specifically, the intersection character string having a character string length of 1 is excluded. For example, in the table described with reference to FIGS. 7 to 12, the upper left cell has a value of 1 or more (and the lower right cell is 0, or the lower right cell does not exist). Therefore, by setting the value of (a cell in which a value other than 0 is input) as the common substring length, it is possible to eliminate the common substring whose character string length is 1. When a common substring having a length of 1 is used, the degree of similarity between the character strings S1 and S2 containing one common character becomes high. By excluding the intersection character string having a character string length of 1, it is possible to calculate a score specialized for word replacement. When many character strings are composed of a small number of characters of about 2 to 5 characters, it is useful to include a common substring with a length of 1.

[Example]
<Accuracy of similar character string detection>
Hereinafter, the accuracy of similar character string detection based on this embodiment will be described as an example. 13 to 15 are diagrams for comparing the accuracy of similar character string detection. Four prior arts, the Levenshtein distance, the Jaro-Winkler distance, and the first score and the second score of the present invention were compared.

The Levenshtein distance indicates that the smaller the value, the more similar the strings. However, in this comparison, the value of the Levenshtein distance was divided by the longer of the two character strings, and the standardized value was used.

The Jaro-Winkler distance indicates that the larger the value, the more similar the strings.

As described above, the larger the value of the first score and the second score, the more similar the character strings.

<< Comparison 1 >>
FIG. 13 shows the result of comparison 1 of the accuracy of similar character string detection. The upper row shows the similarity between the character string 1 "Product 1 evaluation recipe (space is a full-width space)" and the character string 2 "Evaluation recipe product 1 (space is a half-width space)", and the lower row is the character string 1 "Product 1 evaluation". The similarity between the recipe (space is a full-width space) and the character string 3 "recipe product 2 (space is a half-width space)" is shown. In order to judge that the character strings having the word order of a plurality of words are similar to each other, it should be judged that the character string 1 and the character string 2 are more similar than the character string 1 and the character string 3. Is. From the result of comparison 1, it can be seen that the first score is suitable.

<< Comparison 2 >>
FIG. 14 shows the result of comparison 2 of the accuracy of similar character string detection. The upper row shows the similarity between the character string 1 "evaluation recipe product 1 (space is a half-width space)" and the character string 2 "product 1 evaluation recipe (space is a full-width space)", and the lower row is the character string 1 "evaluation recipe product". 1 (space is a half-width space) ”and the character string 3“ recipe product 2 (space is a half-width space) ”show the degree of similarity. In order to judge that the character strings having the word order of a plurality of words are similar to each other, it should be judged that the character string 1 and the character string 2 are more similar than the character string 1 and the character string 3. Is. From the result of comparison 2, it can be seen that the first score is suitable.

<< Comparison 3 >>
FIG. 15 shows the result of comparison 3 of the accuracy of similar character string detection. The upper row shows the similarity between the character string 1 "Product 1 evaluation recipe (space is a half-width space)" and the character string 2 "Product 1 evaluation (space is a half-width space)", and the lower row is the character string 1 "Product 1 evaluation recipe". (Space is a half-width space) ”and the character string 3“ Product 2 evaluation recipe (space is a half-width space) ”show the degree of similarity. In order to judge that the character string in which the word is not omitted and the character string in which the word is omitted are similar, the character string 1 and the character string 2 are more similar than the character string 1 and the character string 3. Should be judged. From the result of comparison 3, it can be seen that the second score is suitable.

<Effect>
As described above, in one embodiment of the present invention, it can be determined that the character strings in which the word orders of the plurality of words are exchanged are similar to each other, so that the word order of the plurality of words is changed from the original character string. It is possible to detect the replaced character strings. Further, in one embodiment of the present invention, since it can be determined that the character string in which the word is not omitted and the character string in which the word is omitted are similar, the word is omitted from the original character string. It is possible to detect the character string (or the character string in which the word is not omitted).

<Hardware configuration>
FIG. 16 is a hardware configuration diagram of a similar character string detection device 10 and a user terminal 20 according to an embodiment of the present invention. The similar character string detection device 10 and the user terminal 20 have a CPU (Central Processing Unit) 1001, a ROM (Read Only Memory) 1002, and a RAM (Random Access Memory) 1003. The CPU 1001, ROM 1002, and RAM 1003 form a so-called computer.

Further, the similar character string detection device 10 and the user terminal 20 may have an auxiliary storage device 1004, a display device 1005, an operation device 1006, an I / F (Interface) device 1007, and a drive device 1008.

The hardware of the similar character string detection device 10 and the user terminal 20 are connected to each other via the bus B.

The CPU 1001 is an arithmetic device that executes various programs installed in the auxiliary storage device 1004.

ROM 1002 is a non-volatile memory. The ROM 1002 functions as a main storage device for storing various programs, data, and the like necessary for the CPU 1001 to execute various programs installed in the auxiliary storage device 1004. Specifically, the ROM 1002 functions as a main storage device for storing boot programs such as BIOS (Basic Input / Output System) and EFI (Extensible Firmware Interface).

The RAM 1003 is a volatile memory such as a DRAM (Dynamic Random Access Memory) or a SRAM (Static Random Access Memory). The RAM 1003 functions as a main storage device that provides a work area to be expanded when various programs installed in the auxiliary storage device 1004 are executed by the CPU 1001.

The auxiliary storage device 1004 is an auxiliary storage device that stores various programs and information used when various programs are executed.

The display device 1005 is a display device that displays the internal state of the similar character string detection device 10, the user terminal 20, and the like.

The operation device 1006 is an input device in which a person who operates the similar character string detection device 10 and the user terminal 20 inputs various instructions to the similar character string detection device 10 and the user terminal 20.

The I / F device 1007 is a communication device for connecting to a network and communicating with other devices.

The drive device 1008 is a device for setting the storage medium 1009. The storage medium 1009 referred to here includes a medium such as a CD-ROM, a flexible disk, a magneto-optical disk, or the like, which records information optically, electrically, or magnetically. Further, the storage medium 1009 may include a semiconductor memory for electrically recording information such as an EPROM (Erasable Programmable Read Only Memory) and a flash memory.

The various programs installed in the auxiliary storage device 1004 are installed, for example, by setting the distributed storage medium 1009 in the drive device 1008 and reading the various programs recorded in the storage medium 1009 by the drive device 1008. Will be done. Alternatively, various programs installed in the auxiliary storage device 1004 may be installed by being downloaded from the network via the I / F device 1007.

Although the embodiments of the present invention have been described in detail above, the present invention is not limited to the above-mentioned specific embodiments, and various modifications are made within the scope of the gist of the present invention described in the claims.・ Can be changed.

1 Similar character string detection system 10 Similar character string detection device 20 User terminal 101 Character string group acquisition unit 102 Character string selection unit 103 Common substring length calculation unit 104 First score calculation unit 105 Second score calculation unit 106 Similar character string Detection unit 107 Output unit 1001 CPU
1002 ROM
1003 RAM
1004 Auxiliary storage device 1005 Display device 1006 Operation device 1007 I / F device 1008 Drive device 1009 Storage medium

Claims (7)

The sum of the lengths of the character strings common between the first character string and the second character string is the sum of the length of the first character string and the length of the second character string. The first score calculation unit that calculates the first score divided by the longer length of
A similar character string detection device including an output unit that outputs a combination of similar character strings based on the first score. The longest number of characters in the portion common between the first character string and the second character string is the shorter of the length of the first character string and the length of the second character string. Further equipped with a second score calculation unit, which calculates a second score divided by the length of
The similar character string detection device according to claim 1, wherein the output unit outputs a combination of similar character strings based on the second score. The similar character string detection device according to claim 1, wherein the length of each of the character strings common between the first character string and the second character string is 2 or more. The similar character string detecting device according to claim 2, wherein the longest number of characters in a portion common between the first character string and the second character string is the length of a continuous character string. The way the computer does
The sum of the lengths of the character strings common between the first character string and the second character string is the sum of the length of the first character string and the length of the second character string. And the step to calculate the first score divided by the longer of
A method comprising the step of outputting a combination of similar character strings based on the first score. Computer,
The sum of the lengths of the character strings common between the first character string and the second character string is the sum of the length of the first character string and the length of the second character string. 1st score calculation unit, which calculates the 1st score divided by the longer length of
A program for functioning as an output unit that outputs a combination of similar character strings based on the first score. A system that includes a similar character string detector and a user terminal.
The similar character string detection device is
The sum of the lengths of the character strings common between the first character string and the second character string is the sum of the length of the first character string and the length of the second character string. The first score calculation unit that calculates the first score divided by the longer length of
An output unit that outputs a combination of similar character strings based on the first score is provided.
The user terminal is
A system that displays a combination of similar strings.

Images