JP2005099884A - Retrieving device - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To perform automatic processing of association between character strings based on replacement possibility and connection possibility. <P>SOLUTION: Words including an input word 11 are retrieved as primary words 13. Then, secondary words 17 are retrieved by using connectable words 15 obtained by excluding the input word 11 from the primary words 13. Then, replaceable words 19 are obtained by excluding the connectable words 15 from the secondary words 17. The replaceable words 19 are defined as the synonyms of the input word 11, and registered in a dictionary. <P>COPYRIGHT: (C)2005,JPO&NCIPI

Description

[0001]
BACKGROUND OF THE INVENTION
The present invention relates to a search device that searches for a word that can be replaced with an input word, that is, a synonym, for example.
The present invention also relates to a search device that generates a synonym dictionary using the searched synonyms.
[0002]
[Prior art]
When searching for data distributed on a network such as the Internet or data stored in a database, a user searches for related data by inputting a keyword. If the keyword does not allow the user to search for the desired data, the keyword is often searched using another keyword similar to the keyword. However, it took a considerable amount of time to think about other keywords similar to the user, or a considerable change in ideas and a considerable amount of experience.
[0003]
On the other hand, a synonym dictionary is used to automatically provide synonyms. In this synonym dictionary, words to be synonymous are registered in advance. This synonym dictionary registers synonyms selected by the creator of the synonym dictionary, but there are cases where sufficient synonyms are not registered.
Moreover, there is a problem that enormous effort is required when registering synonyms. In addition, the creator of the synonym does not communicate in all fields, and synonyms in specialized fields, special fields, and private fields may not be registered in the synonym dictionary.
In addition, new words are generated one after another in fields where electronic technology terms, biotechnology terms and the like are moving rapidly, and there is a problem that the synonym dictionary must be updated.
In addition, when registering a synonym dictionary, a synonym dictionary is also created using a probability model using the co-occurrence and appearance probability of two words, the probability of the relationship between two words, and the like. However, it is incomplete technology and has not reached the practical level.
[0004]
[Problems to be solved by the invention]
As described above, conventionally, there has been no method that can be performed easily and quickly when searching for synonyms or constructing a synonym dictionary.
[0005]
An object of the present invention is to provide a search device that searches for a word (character string) similar to an input word (character string), for example.
Another object of the present invention is to perform automatic processing of association between character strings based on, for example, substitution possibility and combination possibility.
Another object of the present invention is to provide a search device that automatically constructs a synonym dictionary using searched words as one application example.
[0006]
[Means for Solving the Problems]
The search device according to the present invention is a search device for searching for a character string from a dictionary in which character strings are registered as registered character strings.
An input unit for inputting a character string as an input character string;
A search unit for searching and outputting a replaceable character string that can be replaced with the input character string input by the input unit;
It is characterized by having.
[0007]
The search part above
A primary search unit for searching a registered character string including a part of the input character string as a primary character string from the dictionary using the input character string input by the input unit;
The remainder obtained by removing the input character string from the primary character string searched by the primary search unit is set as a connectable character string, and a registered character string including a part of the connectable character string as a secondary character string is searched from the dictionary. Next search part,
An output unit that outputs the remaining part obtained by removing the connectable character string from the secondary character string searched by the secondary search unit as a replaceable character string replaceable with the input character string;
It is provided with.
[0008]
The primary search part
A forward match search that searches for a registered character string that matches the input character string and the front of the registered character string, a backward match search that searches for a registered character string that matches the input character string and the back of the registered character string, and an input character Search the primary string by searching at least one of the middle match search that searches for the registered string that matches the middle of the column and the registered string,
The secondary search part
When the primary search unit searches for a primary character string by a forward match search, it searches for a secondary character string by a backward match search that searches for a registered character string that matches the connectable character string and the back of the registered character string,
When the primary search unit searches the primary character string by the backward match search, the secondary search is performed by searching for the registered character string in which the connectable character string and the registered character string are matched, and the secondary character string is searched.
When the primary search unit searches for a primary character string by an intermediate match search, it searches for a registered character string that matches both the connectable character string and the front and rear of the registered character string. It is characterized by searching.
[0009]
The input unit sequentially inputs a registered character string registered in the dictionary as an input character string, and the search unit searches the dictionary for a replaceable character string of the registered character string registered in the dictionary and outputs it.
The search device further includes an association unit that stores information indicating that the replaceable character string output from the search unit is a character string replaceable with a registered character string in a dictionary.
[0010]
The search device further includes a loop unit that searches the replaceable character string for the replaceable character string by inputting the replaceable character string output from the search unit to the input unit as an input character string. It is characterized by that.
[0011]
The secondary search unit has a counting unit that counts the number of appearances of the same secondary character string when the same secondary character string appears, and the output unit has a large number of occurrences of replaceable character strings. It has the sort part which outputs a replaceable character string in order.
[0012]
The search device is characterized in that a search keyword for searching at least one of Internet data and database data is input as an input character string, and a keyword similar to the search keyword is output as a replaceable character string. To do.
[0013]
The search device according to the present invention includes an input character string set that holds a set of input character strings,
A sampling string set that holds a set of sampling strings for searching for a string that can be replaced with the input string;
A replaceable string list set that holds a set of replaceable string lists that are searched for and output for each string in the set of character strings held in the input string set, and replaced with a certain input string A replaceable character string search unit that searches for possible replaceable character strings from the set of sampling character strings held in the sampling character string set and outputs as a replaceable character string list;
The character string is sequentially input from the set of character strings held in the input character string set, the input character string is given to the replaceable character string search unit in order as an input character string, and output from the replaceable character string search unit A control unit for adding the replaced replaceable character string list to the replaceable character string list set;
It is characterized by having.
[0014]
DETAILED DESCRIPTION OF THE INVENTION
Embodiment 1 FIG.
FIG. 1 is a diagram showing a personal computer 51 in which the search device of this embodiment is realized. The personal computer 51 includes a CPU 53, a bus 55, a memory 57, a communication board 59, a magnetic disk 61, a compact disk drive 69, a flexible disk drive 71, a keyboard 73 and a mouse 75. The magnetic disk 61 stores a dictionary 63, a search program 65, and a browser 67. Here, the dictionary 63 is a word dictionary in which words are simply registered. More specifically, words are stored in a text file format as character strings.
[0015]
Hereinafter, an uppercase alphabet is used to represent a character, and one or more alphabets are combined to be described as a character string (word).
The dictionary 63 is a dictionary that lists words such as AB, AC, ABC,... As a text file. The search program 65 is a search device described below realized by software. The search program 65 is loaded into the memory 57 and executed by the CPU 53. As a result, the search program 65 performs the operation of the search device described below. The browser 67 is an Internet search program. The browser 67 is also loaded into the memory 57 and executed by the CPU 53. The memory 57 is a volatile memory configured by a random access memory or the like. The communication board 59 executes a protocol for connecting to the Internet 77 or the LAN 79. For example, a modem, an Ethernet board, or a TCP / IP board is used. The personal computer 51 is connected to the Internet 77 or the LAN 79 via the communication board 59 and can communicate with the personal computer 81 or the server computer 83.
[0016]
In addition, although the case where the dictionary 63, the search program 65, and the browser 67 are stored in the magnetic disk 61 is shown, it is stored in the CD (compact disk) of the compact disk drive 69 or the FD (flexible disk) of the flexible disk drive 71. It does not matter. The dictionary 63, the search program 65, and the browser 67 are stored in the personal computer 81 and the server computer 83 and loaded into the personal computer 51 via the network, or accessed from the personal computer 51 via the network. It does not matter if it is designed.
The search program 65 can be created entirely by software. For example, it can be created using C language or visual basic language. However, the search program 65 may exist as firmware in a read-only memory (not shown), or a part or all of it may exist as hardware. When it exists as hardware, it is made into LSI and operates together with other circuits. Alternatively, the search program 65 may operate as an operating system or window system software driver. In that case, the search program 65 operates by a system call from the operating system or window system, or an interrupt process.
[0017]
FIG. 2 is a diagram showing the configuration and operation of the search program 65. The search program 65 includes a word input unit 21, a search unit 23, an association unit 37, and a loop unit 39. The search unit 23 includes a primary search unit 25, a secondary search unit 27, and an output unit 31. The word input unit 21 inputs a word as the input word 11. This word is, for example, a search keyword for the Internet input from the user to the browser 67 or a keyword for a database. The search unit 23 searches the dictionary 63 for a replaceable word that can be replaced with the input word 11 input by the word input unit 21 and outputs it. The primary search unit 25 uses the input word 11 input by the word input unit 21 to search the dictionary 63 as a primary word 13 for a registered word that includes the input word 11 as a part thereof. The secondary search unit 27 uses the remaining part obtained by removing the input word 11 from the primary word 13 searched by the primary search unit 25 as a connectable word, and registers a registered word that includes a part of the connectable word as a secondary word 17. Search from 63. The output unit 31 outputs the remaining part obtained by removing the connectable word from the secondary word 17 searched by the secondary search unit 27 as the replaceable word 19 that can be replaced with the input word 11.
[0018]
FIG. 3 is a diagram illustrating the operation of the search unit 23 described above.
FIG. 4 is a diagram showing a specific example of the operation.
FIG. 5 is a diagram illustrating an example of words registered in the dictionary 63.
[0019]
Here, it is assumed that words as shown in FIG. 5 are registered in the dictionary 63 in advance. The solid line arrows and the broken line arrows in FIG. 5 will be described later. In FIG. 3, it is assumed that AB is input as the input word 11.
The primary search unit 25 searches the dictionary 63 for words including AB using AB. The primary search unit 25 performs a forward match search, a backward match search, and an intermediate match search using AB. Then, the front match word ABLM, the back match word OPAB, and the intermediate match word CDABEF are searched as the primary word 13. The secondary search unit 27 inputs these primary words 13 and generates a connectable word 15 consisting of the remainder obtained by removing AB from each word. In this example, AB is removed from ABLM to generate LM. In addition, OP is generated by removing AB from OPAB. Further, AB is removed from CDABEF to generate CD and EF. The secondary search unit 27 searches the dictionary 63 again using these connectable words 15. The secondary search unit 27 performs a backward match search when the primary search unit 25 searches for a forward match word. When the primary search unit 25 searches for a backward matching word, a forward matching search is performed. Further, when the primary search unit 25 searches for an intermediate match word, a both-match search in which both the front and the rear match is performed.
While performing the search, the secondary search unit 27 outputs the secondary word 17 while causing the count unit 29 to count the number of occurrences of the same word if there is a matched word. In this example, the secondary search unit 27 detects XYZLM once as a backward matching word and detects GHLM twice. Further, OPUVW is detected 7 times and OPIJ is detected twice as a forward matching word. Also, CDSTEF is detected four times as both forward and backward matching words, and CDKLEF is detected twice.
The output unit 31 inputs these secondary words 17. The sorting unit 33 of the output unit 31 sorts the secondary words 17 using the count counted by the counting unit 29, and outputs the one with the larger number of appearances first.
Further, if the weight reduction unit 35 of the output unit 31 has an excessive number of appearances, the weight of a word with a large number of appearances is changed by the TF-IDF method or other methods. In this example, since the number of occurrences of OPUVW is 7, the case where the number of occurrences is changed to 1 which is the minimum number of appearances is shown.
Here, the tf / idf method refers to a method of obtaining a score using the frequency of words and giving priority to searched words. In the most typical example, the score obtained by the tf · idf method is determined by the following equation.
Score = tf × idf
However,
tf: = Number of appearances that a certain keyword is included in the target document
tf stands for "Term Frequency"
idf: = log (N / n)
N is the total number of documents, n is the number of files containing the keyword
idf is an abbreviation for "Inverse Document Frequency"
It is.
The basic idea of the tf / idf method is “to lower the importance of high-frequency words and increase the importance of low-frequency words in a certain document group”. That is, if a certain keyword is a universal keyword appearing in many documents in a document group of N documents, idf is small, and conversely if id appears only in a specific document, idf is large. Become. In short, idf corresponds to “weighting” applied to tf. There is also an improved version of the tf · idf method, but this is basically based on this idea by using another index instead of 1 / log (n) in tf · idf.
The output unit 31 outputs the six words shown in FIG. 6A as the replaceable words 19 that may replace the input word 11 AB. These words can be replaced with AB and are synonyms. When the search program 65 outputs the replaceable word 19, the browser 67 can search the Internet again using a word having a large weight (number of appearances) from the replaceable word 19 instead of the input word 11.
[0020]
FIG. 4 shows a specific example of FIG. 3 described above. Here, “Aichi” is input as the input word 11, a forward matching search is performed, and “Aichi”, “Aichi Medical University”, and “Aichi Mikan” are the primary search unit 25 as the primary word 13 having “Aichi” ahead. The case where it searched by is shown. In order to perform a backward matching search from these three words, the secondary search unit 27 generates a connectable word 15 such as “prefecture”, “medical college”, and “mandarin orange” and performs a secondary search. As a result, it is shown that “Yamanashi Prefecture”, “Shizuoka Medical University”, and “Shizuoka Mikan” are searched as the secondary word 17. The output unit 31 sorts the secondary words 17 by the number of appearances, and outputs “Shizuoka” and “Yamanashi” as the replaceable words 19. In this way, it is possible to perform a search that the two words “Shizuoka” and “Yamanashi” are replaceable words, that is, synonyms, for the word “Aichi”.
[0021]
Next, a case will be described in which the dictionary 63 is changed from a simple text file dictionary to a synonym dictionary using the search program 65 described above.
2 inputs the replaceable word 19 output from the output unit 31, and stores in the dictionary 63 that the input word 11 can be replaced with the replaceable word 19. For example, as shown in FIG. 5, a solid line arrow is directed from AB to the replaceable word 19 that can be replaced with AB shown in FIG. This arrow is added by the association unit 37. Specifically, this arrow can be realized as a pointer from AB to the address where each word is stored. Alternatively, associations can be stored by attaching relations in a relational database format. If the word output as the replaceable word 19 does not exist in the dictionary 63, the associating unit 37 newly registers the word in the dictionary 63 and stores the association that it is a synonym of the input word 11. Thus, whenever the input word 11 is input and the replaceable word 19 is output, the associating unit 37 continues to register synonyms in the dictionary 63.
In the above-described example, the case where the keyword input to the browser 67 is the input word 11 has been described. However, all the words in the dictionary 63 are sequentially input as the input word 11 and the replaceable word 19 is output. By storing synonyms in 37, the dictionary 63 can have synonyms for all registered words. For example, when 10,000 words are registered in the dictionary 63, the 10,000 words are sequentially input to the search program 65, and the replaceable word 19 of each word is output. By storing the synonym relationship, the dictionary 63 changes to a synonym dictionary instead of a word dictionary in which simple words are registered. This operation may be performed every time a new word is registered in the dictionary 63, or may be performed periodically, for example, once a week, once a month. In addition, new words are registered in the dictionary 63 by, for example, searching for data in a specified technical field, a specified private field, or a field of particular interest to a user from each homepage on the Internet. This can be done by executing an incoming robot program or agent program. In this manner, the dictionary 63 becomes a synonym dictionary in a professional and private field. Thus, automatic word registration by the robot program or agent program is performed, and automatic synonym registration by the search program 65 is performed, so that the dictionary 63 automatically increases words and automatically registers synonyms. It will be.
[0022]
Next, the operation of the loop unit 39 of the search program 65 will be described. When the replaceable word 19 is output, the loop unit 39 inputs the replaceable word 19 and causes the search program 65 to input it again as the input word 11. That is, the replaceable word 19 is fed back as the input word 11. For example, in FIG. 3, when XYZ is output as the replaceable word 19, this XYZ is again input to the search program 65 as the input word 11. When XYZ is input and four words GH, GHLM, OPIJ, and XY are output as replaceable words 19 of XYZ as shown in FIG. 6B, the associating unit 37 selects these four words. Can be registered as a synonym of XYZ and at the same time as a secondary synonym of AB.
5 and 6, the solid arrows directed from the XYZ to the four words indicate synonyms, and the broken arrows directed from the AB to the four words indicate secondary synonyms. Yes. In this way, when one synonym is found, it is possible to search for synonyms in a chain by searching for further synonyms of the synonym.
[0023]
The search device described above is based on the essence of human recognition. That is, when it is determined whether or not a person is a synonym, it is recognized whether or not it can be replaced. The search device described above automatically obtains a word that can be substituted for the input word by the search program 65. As described above, the algorithm is very simple such as a forward match search or a backward match search. However, the algorithm of the search program 65 is based on the essence of whether the above-described replacement is possible for determining a human synonym. There is no such thing that searches for synonyms based on the essence of human recognition.
[0024]
The search device described above can be adapted to Japanese or other languages such as English, French, German and Chinese. That is, the target language is not limited. Further, as described above, if the search device can be automatically activated, the update operation can always be performed. In addition, the replaceable word 19 described above can extract not only a synonym but also a word having a meaningful hierarchical relationship (inclusion relationship) (for example, “elastic body” as an acronym of “rubber”). It is.
[0025]
In addition, in the above-mentioned example, the explanation was made by taking a word as an example, but not only a word but also a character, a phrase, a phrase, a lexical, a sentence, a sentence, a document, a report, a manual, a report, a survey, a magazine, a publication It can also be applied to character strings such as. For example, when a sentence is input, it is possible to perform syntactic analysis, search for a replaceable sentence, and output it as a replaceable sentence.
In addition, by searching for replaceable sentences, sentences, and texts, it is possible to classify the input sentences, sentences, and texts by category. Just as a word is related as a synonym, an input sentence, sentence, or text can be automatically classified by associating a sentence, sentence, or text as a synonym sentence or synonym text.
[0026]
Embodiment 2. FIG.
FIG. 7 is a diagram illustrating the search device according to the second embodiment.
In the component shown in FIG. 7, a set refers to a set of character strings such as characters, words, clauses, phrases, and sentences. These sets are data stored in a storage device of a computer, stored as a file, stored as an email, stored as a web page or home page, or stored as a database. It is something that has been done.
Further, the control unit and replaceable character string search unit described below may be realized by software, may be realized by hardware, or may be realized by a combination of software and hardware.
Each component in FIG. 7 may be mounted as long as the following conditions are satisfied.
[0027]
Input string set
-Holds a set of strings.
-You can extract the elements of the set one by one to the end.
[0028]
Sampling string set
-Holds a set of strings.
-It is possible to extract a subset including a character string that matches a certain character string with a forward match, an intermediate match, and a backward match.
[0029]
Control unit
・ Accept start trigger instructions.
-Perform loop processing to search for each element of the input string set.
-Send a search request to the replaceable character string search unit.
Add the search result list to the replaceable string list set.
[0030]
Replaceable string search part
Request primary search for sampling string set.
Request secondary search for sampling string set.
Create a replaceable string list (including ranking).
[0031]
Replaceable string list set
Holds a list of search results of replaceable character strings for one element of the input character string set.
[0032]
Implementation example
An RDBMS (relational database management system) is an example of implementation of a sampling character string set.
In this case, the implementation of the replaceable character string list set is an efficient implementation of the association entity.
[0033]
Examples of the method of collecting the character string sets held by the input character string set and the sampling character string set are as follows, but are not limited thereto. That is, the operating condition of the system is that character strings exist as a set, but the collection method is not specified.
Sampling string set
・ User input
・ Received mail
・ Browsed web pages
・ Web pages collected by robots
Input string set
・ User input
・ Sampling string set itself
[0034]
Examples of the start timing of the generation operation of the replaceable character string set list are as follows, but are not limited thereto.
・ Start-up instructions from the user
-Notification of input string set status change (such as increase / decrease of set elements)
・ Regular startup
[0035]
Next, the cooperative operation of the search device shown in FIG. 7 will be described.
(0) Start instruction
An activation trigger is generated for the control unit. The activation trigger may be a case of a user, a change notification from an input character string set, a change notification of a sampling character string set, or a periodic activation.
(1) Acquisition of input character string
A control part acquires an input character string from an input character string set after starting. This acquisition operation is performed in order for the number of character strings in the input character string set. That is, loop processing is performed for each element (character string) of the set.
(2) Search for replaceable character strings
The control unit gives the character string acquired from the input character string set to the replaceable character string search unit. The replaceable character string search unit searches for a character string list that can be replaced with the input character string by the operation described below, and outputs it to the control unit.
(3) Primary search
The replaceable character string search unit performs a search similar to that of the first embodiment on the sampling character string set. The sampling character string set may be a dictionary similar to that of the first embodiment, or may be a database that can extract a subset including character strings that match the input character string with forward match, intermediate match, and backward match. I do not care. For example, the sampling character string set may be a database that accepts an SQL sentence or a database that accepts a cure (inquiry).
(4) Secondary search
The replaceable character string search unit performs a secondary search similar to that of the first embodiment on the sampling character string set to obtain a replaceable character string.
(5) Creation of replaceable character string list
The replaceable character string search unit creates a replaceable character string list by assigning priorities or rankings using the appearance frequency and appearance frequency of replaceable character strings obtained by secondary search, and creating a replaceable character string list. Output to.
FIG. 8 is a diagram illustrating an example of the frequency (ranking).
Assume that five words are held in the sampling character string set as shown in FIG. Then, as shown in FIG. 8B, when a primary search is performed with the word “Seibu”, two words “Seibu Railway” and “Seibu Department Store” are searched, and “Railway” and “ Two character strings "department" are obtained. As a result of the secondary search using these two connectable character strings, the words “Tobu Railway”, “Tobu Department Store”, and “Mitsukoshi Department Store” are obtained as a result of the secondary search. As shown in FIG. 8C, “Tobu” and “Mitsukoshi” are obtained as replaceable character strings, and the frequency (ranking) is “Tobu” is 2 and “Mitsukoshi” is 1. .
(6) Addition to replaceable character string list set
The control unit adds the replaceable character string list obtained from the replaceable character string search unit to the replaceable character string list set. The control unit sequentially extracts all character strings from the input character string set, obtains a replaceable character string list, and outputs the replaceable character string list to the replaceable character string list set.
[0036]
【The invention's effect】
As described above, according to the present invention, synonyms are automatically searched as replaceable words, so it is possible to find synonyms in a hidden relationship that cannot be easily found by the user. In other words, there is a possibility of finding a relationship that cannot be found if there is a preconception. If the user wants to know why what was output as a synonym became a synonym, prepare an interactive interface (not shown) and search the system for why the synonym is synonymous with the system. You can ask what happened. In that case, the interactive interface displays the primary word 13, the connectable word 15, and the secondary word 17 shown in FIG. 3, that is, displays the progress of the search, so that the word is a synonym. The user can be informed about the reason for the search.
[0037]
Further, according to the present invention, as an application example of the present invention, a synonym dictionary can be automatically constructed. Conventionally, synonym dictionaries have been compiled manually, requiring enormous effort. For this reason, a synonym dictionary could not be owned by an individual. However, according to the search device of the present invention, a personal private synonym dictionary can be automatically created. Also, synonym dictionaries for specialized fields and special fields can be automatically created and updated automatically.
[0038]
In addition, according to the present invention, the number of keywords given to the search engine can be automatically increased when performing a database search or Internet search.
[0039]
Further, according to the present invention, a basic database for artificial intelligence can be constructed using a search device. The synonym dictionary is a clue for the computer to know the meaning of the word. This synonym dictionary is automatically constructed, and this synonym dictionary can be used as a basic database for artificial intelligence.
[Brief description of the drawings]
FIG. 1 is a configuration diagram of a personal computer 51 in which a search device according to Embodiment 1 of the present invention operates.
FIG. 2 is a configuration diagram of a search program 65 according to Embodiment 1 of the present invention.
FIG. 3 is an operation diagram of a search program 65 according to the first embodiment of the present invention.
FIG. 4 is a diagram showing a specific example of the first embodiment of the present invention.
FIG. 5 is a diagram showing an example of registered words in the dictionary 63 according to the first embodiment of the present invention.
FIG. 6 is a diagram showing a synonym chain according to Embodiment 1 of the present invention;
FIG. 7 is a cooperative operation diagram according to the second embodiment of the present invention.
FIG. 8 is a diagram showing a specific example of Embodiment 2 of the present invention.
[Explanation of symbols]
DESCRIPTION OF SYMBOLS 11 Input word, 13 Primary word, 15 Combinable word, 17 Secondary word, 19 Replaceable word, 21 Word input part, 23 Search part, 25 Primary search part, 27 Secondary search part, 29 Count part, 31 Output part 33 Sorting unit 35 Weight reduction unit 37 Association unit 39 Loop unit 51 Personal computer 53 CPU 57 Memory 59 Communication board 61 Magnetic disk 63 Dictionary 65 Search program 67 Browser 69 Compact disk Drive, 71 Flexible disk drive, 73 Keyboard, 75 Mouse, 77 Internet, 79 LAN, 81 Personal computer, 83
Server computer.

