CN112328625A

CN112328625A - Method, system, medium and electronic device for generating word learning array

Info

Publication number: CN112328625A
Application number: CN202011362484.6A
Authority: CN
Inventors: 郑自然
Original assignee: Shandong Normal University
Current assignee: Shandong Normal University
Priority date: 2020-11-27
Filing date: 2020-11-27
Publication date: 2021-02-05

Abstract

The present disclosure provides a method, system, medium, and electronic device for generating a word learning array, the method comprising: acquiring a target word list, and setting the grid number of an initial matrix grid according to the longest word; traversing all words in the target word list, and sequentially inserting the words into the matrix grid according to a preset insertion direction; inserting any word for a preset number of times, if the word cannot be inserted, inserting all words again after the continuation of the matrix grid; when all words are inserted, spaces in the matrix lattice are randomly filled with characters.

Description

Method, system, medium and electronic device for generating word learning array

Technical Field

The present disclosure relates to the field of teaching equipment technologies, and in particular, to a method, a system, a medium, and an electronic device for generating a word learning array.

Background

The statements in this section merely provide background information related to the present disclosure and may not necessarily constitute prior art.

Word learning is one of the most critical and major steps in foreign language learning such as english learning. Learning and familiarizing words using different methods is a common way of teaching or learning foreign languages. In addition to learning English words based on text, hearing materials, word list memory, etc., learning in other manners is also a very important supplement.

In a great deal of english word mode, it is a comparatively common word teaching mode to construct mixed and disorderly word array and carry out word inquiry study. A general word array generation method is to fill a word (target word) to be searched in a rectangular blank grid and then fill the word with other random characters, and students try to find the words hidden in the grid as many as possible; the design of the word array generally requires manual construction and conversion into an electronic format or a paper format for publication, and the manual method is time-consuming and more difficult if the number of words is large.

Disclosure of Invention

In order to solve the defects of the prior art, the present disclosure provides a method, a system, a medium, and an electronic device for generating a word learning array, which can automatically generate a learning array including a plurality of words as target words, and can realize rapid generation of different learning arrays through the sequence change of the target words, the table start positions, and the directions.

In order to achieve the purpose, the following technical scheme is adopted in the disclosure:

a first aspect of the present disclosure provides a method for generating a word learning array.

A method of generating a word learning array, comprising the steps of:

acquiring a target word list, and setting the grid number of an initial matrix grid according to the longest word;

traversing all words in the target word list, and sequentially inserting the words into the matrix grid according to a preset insertion direction;

inserting any word for a preset number of times, if the word cannot be inserted, inserting all words again after the continuation of the matrix grid;

when all words are inserted, spaces in the matrix lattice are randomly filled with characters.

As some implementations are possible, a random permutation of the target word list is performed each time an insertion loop of all words is performed.

As some possible implementations, the rows or columns of the initial matrix lattice contain a lattice number that is the number of characters of the longest word plus a preset amount.

As some possible implementations, the words are inserted into a matrix lattice, including:

selecting a direction for any word, selecting a cell, then filling characters of sequential words on the cell according to the direction, if the characters exceed the boundary, giving up, and changing one direction to continue to perform character filling operation; if the character does not exceed the boundary, an insert operation is performed.

As a further limitation, the lattice elements are randomly arranged, a certain lattice position is traversed, the direction elements are randomly arranged, a certain direction is traversed, a word is inserted at the current lattice position according to the current direction, if the insertion of the next word is successful, otherwise, the random arrangement and traversal operation of the lattice elements and the lattice positions are continuously executed until the word is inserted.

As a further limitation, if a certain letter of the current word is already occupied by the position of the previous word, upon insertion, if the next position has already a letter, it is determined whether it is the same as the letter to be filled in, if so, the insertion is continued, otherwise, the current starting position is regarded as failed, and the next direction or position is tried.

As a further limitation, judging whether the unit word is out of bounds under the current cell and the current direction, if so, directly returning to fail;

sequentially judging whether each position to be inserted under the current position and direction is occupied, if so, judging whether the occupied letters are the same as the letters to be inserted, and if not, failing to insert; if so, all letters of the word are inserted in the current position and orientation in the lattice.

