JPH0576065B2 - - Google Patents

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 batch conversion have progressed, the number of dictionary accesses has increased, and even if this is not the case, the demand for speeding up conversion has increased, so dictionaries can be accessed at high speed. The mainstream method is to store data in internal memory.

The internal memory is readable/writable and volatile (memory contents disappear when the power is turned off).
Two types of memory are commonly used: RAM, and ROM, which is non-writable but non-volatile (memory contents do not disappear even when the power is turned off).

When storing a dictionary in RAM, the dictionary must be loaded from external memory to RAM as a preparation before kana-kanji conversion, but this has the disadvantage of taking time to load, and in addition, RAM is more expensive than ROM. This also has the disadvantage of increasing 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 can 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. Suppose an operator tries to convert "Kobe Port" using such a dictionary and types "Kobekou".
Kana-kanji conversion usually has a built-in process that gives priority to the "surname + first name" pattern, so
There is a high possibility that it will be converted to "Kobe Isao" against the operator's intention.

In such a case, if you change "Kong" to "Minato",
The learning will work and "Kobe Port" will be converted correctly 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." , impeding operability.

To begin with, the surname "Kobe" is a surname that is not familiar to ordinary people, and the easiest and most effective solution is to delete it from the dictionary. However, since the dictionary normally exists on the ROM, words cannot be deleted directly.

Dictionary as a way to delete words on ROM
A method that memorizes the address of a word on ROM and ignores the word at that position during conversion so that it is not used.Memorizes word information such as pronunciation, spelling, and part of speech of the word to be deleted, and matches it during conversion. If a word exists in the dictionary on the ROM, a method can be considered in which that word is ignored and not used.

[Problems to be Solved by the Invention] However, deleting words using the method of storing word information described above requires a considerable amount of memory each time one word is deleted, resulting in high cost.
Matching with word information at the time of conversion has the disadvantage that the processing becomes complicated and the conversion time becomes longer.

Furthermore, when deleting words by storing addresses, the deleted word dictionary becomes unusable when the contents of the dictionary are updated. Therefore, an operator using multiple types of configurations must create a deletion word dictionary for the machine language, which poses a problem in terms of data compatibility.

As mentioned above, no matter which method is adopted, there are some drawbacks.

[Means for Solving the Problems (and Effects)] In order to solve the above problems, according to the present invention, a character processing device is provided with an input means for inputting a kana character string and a word pronunciation. , a non-rewritable first dictionary means that stores words in correspondence with word information of the word including its notation, and kana characters inputted from the input means with reference to the first dictionary means. a conversion means for converting the string into the notation of the word whose reading is the kana character string; and a reading of the word that is to be invalidated in the conversion by the conversion means among the words stored in the first dictionary means; a second dictionary means for storing the word to be invalidated in association with word information of the word to be invalidated including the notation; and an invalid word for registering the word to be invalidated in the second dictionary means; a registration means, and a search for searching the first dictionary means at the time of activation to find a pointer in the first dictionary means of a word whose pronunciation and word information match the word stored in the second dictionary means; means, an invalid word pointer storage means for storing pointers searched by the search means, and an invalid word pointer storage means for storing a pointer searched by the search means, and a pointer in the first dictionary means of a word whose reading is the input kana character string in the conversion by the conversion means. and determines whether a pointer that matches the found pointer is stored in the invalid word pointer storage means, and if it is determined that it is stored, excludes the word corresponding to the pointer from the conversion target. Among the words stored in the non-rewritable first dictionary means, the words to be invalidated can be changed by the converting means to
This is to exclude them from conversion targets.

[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 arithmetic operations for character processing, logical judgments, etc. Control components.

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.

Next, the ROM is a read-only fixed memory, and stores the control procedure by the microprocessor CPU, which will be described later with reference to FIGS. 10 to 14, and the kana-kanji conversion dictionary DIC.

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. SWTBL is a search word table, which is used to temporarily store the locations of words required during kana-kanji conversion.

The KB is a keyboard with character symbol input keys such as the alphanumeric key, hirakana key, and katakana key, as well as various keys for instructing the character processing device to perform various functions such as the conversion key, word deletion key, and execution key. It has a function key.

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

CR is the cursor register. By 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 display buffer memory that stores data patterns to be displayed.

CRTC is the cursor register CR and buffer
It plays the role of displaying the contents stored in DBUF on the display 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 the 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, and when input from the keyboard KB is supplied, an interrupt signal is first sent to the microprocessor. Various control signals are sent to the CPU, and the microprocessor CPU reads out 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 reading sequence ``Kobekou'' has been converted to ``Kobe Isao.'' This is not the conversion you want, so "Kobe"
If you delete the word (last name) from the dictionary and then enter ``Kobekou'' again, the screen shown in 2-3 will appear. If you press the conversion key again, the screen 2-4 will appear, and this time it will be 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. 3-
Word deletion is activated in step 2, and an input window for the word to be deleted 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. If you press the execute key here, the word with the pronunciation "Kobe" notation "Kobe" and part of speech "surname" will be deleted from the dictionary, and the ending message will be 3-7.
It will be displayed as shown.

FIG. 4 is a diagram showing the configuration of the 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 the contents of the dictionary change, and dictionaries with exactly the same contents have the same dictionary version. As will be described later, whether or not the address part of the deleted word needs to be updated is managed by this dictionary version.

Following the dictionary version, word data is stored. Each word data consists of "pronunciation", "spelling", and "part of speech".

"Yomi" is the reading information of the word, for example, "Kobe"
If so, ``Kobe'' will be remembered. The code is JIS
The lower byte of the X0208 code is used, and each character is stored as one byte.

"Notation" is the notation information of the word, for example, "Kobe"
In this case, the character "Kobe" is stored as 2 bytes per character using JIS X 0208 code or the like.

"Part of speech" stores the part of speech of a word, for example, in the case of "Kobe", "surname", "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 parts are 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.

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

Note that only the dictionary version 6-1 and the address section 6-3 always exist on the RAM.
The actual part 6-2 normally exists only in external memory. 6 when it becomes necessary to recreate the address part.
The entity part of -2 is temporarily loaded into RAM from 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,""notation," and "part of speech," and the pronunciation, notation, and part of speech of the deleted word are stored.

The deleted word should normally exist in the dictionary DIC, and when it exists, the pronunciation, spelling, and part of speech in the dictionary DIC will be stored as is.

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 deleted 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.

The deleted word dictionary address section stores, for each deleted word stored in the deleted word entity section, where that word exists in the dictionary DIC.

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

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

The deleted 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 deleted word dictionary. Furthermore, when the version of the dictionary DIC changes, 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 SWTBL.

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, if the input pronunciation sequence is ``Kobeko'', words such as ``ko'', ``ko'', ``kobe'', ``u'', ``ube'', ``beko'', and ``ko'' are required for analysis. , the positions of those words in the dictionary DIC are stored in the field "pointer".

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

FIG. 10 is a flowchart of the part in which key input is received and processed.

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

Step 10-2 is a process of taking in data from the keyboard. In step 10-3, the type of key taken in 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. Thereafter, the process branches to step 10-2.

When the word deletion key is input, step 10−
The process branches to step 10-5, and word deletion supplementary processing detailed in FIG. 14 is performed at step 10-5. Thereafter, the process branches to step 10-2.

If any other key is pressed, the process branches to step 10-6, and other processing such as insertion, deletion, etc. performed in a normal character processing device is performed. Thereafter, 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 deleted word dictionary are retrieved from the external memory.
Load into RAM.

In step 11-2, the dictionary version of the deleted word dictionary is compared with the dictionary version of the dictionary DIC. If they match, the process returns as is, but if they do not match, it is necessary to recreate the address section of the deletion word dictionary, so proceed to step 11-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. Also, delete the word dictionary entity part from external memory.
Load into 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 processing has not been completed, the process advances to step 11-6 to determine the address of the word to be deleted.

In step 11-6, a search is made to see where in the dictionary DIC the same word as the extracted deleted word 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 SWTBL.

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, the likelihood of each clause candidate is calculated to determine which clause is most likely to be converted, and is 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 (pronunciation to be searched) of a word necessary for analysis of the input pronunciation sequence is determined from the dictionary DIC.

In step 13-2, it is determined whether there are no more readings to be searched, and if there are no more readings to be searched, the process returns.

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

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

In step 13-5, it is determined whether a matching address is found, and if so, 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.

Figure 14 shows the "word deletion process" in step 10-5.
This is a detailed flowchart.

In step 14-1, a notation entry 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 window for inputting the part of speech 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. The actual part usually does not exist in RAM, so it is read from external memory and registered.

In step 14-5, the address of the word just deleted on the dictionary DIC is obtained.

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, the entire deletion word dictionary is stored in an 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, the case where a ROM is used as the memory in which the dictionary is stored has been explained, but the situation is the same as long as it is a non-writable memory, and the present invention can be applied. For example, even with optical discs, CDROMs, etc., words cannot be directly deleted because they cannot be written to, but they can be deleted using the principles of the present invention.

In addition, we decided to hold the address as the way to hold the deleted word dictionary, but if it is held in a way other than an address that depends on the version of the dictionary,
Since the circumstances are still the same, the present invention can be applied. For example, even if the words are stored in consecutive numbers starting from the beginning of the dictionary, processing can be performed with a similar configuration.

In addition, the deleted word dictionary has been designed to have the pronunciation, spelling, and part of speech of the word, but if there is other word information that needs to be memorized, it is necessary to memorize it.
Furthermore, if the information is unrelated to matching, storage can be omitted. For example, in the dictionary,
If there are words with different frequencies but with the same pronunciation, spelling, and part of speech, the frequencies also need to be stored in the deletion 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 a kana-kanji conversion dictionary exists in a non-writable memory, for example, a ROM, the dictionary existing address of the word to be deleted and its By memorizing both word information such as pronunciation, spelling, and part of speech, we can create a word deletion dictionary with high data compatibility that does not depend on the version of the dictionary. It is possible to realize a character processing device that is easy to use for operators who want to use it.

[Brief explanation of the drawing]

Figure 1 is a block diagram of the overall configuration of the present invention, Figure 2 is a block diagram of the overall configuration of the present invention.
The figure shows an example of the Kana-Kanji conversion operation in the present invention, Figure 3 shows an example of the word deletion operation in the present invention, and Figure 4 shows the dictionary DIC in the present invention.
FIG. 5 is a diagram showing the configuration of the dictionary in the present invention.
A diagram showing an example of words stored in the DIC, FIG. 6 is a diagram showing the overall configuration of the deleted word dictionary in the present invention, and FIG. 7 is a diagram showing the configuration of the deleted word dictionary entity part in the present invention, FIG. 8 is a diagram showing the structure of the deletion word dictionary address section in the present invention, FIG. 9 is a diagram showing the structure of the search word table in the present invention, and FIGS. 10 to 14 are diagrams showing the structure of the character processing device of the present invention. Flowchart showing the operation. DISK...external memory, CPU...microprocessor, ROM...read-only memory, RAM...
...Random access memory, DIC...Kana-kanji conversion dictionary, DELD...Deletion word dictionary, SWTBL...
...Search word table.

Claims (1)

[Scope of Claims] 1. An input means for inputting a kana character string; and an unrewritable first dictionary that stores words by associating the pronunciation of the word with the word information of the word, including the notation. means, converting means that refers to the first dictionary means and converts the kana character string inputted from the input means into the notation of a word whose reading is the kana character string; and the first dictionary means. Of the words memorized in
a second dictionary means for storing words to be invalidated by associating the pronunciation of the word to be invalidated in the conversion by the conversion means with word information of the word to be invalidated including the notation; invalid word registration means for registering words to be invalidated in the second dictionary means; upon startup, searches the first dictionary means to retrieve words, pronunciations, and word information stored in the second dictionary means; a search means for obtaining a pointer of a matching word in the first dictionary means; an invalid word pointer storage means for storing the pointer searched by the search means; and in the conversion by the conversion means, the input kana character string Find a pointer in the first dictionary means for the word whose reading is , and determine whether a pointer that matches the found pointer is stored in the invalid word pointer storage means, and it is determined that it is stored. A character processing device characterized in that it has a control means for controlling to exclude a word corresponding to the pointer from a conversion target.