KR860000681B1 - Hangul/hanja(korean character/chinese character)word processor - Google Patents

Abstract

No content.

Description

Hangul / Hanja word processor

1 is a system configuration diagram of the present invention.

2 is a flow chart in accordance with the present invention.

3 is a Hangul / Hanja conversion process according to the present invention.

Figure 4 is an illustration of the term change table of the Rom-3 (4) according to the present invention.

5 is an exemplary diagram showing a Hangul / Hanja word correspondence table in the floppy disk 7 according to the present invention.

* Explanation of symbols for main parts of the drawings

1: middle longevity anchor 2: rom-1

3: rom-2 4: rom-3

5: System RAM 6: Keyboard

7: floppy disk 8: display screen

CG: Clock Generator AL: Address Latch

DC ₁ ~ DC ₂ : Decoder KC: Keyboard Controller

DMC: DMA Controller FDC: Floppy Disk Controller

DPC: Display Controller AR: Address Line

DT: data line

The present invention relates to a Hangul / Hanja word processor. Particularly, a Hangul / Hanja conversion is automatically performed by a word mode that separates a word from a key input string, and then interprets the separated word in grammar. It is about a Hangul / Hanja conversion method.

In general, there are two general methods of converting Hangul into Hanja using a word processor, which is a document processing system. As one method, when a user inputs a character to be converted into Hanja, the word processor It is a method to convert all the Chinese characters corresponding to the sound by displaying them on the display screen and then selecting the corresponding Chinese characters from among them.

This method can not only handle Hangul characters at a time, but also increases the number of key inputs, and when the user lacks knowledge of Hanja, considerable difficulty has been encountered. On the other hand, the other method is the Chinese character mode method, in which a word that can be converted into Chinese characters is inputted and converted into words, that is, before and after the Hangul word that needs to be converted into Chinese characters. By entering a word to be converted into Hanja by placing a delimiter, all the corresponding Hanja words will be listed on the display screen, and the Hangul / Hanja conversion is performed by selecting the required words. It was. This method has caused a lot of inconvenience because it is necessary to distinguish between the Hanja part and the Hangul part by specifying the conversion range by specifying a delimiter using a specific code or a function key before and after the word that the operator needs to convert to Hanja. Even compound words consisting of words and more words should be placed in a database (Hanja / Hanja word mapping table), which makes it difficult to use memory efficiently due to the large amount of memory, and it is only a simple use of a dictionary containing words. There was a problem that could not process words that are not in the disk.

The present invention has been invented to solve the above problems, and the Hangul is divided into word phrases using spaces or punctuation marks (.,! Automatically analyze sentences and classify parts that can be converted into Chinese characters and irreversible parts into word or suffixes, and process them into prefixes, words, suffixes, or compound words. It is an object of the present invention to provide a Hangul / Hanja word processor by word mode that automatically converts Hanja conversion parts contained in the Hanja.

The operation and effects of the present invention will be described in detail with reference to the accompanying drawings. In the process of Hangul / Hanja conversion using Hangul / Hanja word processor, various terms are used in the process of grammar interpretation, and these terms are defined as follows for the convenience of use, but they are defined in Korean grammar. May be somewhat different.

Word: It represents a string of characters that make up a sentence, separated by a space or punctuation mark (.,!?; Etc.).

Words: Words that can be written in Chinese characters, especially among the smallest combination of letters with a certain meaning, are called words.

Prefix: A character that can be processed with Chinese characters, especially among characters that add meaning or texture by preceding a word without qualification as a word.

Suffix: A character that can be processed with Chinese characters, especially among characters that add meaning or texture after a word without qualification as a word.

Ending: A term that changes after a word or suffix.

RESEARCH: A grammatical relationship or addition to a word by adding it to a noun line of a statement or verb.

Compound word: A word that combines two or more words to form a single word.

Using the above terms, the basic structure of the word for grammar interpretation is subdivided into (Prefix) + Word + (Suffix) + (Ending or Survey), where the word may be a compound word or The term indicates that the term exists in some cases, the present invention is to realize the grammatical interpretation based on the word structure described above.

FIG. 1 shows a system configuration for realizing the present invention. When the user selects a kanji / word mode selector installed in the keyboard 6 as an input device, the key data of the word mode is displayed on the keyboard. Since it is applied to the central operation unit 1 through the controller (KC) it is recognized that the word mode. Then, the character strings inputted by the character keys of the keyboard 6 are latched to the address latch AL through the address line AR through the keyboard 6 data for the character string, and then the decoder DC ₁ is decoded. Data stored in the string buffer in the system RAM 5 and output from the address latch AL and maintained on the data line DT is transferred to the display screen 8 through the display controller DPC. It is indicated in order.

The display operation for the input of the character string performs the steps A and B of FIG. 2 before the control signal for wording is input. Here, when a space character or punctuation key (.,!?, Etc.) is selected and input, the central processing unit 1 controls the system RAM 5 to separate the input string into one word. do. The grammar analysis is performed based on the above-described word structure for the section separated into one word. The grammar analysis is performed under the control of the central computing unit 1 and the DMA controller and the floppy disk controller (FDC). For example, the Hangul / Hanja word correspondence table as shown in FIG. 5 is executed by referring to the word correspondence table in the dictionary floppy disk 7 in which the Hangul and Hanja are for understanding. The code used HEXADECIMAL on the KS table. The Hangul / Hanja correspondence table is composed of two or more letters, and words that can represent an idea are written in correspondence with each other.A compound word representing the meaning of a lump by combining two or more words corresponds to the Hangul / Hanja word in the correspondence table. The relationship is controlled. Therefore, compound words are processed by classifying and searching words and words.

In order to perform the kanji conversion word search (G step) as described above, the code value of the corresponding Hanja words is determined by using the code value corresponding to the Hangul word under the control of the central computing device ( ₁ ). This is stored in the buffer in the system RAM (5). Then, the grammar analysis is performed based on the word structure of prefix + word + suffix + search (or ending) for the separated word, and the first to two words of the word are searched in the word matching table. Determines whether the corresponding Hanja prefix exists in the prefix in rom-3 (4) by separating the first character in. If it exists in the prefix, it is separated by the Hanja prefix, followed by the prefix (the first Hangul character of the word). As described above, a word table in the dictionary floppy disk 7 is searched for a word having a certain concept, as described above for letters, that is, Hangul characters that can form words starting from the second Hangul letter of the word. Therefore, the Chinese character code of the prefix and the Chinese character code of the word determined as "Prefix + word" (step D) are stored in the buffer in the system RAM 5 through the decoder DC ₁ under the control of the central computing device 1. Lose.

Here, after searching for a word capable of Hangul / Hanja conversion, it is checked whether there is a word to be converted to Hanja, and if there is no word searched by the word representation, the Hanja conversion is processed as unnecessary pure text (step E), If there is more than one word, the characters that follow the word are searched for as suffixes or as search or ending words. That is, by using the suffix shown in FIG. 4 for the Hangul characters after the searched word, the system can search the suffix for whether the Hangul characters can be a single suffix (Step F). After the "word" or "prefix + word" stored in the buffer, the Chinese character code searched by the Chinese character suffix is added, and then the survey table stored in Rom-3 (4) shown in FIG. Combined relations in the survey table and the ending table by using one or more of the words `` prefix + word '', `` word + suffix '', and `` prefix + word + suffix '' that can be applied to a word that can be interpreted grammatically. Search for to determine whether the linkage of the survey or the mother is valid (step G).

However, if one word is searched in a Chinese word table and the letters following the word are another word that can be converted into Chinese characters, this is a compound word that is first combined with the searched word. It is not a compound word. Here, if compound word determination is required (step H), the searched words and prefix kanjis are stored in the buffer in the system RAM 5 up to this step (step I), and the following words in the dictionary floppy disk 7 are stored. The word table is used to search for a compound relationship of words (step C). Therefore, as described above, in the process of retrieving the compound word (step C. H), the compound word is treated as the new word by treating the compound word (a word after the word to be connected to the previously searched word) and referring to the word table to search for the Hanja code value. After the buffer is stored in the system RAM 5, the searching process (step F) to determine the connection relationship between the suffix and the search or the ending is executed again. If compound word processing is not necessary, the step I is converted to Chinese characters.

For example, as shown in FIG. 3, when the sentence "Inefficient production control" is input, the central computing unit 1 selects a space for spacing between "Inefficient" and "Production control." The control signal of the SPACE KEY is sensed to separate "inefficient" into one word. Similarly, the control signal of the function key corresponding to the sentence code (.) Written in the example of "Production control" separates "Production control" into the following word and an independent word.

Then, the grammar analysis is executed according to the above-described word structure, that is, the order of prefix + word + suffix + search (or ending), where prefix, suffix or search ( The term "mother" does not always apply to the word structure.

In the word "inefficient", the central computing unit (1) searches for the first letter of the word "bee" and the following "hyo" in the word table. It recognizes that it is non, and then searches for "hyo" and "rate" again in the word table. Thus, it reads that "efficiency" is the Chinese character "效 率", and stores the prefix and the word "non + efficiency" into a buffer in the system RAM 5. Then, the ROM is processed according to the suffix processing. The suffix in -3 (4) is used to read the Hangul character "red" as a Chinese character suffix "的" which can be converted to Hanja, and is connected after the "inefficiency" stored in the buffer in the system RAM (5). The buffer will contain the code value of the word "inefficient + red" in the buffer, and then search after "prefix + word + suffix" using the lookup table and the ending table in Rom-3 (4). Recognizing that the "in" is connected, the Hangul "inefficient" is displayed on the display screen 8 in Chinese character "inefficient".

On the other hand, when the selection of the homonym is required, the Chinese characters of the homonym stored in the buffer of the system RAM 5 are displayed on the display screen 8 by the character key and the function key of the keyboard 6 as an input device. In this case, the desired Hanja word is selected and the Hanja conversion is executed. Words that are not processed in the above parsing analysis are judged as pure or foreign words and processed as they are without conversion into Hanja. The image is replaced with the position of the Chinese character displayed on the display screen 8 to be displayed. Further, while processing the aforementioned word mode, the Chinese character / word mode selection key is positioned as the Chinese character mode, and when the user presses a letter key of the keyboard 6, which is an input device, the central computing device 1 performs the following Hangul / Hanja conversion. Recognizing that it is executed by the Hanja mode by word selection, the input string is stored in the buffer of the system RAM 5, and the Hangul / Hanja conversion is executed by the Hanja mode.

As described above, in the present invention, when a user simply inputs Hangul, the word automatically converts the necessary word into Hanja by the word mode, so that office work is much faster and accurate Chinese character conversion is possible. There is an advantage that can increase the efficiency of document preparation.

Claims (1)

(Correct) When the word mode is selected by the selected kanji / word mode selector among the keyboards 6 and the central operation unit 1 recognizes it, the Hangul character string input from the keyboard 6 is stored in the system RAM (5). After storing them in the buffer and displaying them on the display screen (8), the words are separated by a space or a control signal input by a function key of punctuation marks (.,!?, Etc.). Prefixes and suffixes placed before and after words that can be converted into Hangul / Hanja using the prefixes, suffixes, checks and endings in the Rom-3 (4), and the word table in the dictionary floppy disk (7). Hangul / Hanja word processor that automatically converts parts that can be converted into Hangul from Hanja by grammatical interpretation of the relation between the words and the investigation.

Images