JPS62156761A - Document data processor - Google Patents

Abstract

PURPOSE:To simplify an input operation in order to reduce the load of an operator and to increase the input operation speed, by reading the designated paragraph data out of a document memory to use it as the input data when the retrieval is designated for the paragraph data. CONSTITUTION:The data supplied from an input part 1 is converted into a KANA (Japanese syllabary)-KANJI (Chinese characters) sentence by a CPU 2 and stored in a document memory 4. The data of the memory 4 are displayed at a display part 7. Here the parts A-D show the paragraph data and a dash shows a cursor. When a paragraph search key 1a is operated, a paragraph D closest to a cursor is retrieved out of the memory 4 and displayed at the cursor position by the CPU 2. Hereafter the following paragraph data C, B and A are displayed successively at the cursor position at every operation of the key 1a. If the data displayed at the cursor position is satisfactory, it is written to the memory 4 by means of a cursor shift key, an execution key, etc.

Description

DETAILED DESCRIPTION OF THE INVENTION [Technical Field of the Invention] The present invention relates to a technique for simplifying document data input operations in a document data processing device such as a Japanese word processor.

[Prior art and its problems]

When inputting data manually in a Japanese word processor, etc., data is entered by operating a kana key or the like. At this time, even if the phrase had already been entered manually, the user had to input it again by operating the kana keys or the like. In particular, even if a clause is used many times in the same sentence, it is inefficient to input it by key operation each time.
It was a burden on the operator.Furthermore, there was a drawback that the speed of the input operation could not be measured.

Furthermore, conventional devices have a so-called copying function that reads a specified sentence from low-input document data and writes it to another position in the document.

The operating procedure in this case is to first specify the range of words to be copied by changing the copy mode to 1" and then operating the cursor, and then specifying the position of the document to be copied. For this reason, the key operations are very complicated, and frequent copying of short phrases has the disadvantage of slowing down the manual labor speed.

[Purpose of the invention]

The present invention has been made in view of the above-mentioned circumstances, and allows specific phrase data to be read out by a simple operation from among data that has already been input as Bunbara data and used again as document data.

[Key points of the invention]

In order to achieve the above object, the present invention includes means for specifying a search for phrase data, and means for searching document data for phrase data in response to the means.

〔Example〕

(1) Configuration FIG. 1 is a circuit diagram of a Japanese word processor.

Reference numeral 1 is an input section, which has a phrase search key 1& for designating the start of a search for phrase data in addition to keys for manually inputting data such as kana. Alternatively, CPU 3 is a dictionary memory that stores kana/kanji correspondence data, and when kana data is input from input section 1, CPU 2 refers to dictionary memory 3 and converts it into a sentence containing kana and kanji. Convert. The document data resulting from the conversion is stored in the document memory 4. 5 is an ItOM which stores character fonts for printing and display and programs for processing operations of the CPU 2;

6 is a RAM that stores a cursor pointer, phrase pointer flag F, and the like. The data in the document memory 4 is displayed on the display section 7.
It is displayed and printed in the printing section 8.

(2) Effect Figure 2 (th>, (b) shows the display state,
In the figure, 0), (b), Cu, (→ indicate phrase data, and "-" indicates a cursor. The state in FIG. In other words, the key is in a state where it is waiting for human power.If you operate the bunsetsu search key 1 in this state, the text closest to the cursor is searched for and displayed at the cursor position by the operation of the CPU 2, which will be described later. The state shown in Figure 2(b) will be reached. From now on, each time you operate the phrase search key l&, the next phrase data (c) is displayed.
, (→, (A)... are displayed in sequence at the cursor position.If the 9 data displayed at the cursor position is the desired data that you want to manually input, use the cursor movement key, execution key, etc. to move it to the document memory. Write to 4.

Next, when the phrase search key 1a is operated, the CPU 2
The processing operation is generally shown in chart 70 in FIG. 3, and will be described below with reference to this flowchart. Sl
7 lag F indicating whether or not the data in the document memory 4 is being searched in the middle of the document is detected. 7 lag F is r
In OJ, when it is the time to start searching for data in the document memory 4, the cursor pointer is saved to another area in RAM B in the process of S, the cursor pointer is moved to the left by one character in S3, and the cursor pointer is moved to the left by one character in S4. However, in the process of S1, 7
If the lag F is "1", the process immediately moves to S4. 5
In the s-stt process, the cursor pointer is decremented and the document memory 4 specified by the cursor pointer is
The data within is read character by character, and it is detected whether this data is a kana character and the data before this data is data other than kana. That is, a break in a clause that changes from data other than kana to kana is detected. When a bunsetsu break is detected, in StS, flag F is set to r.
lJ, and in the process of Sta, the data from the data in the document memory 4 specified by (cursor pointer +1) to the data indicated by the clause pointer is saved to the position indicated by the cursor pointer, that is, the position shown in FIG. b) is displayed.

In the process of S6, when the cursor pointer has finished, that is, the search has been completed to the beginning of the document data, the screen is 814''.
T: After restoring the cursor pointer, clear the 7 lag F at 815 and end the process.

The above-mentioned processing is executed each time the phrase search key 1a is operated, and data in the one-document memory 4 is searched one by one to detect the break between phrases and read out the data in units of phrases.

In the above example, the case where the document data is searched sequentially from the end of the sentence is explained, and in this case, the break between clauses is the change point from a non-kana character to a kana character, but the prefix data If so, the phrase data is read using the transition point from this prefix to the next character as a phrase break. Furthermore, in addition to prefixes, suffixes and the like may be taken into consideration to detect clause breaks, and furthermore, compound clauses may be read out. Further, the search may be started from the beginning of the sentence or other position of the document data, and the direction of the horizontal bar can also be designed to be arbitrarily designated as toward the beginning of the sentence or toward the end of the sentence.

Furthermore, in the embodiment, the break between clauses in the document memory 4 is detected each time, but when converting kana-kanji,
An identification code indicating a break between phrases or a document memory address specifying the break 9 of a phrase is stored in memory in advance, and when the phrase search key 71 is operated, the identification code or address stored in the memory is stored in memory in advance. It may also be configured to sequentially read phrase data classified by.

Furthermore, although the search result data is displayed at the cursor position, it may be displayed at another position, for example, in a human canilia that displays human data. It may be possible to distinguish them by display, etc.

In this case, the information is displayed at the cursor position by designation using a specific operation such as the enter key or execution key.

- [Effects of the Invention] As described above, according to the present invention, data that has already been input in document data can be searched and read out with extremely simple key operations and used as new input data, so that input operations can be simplified. This method has various advantages, such as simplifying the process, significantly reducing the burden on the operator, and improving data input operation speed.

[Brief explanation of drawings]

Figure 1 is a circuit configuration diagram of the present invention, and Figures 2 (a) and (b).
) is a display state diagram of the present invention, and FIG. 3 is a flow chart showing the operation of the present invention. 1... Input section, 1 Todoroki... Clause search key, 2...
CPU, 3... Dictionary memory, 4... Document memory, 5
...ROM, 6...RAM, 7...display section, 8.
・Printing section. Figure 1 Figure 2

Claims (1)

[Claims] a storage means for storing document data; a means for specifying a search for phrase data; a means for detecting a break between phrases in the document data stored in the storage means in response to the designation of the means; A document data processing device comprising means for displaying phrase data.