JPS63211023A - Data retrieval system by kana expression - Google Patents

Abstract

PURPOSE:To retrieve the same character with different KANA (Japanese syllabary) by converting an input retrieval key in KANA expression and performing retrieval processing based upon the converted retrieval key. CONSTITUTION:An input KANA expression which is inputted as a retrieval key is so converted that a voiced, a semi-voiced, and a 'tu' sound are deleted, a long vowel is made into a vowel, and lower-case characters are changed into upper-case characters while 'wa'-'wo' are replaced with 'ha'-'ho', thereby performing retrieval by using the converted key. Consequently, when 'nihon' in Chinese characters is retrieved 5 by using a terminal 4, its retrieval key is converted into previously standardized expression 'nihon' and registered, and consequently the retrieval key is obtained by conversion regardless of whether 'nihon' or 'nippon' is inputted to perform the retrieval processing 5, thereby finding data having the key 'nihon'.

Description

[Detailed description of the invention] [Industrial application field] Invention r! A relates to an online data retrieval method, and particularly relates to a data retrieval method suitable for data crossbars using ambiguous kana expressions.

[Conventional technology]

Conventionally, search processing uses the input search key as is and compares it with the key of data in the file. Therefore, the search key must completely match the key in the data, and no consideration has been given to search keys in kana expressions that have ambiguity. A related technique of this type is JP-A No. 57-90782.

[Problem that the invention seeks to solve]

The above conventional technology does not take into account the ambiguity of kana expressions, which can be read differently depending on the user, and does not guarantee search results when the same character is expressed differently, so it imposes restrictions on search keys. There was a problem that I had to do it. Moreover, it placed a burden on users.

An object of the present invention is to reduce the burden on two users by performing search processing without adding restrictions to search keys.

[Means for solving problems]

The above purpose is to delete kana expressions entered as search keys, delete daku sounds, half daku sounds, and tsu sounds, convert long sounds to vowels, and convert lowercase letters to uppercase letters. “
This is achieved by converting the key to ``ho'''' and performing a search process using the converted key.

(Effect) Kana expression search key, dak sound, half dak sound, tsu sound are deleted,
By converting long sounds into vowels and converting lowercase letters into uppercase letters, converting "Vua" to "Vuo" into "Ha" to "Ho" respectively, and using the converted search key, the user can express kana. Even if the key is different, you can still search for the data in the file that has the converted key set in advance.

〔Example〕

An embodiment of the present invention will be described below with reference to the drawings. FIG. 1 is an overview of search processing using the present invention. First, when registering data 2 in file 3 from MTl, the search key added to the data (“Japan’”: 3:3
A truly unified table.

Convert and register.

When each user performs the search process 5 using the terminal 4, “
Even if you enter the characters ``Japan'' together with ``Nihon'' and ``Book Tsubon'', both will be converted to the search key ``Nihon'' instead of performing the conversion process. Search using the converted search key. By performing process 5, it is possible to search for data having the key "Nihon".

FIG. 2 is a 70-chart for performing the conversion process. When a search key is input, first put the search key into the work area separated by - characters 201゜Next, check whether the first three characters of the search key are "Gua. Gui, Vuuvuk, Vuo". Determine whether the following applies: 205° If it applies, say “ha, hee, fu.”

204゜Also, determine whether a character in the search key is a long sound.205゜If it is a long sound, compare it with the previous character and convert it into a vowel.206゜In the search key , if there is a daku sound, half daku sound, or tsu sound, 207. Delete 208 ° Also, if there is a lowercase letter, 209 make it uppercase 210
By repeating the above process 202 for each key, the kana expressions are unified.

〔Effect of the invention〕

According to the present invention, even if the kana expression is slightly different depending on the eight,
Correct search processing can be performed without adding constraints to the search key, and the user can use a normal expression.

[Brief explanation of the drawing]

Figure 1 is a configuration diagram of a search method according to an embodiment of the present invention;
The figure is a 74-chart diagram of the conversion process.0 1...MT, 2...Registration process, 3
...File, 4...Terminal, 5...
Search processing, 201, 204, 206, 208, 210...
·process. 202, 205, 205, 207, 209...
·judgement. Tow 1 diagram

Claims (1)

[Claims] 1. In the data search process that uses kana expressions to search for data, the search key for kana expressions is deleted by deleting dak, half-dak, and tsu sounds, converting long sounds to vowels, and converting lowercase letters to uppercase letters. ~ A data search method using kana expressions, which is characterized in that "Vuo" is converted into "Ha" to "Ho" respectively, and the search process is performed using the converted search key.