JPH03135663A - Character processor - Google Patents

Abstract

PURPOSE:To effectively use a memory space by detecting a character string stored in a subject character string storage means and satisfying the conditions to be pointed out among the documents. CONSTITUTION:A character string satisfying the conditions to be pointed out is stored and then detected out of a relevant document. This detected character string is stored together with its position in the document and its satisfying conditions. Then the characters satisfying the conditions to be pointed out is extracted out of the document. The stored character string is displayed via a display means. Thus such character strings that are not included in the document and to be corrected are not registered into a dictionary. Then the least necessary number of memories are used with high efficiency. Thus it is possible to prevent such a case where the character strings included in the document and to be corrected are not pointed out since the are not registered yet in the dictionary.

Description

[Detailed Description of the Invention] [Industrial Application Field] The present invention relates to a character processing device for creating and editing documents, and particularly has a function of searching and pointing out parts that should be proofread or should be checked. It relates to character processing devices.

[Prior Art] Conventionally, a character processing device that has a function of searching a created document and pointing out parts that should be proofread has a function of searching a created document and pointing out parts that should be proofread. A character processing device has been proposed that has already been registered or has been registered by itself, and has a function of pointing out parts to be proofread using the dictionary.

[Problems to be Solved by the Invention] However, in such a conventional character processing device that has a function of searching a created document and pointing out areas to be proofread, it is difficult to find a character string to be proofread in the document. However, since it is already registered in the dictionary, it has the disadvantage of requiring a larger amount of memory than necessary.

Another disadvantage is that even if a character string to be proofread exists in a document, it may not be pointed out because it has not been registered in a dictionary that has a large amount of memory.

[Means for Solving the Problems (and Effects)] According to the present invention, a document storage means for storing a document, a target character string storage means for storing a character string that satisfies a condition to be pointed out, and a document storage means for storing a character string that satisfies a condition to be pointed out; From among the documents stored in the storage means,
A character string pointing means for finding a character string that satisfies the conditions to be pointed out stored in the target character string storage means; an extraction means for extracting a character string that satisfies the conditions to be pointed out from documents stored in the document storage means, and the extraction means extracted character string storage means for storing the character string extracted by;
display means for displaying the document stored in the document storage means; instruction means for instructing to display the character string stored in the extracted character string storage means; Since the display control means displays the character strings stored in the extracted character string storage means, character strings to be proofread that do not exist in the document do not need to be registered in the dictionary, and the minimum memory required can be efficiently used. Even if a character string to be proofread exists in a document, it can be prevented from being pointed out because it is not registered in the dictionary.

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

FIG. 1 is a block diagram showing 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 paths.

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 in FIGS. 3 to 20.
The fixed data and notation of the katakana notation variation extraction rule dictionary KTRULDIC which stores the control procedure by U, the character string rules for extracting character strings with katakana notation variation from the katakana character string table KSKATATB, and the notation Fixed data of the katakana notation shaky extraction string dictionary KTSTRDIC that stores character strings that do not fall under the rules for extracting shaky character strings from the katakana character string table KSKATATB, and the katakana notation shaky extraction rule dictionary. Katakana notation fluctuation extraction rule non-applicable dictionary KTNRLD stores exceptional character strings that do not change orthography even when fixed data of KTRULDIC is applied.
Store fixed data in the IC.

Katakana notation fluctuation extraction rule dictionary KTRULD IC is
As will be described later with reference to FIG. 7, this is a dictionary that stores extraction rule heading information and extraction rule replacement information.

- Katakana notation fluctuation extracted character string dictionary KTSTRDIC is a dictionary that stores extracted character string heading information and extracted character string replacement information, as will be described later with reference to FIG.

Katakana notation fluctuation extraction rule non-applicable dictionary KTNRLDIC
As will be described later with reference to FIG. 9, is a dictionary that stores extracted character string heading information and extracted character string replacement information.

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.

TEXT is a text buffer, which stores documents handled by this character processing device in an internal format, as will be described later in FIG.

KBBUF is a keyboard buffer for storing input reading strings.

KSSBUF is a proofreading pointing buffer for storing the information pointed out in the text buffer TEXT using the katakana notation deviation pointing dictionary KSSDIC, as will be described later in FIG. information, replacement candidate number information, and replacement candidate information.

As will be described later in FIG. 10, KSSDIC is extracted from the text buffer TEXT and the text buffer TEXTI for time evaluation output, and is extracted from the katakana notation fluctuation extraction rule dictionary KTRULDIC, the katakana notation fluctuation extraction character string dictionary KTSTRDIC1 and This is a dictionary for pointing out fluctuations in Katakana writing that stores character strings to be corrected, created from a Katakana character string table KSKATATB created using the Katakana writing fluctuation extraction rule non-applicable dictionary KTNRLDIC, and includes pointing pattern information, Storage address information for replacement candidate information for pointed patterns and replacement candidate information for pointed patterns are stored.

KSKATATB is a katakana string table that stores katakana string information extracted from the text buffer TEXT and the text buffer TEXTI for comment output, as will be described later in FIG. It stores length, information, katakana character string information, and spelling variation candidate information storage address information (0FFFFH is stored in the initial state). In addition, using the katakana notation variation extraction rule dictionary KTRULDIC, the katakana notation variation extraction character string dictionary KTSTRDIC1, and the katakana notation variation extraction rule non-applicable dictionary KTNRLD IC, if there is any variation in writing, the address information for storing candidate information on notation variation is determined. Store.

KSKATWRK, as described later in FIG. To check whether the same character string is registered in the column table KSKATATB,
This is a work for registering a katakana character string table. Note that if the same character string exists in the katakana character string table KSKATATB, the katakana character string table KSKATAT
B is the work KSKA for registering the katakana character string table.
TWRK data is not registered.

TEXT 1 RA documents from external storage device DISK
This is a text buffer for temporary recall on M, and stores documents handled by this character processing device in an internal format, as will be described later in FIG.

KB is a keyboard, which includes alphabet keys, hirakana keys, katakana keys, and other character/symbol keys.
Numeric keys, proofreading indication start key, notation variation data multiple document specification key, notation variation data single document specification key, cursor movement key, selection end key, selection key, selection cancellation key, selection search key, etc. for this character processing device It is a raw potato that instructs various functions, and stores documents created on the text buffer TEXT, and the stored documents can be called up when necessary by instructions from the keyboard.

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

The 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. When displaying the contents of document data, a pattern is developed on DBUF based on the data on text buffer TEXT.

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 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. 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 the screen configuration formed on the display device CRT of the apparatus of the present invention.

In the figure, DSP means a display screen.

TS is the text screen, and the text buffer TEXT
The content of the document stored in is displayed.

KS is an area for displaying soft keys, and keys required depending on the operating situation, such as proofreading indication start key, notation fluctuation data multiple document specification key, notation fluctuation data single document specification key, cursor movement key selection end key, selection key , selection cancel key, selection search key, etc., and press K on the keyboard.
It is used to input data using the key in the corresponding position of B.

WDSP is a window display screen, and is an area where notation display or replacement candidates at the time of pointing out are displayed.

It is a diagram explaining the transition of the screen to be set.

With the document on the text buffer TEXT being displayed, the proofreading indication start key is input and the 9 notation is displayed on the window display screen WDSP. Here, the operator:
If the document name indicated by the cursor is not highlighted, by manually pressing the "Select" key, you can change the document to a document to be extracted for the katakana character string. If so, by pressing the "Cancel Selection" key, the document can be changed to a document that is not subject to extraction of katakana character strings.

Furthermore, by manually pressing the "end selection" key, the proofreading pointing process can be performed based on the document to be extracted from which the katakana character string is selected by the operator.

Here, the operator moves the cursor position to the saved document 2 using the cursor movement key (Fig. 3(b)), and manually presses the ``r select'' key to move the saved document 2 into the katakana character string. Make it an extraction target document (Figure 3 (C)).

Then, by manually pressing the "end selection" key, the operator can perform the proofreading pointing out process using the saved document 2 selected by the operator and the document stored in the text buffer TEXT. only the text buffer TEXT).

FIG. 4 is a diagram explaining the document contents existing on the text buffer TEXT (FIG. 4(a)), and a diagram explaining the document contents existing on the saved document 2 selected by the operator (FIG. 4(a)). b))) and a diagram explaining the transition of the screen by the proofreading pointing function that points out the parts to be proofread in the document existing on the text buffer TEXT (Fig. 4(c) ~(g)).

In Figure 3 (C), after specifying the saved document 2 as the target document for extraction of katakana character strings, as shown in Figure 4 (C), the parts to be proofread are automatically extracted and one proofreading is performed. The target area is displayed in reverse video with low brightness.

Here, when the operator inputs the selection search key, a screen appears that displays replacement candidates according to the proofreading indication buffer KSSBUF.

