JPS58117039A - Kana(japanese syllabary)/kanji(chinese character) conversion system - Google Patents

Abstract

PURPOSE:To improve the Kana-Kanji conversion rate, by writing an n-notation numeral representng the possibility of inter-connectin of words in a connection table, and using the numeral as one of parameters for word pickup. CONSTITUTION:A keyboard 1 inputs a kana character train and a CPU2 controls the Kana-Kanji conversion. A display 3 displays the result of conversion. A word dictionary is stored in an auxiliary storage device, and words in Kana and Kanji expressin, grammer information of words and frequency of appearance of words are written in the word dictionary. A connection table 6' representing the possibility of connection between part of speeches is stored in a memory 5. An n- notation numeral representing the possibility of connection between words is written in the connection table and the numeral is used as one of parameters for word pickup.

Description

[Detailed description of the invention] (1) Technical field of the invention
＞In other words, priority is given to the connectivity of words.
・ ■ Conventional technology and problems Figure 1 shows the 8-doku, A-structure of the Kana-Kanji conversion method! In the figure showing the embodiment, 1 is a keyboard, 2 is a central processing unit, 3 is a display, 4 is an auxiliary storage device, and 5 is a memory. The keyboard 1 is for inputting kana character strings, and the central processing unit 2 is for controlling kana-kanji conversion. The display 3 is for displaying the conversion results. A single dictionary is stored in the auxiliary storage device 4, and words written in kana, words written in kanji, grammatical information in single letters, and frequency of occurrence are entered in this single dictionary. A connection table indicating possible connections between parts of speech is stored in the memory device.

Conventional kanai-kanji conversion is generally performed as follows. In order to convert multiple phrases written solidly in kana or romaji strings into kanji, we first use a stone that separates each word into a string of single words to determine whether or not the divided words can be connected. This is determined using the grammatical information and connection table, and only connectable words are left as candidates, and among the remaining candidates, the one with the largest length and S degree is used as the result of kana-kanji conversion. .

FIG. 2 shows the structure of a conventional connection table.

The connection table 6 is a turtle that shows the possibility of connection between parts of speech. ``1'' is written at the intersection between parts of speech that have a possibility of connection, and between parts of speech that have no possibility of connection. rOJ is written at the intersection. In the connection table in Figure 2, there is a possibility of a connection between a place name and a number word, so the intersection of these is set to ``1'', and a connection is also possible between a place name and a place name suffix. These fulcrums also have “1”
It is clear from the examples of expressions such as ``Tokyo's 23 wards'' and ``Tohoku 6 prefectures'' that there is a possibility of a connection between a place name and a number word.

In the conventional method using a connection table such as No. 28, if f is used as the evaluation function = frequency of In this case, the result of kana-kanji conversion is determined only by

Since there is no consideration given to the fact that the probability of a word-to-word connection is 0, if the frequency of appearance of ``shi'' is greater than the occurrence of ``r city'', for example, The kana character string "Seal Puma V" should be converted to "Yokohama City" but instead is converted to "Yokohama 1 4".
``Yokohama'' is an earth sound, and ``four'' is a number word with a length of 1.
"r city" is a place name suffix with a length of 1.

Purpose of the Invention The present invention is based on the above-mentioned idea 111K, and provides a kana-kanji conversion method that can improve kana-kanji conversion by taking into account the possibility of connections between words. The purpose is to be sui.

(4) Structure of the invention [Therefore, the kana-kanji conversion method of the present invention uses a word dictionary in which words written in kana, words written in kanji, grammatical information of the words, and frequency of occurrence of the words are entered; In the kana-kanji conversion method, which has nine connection tables in which connection information between words is entered, and converts a temporary character string inputted using the word dictionary and the connection table into a sentence containing kanji, the connection table and When extracting words, write an n-ary number (Tarishi, n is meaning) in Φ that indicates the possibility of a connection between words. ** indicates that it is one of the parameters.゛(2)”□Embodiments of the invention ゛
'Hereafter, I will explain the present Okumei with reference to inversion.

The present invention introduces the concept of the probability of one connection being 1 into the connection table that was used to check whether or not words can be connected. FIG. 3' is a diagram illustrating the connection table of the present invention, where 6 pa indicates the connection table 6'Kk, the intersection point II between the parts of speech and the
A numerical value indicating the size of the possibility of continuation is entered.
The larger the value, the greater the possibility of connection.

In the illustrated example, the number 1!1 is written at the intersection between the place name and the numeral, and the number 12'' is written at the intersection/point between the place name and the place name suffix.Of course, 1 in the vertical direction The part of speech in front of the part of speech is the part of speech in the front, and the part of speech in the horizontal direction is the part of speech that follows the part of speech.The way to determine the evaluation function is 0.

f) = 1 S degree x 3.2 x (first half - connection degree). As in the previous example, let's consider converting ``Bakuhama ν'' into kana and kanji.

The evaluation function f(four) for "four" is f(four):=:1ooOX32'X1, and the evaluation function for /(city) is f(city)=900X3! 'It becomes X intention. /(&!g)</(city), so "11:
yhemaV" is converted to "Yokohama City." It is assumed that the appearance frequency of single (4) is "1000@, and the appearance frequency of single-r city" is 1900.

(0) Effects of the Invention As is clear from the above description, according to the present invention, nine or more phrases input at one time can be converted into kanji with a high conversion rate.

[Brief explanation of the drawing]

FIG. 1 is a diagram illustrating an example of the hardware configuration of a kana-kanji conversion device, FIG. 2 is a diagram illustrating a conventional connection table, and FIG. 3 is a diagram illustrating a connection table according to the present invention. 1...Keyboard! ...Central processing unit, 3...
Display, 5...Memory, 6 and 6'...Connection table. Patent Applicant: Fujitsu Ltd. Attorney: Yobu Kyotani

Claims (1)

[Claims] It is equipped with a nine-word dictionary in which words written in kana, words written in kanji, grammatical information of words, and frequency of appearance of words are entered, and an optical connection table in which connection information between words is entered, and using the above single dictionary and connection table. In the kana-kanji conversion method, which converts the light kana character string input by
In the connection table above, write an n-adic number (n is greater than 2) that indicates the possibility of a connection between words, and write a number that indicates the possibility of a connection between words. of parameters during single extraction! A Kana-Kanji conversion method that is characterized by: