JPH03189725A - Analogous word retrieving system for automatic programming device - Google Patents

Abstract

PURPOSE:To easily specify the erroneous one of those words forming a statement by displaying all defined words analogous to a wrong input word on a CRT screen as the candidates of words to be inputted. CONSTITUTION:The defined words forming an automatic programming language are previously stored in a CPU 1 of an automatic programming device. Then the words inputted to the automatic programming device are compared with the defined words for detection of the errors of those input words. If a wrong input word is detected, the defined words are retrieved to obtain the words analogous to the input words and to display them on a CRT 7. Thus the defined words analogous to the wrong input word are displayed on the CRT 7 as the candidates of words to be inputted. Thus, the erroneous one of those words forming a statement can be easily specified and furthermore the error of the input word is simply corrected.

Description

DETAILED DESCRIPTION OF THE INVENTION Field of the Invention The present invention relates to a similar word search method for an automatic programming device.

2. Description of the Related Art An automatic programming device is already known which checks the spelling of an input word by referring to predefined words stored in the automatic programming device and displays an error identification number and error message on a CRT screen. be.

Problems that the invention sought to solve This type of automatic programming device only displays spelling errors as an error identification number or error message on the CRT screen, and in order to know the correct spelling of the word to be input, it is necessary to check the error It is troublesome to have to refer to a manual or the like to search for the correct word each time an identification number or error message is displayed, and the error identification number or error message is displayed for one statement. Therefore, it is not easy to identify which of the words that make up a statement contains an error.

FIG. 9 is a diagram showing an example of the CR7 display screen when an error in an input word is detected by a conventional automatic programming device. It is understood that errors have been detected, but these error identification numbers and error messages are line number r0020.
Since it is displayed for the statement J, the words MCHN, MILL,
It is not easy to identify which word in INC is incorrect, and even if the incorrect word is identified by the operator, refer to the manual etc. when correcting spelling errors. There is an inconvenience in having to do so.

SUMMARY OF THE INVENTION An object of the present invention is to provide a similar word search method for an automatic programming device that can eliminate these drawbacks of the prior art, easily identify misspelled words, and easily correct spelling errors. There is a particular thing.

Means for Solving the Problems The similar word search method of the present invention stores predefined words constituting an automatic programming language inside an automatic programming device in advance, and combines the words input into the automatic programming device with the above defined words. In addition to detecting errors in the input word by comparing the words with the input word, if there is an error in the input word, search the predefined words to find a word similar to the input word and display it on the CRT screen. The above objectives were achieved.

In order to find similar words, the predefined words are automatically searched for character strings constituting the input word and words containing parts of the character strings.

Also, create a character string by sequentially subtracting one character from the character string that makes up the input word, and each time you subtract one character, it matches the above character string until the number of characters that make up the string reaches a predetermined number. Search for a word among defined words.

Furthermore, a character string is created by sequentially subtracting one character from the character string composing the input word, and each time a character is subtracted, the character string matches the above character string until the number of characters composing the character string reaches a predetermined number. Search the predefined words for a word that matches the word and a character string obtained by replacing part of the above character string with other characters.

In order to more accurately find similar words, we search for words that include the character strings that make up the input word and a part of them from among the defined words, and also create a string by subtracting one character from the character string that makes up the input word. until the number of characters composing the character string reaches a predetermined number, each time one character is subtracted, a word that matches the above character string and a character string in which part of the above character string is replaced with other characters are added. - Search for matching words from predefined words, and display all searched words as similar words on the CRT screen.

Predefined words that are similar to the incorrectly input word are displayed on the CRT screen as candidates for words to be input, making it easy to identify which word in the statement contains the error. , it becomes possible to easily correct errors in input words.

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

FIG. 7 is a block diagram showing the main parts of an automatic programming device according to an embodiment of the present invention, in which 1 is a microprocessor (hereinafter referred to as CPU), and 2 is a control program for controlling the automatic programming device. stored R
OM, 3 is a RAM that stores the system program and various data loaded from the floppy disk FL, 4 is an NC data storage memory that stores NC data converted from a part program configured by an automatic programming language, 5 is a keyboard, 6 is a disk controller, 7 is a CRT (including various types of graphic displays), and each of these elements 1 to 7 is connected by a bus 8.

FL is a floppy disk that stores various system programs related to part program creation, etc. It stores a table (hereinafter referred to as registered word table) that stores predefined words that make up an automatic programming language, and is used as a system program for part program creation. In addition to the conventional program for checking the spelling of input words, a sub-program for executing similar word search processing as shown in FIG. 1 is added.

In this automatic programming device, "statement number".

"Elements" and "separators" can be used as an automatic programming language, and each of these elements creates one "
statement” is constructed. Among these, the "statement number" is an arbitrary numerical string that is added to the beginning of the "statement" when it is necessary to refer to a specific "statement" on the part program.
"Separators" are composed of symbols such as ", j" that separate "statement numbers" and "elements" and between "elements". "Elements" are "words", "definition names" ”.

It consists of either a "character string" or "numeric value", but among these, the "definition name" is an arbitrary name for a defined variable or figure, and The columns and "numbers" are arbitrary real numbers that represent identification numbers and sizes. A "word" is composed of a "main word" or a "modifier." In general, a "main word" corresponds to a command indicating an instruction or definition, and a "modifier" corresponds to an operand part that embodies the instruction or definition. do.

Therefore, among the above elements, an automatic programming language that has a fixed character string is a "main word" that makes up a "word" and a "
In this embodiment, all of these single words are stored as default words in the registered word table, and are input into the automatic programming device for each statement via the keyboard 5 when creating the part program. "word"
As in the past, the statement is compared with all predetermined compositions stored in the registered word table, and if there is no matching predetermined composition, the statement is detected as having an error.

The following is a flowchart outlining the similar word search process that is started when an error in a statement is detected, and a flowchart showing the search process for each method carried out at each step of the similar word search process (Figures 1 and 2). Figure ~ Figure 6)
The similar word search method in this embodiment will be explained with reference to . It is assumed that the system program for creating the part program and the registered word table have been loaded in advance into the RAM 3 from the floppy disk FL.

For example, when creating a part program, [0010PA
If the statement RT, @ABCJ is input, the line number "0010J," the arbitrary string r@ABCJ set as the part program name, and the separator "," are "words." Since it is not, the spelling is not checked, and in this statement, the spelling is checked only for rPARTJ, which is the main word that defines the part program. In this case, since the character string rPARTJ is stored as a predefined word in the registered word table, it is determined that there is no spelling error in the input word.

In addition, if the statement "r0020 MCHN, MILL, INC" is input, the main word "MCHNJ" that commands the creation of NC data, and the modifier rMILLJ that specifies the processing machine subordinate to this main word.
, and the spelling is checked for rlNcJ, which is considered a modifier.

Note that rlNcJ is incorrect and is not a "word" in the strict sense.
However, the syntax of automatic programming languages is rMcH.
Since the "word" following N and MILLJ exists only as a modifier specifying the tape output format, the spelling as a "word" is necessarily checked.

In this case, the character string rlNcJ is not a predefined word and is therefore not stored in the registered word table.
It is determined that the spelling of rlNcJ as a "word" is incorrect, and similar word search processing is started.

The cPUl that detected the error and started the similar word search process,
First, an error identification number rME is assigned to the statement at line number 0020 where an error was detected.

54E" and the error message "Statement no error" are displayed, the creation of the part program is temporarily stopped, the incorrectly spelled input word is displayed on the CRTT (step 501), and each of the steps shown from step s02 to step SO6 is executed. The registered word table is searched and stored for predefined words that are similar words, and all the similar words searched by each method are displayed on the CRTT as word candidates to be input (step S07. (See Figure 8).

FIG. 2 is a flowchart showing an outline of method 1 in which predefined words containing all the character strings constituting the input word are searched from the registered word table to obtain similar words. If the defined word is referenced sequentially and the defined word contains all the character strings of the incorrectly spelled input word, in other words, if some characters are added to the incorrectly spelled input word, it becomes the already defined word. If so, these predefined words are stored as similar words to the input word (see step Sll, 812). In this case, rlNcHJrlNcOJ, r
lNcRJ and rINcREJ are stored as similar words (see Table 1).

Table 1. Search example Figure 3 shows a character string that is created by sequentially subtracting one character from the character string that makes up the input word, and the process is performed each time one character is subtracted until the number of characters that make up the character string reaches a predetermined number M. This is a flowchart showing an outline of Method 2, in which a predefined word that matches a character string is searched from the registered word table and used as a similar word. In this example, the value of the predetermined number M is set to 3 to form the input word. One character is subtracted sequentially from the end of the string. CPU
1, first, create a character string by subtracting the last character of the character string constituting the input word (step 521), and sequentially refer to predefined words stored in the registered word table that have the same number of characters as this character string. However, if there is a predefined word that matches the character string with the last character subtracted, this predefined word is stored as a similar word (steps 322, 523). Next, it is determined whether the number of characters of the character string created by subtracting the last character has reached a predetermined number M (step 524), and if the number of characters is greater than M, the last character of this character string is subtracted. Create a new character string again in step 521), and in the same manner as above in step 322. The process of S23 is repeatedly executed to search for predefined words that match the character string and store them as similar words. That is, all the predefined words obtained by removing some characters from the incorrectly spelled input word are searched as similar words. In this case, first, the last character rCJ of the character string rINCJ constituting the input word is subtracted to form the character string rINJ.
is created, sequentially refers to the predetermined compound words stored in the registered word table that have the same number of characters as this character string, and the predetermined compound word rINJ that matches the character string with the last character subtracted is stored as a similar word (Table 2 ), at this stage the number of characters≦M and the search ends.

Table 2. Search example Note that the comparison of the size relationship between the number of characters that make up the character string and the predetermined number M is performed after the first search process is executed, so the number of characters that make up the incorrect input word is smaller than the predetermined number M. Even in the above case, the process for searching for a predetermined compound word that matches the character string with the last character subtracted is executed at least once.

Figure 4 is a flowchart showing an outline of method 3, in which predefined words that include a part of the character strings that make up the input word are searched from the registered word table and used as similar words. The predefined words stored in the registered word table that have the same number of characters as It is searched as a predetermined word containing the word and stored as a similar word (hereinafter, step S31゜532
). In this case, the character string rINcJ that constitutes the input word is 3
Since it consists of letters, rlN*J.

A predetermined compound word that matches the character string "rI*cJ, r*Nc", "rl**J, r*N*", or "**C" will be searched as a similar word. Note that "*" is a wild card that represents any single character, and no determination processing regarding match/mismatch is actually performed. For example, when searching for a predetermined compound word that matches rIN*J, the CPUI determines that the first character of the predetermined compound word stored in the registered word table having three characters is rIJ, and the second character It is determined only whether or not is rNJ, and all predetermined words that satisfy this condition are detected as similar words, regardless of what the third character is. Therefore, rIN*J
The default compositions that match are included in the range of default compositions indicated by ``rr**'' and l''*N*J, but in the case of the example,
Since the number of characters to be replaced (the number of wild cards) is set to 1, only rlNTJ is searched as a default compound word that is a similar word (see Table 3).

Table 3. This search example is different from method 3 above. That is, in this example, all predetermined words that include a part of the character string of the input word are searched for regardless of the number of characters, and are stored as similar words (step S41.542). In the embodiment, as in Method 4 above, the number of characters to be replaced is set to 1, and the character strings of the input word and the default compound word are compared from the beginning, so in this case, rlN*...J, II *C*...J, r
*Nc*...'' will be searched as a similar word (see Table 4).

Table 4. Search example Figure 5 shows another method 4 in which a predefined compound word that includes a part of the character string constituting the input word is searched from the registered word table and used as a similar word.
Table 4. is a flowchart outlining the point that there is no limit to the number of characters in the predefined compound word to be searched. Search example (continued) Figure 6 shows a character string that is created by sequentially subtracting one character from the character string that makes up the input word. This is a flowchart outlining Method 5, in which a predetermined compound word that matches the character string obtained by replacing a part of the above character string with other characters is searched from the registered word table and used as a similar word. Similar to method 2 above, the value of the predetermined number M is set to 3, and one character is sequentially subtracted from the end of the character string forming the input word.

The CPU first creates a character string by subtracting the last character of the character string that constitutes the input word (step 551), and sequentially refers to predefined compound words stored in the registered word table that have the same number of characters as this character string. , if there is a predetermined word that matches the character string obtained by subtracting the last character and replacing a part of the string with another character, this predetermined word is stored as a similar word (step S52.553). Next, it is determined whether the number of characters in the character string created by subtracting the last character has reached a predetermined number M (step 554), and if the number of characters is greater than M, the last character in the current character string is subtracted. Step 551) to create a new character string again (step 551), repeat the steps 852 and 353 in the same manner as above, and create a default compound word that matches the string in which part of this string has been replaced with other characters. Search and store as similar words. In this case, first, create a character string rlNJ by subtracting the last character "C" from the character string rlNcJ that constitutes the input word, and then sequentially select the predefined words stored in the registered word table that have the same number of characters as this character string. Default compound word rl that matches a character string that is referenced and a part of the character string is replaced with other characters, that is, "■*" or "*N"
LJ and "ON" are stored as similar words (see Table 5),
At this stage, the number of characters≦M and the search ends.

