JPH03177971A - Retrieving method by abbreviation - Google Patents

Abstract

PURPOSE:To improve retrieval efficiency by permitting the retrieval of a data base when either targeted character strings with prescribed number of character exceeding the total number of each character unit of abbreviation includes each character unit in the same sequence as that of the character string of the abbreviation. CONSTITUTION:When either the targeted character strings 2 arranged continuously as in decided sequence in the data base 9 to be retrieved and with the prescribed number of characters exceeding the total number of each character unit of the abbreviation includes each character unit in the same sequence as that in the character string of the abbreviation, the data can be permitted to retrieve. Therefore, when no character-encoded data base can be retrieved with certain abbreviation in a conventional system, it is necessary to perform the retrieval based on several normal words or semi-normal words relating to the abbreviation, however, since the retrieval can be directly performed with only the abbreviation, the retrieval efficiency can be improved.

Description

[Detailed description of the invention] [Industrial application field]

The present invention relates to an abbreviation search method for searching a character-coded database based on an abbreviation that is a character string.

[Conventional technology]

In general, character-encoded databases are written using a mixture of several forms of words, such as formal words, semi-formal words, abbreviations, and abbreviations. Therefore, conventionally, the following method has been used to search a database based on an abbreviation or abbreviation (hereinafter simply referred to as an abbreviation). Abbreviations and corresponding formal or semi-formal words are set in advance in the form of a correspondence table, and based on whether the formal or semi-formal words corresponding to the abbreviations are included in the database, It was set as searchable or searchable. Alternatively, when a search is rejected, the official or semi-official words corresponding to the abbreviation are input one after another.

[Problem to be solved by the invention]

As explained above, with conventional technology, when a certain abbreviation cannot be searched, some formal words related to this abbreviation,
It is also necessary to search based on semi-formal words.
The verification process was time-consuming and troublesome, which hindered search efficiency. For example, when the abbreviation is [XX], its official word is (
XXXX Co., Ltd.], its semi-official term (XXXXK
, K), [XXXX■), and (XXXX). Therefore, if you are unable to search for [X×], search for [×XXXXXXXX], (XXXXK,
It is also necessary to search based on K), (XXXx■), and (XXXX), and in short, it is necessary to add searches using a total of five types of words (character strings). The object of this invention is to solve the problems of the conventional technology and improve the search efficiency when searching a character-coded database based on abbreviations that form character strings.
The objective is to provide a search method using abbreviations.

[Means to solve the problem]

In order to solve this problem, the abbreviation search method according to the present invention is a method of searching a character-coded database based on an abbreviation forming a string, which divides the string of abbreviations into individual characters. ;Select a target character string with a predetermined number of characters that are arranged consecutively in order in the database to be searched and exceeds the total number of each character unit;If any of these target character strings replaces each character unit with the character string of the abbreviation When the database is included in the same order as in the database, the database is used as a search blade.

[Working space] When any of the target character strings that are arranged consecutively in order in the database to be searched and have a predetermined number of characters exceeding the total number of each character unit contain each character unit in the same order as in the abbreviation character string, Use that database as a search blade. 【Example】