A second aspect of the present disclosure provides a system for generating a word learning array, including:

a data acquisition module configured to: acquiring a target word list, and setting the grid number of an initial matrix grid according to the longest word;

a word insertion module configured to: traversing all words in the target word list, and sequentially inserting the words into the matrix grid according to a preset insertion direction;

an insertion execution module configured to: inserting any word for a preset number of times, if the word cannot be inserted, inserting all words again after the continuation of the matrix grid;

an array generation module configured to: when all words are inserted, spaces in the matrix lattice are randomly filled with characters.

A third aspect of the present disclosure provides a computer-readable storage medium on which a program is stored, the program implementing the steps in the method for generating a word learning array according to the first aspect of the present disclosure when executed by a processor.

A fourth aspect of the present disclosure provides an electronic device, comprising a memory, a processor and a program stored on the memory and executable on the processor, wherein the processor implements the steps of the method for generating a word learning array according to the first aspect of the present disclosure when executing the program.

Compared with the prior art, the beneficial effect of this disclosure is:

1. the method, the system, the medium or the electronic equipment can take a plurality of words as target words, automatically generate learning arrays containing the words, and realize the rapid generation of different learning arrays through the sequencing change of the target words, the starting positions and the directions of the table; the test is carried out through the automatically increased grid size, so long as the number of the target words is fixed, the grid examples containing all the target words can be found, and a word cannot be missed.

2. According to the method, the system, the medium or the electronic device, although English is used, the word finding array can be generated through the algorithm for the foreign languages based on letters, the customization of the algorithm is high, and the expansion and modification can be performed according to different conditions, such as the presentation direction of the target word, the length ratio of a rectangular area and the like; the method is completely automatic, can be realized in any system and programming language, and can be applied to different platforms.

Advantages of additional aspects of the disclosure will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of the disclosure.

Drawings

The accompanying drawings, which are included to provide a further understanding of the disclosure, illustrate embodiments of the disclosure and together with the description serve to explain the disclosure and are not to limit the disclosure.

Fig. 1 is a schematic flowchart of a method for generating a word learning array according to embodiment 1 of the present disclosure.

Fig. 2 is a schematic diagram of a common letter provided in embodiment 1 of the present disclosure.

Fig. 3 is a word learning array 1 provided in embodiment 1 of the present disclosure.

Fig. 4 is a word learning array 2 provided in embodiment 1 of the present disclosure.

Fig. 5 is a word learning array 3 provided in embodiment 1 of the present disclosure.

Fig. 6 is a word learning array 4 provided in embodiment 1 of the present disclosure.

Detailed Description

The present disclosure is further described with reference to the following drawings and examples.

It should be noted that the following detailed description is exemplary and is intended to provide further explanation of the disclosure. Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this disclosure belongs.

It is noted that the terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of example embodiments according to the present disclosure. As used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, and it should be understood that when the terms "comprises" and/or "comprising" are used in this specification, they specify the presence of stated features, steps, operations, devices, components, and/or combinations thereof, unless the context clearly indicates otherwise.

The embodiments and features of the embodiments in the present disclosure may be combined with each other without conflict.

Example 1:

as shown in fig. 1, an embodiment 1 of the present disclosure provides a method for generating a word learning array, including the following steps:

Specifically, the method comprises the following steps:

step 1: creating a target word list; setting rectangular grids and setting the length of an initial rectangular side;

step 2: enter into circulation

step 3: when the number of attempts does not exceed the threshold, a loop is entered

step 4: randomly shuffling the word list;

step 5: creating a two-dimensional matrix with the side length of the current rectangle as the dimension;

step 6: traversing a target word list

step 7: performing insertion operation on the current word;

step 8: if all words are inserted

step 9: jumping out of Step2 loop;

step 10: the number of attempts is increased by 1, and the process returns to Step 3;

step 11: adding 1 to the side length of the rectangle and returning to Step 2;

step 12: and randomly filling other characters into the blank spaces which are not filled with the target words, and finishing the algorithm.

Detailed Description

The overall flow of the algorithm is as follows. At step1 the receive parameters are dominant. The only parameter of this embodiment is the set of words that need to be generated, which is referred to herein as the target word list. While setting the length of the generated mesh. The length here corresponds to the unit of length of the word.

For example, if a word of length 5 is to be generated, the minimum lattice size must be 5. Here, the case of a plurality of lines is not considered, and only the word appearing in a certain line, a certain column, or a certain diagonal line is considered. When the target words are many, there may be a case where the words cannot be inserted, for example, the number of words is large and the lattice is small. It is therefore necessary to initialize the side length of a rectangle first. Without theoretical support, the length of the maximum target word can be increased by 1 as the initial lengthening.

For the above reasons, it may not be possible to insert all words in a certain size of lattice. The algorithm therefore uses a loop of step2 to try to increase the grid after the side length. If a word cannot be inserted at the current side length, i.e., a word array instance cannot be successfully generated, then at the end, step11, the side length is increased by 1, i.e., the grid area is expanded. Obviously, as long as the target word is not infinite, when the lattice is increased to a certain length (e.g., the sum of the lengths of all words), there must be a case where all words are successfully inserted at one time. For convenience of explanation, rectangles of equal length and width, i.e., squares, are used herein for description. If rectangles of unequal length and width are to be implemented, alternate increases in length and width at step11 may be made to increase the grid area size.

The algorithm goes from step3 to the inside of the loop. Since the algorithm has a certain randomness, it is possible that the subsequent insertion operation is successful or unsuccessful for a fixed target word list and the current lattice size. Therefore, multiple attempts to insert all words are made with all parameters fixed. The threshold of the number of attempts here may be generally set to 100 to 200. If all word insertions were not successful in a certain attempt, i.e. one word array instance was not generated, the attempt continues under the current parameters and 1 is incremented by the count of the number of attempts. If the threshold is not successfully crossed, the outermost loop is entered, and the mesh area is expanded. That is, the outermost loop of the algorithm is used to increase the grid area, and the next loop is tried multiple times under the current area.

The algorithm randomizes the target word list, i.e., shuffles, at step 4. The purpose of this is to create some randomness to the interface of the final word array. If a plurality of word array interfaces are generated and the target words contained in the interfaces are the same, the shuffling operation can ensure that the generated interfaces are different each time, and the applicability of the algorithm is increased. This operation may be omitted if the instance is generated only once. The algorithm builds an instance of the grid in computer memory at step5 to facilitate subsequent insertion operations.

The algorithm enters a target word list traversal loop at step 6. Within this loop, an attempt is made to insert all words into the lattice. The insert operation is done with step7. This step is explained in further detail.

The overall idea of the operation is first to select a direction, select a cell, and fill in the cell with the letters of the sequential word in that direction, and discard if the letters exceed the boundary.

First, words may be presented in multiple directions, e.g., from left to right in a row, or from top to bottom in a column. The word array can be generated from right to left and from bottom to top as required. Thus, to represent the presentation direction of a word, an enumeration class is first defined that represents the direction. In the current example implementation, three directions are used, namely the more common left-to-right, top-to-bottom direction. For diagonal lines, only the direction from the upper left corner to the lower right corner is used. Other implementations may vary accordingly. Two numbers representing horizontal and vertical directions, such as positive 1 and negative 1, may be used to represent a certain direction during programming implementation.

On the other hand, in order to try all directions while maintaining randomness, the direction elements may be shuffled. Such as a first attempt from left to right, a second attempt from top left to bottom right, and a third attempt from top to bottom. And for the next word, the order may be changed, but all are used. The method is also used for the selection of the grid. I.e., first shuffle all of the grid locations and then try in sequence. The insertion operation, step7, is specifically the following step.

step7.1. shuffle the grid elements randomly, traverse a certain grid position

Step7.2. shuffle Direction elements, traverse a certain direction

step7.3, inserting words at the position of the current grid according to the current direction;

step7.4. if successful, return;

step7.5, ending the direction traversal;

step7.6. the traversal of the grid position is finished;

the concrete explanation of step7.3 is as follows. In this step, a decision is involved if a certain letter of the current word has been occupied by the position of the previous word. As shown in fig. 2, two words share the letter o. In the case of inserting a word, if a letter exists at the next position, it is only necessary to judge whether the letter is the same as the letter to be filled. If so, there is no effect. If not, the current starting position is deemed to have failed and the next direction or position is tried.

The implementation of the insertion word, step7.3 above, is as follows.

Step7.3.1: judging whether the single words cross the boundary under the current position and the current direction, if so, directly returning to the failure

Step7.3.2: sequentially judging whether each position to be inserted under the current position and direction is occupied or not, if so, judging whether each position to be inserted under the current position and direction is occupied or not

Step7.3.3: judging whether the occupied letters are the same as the letters to be inserted or not, and if not, returning to failure;

step7.3.4: insert all letters of the word at the current position and orientation in the lattice and return success

In step12 of the overall algorithm flow, all target words are inserted and then the remaining grid positions are filled with random letters.

Results of the experiment

The following are examples of word arrays generated by the present algorithm using the target word lists bound, natural, conceal, regret, completion, paddle, grove, overurn, and sink, as shown in fig. 3, 4, 5, and 6.

Example 2:

an embodiment 2 of the present disclosure provides a system for generating a word learning array, including:

The working method of the system is the same as the generation method of the word learning array provided in embodiment 1, and details are not repeated here.

Example 3:

an embodiment 3 of the present disclosure provides a computer-readable storage medium, on which a program is stored, which when executed by a processor, implements the steps in the method for generating a word learning array according to the first aspect of the present disclosure, the steps being:

The detailed steps are the same as the generation method of the word learning array provided in embodiment 1, and are not described again here.

Example 4:

an embodiment 4 of the present disclosure provides an electronic device, which includes a memory, a processor, and a program stored in the memory and executable on the processor, where the processor implements, when executing the program, the steps in the method for generating a word learning array according to embodiment 1 of the present disclosure, where the steps are:

As will be appreciated by one skilled in the art, embodiments of the present disclosure may be provided as a method, system, or computer program product. Accordingly, the present disclosure may take the form of a hardware embodiment, a software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present disclosure may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, optical storage, and the like) having computer-usable program code embodied therein.

The present disclosure is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the disclosure. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by a computer program, which can be stored in a computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. The storage medium may be a magnetic disk, an optical disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), or the like.

The above description is only a preferred embodiment of the present disclosure and is not intended to limit the present disclosure, and various modifications and changes may be made to the present disclosure by those skilled in the art. Any modification, equivalent replacement, improvement and the like made within the spirit and principle of the present disclosure should be included in the protection scope of the present disclosure.

Claims

1. A method of generating a word learning array, comprising: the method comprises the following steps:

2. The method of generating a word learning array as claimed in claim 1, wherein:

the random arrangement of the target word list is performed each time an insertion loop of all words is performed.

3. The method of generating a word learning array as claimed in claim 1, wherein:

the number of grids contained in the rows or columns of the initial matrix grid is the number of characters of the longest word plus a predetermined amount.

4. The method of generating a word learning array as claimed in claim 1, wherein:

a word insertion matrix lattice comprising:

5. The method of generating a word learning array according to claim 4, wherein:

randomly arranging the grid elements, traversing a certain grid position, randomly arranging the directional elements, traversing a certain direction, inserting a word at the current grid position according to the current direction, if the insertion of the next word is successful, otherwise, continuously executing the random arrangement and traversal operation of the grid elements and the grid positions until the word is inserted.

6. The method of generating a word learning array according to claim 4, wherein:

if a certain letter of the current word is already occupied by the position of the previous word, judging whether the letter is the same as the letter to be filled in or not if the next position has the letter during the insertion, if so, continuing the insertion, otherwise, regarding the current starting position as failure and trying the next direction or position.

7. The method of generating a word learning array according to claim 4, wherein:

judging whether the single words cross the boundary under the current cell and the current direction, if so, directly returning to failure;

8. A method of generating a word learning array, comprising: the method comprises the following steps:

9. A computer-readable storage medium, on which a program is stored, which, when being executed by a processor, carries out the steps in the method for generating a word learning array according to any one of claims 1 to 7.

10. An electronic device comprising a memory, a processor and a program stored on the memory and executable on the processor, wherein the processor implements the steps in the method of generating a word learning array according to any one of claims 1-7 when executing the program.