Table 5. Search Example The similar words searched by each of the above methods 1 to 5 are sorted according to the number of characters, and are displayed as a list on the CRTT as word candidates to be input (step S07, see FIG. 8). In this example, the modifier rINcRJ, which incrementally specifies the format of tape output, is the "word" to be entered, and the operator must enter the misspelled input word 1'-IN.
rlNcRJ will be re-inputted instead of CJ.

According to this embodiment, the incorrectly spelled input word itself is displayed on the CRTT together with the candidate word to be input, so it is possible to easily identify which word making up the statement is incorrect.

In order to search for similar words, it is not necessary to use each method 1 to 5 above.
Although it is not necessary to perform the steps twice, in order to properly search for similar words that are candidates for the word to be input, at least
It is desirable to combine method 1 and method 3 or method 4 (corresponding to claim 2), or to combine method 2 and method 5 (corresponding to claim 4), and even when searching is performed using a single method. For example, method 2 (corresponding to claim 3) is preferably used.

In the example, all predefined compound words with similar spellings to the incorrectly entered input word are displayed, regardless of the grammar of the automatic programming language. Only predefined words that can be input may be selected and displayed.

Effects of the Invention According to the similar word search method of the present invention, all predetermined words similar to an erroneous input word are selected as candidates for words to be input.
Since it is displayed on the screen, it is easy to identify which word making up the statement contains an error, and furthermore, errors in input words can be easily corrected without referring to a manual etc. Therefore, automatic programming language input work can be done quickly and easily.

[Brief explanation of drawings]

FIG. 1 is a flowchart showing an outline of similar word search processing in an embodiment of the present invention, 2nd TI! J~ Figure 6 is a flowchart showing an outline of the search process for each method carried out at each step of the similar word search process in the same embodiment, and Figure 7 is an automatic programming device of one embodiment implementing the method of the present invention. 8 is a diagram showing an example of the CRT display in the automatic programming device of the same embodiment, and FIG. 9 is a CR7 display when an input word error is detected by the conventional automatic programming device. It is a figure which shows an example of a screen. 1...Microprocessor (CPU), 2...R
OM, 3...RAM, 4...NC data storage memory, 5...keyboard, 6...disk controller, 7...CRT, 8...bus, FL...floppy disk. Figure Figure 6 Figure Figure 6

Claims (5)

[Claims] (1) Predefined words that make up the automatic programming language are stored in the automatic programming device in advance, and errors in input words are detected by comparing the words input into the automatic programming device with the predefined words. In addition, if there is an error in an input word, a similar word search method for an automatic programming device is characterized in that, if there is an error in an input word, a predefined word is searched to find a word similar to the input word and displayed on a CRT screen. (2) If there is an error in the input word, the character string composing the input word or a word containing a part thereof is searched from among the defined words and displayed on the CRT screen as a similar word. A similar word search method for an automatic programming device according to claim 1. (3) If there is an error in the input word, create a character string by sequentially subtracting one character from the character string that makes up the input word. 2. A similar word search method for an automatic programming device according to claim 1, wherein each time a character is subtracted, a word matching said character string is searched from among predefined words and displayed as a similar word on a CRT screen. (4) If there is an error in the input word, create a character string by sequentially subtracting one character from the character string that makes up the input word. Every time a character is subtracted, a word that matches the above character string and a word that matches a character string in which part of the above character string is replaced with other characters is searched from among the predefined words and displayed as similar words on the CRT screen. 2. A similar word search method for an automatic programming device according to claim 1. (5) If there is an error in the input word, search for the character string that makes up the input word or a word that includes a part of it from among the defined words, and search for one character from the character string that makes up the input word one by one. Create a character string by subtracting it, and replace the word that matches the character string and a part of the character string with other characters each time one character is subtracted until the number of characters that make up the character string reaches a predetermined number. Similar word search for an automatic programming device according to claim 1, characterized in that a word matching a character string is searched from among predefined words, and all searched words are displayed as similar words on a CRT screen. method.