Claims (8)

In a search device that searches a character string from a dictionary in which character strings are registered as registered character strings,
An input unit for inputting a character string as an input character string;
A search device, comprising: a search unit that searches a dictionary for a replaceable character string that can be replaced with an input character string that is input by an input unit. The search part above
A primary search unit for searching a registered character string including a part of the input character string as a primary character string from the dictionary using the input character string input by the input unit;
The remainder obtained by removing the input character string from the primary character string searched by the primary search unit is set as a connectable character string, and a registered character string including a part of the connectable character string as a secondary character string is searched from the dictionary. Next search part,
The output part which outputs the remainder part which remove | excluded the character string which can be combined from the secondary character string searched by the secondary search part as a replaceable character string which can be substituted with an input character string, It is characterized by the above-mentioned. The search device according to 1. The primary search part
A forward match search that searches for a registered character string that matches the input character string and the front of the registered character string, a backward match search that searches for a registered character string that matches the input character string and the back of the registered character string, and an input character Search the primary string by searching at least one of the middle match search that searches for the registered string that matches the middle of the column and the registered string,
The secondary search part
When the primary search unit searches for a primary character string by a forward match search, it searches for a secondary character string by a backward match search that searches for a registered character string that matches the connectable character string and the back of the registered character string,
When the primary search unit searches the primary character string by the backward match search, the secondary search is performed by searching for the registered character string in which the connectable character string and the registered character string are matched, and the secondary character string is searched.
When the primary search unit searches for a primary character string by an intermediate match search, it searches for a registered character string that matches both the connectable character string and the front and rear of the registered character string. The search device according to claim 2, wherein the search device is searched. The input unit sequentially inputs the registered character strings registered in the dictionary as input character strings,
The search unit searches the dictionary for replaceable character strings registered in the dictionary and outputs them,
The search apparatus further includes an association unit that stores information indicating that the replaceable character string output from the search unit is a character string replaceable with a registered character string in a dictionary. Item 4. The search device according to Item 1.   The search device further includes a loop unit that searches the replaceable character string for the replaceable character string by inputting the replaceable character string output from the search unit to the input unit as an input character string. The search device according to claim 1, wherein:   The secondary search unit has a counting unit that counts the number of appearances of the same secondary character string when the same secondary character string appears, and the output unit has a large number of occurrences of replaceable character strings. The search device according to claim 2, further comprising a sorting unit that sequentially outputs replaceable character strings.   The search device is characterized in that a search keyword for searching at least one of Internet data and database data is input as an input character string, and a keyword similar to the search keyword is output as a replaceable character string. The search device according to claim 1. An input string set that holds a set of input strings;
A sampling string set that holds a set of sampling strings for searching for a string that can be replaced with the input string;
A replaceable string list set that holds a set of replaceable string lists that are searched for and output for each string in the set of character strings held in the input string set, and replaced with a certain input string A replaceable character string search unit that searches for possible replaceable character strings from the set of sampling character strings held in the sampling character string set and outputs as a replaceable character string list;
The character string is sequentially input from the set of character strings held in the input character string set, the input character string is given to the replaceable character string search unit in order as an input character string, and output from the replaceable character string search unit And a control unit for adding the replaceable character string list thus made to the replaceable character string list set.

Images