At this time, among the parts to be proofread on the text buffer TEXT, the first part is displayed in a high-intensity inverted state.

In FIG. 4(d), "Idea" is displayed in reverse video, indicating that its replacement candidates are "Idea" and "Idea".

Here, "idea" is a character string that existed in the archived document 2 in the external storage, and "idea" is a character string pointed out by the katakana notation fluctuation extraction character string dictionary KTSTRDIO.

Here, the operator moves the cursor position to the character string "idea" using the cursor movement key (see Fig. 4 (e).
)), by manually inputting the "r selection" key, the text in the text buffer TEXT is replaced with the character string "idea", and when the selection search key is input, the text buffer TEXT is then changed according to the proofreading indication buffer KSSBUF.
The portion to be calibrated above becomes inverted with high brightness on the display, and a screen displays replacement candidates (FIG. 4(f)).

In FIG. 4(f), "Feri" is displayed in reverse video, indicating that its replacement candidates are "Feri" and "Ferry."

Here, "ferry" is a character string that existed in the archived document 2 in the external memory, and "feri" is a character string that exists in the saved document 2 in the external memory, and "ferry" is extracted from the extraction rule heading information "I-dan character + long sound" of the katakana notation fluctuation extraction rule dictionary KTRULD I C. This is a character string pointed out by the rule replacement information "I-danji".

Here, the operator leaves the character string "Feri" on the text buffer TEXT by pressing the "select" key (FIG. 4(g)).

In a state where there is no location to be calibrated (FIG. 4(g)), the "selection search key" is not displayed on the soft keys (invalid).

The katakana character strings "jotsuki" and "jotsuki-" exist on the text buffer TEXT and on the saved document 2, but the katakana notation fluctuation extraction rule dictionary KTRULD
After extraction as a character string with irregular spelling based on the IC's extraction rule heading information "I-dan character + long sound" and the extraction rule replacement information "I-dan character", the Katakana notation irregularity extraction rule non-applicable dictionary KTNRLDIC extracts the character string with katakana orthographic irregularity. Not applicable.

FIG. 5 is a diagram explaining the structure of the katakana character string table KSKATATB.

The katakana character string table contains character count information for the number of katakana character strings and tekana character strings, katakana character string information (one character is stored as a 2-byte JISXO208 code), and notation variation candidate information storage address information (initial state is 0FFFFH
(relative address on the katakana string table) is stored.

In addition, the initial state of the storage address information for writing variation candidate information is stored as 0FFFFH, but there are katakana notation variation extraction rule dictionary KTRULD IC, katakana notation variation extraction character string dictionary KTSTRDIC1, and katakana notation variation extraction rule non-applicable dictionary KTNRLDIC. If there is a spelling variation, the spelling variation candidate information storage address information is stored using .

Figure 6 shows the work KSK for registering the katakana character string table.
FIG. 2 is a diagram illustrating the configuration of ATWRK.

The work for registering the katakana character string table is on the text buffer TEXT, and on the text buffer T for - time calling.
When storing the katakana character string information extracted from EXTl in the katakana character string table KSKATATB,
It exists to check whether the same character string has been registered in the katakana character string table KSKATATB, and includes the effective length of the work for registering the katakana character string table, information on the number of required characters, and katakana character string information (1 character). is stored in 2-byte JISX0208 code).

Figure 7 shows the Katakana notation fluctuation extraction rule dictionary KTRULD.
FIG. 2 is a diagram illustrating the configuration of an IC.

The katakana notation fluctuation extraction rule dictionary consists of extraction rule heading information and extraction rule replacement information.
This is a dictionary that stores character string rules for extracting from TATB.

For example, rules are stored in the direction in which the character string becomes shorter, such as for extraction rule heading information such as "A character + long sound" whose extraction rule replacement information is "A character".

Figure 8 shows the Katakana notation fluctuation extraction character string dictionary KT S
FIG. 2 is a diagram illustrating the configuration of T and RD IC.

・The katakana notation fluctuation extracted character string dictionary contains extracted character string heading information (one character is stored as a 2-byte JISXO208 code, and is stored in ascending order of JISXO208 code), extracted character string replacement information (1 This is a dictionary that stores character strings that do not meet the rules for extracting character strings with katakana notation from the katakana character string table KSKATATB. .

For example, for the extracted character string heading information "Artist", the extracted character string replacement information is "Artist".
Strings are stored in the direction in which they become shorter, as in

Figure 9 is a dictionary KTN that does not apply Katakana notation fluctuation extraction rules.
FIG. 2 is a diagram illustrating the configuration of RLDIC.

The Katakana notation fluctuation extraction rule non-applicable dictionary contains extracted character string heading information (one character is stored as a 2-byte JISX0208 code, and is stored in ascending order of JISXO208 code), extracted character string replacement information (one character is stored as a 2-byte JISX0208 code), extracted character string replacement information (one character is (stored in byte JISXO208 code), and the Katakana notation fluctuation extraction rule dictionary KTRULD
This is a dictionary that stores exceptional character strings whose notation does not change even when IC fixed data is applied.

For example, character strings are stored such that the extracted character string replacement information is "Arapia" for the extracted character string heading information "Abia".

Figure 10 shows the KSSDIC dictionary for pointing out fluctuations in katakana notation.
FIG.

The katakana notation fluctuation pointing dictionary is created from the katakana character string table KSKATATB, and contains the number of characters in the warning pattern corresponding to the number of warnings issued, and the character string information of the warning pattern (stored in JISXO208 code where each character is 2 bytes). ), storage address information for replacement candidate information for the pointed pattern, information on the number of replacement candidates for the pointed pattern and the number of characters of replacement candidates corresponding to the number of replacement candidates for each pointed pattern, character string information for the replacement candidate (one character is 2 bytes). ) is stored in JISXO208 code.

In addition, the character string information of the indication pattern is JISX0208
The codes are stored in ascending order.

FIG. 11 is a diagram illustrating the configuration of the calibration indication buffer KSSBUF.

The proofreading pointing buffer stores the information pointed out on the text buffer TEXT using the katakana notation fluctuation pointing dictionary KSSDIC, and the text buffer TEXT
Information on the location of pointed documents, information on the number of characters pointed out, information on the number of replacement candidates for the number of items pointed out on Part-time job (7) JISXO208:
) is stored.

In addition, the pointed document position information, number of pointed characters information, replacement candidate number information in this proofreading pointing buffer KSSBUF, character string length information of replacement candidates corresponding to the number of replacement candidates, and character string information of replacement candidates are stored in the text buffer. T
They are stored in the order indicated from the beginning of EXT.

FIG. 12 is a diagram showing the structure of the text buffer TEXT and the -time call text buffer TEXTI.

Text consists of multiple lines of fixed length data. Each line of data is similarly composed of a plurality of character data. Each character data is composed of 2 bytes per character, and is stored in, for example, JISXO208 code.

Further, the position of each character is specified by the Y coordinate indicating the line and the X coordinate indicating the character position within the line. For example, the fourth character from the left in the third line from the beginning of the text has an X coordinate of 4,
Y coordinate: Specified as 3.

Similarly, the current position of the cursor is also managed using the X and Y coordinates.

Next, the operation of the above embodiment will be explained according to the flowcharts shown in FIGS. 13 to 20.

FIG. 13 is an overall flowchart of the process of specifying a search range for katakana notation fluctuation data, the process of creating a dictionary for pointing out katakana notation fluctuations, and the process of pointing out areas to be proofread.

First, in step 13-1, an input from the keyboard KB is waited for, and when the input is received, data is taken into the keyboard buffer KBBUF. Here, if the beginning of the keyboard buffer KBBUF is the proofreading indication start key, the process branches to step 13-2, and if it is other than the proofreading indication start key, the process branches to step 13-3.

In step 13-3, other processes found in general word processors other than pointing out proofreading are performed according to the input key.

In step 13-2, the input from the keyboard KB is waited for, and when the input is received, the data is transferred to the keyboard buffer KBB.
Perform processing to import into UF. Here, if the beginning of the keyboard buffer KBBtJF is a notation variation data multiple document specification key, the process branches to step 13-5, and if it is a notation variation data single document specification key, the process branches to step 13-7, where the notation variation data If it is other than a multiple document designation key or a notation variation data single document designation key, the process branches to step 13-4.

In step 13-4, no processing is performed.

The process is then displayed on the display screen WDSP to designate the document from which the spelling variation data is to be extracted, and the process ends.

Next, in step 13-6, as detailed in FIG.
- Extract the katakana character string information from the document in the external storage specified in step 5, and create the katakana character string table KS.
Perform processing to store in KATATB and end the processing.

However, in this step 13-6, the notation variation candidate information storage address information of the katakana character string table stores 0FFFFH in the initial state.

In step 13-7, as detailed in FIG. 16, katakana character string information is extracted from the text buffer TEXT and stored in the katakana character string table KSKATATB, and the process ends. However, in this step 13-7, the notation variation candidate information storage address information of the katakana character string table stores 0FFFFH in the initial state.

Next, in step 13-8, as detailed in FIG. 17, for the katakana character string information stored in the katakana character string table KSKATATB, a katakana notation fluctuation extraction rule dictionary KTRULDIC, a katakana notation fluctuation extraction string dictionary Using KTSTRDIC1 and Katakana spelling variation extraction rule non-applicable dictionary KTNRLDIC, if there is spelling variation, then writing variation candidate information storage address information is stored.

Next, in step 13-9, as detailed in FIG. 18, the character string to be proofread is determined from the katakana character string table KSKATATB, which is created in step 13-8 and stores address information for writing variation candidate information. The information is converted into a dictionary format (including replacement candidate information), and a process is performed to create a dictionary for pointing out katakana notation fluctuations, KSSDIC,
Finish processing.

Next, in step 13-10, as detailed in FIG. 19, the text buffer TEXT is searched for a point to be pointed out using the katakana notation fluctuation pointing dictionary KSSDIC created in step 13-9. , creates information on the points to be pointed out (including replacement candidate information), and stores the information in the proofreading pointing buffer in S S B UF , and ends the process.

Next, in step 13-11, as detailed in FIG. 20, replacement candidate information for the points to be corrected is determined using the indication data created in step 13-10 and stored in the calibration indication buffer KSSBUF. Display, perform replacement processing, and finish processing.

FIG. 14 is a detailed flowchart of the process of specifying plural documents of notation variation data in step 13-5.

First, in step 14-1, the external storage Dr-S
Display the document name of the document in K on the window display screen WDSP.
Perform the processing to display on the screen.

Next, in step 14-2, an input from the keyboard KB is waited for, and when the input is received, data is taken into the keyboard buffer KBBUF. Here, if the beginning of the keyboard buffer KBBUF is a selection end key, the process branches to step 14-3, if it is a selection key, the process branches to step 14-4, and if it is a selection cancel key, the process branches to step 14-3.
Branches to step 4-5, if it is a cursor movement key, branches to step 4-6, and if it is a key other than the above, step 14
Branch to −7.

In step 14-7, no processing is performed.

Erase, memorize the specified state, and finish the process.

In step 14-4, if the document name indicated by the cursor is not highlighted (not selected), processing is performed to change the document indicated by the cursor to a document to be extracted with a katakana character string. (selected), and if it is inverted (selected), no processing is performed.

In step 14-5, if the document name indicated by the cursor is highlighted (selected), the document indicated by the cursor is changed to a document that is not subject to extraction of a katakana character string. (not selected), and if it is not inverted (not selected), no processing is performed.

In step 14-6, processing is performed to change the position of the cursor in the document designation display on the window display screen WDSP in the designated movement direction.

FIG. 15 is a detailed flowchart of the multiple document character string search process in step 13-6.

First, in step 15-1, the text buffer T
Search for and extract katakana character strings on EXT. However, once the katakana character string is extracted, this process ends. If the katakana character string does not exist, the process branches to step 15-5, and if the katakana character string exists, the process branches to step 15-2.

Next, in step 15-2, the katakana character string extracted in step 15-1 is stored in the katakana character string table registration work KSKATWRK.

Next, in step 15-3, a process is performed to check whether the same character string is stored in the katakana character string table KSKATATB with respect to the character string stored in the katakana character string table registration work KSKATWRK. If the same character string is stored, step 15-1
Branch into.

If the same character string is not stored, step 15-
Branches into 4.

In step 15-4, the character strings stored in the katakana character string table registration work KSKATWRK are stored in the katakana character string table KSKATATB in a predetermined table format. However, the address information for storing the spelling variation candidate information in the katakana character string table stores 0FFFFH in the initial state.

In step 15-5, one document that has not been subjected to the display processing in step 13-5 is called into the text buffer TEXT 1 for -time recall.

Next, in step 15-6, a process of searching and extracting a katakana character string on the text buffer TEXT1 for -time calling is performed. However, once the katakana character string is extracted, this process ends. If the katakana character string does not exist, the process branches to step 15-10, and if the katakana character string exists, the process branches to step 15-7.

Next, in step 15-7, the katakana character string extracted in step 15-6 is stored in the katakana character string table registration work KSKATWRK.

Next, in step 15-8, 9- K A T A is added to the katakana character string table for the character string stored in the katakana character string table registration work KSKATWRK.
Processing is performed to check whether the same character string is stored in TH. If the same character string is stored, the process branches to step 15-6.

If the same character string is not stored, step 15-
Branches into 9.

In step 15-9, the character strings stored in the katakana character string table registration work KSKATWRK are stored in the katakana character string table KSKATATB in a predetermined table format. However, the address information for storing the spelling variation candidate information in the katakana character string table stores 0FFFFH in the initial state.

In step 15-10, a process is performed to determine whether there are any documents that have not been subjected to the extraction process in step 13-5. If there is a document for which katakana character string extraction processing has not been performed, the process branches to step 15-5. If there is no document that has not undergone katakana character extraction processing, the process branches to step 17-1.

FIG. 16 is a detailed flowchart of the character string search process in step 13-7.

First, in step 16-1, the text buffer T
Search for and extract katakana character strings on EXT. However, once the katakana character string is extracted, this process ends. If the katakana character string does not exist, the process branches to step 17-1, and if the katakana character string exists, the process branches to step 16-2.

Next, in step 16-2, the katakana character string extracted in step 16-1 is stored in the katakana character string table registration work KSKATWRK.

Next, in step 16-3, a process is performed to check whether the same character string is stored in the katakana character string table KSKATATB with respect to the character string stored in the katakana character string table registration work KSKATWRK. If the same character string is stored, step 16-1
Branch into.

If the same character string is not stored, step 16-
Branches into 4.

In step 16-4, the character strings stored in the katakana character string table registration work KSKATWRK are stored in the katakana character string table KSKATATB in a predetermined table format. However, the address information for storing the spelling variation candidate information in the katakana character string table stores 0FFFFH in the initial state.

FIG. 17 is a detailed flowchart of the character string extraction process in step 13-8.

First, in step 17-1, a process is performed to set the point at which a character string with irregular spelling is extracted from the katakana character string table KSKATATB to the beginning of the katakana character string table KSKATATB.

Next, in step 17-2, the katakana notation variation extraction rule dictionary KT
RULDIC performs processing to determine whether it is possible to create character string candidates with different orthography, and if possible, performs processing to create all possible character string candidates with different orthography. If it can be created, the process branches to step 17-3. If it cannot be created, the process branches to step 17-4.

In step 17-3, a process is performed to search whether or not the spelling variation character string candidate created in step 17-2 is stored in the katakana spelling variation extraction rule non-applicable dictionary KTNRLDIC. As a result of the search process, if it exists, the process branches to step 17-7. As a result of the search process, if it does not exist, the process branches to step 17-5.

In step 17-4, the katakana character string table KSK is
For the character string at the point to extract the character string with fluctuation in writing from ATATB, use the Katakana transcription extraction string dictionary KTST.
The RDIC performs a process of determining whether or not a character string candidate with varying spelling can be created, and if it is possible, a process of creating a character string candidate with varying spelling is performed. If possible, step 17
Branch to -5. If it cannot be created, step 17-7
Branch into.

In step 17-5, a process is performed to search whether or not the spelled character string candidates created in step 17-2 and step 17-4 are stored in the katakana character string table KSKATATB.

As a result of the search process, if it exists, the process branches to step 17-6. As a result of the search process, if it does not exist, step 17
Branch to −7.

In step 17-6, the katakana string table KSK is
The location address (relative address of the katakana character string table KSKATATB) of the spelling variation character string candidate searched in step 17-5 is stored in the spelling variation candidate information storage address information of ATATB.

In step 17-7, the katakana string table KSK is
From ATATB, perform the process of setting the point at which the orthographic variation character string is extracted to the next point where the location address of the orthographic variation candidate is not stored in the notation variation candidate information storage address information (it remains in the initial state of 0FFFFH). Let's do it. If the end position of the katakana character string table KSKATATB is reached during the process of setting the next point, the process branches to step 18-1. During the process of setting the next point, if the end position of the katakana character string table KSKATATB has not been reached, the process branches to step 17-2.

FIG. 18 is a detailed flowchart of the process of creating a dictionary for pointing out fluctuations in katakana notation in step 13-9.

First, in step 18-1, a process is performed to set the point created by the dictionary KSSDIC for pointing out deviations in katakana writing from the katakana character string table KSKATATB to the beginning of the katakana character string table KSKATATB.

Next, in step 18-2, from the katakana character string table KSKATATB, the katakana notation fluctuation pointing dictionary K
A process is performed to set the point created by the SSD IC to the next point where the location address of the spelling variation candidate is stored in the spelling variation candidate information storage address information (not remaining at the initial state of 0FFFFH). If the katakana character string table KSKATATH is set to the next point,
When the end position is reached, the process branches to step 19-1. During the process of setting the next point, if the end position of the katakana character string table KSKATATB has not been reached, the process branches to step 18-3.

In step 18-3, the katakana notation fluctuation pointing dictionary K
The character string information of the indicated pattern is sent to SSDIC from JISXO.
Step 18-
Processing is performed to additionally store pointing pattern information and replacement candidate information for the points determined in step 2.

FIG. 19 is a detailed flowchart of the calibration point search process and the calibration indication data creation process in step 13-10.

First, in step 19-1, a text buffer T is created using the katakana notation fluctuation pointing dictionary KSSD IC.
A process is performed to set the search point of the proofreading point on EXT to the beginning of the text buffer TEXT.

Next, in step 19-2, processing is performed to search the text buffer TEXT for proofreading points using the dictionary KSSDIC for pointing out deviations in katakana notation. However, once the correction pointing out point is detected, this process ends. If no proofreading point is detected, the process branches to step 19-5, and if a proofreading point is detected, the process branches to step 19-3.

In step 19-3, the information on the proofreading part (pointed document position information, number of pointed characters, number of replacement candidates, replacement candidate information) is stored in the Katakana notation fluctuation pointing dictionary KSSDI.
C, additional storage processing is performed in the proofreading indication buffer KSSBUF.

Next, in step 19-4, the text buffer T
A process is performed to set the search point for the proofreading point on X, T immediately after the character string in the text buffer TEXT where the proofreading point was detected.

In step 19-5, the calibration indication buffers KS, 5B
The information stored in the UF allows the text buffer TEX
Processing is performed to change the display form of all the points on T where proofreading has been pointed out to the shaded state.

FIG. 20 is a detailed flowchart of the process of pointing out points to be corrected in step 13-11.

First, in step 20-1, an input from the keyboard KB is waited for, and when the input is received, data is loaded into the keyboard buffer KBBUF. Here, if the beginning of the keyboard buffer KBBUF is the selected search key,
The process branches to step 2o-2, and if the selected search key is not the selected search key, the process branches to step 20-3.

In step 2o-3, other processes found in general word processors other than the pointed-out location search are performed in accordance with the input key.

In step 20-2, the calibration indication buffer KSSBU
The information stored in F allows the text buffer TEXT
Processing is performed to search for the above proofreading points from the beginning. If there is no proofreading point, step 20-4
branch to. If there is a point to be corrected, the process branches to step 2o-5.

In step 20-5, for the pointed out part on the text buffer TEXT searched in step 2o-2, a replacement candidate character string is displayed on the window display screen WD based on the information stored in the proofreading pointing out buffer KSSBUF.
Performs processing to display the inverted cursor on SP.

In step 20-6, the input from the keyboard KB is waited for, and when the input is received, the data is transferred to the keyboard buffer KBB.
Perform processing to import into UF. Here, if the beginning of the keyboard buffer KBBUF is a selection key, step 20
Branches to -7 and if it is a cursor movement key, step 2
The process branches to step 0-8, and if the key is not a selection key or a cursor movement key, the process branches to step 20-9.

In step 20-9, no processing is performed.

In step 20-7, the window display screens WD, SP
The pointed out point on the text buffer TEXT is replaced with the replacement candidate character string at which the inverted cursor is located, and the information stored in the proofreading point buffer KSSBUF of the pointed out point is invalidated.

In step 20-8, the inverted cursor position on the window display screen WDSP is moved according to the cursor movement direction.
Perform the process to change.

[Other Examples] In the above description, a katakana character string is extracted from a text buffer and a document existing in an external storage device DISK, and a katakana notation variation extraction rule dictionary, a katakana notation variation extraction string dictionary, and We have explained that it is possible to create a dictionary for pointing out fluctuations in katakana writing using a dictionary that does not apply the rules for extracting fluctuations in katakana writing.

Similarly, English character strings are extracted from the text buffer and the document existing in external storage, and the English character notation fluctuation extraction rule dictionary, the English character notation fluctuation extraction string dictionary, and the English character notation fluctuation extraction rule not applicable. It is also possible to use a dictionary to create a dictionary for pointing out fluctuations in English character notation.

In this case, in the flowcharts of FIGS. 15 and 16, the process of extracting katakana character strings from the text buffer and the -time ejection text buffer is changed to the process of extracting English characters, and the katakana notation fluctuation extraction rules are changed. dictionary,
The katakana notation fluctuation extraction string dictionary and the katakana notation fluctuation extraction rule non-applicable dictionary are changed to the English character notation fluctuation extraction rule dictionary, the English character notation fluctuation extraction string dictionary, and the English character notation fluctuation extraction rule non-applicable dictionary. This is achieved by making changes.

Similarly, flat name character strings are extracted from documents existing in the text buffer and external storage, and a flat name notation fluctuation extraction rule dictionary, a flat name notation fluctuation extraction string dictionary, and a flat name notation fluctuation extraction are created. It is also possible to create a dictionary for pointing out fluctuations in the written name of a flat name using a dictionary that does not apply the rules.

In this case, in the flowcharts of FIGS. 15 and 16, the process of extracting katakana character strings from the text buffer and the -time call text buffer is changed to the process of extracting hiragana, and the katakana notation fluctuation extraction rule dictionary ,
The katakana notation fluctuation extraction string dictionary and the katakana notation fluctuation extraction rule non-applicable dictionary are changed to the flat name notation fluctuation extraction rule dictionary, the flat name notation fluctuation extraction string dictionary, and the flat name notation fluctuation extraction rule non-applicable dictionary, This is achieved by making changes.

[Effects of the Invention] As explained above, according to the present invention, there is no need for the dictionary for detecting points to be proofread to be resident in the memory except when detecting points to be proofread. , the memory space can be used when other functions are operating. Furthermore, since only the character strings to be proofread that exist in the document are registered in the dictionary, the minimum amount of memory required can be used.

Further, it is possible to prevent characters from being excluded from the indication target on a document because they are not registered in the dictionary, and it is possible to realize a character processing device that uses memory very efficiently.

[Brief explanation of the drawing]

Fig. 1 is a block diagram of the overall configuration of the present invention, Fig. 2 is a diagram showing the screen configuration of the device of the present invention, and Fig. 3 is a block diagram showing the screen configuration of the device of the present invention. Figure 4 is a diagram showing an example of a method for pointing out points that should be proofread in the present invention. Figure 5 is a diagram showing the structure of a katakana character string table in the present invention. FIG. 6 is a diagram showing the configuration of a work for registering a katakana character string table in the present invention. FIG. 7 is a diagram showing the configuration of a katakana notation fluctuation extraction rule dictionary in the present invention. Figure 9 shows the configuration of a dictionary for extracting katakana notation variations in character strings according to the present invention. Figure 9 shows the configuration of a dictionary in which katakana notation variations extraction rules are not applied in the present invention. Figure 10 shows katakana notation variations identified in the invention. FIG. 11 is a diagram showing the configuration of the proofreading indication buffer in the present invention. FIG. 12 is a diagram showing the configuration of the text buffer and the time-recall text buffer in the present invention. , FIGS. 13 to 20 are flowcharts showing the operation of the character processing apparatus of the present invention. DISK...external storage device, CPU...micro processor, ROM...read-only memory, RAM...random access memory KBBUF...keyboard buffer, KSSBUF...
...Buffer for proofreading indication, TEXT...Text buffer, TEXT 1...Text buffer for -time call, KS
SDIC...Dictionary for proofreading indications, KTRULDIC...Katakana notation fluctuation extraction rule dictionary, KTSTRD
I C ... Katakana notation fluctuation extraction character string dictionary, KTNRLD
IC...Katakana notation fluctuation extraction rule non-applicable dictionary, 5SDI
C...Dictionary for pointing out irregularities in katakana notation, KSKATATB...Dictionary for pointing out irregularities in katakana notation, KSKATWRK...Work for registering katakana character string tables.

Claims (1)

[Scope of Claims] 1. Document storage means for storing documents; Target character string storage means for storing character strings that satisfy conditions to be pointed out; Out of the documents stored in the document storage means. , a character string pointing means for finding a character string that satisfies a condition to be pointed out, which is stored in the target character string storage means; and a character string found by the character string pointing means,
A pointed character string storage means that can store the position in a document and a condition that the character string satisfies, and a character string that satisfies the condition to be pointed out is extracted from the document stored in the document storage means. extraction means; extracted character string storage means for storing the character string extracted by the extraction means; display means for displaying the document stored in the document storage means; and characters stored in the extracted character string storage means. A character string comprising: an instruction means for instructing to display a string; and a display control means for displaying a character string stored in an extracted character string storage means on the display means according to an instruction from the instruction means. Processing equipment.