JPH03116367A - Character processor - Google Patents

Abstract

PURPOSE:To realize a deleted word dictionary of high data compatibility by storing word information of a word to be deleted in an external memory and storing only the dictionary existence address generated from word information in an internal memory. CONSTITUTION:A RAM is provided with a deleted word dictionary DELD where words deleted from a dictionary DIC are stored. When a word existing in the dictionary DIC on a ROM is deleted, word information itself (reading, expression, and part of speech) of the word to be deleted is stored in an external memory DISK, and the existence address on the dictionary of the word to be deleted is stored in an internal memory DELD, and deletion of the word is realized by mere address matching at the time of conversion. Thus, the used size of the internal memory is reduced, and word information itself is loaded from the external memory and address information is generated again at the time of update of contents of the dictionary to realize the data compatibility, and KANA(Japanese syllabary)-KANJI(Chinese character) conversion of high conversion rate is presented to each operator, and the deleted word dictionary of high compatibility is inexpensively realized.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a character processing device for inputting a sentence containing kanji and kana through kana-kanji conversion.

[Prior Art] Currently, character processing devices such as Japanese word processors generally input sentences containing kanji and kana using kana-kanji conversion.

Conventionally, kana-kanji conversion dictionaries were often stored in external memory (floppy disk, hard disk).

However, as improvements in conversion methods such as - bracket conversion progress, the number of dictionary accesses increases, and (
However, due to the increasing demand for faster conversion, the mainstream is to store dictionaries in internal memory that can be accessed at high speed.

Internal memory consists of RAM, which can be read and written to and is volatile (memory contents disappear when the power is turned off), and non-volatile RAM, which cannot be written to (memory contents disappear even when the power is turned off). There are two types of ROM that are generally widely used.

If the dictionary is stored in RAM, the dictionary must be loaded from external memory to RAM in preparation before kana-kanji conversion, but this has the disadvantage of taking time to load.
Since AM is more expensive than ROM, it also has the disadvantage of higher costs. For this reason, dictionaries are generally stored in ROM.

Furthermore, recently, demands on the conversion rate of kana-kanji conversion have become more sophisticated, so there is a tendency for dictionaries to have larger capacities.

As the capacity of dictionaries has increased in this way, a considerable number of words that individuals would never use are stored in dictionaries. It is inevitable that such useless words are simply useless and waste memory, but they also cause erroneous conversions, and some operators would be grateful if they did not exist.

For example, suppose that as a result of an increase in the number of words, the surname "Kobe" is stored in the dictionary, and the name "Kou" is also stored in the dictionary. If an operator tries to convert ``Kobe Port'' using such a dictionary and types in ``Kobekou,'' then the kana-kanji conversion would normally include ``surname ten names.''
Since it has a built-in process that gives priority to the pattern ``Kobe Isao'', it is likely to be converted to ``Kobe Isao'' against the operator's intention.

In such a case, if you change "Ko" to "Minato", the learning will work and "Kobe Port" will be converted correctly the next time. However, as long as the surname "Kobe" exists in dictionaries, mistranslations will occur here and there, such as "Kobe City" becoming "Kobe-san" and "Kobe-made" becoming "Kobe-san." ,
Obstructs operability.

In the first place, the surname "Kobe" is a surname that is not familiar to ordinary people, and the solution of deleting it from the dictionary is time-consuming (and most effective. However, dictionaries usually have RO
Since the word exists on M, it is not possible to directly delete the word.

As a method for deleting a word on ROM, there is a method that memorizes the address of the word on the dictionary ROM and ignores the word at that position during conversion so that it is not used. One possible method is to store word information and, at the time of conversion, if a word matching the word exists in the dictionary on the ROM, that word is ignored and not used.

[Problems to be solved by the invention] However, deleting words using the above method of storing word information requires a considerable amount of memory each time one word is deleted, resulting in high costs and Matching with word information has the drawbacks of complicated processing and long conversion time.

In addition, when deleting words using the method of remembering addresses,
The deleted word dictionary becomes unusable when the contents of the dictionary are updated. Therefore, operators using multiple types of machines must create deletion word dictionaries for their machine languages, which poses a problem in terms of data compatibility.

Another possibility is to store both address and word information, but in that case the specification memory would be quite large (and
The disadvantage is that it is too costly.

[Means for Solving the Problems (and Effects)] In order to delete a word existing in a dictionary on a ROM, the present invention stores the word information (pronunciation, spelling, part of speech) of the word to be deleted in an external memory. In addition, the address of the deleted word in the dictionary is stored in the internal memory, and the word is deleted by simply matching with the address during conversion, thereby reducing the size of the internal memory used. Furthermore, when the contents of the dictionary are updated, data compatibility can be achieved by loading the word information itself from external memory and re-creating the address information. As a result of the above, it is possible to provide kana-kanji conversion with a high conversion rate for each operator, thereby reducing the operator's effort in selecting candidates, and to realize a deletion word dictionary with high compatibility at a low cost.

[Example] The present invention will be described in detail below with reference to the drawings.

FIG. 1 is an example of the overall configuration of the present invention.

In the illustrated configuration, the CPU is a microprocessor that performs calculations, logical judgments, etc. for character processing, and uses an address bus AB, a control bus CB, and a data bus D.
B to control each component connected to those buses.

Address bus AB transfers address signals indicating the components to be controlled by the microprocessor CPU. The control bus CB transfers and applies control signals for each component to be controlled by the microprocessor CPU. The data bus DB transfers data between each component device.

Next, ROM is a read-only fixed memory, and the first
Microprocessor CP, which will be described later with reference to Figures 0 to 14.
Control procedure by U and dictionary DIC for kana-kanji conversion
Let me remember it.

Further, the RAM is a writable random access memory having a configuration of 1 word and 16 bits, and is used for temporary storage of various data from each component. DELD is a deleted word dictionary and stores words deleted from dictionary DIC.

5WTBL is a search word table, and is a table for temporarily storing the existing positions of words required during kana-kanji conversion.

KB is a keyboard, which includes letters and symbols such as alphabet, hiragana, and katakana keys, and various function keys for instructing various functions for this character processing device, such as a conversion key, word deletion key, and execution key. We have everything in place.

DISK is an external memory for storing document data and deleted word dictionary DELD. Document, deletion word dictionary DEL
D is saved as needed, and the saved data can be called up when needed by instructions from the keyboard.

CR is a cursor register. The CPU can read and write the contents of the cursor register.

A CRT controller CRTC, which will be described later, displays a cursor at a position on the display device CRT corresponding to the address stored here.

DBUF is a display buffer memory that stores data patterns to be displayed.

CRTC is cursor register CR and buffer DBUF
It plays the role of displaying the contents stored in the CRT on the display device CRT.

Further, a CRT is a display device using a cathode ray tube or the like, and a CRT controller controls the dot-configured display pattern and cursor display on the display device CRT.

Furthermore, CG is a character generator that stores patterns of characters and symbols to be displayed on a display device CRT.

The character processing device of the present invention, which is composed of each of these components, operates in response to various inputs from the keyboard KB. When input from the keyboard KB is supplied, first, an included signal is sent to the microprocessor CP.
The microprocessor CPU reads various control signals stored in the ROM, and various controls are performed in accordance with these control signals.

FIG. 2 is a diagram showing an example of a conversion operation performed by the apparatus of the present invention. 2-1 first shows the screen when the reading sequence "Kobekou" is input. The cursor is displayed next to the input reading sequence. If you press the conversion key here, the screen 2-2 will appear. In 2-2, the pronunciation ``Kobekou'' is ``Kobe Isao.''
It has been converted to . This is not the conversion you want, so if you delete the word "Kobe" (surname) from the dictionary and then enter "Kobeko" again, you will get 2-
3 screen will appear. If you press the conversion key again here, 2-
4 screen appears, and this time it is correctly converted to "Kobe Port".

FIG. 3 is a diagram explaining the word deletion operation.

3-1 shows the initial screen, and when the word deletion key is pressed in this state, the screen 3-2 appears. Word deletion is activated in step 3-2, and a deletion word input window is displayed. When the operator inputs the pronunciation of the word to be deleted, ``Kobe'', the pronunciation of the word to be deleted is displayed in the window, and the screen shown in 3-3 appears. When the conversion key is further pressed, "Kobe" is converted to "Kobe" and displayed in the window, resulting in screen 3-4. If you press the execution key here, the notation and pronunciation of "Kobe" will be imported, a part-of-speech input window will open, and the screen 3-5 will appear. Here, when the operator inputs the part of speech "last name", the screen 3-6 appears. Press the execute key here.

Then, the word with the pronunciation "Kobe" written as "Kobe" and the part of speech "surname" is deleted from the dictionary, and the end message is displayed as shown in 3-7.

FIG. 4 is a diagram showing the configuration of dictionary DIC.

The dictionary exists on ROM. Therefore, the contents cannot be changed.

A "dictionary version" is stored at the beginning of the dictionary. This is data that is updated when there is a change in the contents of the dictionary, and all (dictionaries with the same contents have the same dictionary version.Is it necessary to update the address part of the deleted word as described later? It will be managed by Hoko's dictionary version.

Following the dictionary version, word data is stored. Each word data consists of ``pronunciation,''``notation,'' and ``part of speech.''

"Yomi" stores word reading information, for example, "Kobe" for "Kobe". The code is JIS X 02
Each character is stored as one byte using the lower byte of the 0g code.

"Notation" contains the notation information of the word, for example, if it is "Kobe", the character "Kobe" is 1 character, 2 bytes, and JIS X
It is stored using a 020g code or the like.

"Part of speech" is the part of speech of a word, for example, for "Kobe", "
Last name, place name, etc. are stored.

FIG. 5 is a diagram showing an example of data stored in the dictionary DIC. As shown in the figure, word data in the dictionary is stored in ascending order of pronunciation (lexicographical arrangement).

FIG. 6 is a diagram showing the structure of the deletion word dictionary DELD.

The deleted word dictionary is stored in external memory.

When the power is turned on, the necessary portion is read from external memory and loaded into RAM.

The deletion word dictionary is divided into three parts.

6-1 is a part that stores a "dictionary version". The dictionary version of the dictionary DIC when the address part of the deleted word dictionary was created is stored as is.

Reference numeral 6-2 is the entity part, which stores the pronunciation, notation, and part of speech of the deleted word, as detailed in FIG.

6-3 is an address field, which stores a pointer indicating where the deleted word exists on the dictionary DIC, as detailed in FIG.

ft 8, only the dictionary version 6-1 and the address part 6-3 always exist on the RAM.

The actual part 6-2 normally exists only in external memory. When it becomes necessary to recreate the address part, the real part 6-2 is temporarily loaded into the RAM from the external memory. In other situations, the memory corresponding to the entity part is freed and effectively used for another purpose.

FIG. 7 is a diagram showing the detailed configuration of the deletion word dictionary entity section.

It consists of three fields: ``pronunciation,''``orthography,'' and ``part of speech.'' The reading, spelling, and part of speech of the deleted word are stored.

The deleted word should normally exist in the dictionary DIC,
When it exists, the reading, notation, and part of speech in the dictionary DIC will be stored as they are.

In the figure, deleted word 1 is "Kobe" (surname), and deleted word 2 is "cabinet" (noun).

Note that there is no problem even if a word that does not exist in the dictionary DIC is written as a deletion word. Deletion words that do not exist are simply ignored.

FIG. 8 is a diagram showing the detailed structure of the deletion word dictionary address section.

In the deletion word dictionary address field, for each deletion word stored in the deletion word entity part, that word is stored in the dictionary D.
It remembers where it is in the IC.

The deletion word dictionary address part is data that exists to speed up the kana-kanji conversion process, and even without this data,
It can be recreated at any time from the entity part and the dictionary DIC.

For example, since deletion word 1 is "Kobe" (last name) according to FIG. 7, the address where "Kobe" (last name) exists in the dictionary DIC is stored as the first entry. Similarly, for deletion word 2, the address where "cabinet" (noun) exists is stored as the second entry.

The deletion word dictionary address field is data that depends on the version of the dictionary DIC, and the dictionary version of the dictionary DIC at the time of creation is stored at the beginning of the deletion word dictionary. Furthermore, when the version of the dictionary DIC is changed, it is re-created by referring to the data in the deleted word dictionary entity section.

FIG. 9 is a diagram showing the structure of the search word table 5WTBL.

The search word table is a table that temporarily stores where in the dictionary DIC the words necessary to analyze the input pronunciation sequence exist in the process of performing the kana-kanji conversion process.

For example, when the input pronunciation sequence is "Kobekou",
For this analysis, words such as "ko", "ko", "kobe", "u", "ube", "beko", "ko" are required, and the location of these words in the dictionary DIC is stored in the field "pointer". is memorized.

The operation of the above embodiment will be explained according to the flow.

FIG. 10 is a flowchart of the part that takes in key human power and performs processing.

Step 10-1 is an address creation process in which the deletion word dictionary is initialized as shown in FIG. 11: This process is normally executed only once immediately after the power is turned on.

Step 10-2 is a process of capturing data from the keyboard. In step 10-3, the type of the retrieved key is determined, and the process branches to a processing routine for each key.

When the conversion key is input, the process branches to step 10-4, and in step 10-4, conversion processing for kana-kanji conversion is performed as detailed in FIG. 12. After that, the process branches to step 10-2.

When the word deletion key is input, the process branches to step 10-5, and in step 10-5, the word deletion key operation detailed in FIG. 14 is performed. After that, the process branches to step 10-2.

If it is any other key, the process branches to step 10-6, and other processing such as insertion, deletion, etc. performed in a normal character processing device is performed. After that, the process branches to step 10-2.

FIG. 11 is a detailed flowchart of the "address creation process" in step 10-1.

In step 11-1, the "dictionary version" and "address part" of the deletion word dictionary are loaded from the external memory to the RAM.

In step 11-2, the dictionary version of the deleted word dictionary and the dictionary version of the dictionary DIC are compared. If there is a match, it will return as is, but if it does not match, it will be necessary to recreate the deletion word dictionary address part, so step 1
Proceed to 1-3.

In step 11-3, for re-creation, the address section is first initialized, and the dictionary version of the dictionary DIC is set as the dictionary version in the deleted word dictionary. Further, the deletion word dictionary entity part is read from the external memory into the RAM.

In step 11-4, one word to be deleted is extracted from the entity part.

In step 11-5, it is determined whether the processing has been completed for all deleted words, and if the processing has been completed, the process returns. If the process is not completed, proceed to step 11-
Proceed to step 6 to determine the deletion word address.

In step 11-6, a search is made to see where in the dictionary DIC the same word as the extracted word to be deleted exists, and its address is obtained.

In step 11-7, the address obtained above is set in the deletion word dictionary address field.

Then, since the next deleted word must be processed, the process branches to step 11-4.

FIG. 12 is a detailed flowchart of the "conversion process" in step 10-4.

In step 12-1, word search processing, which will be described in detail in the thirteenth section, is performed in order to register words necessary for analyzing the input pronunciation sequence in the search word table 5WTBL.

In step 12-2, the input pronunciation sequence is analyzed by morphological analysis, syntactic analysis, etc., and clause candidates are created.

In step 12-3, calculate the likelihood of each clause candidate and determine which clause is most likely to be converted;
Determined as the first candidate.

In step 12-4, a conversion result is created and output based on the determined first candidate.

FIG. 13 is a detailed flowchart of the "word search process" in step 12-1.

In step 13-1, one pronunciation of a word (pronunciation to be searched) necessary for analyzing the input pronunciation sequence is determined from the dictionary DIC.

In step 13-2, it is determined whether the reading to be searched for has become ``Na'', and if it has become ``Na'', the process returns.

In step 13-3, the dictionary DIC is actually searched for the pronunciation to be searched, and the address is obtained.

The deleted word dictionary address section is searched to determine whether the address found in step 13-4 is written in the deleted word dictionary address section.

In step 13-5, it is determined whether there is a matching address, and if there is, the word is considered to have been deleted, and the process branches to step 13-1 to proceed to the next search reading process. If the word does not exist, the word has not been deleted, and the process proceeds to step 13-6, where the address is registered in the search word table.

FIG. 14 is a detailed flowchart of the "word deletion process" in step 10-5.

In step 14-1, a notation input window for word deletion is displayed on the screen.

In step 14-2, processing is performed to receive the notation of the deleted word from the operator. The reading input by the operator and the notation selected are temporarily stored in the internal memory. When the operator inputs the notation and presses the execution key, the process moves to step 14-3.

In step 14-3, a part-of-speech input window is displayed. At this point, the part of speech input by the operator is imported into the internal memory. When the operator inputs the part of speech and presses the execution key, the process moves to the next step 14-4.

In step 14-4, the pronunciation, spelling, and part of speech obtained as a result of the processing up to now are registered in the deletion word data entity section. Since the actual part does not normally exist on RAM, it is read from external memory and registered.

In step 14-5, the dictionary D of the word just deleted
Find the address on the IC.

In step 14-6, the obtained address is also registered as a deletion word data address.

In step 14-7, word deletion termination processing is performed. That is, save the entire deleted word dictionary in external memory,
The area of the entity part on the RAM is released and a termination message is displayed on the window. Clear the window at an appropriate time and return.

[Other Embodiments] In the above description, R is used as the memory in which the dictionary is stored.
Although the case of OM has been described, the situation is the same for any non-writable memory, and the present invention is applicable to it. For example, words cannot be directly deleted from optical disks, CD-ROMs, etc. because they cannot be written to, but they can be deleted using the principles of the present invention.

In addition, although the deleted word dictionary is held by having an address, the present invention can be applied to any other way of holding the deleted word dictionary depending on the version of the dictionary as the same situation applies. . For example, even if the words are stored in consecutive numbers starting from the beginning of the dictionary, processing can be performed using a similar configuration.

In addition, how to hold the deleted word dictionary is to read, write, and read the words.
Although the word information has a part of speech, if there is other word information to be stored, it is necessary to store it, and if the information is unrelated to matching, storage can be omitted. For example, if there are words in the dictionary that have different frequencies but have the same pronunciation, spelling, and part of speech, the frequencies also need to be stored in the deleted word dictionary. However, if there are no words that have the same pronunciation, spelling, and part of speech and differ only in frequency, there is no need to forcefully store the frequencies in the deletion word dictionary.

[Effects of the Invention] As is clear from the above description, according to the present invention, even if the kana-kanji conversion dictionary exists in a non-writable memory, such as a ROM, the word information of the word to be deleted can be stored in an external memory. Since the internal memory stores only the dictionary existence address created from the word information, it is possible to create a deleted word dictionary with high data compatibility independent of the dictionary version.
Furthermore, since there is no burden on the conversion time, it is possible to realize an inexpensive character processing device that is easy to use for operators who wish to delete words.

[Brief explanation of drawings]

FIG. 1 is a block diagram of the overall configuration of the present invention, FIG. 2 is a diagram showing an operation example of kana-kanji conversion in the present invention, FIG. 3 is a diagram showing an example of word deletion operation in the present invention, Figure 4 is a diagram showing the configuration of the dictionary DIC in the present invention, Figure 5 is a diagram showing an example of words stored in the dictionary DIC in the present invention, and Figure 6 is the overall configuration of the deletion word dictionary in the present invention. 7 is a diagram showing the configuration of the deleted word dictionary entity part in the present invention. Figure 8 is a diagram showing the configuration of the deleted word dictionary address part in the present invention. FIG. 9 is a diagram showing the configuration of the deleted word dictionary address part in the present invention. FIGS. 10 to 14 are flowcharts showing the operation of the character processing device of the present invention. DISK...External memory CPU...Microprocessor ROM
...Read-only memory RAM ...Random access memory DIC ...Kana-kanji conversion dictionary DELD ...Delete word dictionary 5WTBL ...Search word table↓ Conversion key↓ Delete "Kobe" (surname) Input from ↓ Conversion key ↓ Word deletion key ↓ "Kobe" ↓ Conversion key ↓ Execution key ↓ "Last name" ↓ Execution key reading Notation Part-of-speech reading notation Part-of-speech East 10 Zuho/4 Figure

Claims (1)

[Scope of Claims] 1. An input means for inputting the pronunciation of a word; a dictionary in which the pronunciation, notation, and part of speech of the word are stored in correspondence; and the pronunciation string input by the input means is read by referring to the dictionary. a conversion means for converting into notation; a deletion word dictionary that stores both pointers of invalid words stored in the dictionary and word information such as pronunciations, spellings, parts of speech, etc.; and an external storage means. , a word deletion means for registering a word to be deleted in the deletion word dictionary, the conversion means does not convert the words registered in the deletion word dictionary, and the word deletion means externally stores word information in the deletion word dictionary. A character processing device characterized by storing data only in a storage means.