JPH0799520B2 - Document editing device - Google Patents

Description

Description: TECHNICAL FIELD The present invention relates to a document editing apparatus that saves labor in input operation.

More specifically, according to the present invention, when inputting using a character inputting means such as a keyboard, the "character string exactly the same as the character string" or the "character string differing only in a small part such as the ending" is inputted before. The present invention relates to a document editing apparatus capable of reducing the number of input operations such as keystrokes when inputting again.

[Prior Art] When interactively using a computer application product such as a general-purpose electronic computer or a word processor, a means for reducing the number of input operations such as keystrokes for inputting characters, and thus reducing the burden on the user, Some have been put to practical use. For example, in a word processor, register and convert frequently-used words / fixed phrases and omit input work; as seen in some personal computer operating systems (hereinafter referred to as OS), command input Do not use the "immediately before input line" to omit the input (for example, when inputting the correct command line after entering the wrong file name in a certain command line, instead of typing all the lines, first Display the command line that was just entered and edit / correct this to correct the input to reduce the input work.); Escape, as is done in the OS related to the manufacture of a certain manufacturer. Use keys to save input. That is, when entering a command or file name, press the escape key after typing the first few characters (a sufficient number of characters to distinguish it from others), and the OS will display the corresponding command name or file name. Therefore, edit it, correct it, and enter it; etc. are known.

However, since the burden of "registration" is newly added in the above-described method, it is not usually performed to register and use a large number of words each time.

Further, the methods shown in and are limited to use in the OS command language, and cannot be used for general input work such as document editing.

By the way, the above method is to register and use words and phrases that are used repeatedly when inputting a document.
Select a desired phrase from the already entered document itself,
If this can be used as input, it is not necessary to register, and it becomes possible to omit input for many words and phrases.

However, it is not possible for the input operator to select a word or phrase that has already been input (that is, to search for a desired word or phrase and to define the range from where to input) by using a normal document editing device (for example, a word processor). As can be seen, it is possible to do this with the phrase copy function. Moreover, if the operation of copying the phrase is performed many times during the input work, the input work is interrupted each time, and the efficiency of the input work is significantly reduced.

Therefore, unlike the copying of such words and phrases, a new document editing device that does not interfere with the input work is required.

[Purpose] An object of the present invention is to provide a document editing device that allows a character that has already been input to be easily input to another location.

In order to achieve such an object, the present invention is a document editing device having a display means (7), an input means (50), and a control storage means (60), wherein the control storage means (60) comprises
A character buffer memory (2) for storing the character string input from the input means (50) is provided, a control signal is input, a predetermined collation character string is determined from the character buffer memory (2), and this collation is performed. A search character string corresponding to the character string is searched from the character buffer memory (2), and a word including the search character string,
Alternatively, a line is selected, this word or line is stored, and the display means (7) displays the word or line containing the search character string stored by the control storage means (60).

Hereinafter, the present invention will be described in detail with reference to the drawings.

[Embodiment] FIG. 1 is a block diagram showing an embodiment of the present invention. In the figure, 1 is a character input means equipped with a keyboard and the like, and 2 is a character buffer memory for storing input character data (hereinafter simply referred to as "character") by a predetermined number or less. It is assumed that the character buffer memory 2 holds a predetermined number or less of characters (e.g., characters for one page) input immediately before among characters input by the operator. That is, when a certain number of characters are input to the character buffer memory 2, the oldest characters among the already input characters are sequentially discarded, and the latest character always remains below a certain number.

Reference numeral 3 is an instruction means for instructing a process to be described later (for example, some function keys, keys on a keyboard for giving specific control characters, etc. are provided). The function of this instructing means is that the character inputting means 1 allows a specific control character (for example, DC2, DC4 in JIS information exchange code (C-6220)).
It is executed by inputting. Besides, it is also possible to provide a specific switch or the like (not shown) to replace the input of these control characters.

Reference numeral 4 is a means for determining a "collation character string" by input from the character input means 1. Here, the collation character string means "a group of character groups to be searched" in this apparatus.

Reference numeral 5 is a selection unit for searching the character buffer memory 2 for a matching character string, and has a function of selecting a character group such as a word or phrase including the specified matching character string.

Reference numeral 6 is an expansion means for writing the word or the like selected by the selection means 5 (a collation character string is partly included) in the character buffer memory 2. That is, based on the collation character string (for example, “ind”) input to the character buffer memory 2, the collation character string is replaced with the selected word or phrase (for example, “independence”). In this way, on the character buffer memory 2, the specific collation character string is expanded and replaced by a word or the like including the collation character string, and hence this operation is hereinafter referred to as "expanding".

Reference numeral 7 is a display means for displaying the words and the like expanded by the expanding means 6, and makes the input operator judge whether or not the expanded words and phrases are desired words and phrases.

Reference numeral 8 is a control means for controlling each means described above.

Reference numeral 9 indicates other processing means.

A block 50 surrounded by a broken line forms an input means as a whole, and a block 60 forms a control storage means as a whole.

The solid line shows the actual input / output of data, and the broken line shows the control or pointer operation.

The words and the like expanded according to the present embodiment include: a) a character group that matches the collation character string, followed by "blank,
A character group that ends (immediately before) one character before "tab, new line character" (hereinafter referred to as "word", assumed to be expanded by DC2); b) starts with a character group that matches the collation character string, Characters ending one character before (immediately before) (hereinafter referred to as "line", assumed to be expanded by DC4);

FIG. 2 shows an example of a document including each word underlined. The blank portion surrounded by a frame in this figure indicates a blank character. Also, for each character string enclosed in a horizontally long frame, RC at the bottom line
Indicates the matching character string, and the others indicate the matching character string.

Next, the operation of this embodiment will be described by taking as an example the case of inputting a document including each "word" (underlined part) as shown in FIG.

Each character forming the document shown in FIG. 2 is input from the character input means 1. Then, it is displayed on the display means 7 by the control means 8 and stored in the character buffer memory 2, and the character information is also input to the other processing means 9.
Here, since the character buffer memory 2 holds the latest number of characters or less as mentioned above, each input character is
It is placed in the character buffer memory 2 as shown in FIG.

FIG. 3 is a diagram showing a detailed configuration of the character buffer memory. The arrows shown in this figure all indicate pointers.

Next, an outline of each pointer is as follows.

Pointer head ... Indicates the start position of the character buffer memory.

Pointer tail: Indicates the tail position of the character buffer memory.

Pointer r, t ... Indicates the first and last characters of the collation character string, respectively.

Pointer s, s' ... Indicates the position to start the search.

Pointer c ... Indicates the position of the character to be compared when searching for the search character string “b” that matches the collation character string “a”.

Pointer e ... Indicates the end of the character string to be expanded.

Pointer f ... Indicates the end of the collation character string for expansion.

The head side is called the front side and the tail side is called the rear side in the character buffer memory, and the contents of each are head <tail. In addition,
Input characters are added one after another from the tail side, and the part exceeding a certain number is discarded from the head side (ring buffer configuration), so the character pointed to by the pointer tail is called the latest input character.

Now, as shown in Fig. 2, when the last line "ind" is entered, a control character (DC2) that directs expansion to "word"
When this is input, since this expansion instruction is the first time (for this input), the control means 8 calls the collation character string determination means 4 (sets a flag (not shown)).

FIG. 4 shows an algorithm to be executed by the collation character string determining means 4.

In the present embodiment, the collation character string is a character string up to the latest input character following the last delimiter 20 (for example, the character "blank, tab, newline" in the character buffer memory) (that is,
Characters from the pointer r to t) ". Therefore, the pointer r shown in FIG. 3 is successively" d "," n "," i "," blank "," i "according to the algorithm shown in FIG. It moves so as to point to each character of "," and "ind" indicated by Katakana A is determined as the collation character string.