An application example of the search method using abbreviations according to the present invention will be explained with reference to FIG. 1, which is a conceptual diagram based on the application example. In FIG. 1, the abbreviation l (XXJ) is divided into its first unit character IA (X) and its second unit character IB (X). On the other hand, in the database 9 to be searched, ``I used XXXX on a business trip for...'' in 5 consecutive letters, shifting each letter one by one.
Create character strings separated by 1, and call each character string a target character string (meaning a target character string for searching), and assign a common code 2 to each character string. Note that the number of characters 5 of the target character string 2 is determined to be an appropriate number exceeding the total number 2 of unit characters of the abbreviation], mainly with reference to the number of characters of the formal word or semi-formal word related to the abbreviation 1. In Fig. 1, the target character string 2 includes: ■ one that does not contain any of the unit characters (X) or (X), as shown by dashed line underlining, and ■ - each unit character ( X),
Items containing either (X), ■Each unit character [×] as shown in solid underline. There are three types, □, which contain any of [×], and only when there is a target character string such as ■, the database 9 is used as a search blade, and when there are only target character strings such as ■ and ■, the database 9 The search is NG. That is, each character unit of the abbreviation CX), (X) in any target character string is
The search blade only works if the abbreviations appear in the same order as they appear in the string. There are two methods for searching for each target character string in the database 9 to see if it contains any of the unit characters (X) and (X) of ■. The first method is to select a target character string of five consecutive characters in order from the first character in the database, and use it as a search blade when each unit character (X), (X) is included in that order. It is. The second method is to sequentially search for unit characters [×] in the database, and when found, use this as a starting point to select a continuous target character string of 5 characters that contains the next unit character [×]. The search operation according to the first method will be described with reference to the flowchart shown in FIG. 2 and the conceptual diagram shown in FIG. 1. In FIG. 2, in step S1, a counter i is initialized,
i15 In step S2, counter j is initialized, j=1,
Do each. Note that i represents the order number from the beginning of each character in the database, and j represents the order number from the beginning of each character in the target character string of five characters. In step S3, it is determined whether the character Li belonging to the target character string is the first character unit (X)Xi of the abbreviation t (XX). If YES, the process moves to step S4; if NO, the process moves to step S6. In step S4, the characters Li+j of the target character string are abbreviation 1
It is determined whether it is the second character unit (X)X2 of (XX), and if YES, the process moves to step S5, and if No, the process moves to step S7. In step S5, “Searchable (OK)” is selected.
It is judged as J and ends. In step S6, it is determined whether the character L i+j of the target character string is the first character unit (X:l In step S7, j is incremented, and in step S
At step 8, it is determined whether or not j exceeds 4. If it does, the process returns to step Sll, and if it does, the process returns to step S4. Note that in steps S7 and S38, character units (
This is a procedure for sequentially checking whether X) X2 is included. In step S9, j is also incremented, and in step SIO, it is determined whether or not j exceeds 3. If it exceeds, the process returns to step Sll, and if it is below, the process returns to step S6. Note that step S9. SIO is a procedure for sequentially checking whether character units (X)XI are included in a target character string. Steps Sll and S12 are steps in which the above procedure is repeated for all n characters in the database. If No in step S12, the process returns to step S2 and the same procedure is performed for the next target character string. If YES
If so, in step S13, it is determined that the search is not successful (NG) and the process ends. Regarding the search operation according to the second method, please refer to the flowchart in FIG. 3 showing it and the conceptual diagram in FIG. 1. In FIG. 3, in step S1, the counter i is initialized,
i=1, and in step S2, the character Li belonging to the target character string is the first character unit EX of the abbreviation 1 [XX].
) XI, and if YES, the process moves to step S3; if NO, the process moves to step S6. Note that the counter i has the same meaning as in FIG. In step S3, counter j is initialized to j=1. Note that the counter j has the same meaning as in FIG. In step S4, it is determined whether the character L i+j of the target character string is the second character unit [navigation] In step S5, “Searchable (OK)” is selected.
) J is determined and the process ends. Step S6. S7 is a procedure in which step S2 is repeated for all n characters in the database. If NO in step S7, the process returns to step S2, and the same procedure is performed for the next target character string. If YES, in step S8, it is determined that the search is NG, and the process ends. In step S9, j is incremented, and in step 510, it is determined whether j exceeds 4, and if it exceeds the In step S6, if the result is below, the process returns to step S4. Note that step S9.SIO is a procedure for sequentially checking whether or not the character unit χ2 is included in the target character string. Comparing the two methods, it can be said that the second method is slightly simpler, as is clear from the total number of steps in the flowchart, 13 steps for the former and 8 steps for the latter. , the first method takes the steps of selecting each target character string in turn and checking whether each of the first and second character units of the abbreviation exists in it, whereas the second method This is because first, among the characters in the database, a character corresponding to the first character unit of the abbreviation is searched, and the subsequent steps are constrained by this search.

【Effect of the invention】

As explained above, in the present invention, if any of the target character strings that are consecutively arranged in order in the database to be searched and have a predetermined number of characters exceeding the total number of character units, each character unit is an abbreviation. The database is searchable if it is contained in the same order as in the string. Therefore, in the past, when a character-coded database could not be searched for a certain abbreviation, it was necessary to search based on several official or semi-official words related to this abbreviation. Since it is possible to search directly using just the abbreviation, it has the excellent effect of improving search efficiency.

[Brief explanation of drawings]

FIG. 1 is a conceptual diagram based on an application example of the method of the present invention, FIG. 2 is a flowchart showing the first search operation in the application example of the method of the present invention, and FIG. 3 is a second search operation in the same application example. FIG. Code explanation 1: Abbreviation, IA, IB: Character unit, 2: Target character string, 3rd consideration

Claims (1)

[Claims] 1) In a method of searching a character-coded database based on an abbreviation forming a character string, the character string of the abbreviation is divided into character units; Selecting target character strings with a predetermined number of characters exceeding the total number of character units; making the database searchable when any of the target character strings includes each of the character units in the same order as in the string of the abbreviations; A search method using abbreviations that is characterized by: