JP2621999B2 - Document processing device - Google Patents

Description

The present invention relates to a document processing apparatus such as a Japanese word processor or a computer capable of creating a document in Japanese, and more particularly, to an arbitrary entry word called a so-called user dictionary. The present invention relates to a document processing apparatus having a dictionary capable of registering words and phrases in correspondence with each other, and further capable of inputting a foreign language such as English or French and checking the spelling of the foreign language.

(B) Conventional technology Conventionally, in this type of document processing apparatus, when a foreign language such as English or French is input and its spell check is performed, a spell check dictionary in which many words are registered in advance is used. Is prepared, and the spelling of the foreign language entered is checked by checking the dictionary.

In addition, in order to cope with a special word used on the user side, an additional dictionary that can be registered on the user side is provided in addition to the spell check dictionary.

To register and delete words in the additional dictionary, a registration and deletion utility program is prepared, and registration and deletion are performed using the utility program.

(C) Problems to be Solved by the Invention However, in this type of conventional document processing apparatus, an entry word is stored in a dictionary called a user dictionary, which can register an arbitrary entry word and a word in association with each other. There is a problem that it is necessary to separately prepare a utility program for registering words and phrases and deleting the registered words and a utility program for the above-mentioned additional dictionary for spell checking.

The present invention has been made in view of such circumstances, and provides a document processing apparatus in which a utility program is integrated by using a user dictionary as an additional dictionary for spell checking.

(D) Means for Solving the Problems FIG. 1 is a block diagram showing the configuration of the present invention. As shown in the figure, the present invention provides input means 10 for inputting a character string.
1, a user dictionary 102 in which a heading character string and a registered character string can be arbitrarily associated and registered, a spell check dictionary 103 storing words composed of a plurality of alphabets, and characters input from the input means 101. Input storage means 104 for storing a sequence, and the spell check dictionary for the alphabet character string stored in the input information storage means 104
A document processing apparatus comprising spell checking means 105 for checking spelling with reference to 103 and a user dictionary 102, wherein the user dictionary 102 is used for both kana-kanji conversion processing and spell checking processing.

It should be noted that the input means 101 only needs to be capable of inputting a character string, and a keyboard device is mainly used.

Further, as the user dictionary 102, a dictionary generally called a “user dictionary” that can register a heading character string and a registered character string in an arbitrary manner is used. As the user dictionary 102, an internal memory such as a core memory or an IC memory, or an external storage device such as a floppy disk device or a magnetic disk device is usually used.

Further, as the spell check dictionary 103, any memory capable of storing words composed of a plurality of alphabets may be used, and an internal memory such as a core memory or an IC memory, or an external storage device such as a floppy disk device or a magnetic disk device is used. .

And, as the spell checking means 105, generally, C
It is convenient to use a microcomputer including a PU, a ROM, a RAM, and an I / O port. As the input information storage means 104, a RAM therein is usually used.

(E) Function According to the present invention, the character string input from the input means 101 is stored in the input information storage means 104. Then, the spell check unit 105 refers to the spell check dictionary 103 and the user dictionary 102 with respect to the alphabet character string stored in the input information storage unit 104, and performs a spell check. But,
It is used for both kana-kanji conversion processing and spell check processing.

Therefore, if words consisting of alphabets are registered as headings in the Kana-Kanji conversion user dictionary, the spelling of special words used by the user can be checked in this Kana-Kanji conversion processing user dictionary. A user dictionary dedicated to spell checking is not required, and a utility program used for registering and deleting words can be integrated only for a user dictionary for kana-kanji conversion processing.

(F) Embodiment Hereinafter, the present invention will be described in detail based on an embodiment shown in the drawings. The present invention is not limited by this.

FIG. 2 is a block diagram showing a configuration of an embodiment in which the present invention is applied to a Japanese word processor.

In the figure, reference numeral 11 denotes a keyboard provided with a kana key and an alphabet key, and inputs a Japanese sentence composed of a kana character string and words composed of an alphabet, such as English and French, to the control unit 12.

The control unit 12 includes a microcomputer including a CPU, a ROM, a RAM, and an I / O port, and performs various types of data processing described below according to a control program written in a program memory (not shown) including a ROM.

Reference numeral 13 denotes a display device including a CRT display device, an LC (liquid crystal) display device, or an EL display device.

Reference numeral 14 denotes a sentence buffer for storing Japanese sentences input from the keyboard 11 and words such as English and French.

15 is a kana-kanji conversion dictionary for converting kana character strings into kanji-kana mixed sentences, 16 is an Ether dictionary that stores any headwords and phrases in correspondence with input from the keyboard 11, and 17 is a dictionary 15 and a user. This is a dictionary search device for searching the dictionary 16.

Reference numeral 18 denotes a spell check dictionary that stores a number of words such as English and French words composed of alphabets, and 19 denotes a spell check that checks the spelling of words such as English and French words stored in the document buffer 14 using the spell check dictionary 18. Device.

FIG. 3 is an explanatory diagram showing an example of the registered contents of the user dictionary 16. As shown in FIG. 3, for example, when "sharp" is input from the keyboard 11 and the conversion key is pressed, the dictionary search device 17 , Search the dictionary 15 and the user dictionary 16 for a word whose heading matches "Sharp" and return "Sharp Corporation" to the control unit 12, which then displays it on the display device.
Display at 13.

When words such as English and French are input, the control unit 12
Stores the word in the document buffer 14. Then, when a spell check instruction is issued from the keyboard 11, the control unit 12 extracts words such as English and French from the document buffer 14 one by one in order and sends them to the spell check device 19.

The spell check device 19 searches the spell check dictionary 18 to check whether the word is registered. If it is registered, return "OK" to the control unit 12 and check the next word. If not, return "NO" to the control unit 12 and send the word to the dictionary search device 17. . As described above, the spelling is correct, but may be “NO” because it is not registered in the spell check dictionary 18. Therefore, it is registered in the user dictionary 16 for normal kana-kanji conversion in a specific format.

First, the word is entered in the heading, and "s" is entered in the registered word so that the word is for spell checking. For example,
Register as “NARA → s” shown in FIG.

If there is no word in the spell check dictionary 18, the spell check device 19 sends the word to the dictionary search device 17,
Therefore, the user dictionary 16 is searched. The dictionary search device 17 returns the search result, if any, to the spell check device 19. If there is no search result, the spell checking device 19 returns "NO" to the control unit 12, and if there is a search result, the registered word is "s".
Check whether or not. If it is not "s", the control unit 12 returns "NO" to the operator to correct the spelling error, and if it is "s", it returns "OK" to the control unit 12.
Thus, even if there is no word in the spell check dictionary 18,
If you register words in the user dictionary 16 for kana-kanji conversion,
It is determined that the spelling is not misspelled.

Since words such as English and French are distinguished by uppercase and lowercase, when searching the user dictionary 16, the characters are changed as shown in Table 1 to search.

In other words, when all lowercase letters, change the characters to all lowercase letters, only uppercase letters, all uppercase letters, and change the letters to uppercase only, uppercase letters, all uppercase letters, and when they are all uppercase letters, search as is. Then, if you register all proper nouns in uppercase, for example, input words "nara", "Nara",
You can search for any of "NARA" and it is efficient.

Next, the contents of the processing operation of the control unit 12 are described in the fourth section.
The description will be made according to the flowchart shown in FIG.

First, one word is extracted from the sentence buffer 14 (step 51), and the spell check device 19 searches the spell check dictionary 18 (step 52).

Here, if there is no corresponding word in the spell check dictionary 18, it is determined whether the word form of the word is all uppercase, only the head is uppercase, or all lowercase (step 53). .

In this determination, if the word is all lowercase, the dictionary search device 17 first searches the heading of the user dictionary 16 with all lowercase letters (step 54). Is capitalized, and the heading of the user dictionary 16 is searched again (step 55). Otherwise, the word is capitalized and the user dictionary is changed.
The 16 headings are searched again (step 56).

Also, if a word is capitalized only at the beginning,
The heading of the user dictionary 16 is searched with the capital at the beginning (step 57). If not, the word is all capitalized and the heading of the user dictionary 16 is searched again (step 58).

Further, if the word is all uppercase, the heading of the user dictionary 16 is searched with all uppercase letters (step 59).

In steps 54, 55, 56, 57, 58 and 59, if the same word as the extracted word is found in the heading of the user dictionary 16, it is checked whether the registered word in the user dictionary 16 is "s" ( Step 60) If not "s", display device
Misspelling is displayed on 13 (step 61).

Also, in steps 56, 58, and 59, if the same word is not found in the heading of the user dictionary 16, the misspelling is displayed (step 61).

Then, if there is a word corresponding to the spell check dictionary 18 in step 52, and if the registered word in the user dictionary 16 is "s" in step 60,
In step 61, after displaying the misspelled word, it is checked whether it is the last word of the sentence (step 6).
2) If it is not the last word, the process returns to step 51, and if it is the last word, the process ends.

In this manner, a word from the alphabet is registered as a heading in the user dictionary 16, and if there is no word in the spell check dictionary 18, the spell check is performed by searching the user dictionary 16 and checking the spelling. You can check the spelling of special words used by users without using additional dictionaries.
A utility program used for erasing or the like can be integrated only for a user dictionary.

In addition, in the user dictionary 16, words such as English and French, which are composed of alphabets, are registered as headings.
Spell check data is not displayed in Kana-Kanji conversion.

(G) Effects of the Invention According to the present invention, when performing spell checking of words composed of alphabets such as English and French, for example, stored in the input information storage means, a spell check dictionary and a kana-kanji conversion user dictionary. Spell check by referring to, spell check dedicated user dictionary is not required, and utility programs used for word registration and deletion etc. should be integrated only for user dictionary for kana-kanji conversion processing Can be.

In addition, since the user dictionary for kana-kanji conversion processing stores words such as English, French, etc., which are composed of alphabets as headings, data for spell checking in kana-kanji conversion is not displayed.

[Brief description of the drawings]

FIG. 1 is a block diagram showing a configuration of the present invention, FIG. 2 is a block diagram showing a configuration of an embodiment in which the present invention is applied to a Japanese word processor, and FIG. 3 is an illustration showing an example of registered contents of a user dictionary. FIG. 4 is a flowchart showing the operation of the embodiment. 11 ... keyboard, 12 ... control unit, 13 ... display device, 14 ... sentence buffer, 15 ... dictionary, 16 ... user dictionary, 17 ... dictionary search device, 18 ... spell check dictionary, 19 ... ... Spell checker.

Claims (1)

(57) [Claims] 1. A first input function for converting a character string input from an input means into a character string of a different notation with reference to a conversion dictionary means and inputting a character string, and a spell check dictionary for an alphabet input from the input means. What is claimed is: 1. A document processing apparatus comprising: a second input function for performing spelling evaluation and input; and having at least first and second storage areas, wherein the first storage area includes a character string to be converted in the first input function. A user dictionary capable of arbitrarily registering a character string to be used or a character string for spell checking in the second input function, and a character string to be a converted character string in the first input function in the second storage area. In the character input in the first input function, a character string that matches the character string input from the input means is searched from the first storage area of the user dictionary, and the corresponding second character string is searched. While the character string stored in the area is output as a converted character string, in the character input in the second input function, a character string matching the character string input from the input means is searched from the first storage area of the user dictionary. A document processing apparatus comprising: a control unit configured to output an evaluation result of a spelling of an input character string; and a display unit configured to display a converted character string output from the control unit and the evaluation result.