The steps shown in FIG. 4 are as follows.

Step S1: The position of the latest input character (position of tail) is stored in the pointers t and r. That is, t = r = tail.

Step S2: The character pointed by pointer r is a delimiter (blank S
P, tab TAB, line feed character NL).

Step S3: If the character pointed to by the pointer r is not a delimiter, the value of the pointer r is moved forward (to the head side).
That is, in order to move the pointer r to the left side of FIG. 3 by one character, r ← r-1.

Step S4: It is judged whether or not the designated position of the pointer r exceeds the head of the character buffer memory, and if not, the control is returned to step S2 again. On the other hand, when r <head, the determination cannot be made (step S5).

Step S6: When the character pointed by the pointer r is a delimiter (step S2), it is determined whether the positions pointed by the pointers r and t are the same (r = t?). In other words, if the first character pointed to by the pointer r is a delimiter, it cannot be determined (step S9).

Step S7: When it is determined in step S6 that r = t, the position pointed by the pointer r is moved backward (to the right in FIG. 3). That is, r ← r + 1 is set and the determination of the collation character string is completed (step S8).

When the collation character string is determined, the control means subsequently calls the means for selecting one of the words or lines having the collation character string as a part from the character buffer memory 2.

5 (A) and 5 (B) show an algorithm to be executed by the selection means 5.

First, as shown in FIG. 5 (A), the selection means 5 sequentially proceeds from the last character "d" (pointed by the pointer t shown in FIG. 3) of the collation character string "a" to the front (that is, the pointer he).
A character to be compared (pointed by the pointer c) is taken to the ad side), and the search start position (the position immediately before the delimiter 20 in front of the collation character string “a”) indicated by the pointer s in FIG. 3 is taken. Is the initial position S) and is the first character string that matches the collation character string (hereinafter referred to as the search character string. In the example shown in FIG. 3, "ind" indicated by "b" is the search character string). Find the position (which corresponds to the column). The algorithm shown in FIG. 5 (A) fulfills such a search function and is therefore also called a search unit.

In the algorithm shown in FIG. 5 (B), the last part (pointer) of the character group to be expanded (pointer) according to the type of the character group to be expanded (that is, whether it is "word" or "line") is specified. pointed to by e). Therefore, the algorithm shown in FIG. 5 (B) will be referred to as a selection unit in contrast to the search unit in FIG. 5 (A).

Each step of these algorithms will be described below.

In the search unit shown in FIG. 5 (A), step S10: The character to be compared is pointed to by the pointer c.
Therefore, first, in order to specify the last character (“d” in this example) of the collation character string (“I” shown in FIG. 3), the pointer c
T is used as the value of.

Step S11: A comparison character is searched from the search start position (initial position) indicated by the pointer S toward the front of the character buffer memory (left side in FIG. 3).

Step S12: Determine whether there is a comparison character. If no comparison character is detected, the search fails (step S1).
8).

Step S13: When the comparison character is detected in step S12, the position pointed by the pointer c is moved forward by one character. That is, c ← c-1.

Step S14: Whether the position pointed by the pointer c is ahead of the position pointed by the pointer r (left side in FIG. 3) (that is,
By determining whether or not c <r), the end point of the collation is determined.

Step S15: If the collation is not completed yet, the position of the pointer s is advanced forward (left side in FIG. 3) by one character. That is, s ← s−1.

Step S16: It is determined whether or not the position pointed by the pointer s has exceeded the head of the character buffer memory. If it already exceeds the start position, the search fails (step S1).
9).

Step S17: It is determined whether or not the characters (contents) pointed to by the pointers c and s are equal. If they are not equal, the control is returned to step S10 and the search is performed again. Also,
If the characters pointed to by the pointers c and s are equal, steps S13 and thereafter are repeated.

In the selection section shown in FIG. 5 (B), step S20: Delimiter is set. That is, "word"
Or (SP; space, TAB; tab, NL; newline),
Alternatively, specify either "line" (NL).

Step S21: A pointer f pointing to the end of the collation character string and a pointer e pointing to the end of the character group to be expanded are set. That is, f ← s + t−r e ← f + 1.

Step S22: It is determined whether or not the character pointed by the pointer e is the delimiter (SP, TAB, NL) described above.

Step S23: If it is determined in step S22 that the symbol is not a delimiter, the pointer e is moved backward (to the right in FIG. 3). That is, e ← e + 1.

Step S24: When it is determined that the symbol is the delimiter in step S22, the pointer e is returned to the front (left side in FIG. 3). That is, e ← e-1.

Next, the control means 8 calls the expansion means 6. This expansion means replaces the collation character string in the character buffer memory 2 with the selected "word" or "row". In other words, by the processing performed by the expanding means 6, the selected character group is input instead of the collation character string.

That is, in this example, the portion following the search character string “b” detected by the selection means 5 (“c” in FIG. 3) is displayed on the display means 7 in exactly the same manner as when the character input means 1 newly inputs it ”. It is displayed, input to the character buffer memory 2, and further input to another processing means 9.

From the viewpoint of processing efficiency, it is desirable to perform expansion processing at the same time when the end of the above phrase is determined.

The steps in the expansion algorithm shown in FIG. 6 are as follows.

Step S25: The value of the variable i is set to the position one character behind (the right side in FIG. 3) the position pointed to by the pointer f. As a result, the position immediately after the search character string (see "b" in FIG. 3) is set as the variable i.

Step S26: It is determined whether or not the variable i points to the rear side of the pointer e (right side in FIG. 3).

Step S27: The character at the position indicated by the variable i is displayed on the display means 7.

Step S28: The character at the position indicated by the variable i is input to the character buffer memory 2.

Step S29: The character at the position indicated by the variable i is input to the other processing means 9.

Step S30: The position indicated by the variable i is moved backward by one character (on the right side in FIG. 3).

Thus, as shown in FIG. 7 (A), the word "independen"
Unexpected phrases may be selected because t "is expanded, but only part of it is given to make such a selection.

Therefore, if this "independent" is a desired word / phrase, the input work may be continued as it is. However, if it is not the desired word / phrase, by continuously giving an instruction for expansion, FIG. ), The next candidate word "independence" is expanded.

When the instruction of the expansion continues in this way, the control means 8 cancels the influence of the previous expansion (step S2 in FIG. 6).
7 to S29), the next search is performed with the search start position (s) as the position immediately before the previously found search character string "b" (that is, the position of "s'(next)" in FIG. 3). This allows us to come before the previously selected word “independent”,
And the word "inde" selected by the same collation string as before
"pendence" is expanded.

In the present embodiment, the character buffer memory 2 has been described as holding a predetermined number or less of the characters input immediately before by the operator, but a desired area of a document that has already been input. It is also possible to collectively copy (that is, a group of characters within a certain range adjacent to the input specific editing position) and store them in the character buffer memory 2. Alternatively, it is possible to share a part of the document memory that holds the part. With this configuration, it is possible to partially omit the input using the words and phrases in the already created document, and to reduce the input operation when performing the correction work of the document.

Further, it is also possible to use an information storage unit (memory, file, etc.) holding a word or the like registered in advance instead of the character buffer memory 2 (in this case, it is used only for reading).

Further, the character buffer memory, a part of the document memory, a plurality of files, etc. described above may be provided and used in an appropriate search order. For example, a first character buffer memory that holds a small number of keywords and reserved words and a second character buffer memory that holds a certain number of input characters or less are provided, and these two buffer memories are searched sequentially. Thus, it is possible to configure so that a part of the input of the keyword or the reserved word can be omitted quickly and surely (without being lost due to other input).

Further, by searching both the character buffer memory that holds a certain number or less of input characters and the document memory that stores the contents of the previous page at the position to be corrected, for example, search / expansion can be performed. Since the written word or the like can be copied to the character buffer memory, it can be configured so that it can be used when correcting or inputting another position or another document.

In the present embodiment, the character "blank, tab or line feed" is used as the delimiter when determining the collation character string, but this can be changed, added, or specified from the character input means following the expansion instruction. By configuring, more flexible instructions can be given. In addition, by making the same changes when selecting / expanding, not only the expansion to the words that start with the search character string (that is, the expansion to the word "prefix"), but also the matching characters It is possible to expand into words that match the columns. These variants provide a sort of search effect when entering partially spelled words. Furthermore, when copying from the predetermined collation character string to the "punctuation mark", it can be a simpler means than so-called cut and paste.

By the way, in the present embodiment, a word having a collation character string as a part thereof is selected and expanded, but in actual use, the end of the expanded word is often changed due to a tail change or the like. Therefore, it is also useful to select two (or more) words having a collation character string as a part and expand the common part, rather than simply expanding the word selected "first". FIG. 8 shows an example in which the common part is expanded for the document example shown in FIG.

Further, in the present embodiment, the collation character string is stored in the character buffer memory, but it is also possible to store the collation character string by using a means for storing the character string separately.

[Effect] As described above, according to the present invention, it is possible to omit a part of the character input work without the need for registering a word or the like in advance and without a complicated operation, thereby improving operability. It is possible to obtain an improved document editing device.

That is, in one embodiment of the present invention, storage means for accumulating already input words and phrases (for example, accumulating characters for about one page).
As a method for obtaining a desired word or phrase or the like therein, a part of it (for example, the first few letters of the desired word or phrase) is given, and a word or phrase containing this is searched from the storage means and used. Since the system is adopted, a part of the input (the rest of the word or the like) can be omitted in the operation for obtaining the desired word or the like unlike the copying of the word or phrase seen in the conventional example. Thus, a smooth input operation can be performed.

Also, by automatically updating the contents of the storage means, it is possible to use without registering words in advance, and it is possible to realize an input omission means that is not limited to a command language or the like.

When the present invention is applied to an electronic typewriter or the like, it is preferable to use a character display means such as a liquid crystal display as the display means.

The present invention can also be used as one function of an intelligent terminal device or a composite terminal device.

Further, when the present invention is applied to a Japanese word processor, not only is the omission of a part of the input in kana and roman letters, but it is also appropriate (since the present invention is applicable to any character (data) string). By setting the delimiter, it is possible to realize a device that can partially omit the input for a Japanese document including Chinese characters.

[Brief description of drawings]

FIG. 1 is a block diagram showing an embodiment of the present invention, FIG. 2 is a diagram used to explain the operation of this embodiment, and FIG. 3 is a detailed configuration diagram of a character buffer memory used in this embodiment, FIGS. 4, 5 (A) and (B), and FIG. 6 are flowcharts showing the algorithm of the processing performed in the present embodiment, and FIGS. 7 (A), (B) and FIG. It is a figure which shows the example of a display. 1 ... Character input means, 2 ... Character buffer memory, 3 ... Instructing means, 4 ... Collation character string determining means, 5 ... Selection means, 6 ... Expansion means, 7 ... Display means, 8 ... Control means, 9 ... Other processing means, RC ... Collation character string.

Claims (1)

[Claims] 1. A document editing apparatus comprising a display means (7), an input means (50) and a control storage means (60), wherein the control storage means (60) is input from the input means (50). A character buffer memory (2) for storing the specified character string, inputting a control signal, determining a predetermined collation character string from the character buffer memory (2), and searching character corresponding to this collation character string. The column is searched from the character buffer memory (2), the word or line containing this searched character string is selected, and this word or line is stored, and the display means (7) is stored by the control storage means (60). A document editing device that displays a word or line containing a specified search string.