English word matching method and device, control chip, learning machine and storage medium

Abstract

The invention discloses an English word matching method and device, a control chip, a learning machine and a storage medium, and the method comprises the steps: reading a pre-constructed multi-level index directory, each level of index directory comprises folders which are named by 26 English letters, all English words and / or twenty-six subfolders corresponding to the current index path are stored in each folder; receiving a to-be-matched word input by a user, matching a plurality of English letters arranged in the front of the to-be-matched word with each level of index directory one by one, and confirming a target index path; and matching the word to be matched with each English word under the target index path, and confirming a target English word. According to the method and the device, the words are stored in different folders in a scattered manner, and when the words are matched, the index paths can be firstly matched to greatly reduce the quantity of the words needing to be matched, so that the requirement is reduced, a chip of a learning machine with relatively weak computing power is adapted, and the production cost is reduced.

Description

Technical Field

[0001] This application relates to the technical field of learning supplies, and particularly to an English word matching method, device, control chip, learning machine, and storage medium. Background Art

[0002] A learning machine is an electronic teaching product and a relatively popular portable learning device. Common learning machines usually have the function of querying English words. However, the algorithm implementation process of the English word query function of existing learning machines is relatively complex and requires a large amount of computing power to run effectively and quickly. In this case, if a low-end chip is used, it will inevitably affect the smooth operation of the query algorithm, increase the query time, and further may cause the user to wait for a certain time to obtain the query result, affecting the user experience. Moreover, for a portable learning machine, if a better user experience is required, an increase in computing power means that a more high-end chip needs to be used, resulting in an increase in production costs. Summary of the Invention

[0003] In view of this, this application provides an English word matching method, device, control chip, learning machine, and storage medium to solve the problems of poor optimization, high computing power requirements, and slow query speed of the existing learning machine word query method.

[0004] To solve the above technical problems, a technical solution adopted by this application is: providing an English word matching method, which is applied to a learning machine. The method includes: reading a pre-constructed multi-level index directory, where each level of the index directory includes folders named after the twenty-six English letters, and each folder stores all English words and / or twenty-six sub-folders corresponding to the current index path; receiving a to-be-matched word input by the user, and successively matching the first several English letters of the to-be-matched word with each level of the index directory to confirm the target index path; matching the to-be-matched word with each English word under the target index path to confirm the target English word.

[0005] As a further improvement of this application, successively matching the first several English letters of the to-be-matched word with each level of the index directory to confirm the target index path includes: whenever an English letter input by the user is received, matching the currently received English letter with the name of each folder under the current level of the index directory to confirm the target folder for matching, and using the target folder as the next level of the index directory until the number of English letters input by the user reaches a preset number or a confirmation signal input by the user is received, to obtain the target index path.

[0006] As a further improvement of the present application, each of the multiple English letters arranged at the front of the word to be matched is matched with each level of the index directory one by one to confirm the target index path, including: when the letter length of the word to be matched is greater than the preset number, obtaining the first preset number of target letters of the word to be matched, or when the letter length of the word to be matched is less than or equal to the preset number, obtaining all the English letters of the word to be matched as target letters; sequentially matching each target letter with the name of the folder under each level of the index directory to confirm the target folder to be matched, and using the target folder as the next level of the index directory until all the target letters are matched, thus obtaining the target index path.

[0007] As a further improvement of the present application, the word to be matched is matched with each English word under the target index path to confirm the target English word, including: when the letter length of the word to be matched is greater than the preset number, obtaining the subsequent letter string of the word to be matched after removing the first preset number of target letters, and matching the subsequent letter string with the letter string to be matched after removing the first preset number of target letters of each English word under the target index path to confirm the target English word with successful matching; when the letter length of the word to be matched is less than or equal to the preset number, matching the word to be matched with each English word under the target index path one by one to confirm the target English word with successful matching.

[0008] As a further improvement of the present application, the subsequent letter string is matched with the letter string to be matched after removing the first preset number of target letters of each English word under the target index path to confirm the target English word with successful matching, including: obtaining the pre-constructed mapping relation table, where the mapping relation table records the mapping relation between the English letter string after removing the first preset number of letters of each English word with a letter length exceeding the preset number and each English word; retrieving the letter string to be matched corresponding to each English word under the target index path; matching each letter string to be matched with the subsequent letter string one by one to confirm the target letter string; and confirming the target English word corresponding to the target letter string according to the mapping relation.

[0009] As a further improvement of the present application, pre-constructing a multi-level index directory includes: constructing a multi-level index directory, where each level of the index directory includes folders named with twenty-six English letters; obtaining the first preset number of English letters of each known English word, and sequentially corresponding each English letter with the name of the folder under each level of the index directory to confirm the index path of each known English word; and storing each known English word into the corresponding folder according to the index path.

[0010] As a further improvement of the present application, after confirming the target English word, it further includes: outputting the corresponding definition, graphics, and audio of the target English word.

[0011] To solve the above technical problems, another technical solution adopted by this application is: to provide an English word matching device, which includes: a reading module for reading a pre-constructed multi-level index directory. Each level of the index directory includes folders named after the twenty-six English letters respectively. Under each folder, all English words and / or twenty-six sub-folders corresponding to the current index path are stored; a path matching module for receiving the word to be matched input by the user, and sequentially matching the first several English letters of the word to be matched with each level of the index directory to confirm the target index path; a word matching module for matching the word to be matched with each English word under the target index path to confirm the target English word.

[0012] To solve the above technical problems, another technical solution adopted by this application is: to provide a control chip, which includes a processor and a memory coupled to the processor. Program instructions are stored in the memory. When the program instructions are executed by the processor, the processor executes the steps of the English word matching method as described in any one of the above.

[0013] To solve the above technical problems, another technical solution adopted by this application is: to provide a learning machine, which includes the above control chip and a storage device. The storage device stores a multi-level index directory. Each level of the index directory includes folders named after the twenty-six English letters respectively. Under each folder, all English words and / or twenty-six sub-folders corresponding to the current index path are stored.

[0014] To solve the above technical problems, another technical solution adopted by this application is: to provide a storage medium storing program instructions capable of implementing the English word matching method as described in any one of the above.

[0015] The beneficial effect of this application is: The English word matching method of this application pre-constructs a multi-level index directory, and then stores known English words in different folders according to different index paths respectively. When querying a word, the first several English letters of the word to be queried are matched with the index directory to confirm the corresponding index path, and then the words in the folder corresponding to this index path are matched with the word to be matched to obtain the matching result. It only needs to match the words in the folder under the index path, and does not need to match the word to be matched with all words, thus greatly reducing the number of word matches, reducing the computing power requirements, adapting to the chips of learning machines with relatively weak computing power, and reducing the production cost. Description of the Drawings

[0016] Figure 1 is a flowchart of the English word matching method according to an embodiment of the present invention;

[0017] Figure 2It is a schematic diagram of the functional modules of the English word matching device according to an embodiment of the present invention;

[0018] Figure 3 It is a schematic diagram of the structure of the control chip according to an embodiment of the present invention;

[0019] Figure 4 It is a schematic diagram of the structure of the learning machine according to an embodiment of the present invention;

[0020] Figure 5 It is a schematic diagram of the structure of the storage medium according to an embodiment of the present invention. Detailed implementation manners

[0021] Next, the technical solutions in the embodiments of the present application will be clearly and completely described in conjunction with the accompanying drawings in the embodiments of the present application. Obviously, the described embodiments are only a part of the embodiments of the present application, rather than all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present application.

[0022] The terms "first", "second", and "third" in the present application are only for descriptive purposes and cannot be construed as indicating or implying relative importance or implicitly indicating the number of indicated technical features. Thus, the features defined with "first", "second", and "third" may explicitly or implicitly include at least one of such features. In the description of the present application, the meaning of "a plurality" is at least two, such as two, three, etc., unless otherwise specifically defined. All directional indications (such as up, down, left, right, front, back...) in the embodiments of the present application are only used to explain the relative positional relationship and movement conditions between components in a specific posture (as shown in the drawings). If the specific posture changes, the directional indications will also change accordingly. In addition, the terms "comprising" and "having" and any variations thereof are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or device that includes a series of steps or units is not limited to the listed steps or units, but optionally further includes unlisted steps or units, or optionally further includes other steps or units inherent to these processes, methods, products, or devices.

[0023] Referring to "embodiment" in this article means that the specific features, structures, or characteristics described in conjunction with the embodiment may be included in at least one embodiment of the present application. The phrase appears in various positions in the specification does not necessarily refer to the same embodiment, nor is it an independent or alternative embodiment mutually exclusive with other embodiments. Those skilled in the art will explicitly and implicitly understand that the embodiments described herein may be combined with other embodiments.

[0024] Figure 1It is a schematic flowchart of the English word matching method according to an embodiment of the present invention. It should be noted that if there are substantially the same results, the method of the present invention is not limited to Figure 1 the process sequence shown. For example Figure 1 as shown, the English word matching method includes the steps:

[0025] Step S101: Read the pre-constructed multi-level index directory. Each level of the index directory includes folders named after the twenty-six English letters. Under each folder, all English words corresponding to the current index path and / or twenty-six sub-folders are stored.

[0026] Specifically, when manufacturing a learning machine, it is necessary to implant English words and corresponding explanations, pronunciations, pictures, examples, etc. of the English words into the chip of the learning machine. In the process of implanting data in this embodiment, a multi-level index directory is constructed in the storage space of the chip. Each level of the index directory includes folders named after the twenty-six English letters. Under each folder, all English words corresponding to the current index path and / or twenty-six sub-folders are stored. For example, for the first-level index directory, it includes twenty-six folders, which are named in sequence as "a, b, c,..., x, y, z"; for the second-level index directory, that is, each folder also includes twenty-six sub-folders, and the sub-folders are also named after the twenty-six English words "a, b, c,..., x, y, z". In addition, corresponding words are also included. For example, in the "a" folder under the first-level index directory, it also includes the word "a". Similarly, for the third-level index directory, in addition to including twenty-six folders, corresponding words are also included. For example, in the "n" folder under the second-level index directory, in addition to the twenty-six folders, the word "an" is also included. Please refer to Table 1 below, which shows the structure of the three-level index directory.

[0027] Table 1

[0028]

[0029]

[0030] Preferably, this embodiment constructs a three-level index directory.

[0031] Furthermore, in this embodiment, the step of pre-constructing the multi-level index directory specifically includes:

[0032] 1. Construct a multi-level index directory, and each level of the index directory includes folders named after the twenty-six English letters.

[0033] 2. Obtain the first pre-set number of English letters of each known English word, and correspond each English letter with the name of the folder under each level of index directory in turn to confirm the index path of each known English word.

[0034] 3. Store each known English word into the corresponding folder according to the index path.

[0035] Specifically, first determine the number of levels of the multi-level index directory, and then obtain the first pre-set number of English letters arranged in front of each known English word according to the number of levels. The pre-set number is the same as the number of levels. For example, if a three-level index directory is set, the first three letters of each word need to be extracted. For words with less than three letters, all letters are extracted; then, the three English letters are matched with the folders under each level of index directory in turn to confirm the folders corresponding to each level of index directory, and finally obtain the index path of the word. For example, taking a three-level index directory as an example, for the word "animal", the first three letters are "a", "n", and "i" in turn. Then, the first-level index directory matches the a folder, the second index directory matches the n folder, and the third-level index directory matches the i folder. The generated index path is "X:\a\n\i", where "X" represents the storage space, and then save the word "animal" into the folder under this index path.

[0036] It should be noted that in some implementations, when constructing a multi-level index directory, there is no need to construct the index path corresponding to the non-existent word combination structure. For example, there is no word starting with the three letters "aaa", so when creating the third-level index directory, there is no need to create a folder with the index path "X:\a\a\a", where "X" represents the storage space.

[0037] Step S102: Receive the word to be matched input by the user, and match each of the first several English letters of the word to be matched with each level of index directory in turn to confirm the target index path.

[0038] Specifically, after receiving the word to be matched input by the user, extract the first several English letters arranged in front according to the arrangement order of the English letters in the word to be matched, and match the extracted English letters with each level of index directory in turn, that is, the first English letter is matched with the first-level index directory. After matching the corresponding folder, open the folder, and then match the second English letter with the sub-folders in the folder, and so on, until the matching is completed to obtain the target index path.

[0039] Further, in some embodiments, in order to improve the word query speed, in step S102, the step of matching the first several English letters of the word to be matched with each level of index directory one by one to confirm the target index path specifically includes:

[0040] Whenever an English letter input by the user is received, match the currently received English letter with the name of each folder under the current level of index directory to confirm the target folder that matches, and use the target folder as the next level of index directory until the number of English letters input by the user reaches the preset quantity or a confirmation signal input by the user is received, and the target index path is obtained.

[0041] Specifically, when the user queries an English word, when the user inputs the first English letter, match the letter with the words in the first level of index directory to obtain the target folder that matches. When the user inputs the second English letter, use the target folder as the second level of index directory, and match the sub-folders in the target folder with the second English letter, and so on. Until the number of English letters input by the user reaches the preset quantity, the index path of the English word to be queried by the user can be obtained.

[0042] It should be understood that the English word queried by the user may have a word length less than or equal to the preset quantity. In this case, take the confirmation query signal input by the user as the standard. After receiving the confirmation query signal input by the user, use the index path that has been queried currently as the target index path. For example, when the preset quantity is 3, if the user queries the word "an", that is, only the a folder in the first level of index directory and the n folder in the second level of index directory are queried, then its target index path is "X:\a\n".

[0043] In this embodiment, by performing index query when the user starts to input letters, the time required for word query is further reduced.

[0044] Further, in some embodiments, in step S102, the step of matching the first several English letters of the word to be matched with each level of index directory one by one to confirm the target index path can also be:

[0045] 1. When the letter length of the word to be matched is greater than the preset quantity, obtain the first preset quantity of target letters of the word to be matched, or when the letter length of the word to be matched is less than or equal to the preset quantity, obtain all the English letters of the word to be matched as the target letters.

[0046] 2. Sequentially match each target letter with the names of the folders under each level of the index directory in the arranged order, confirm the matching target folder, and use the target folder as the next-level index directory until all the target letters are matched, obtaining the target index path.

[0047] It should be understood that after setting the preset quantity, there may be a situation where the length of the word to be queried by the user is less than the preset quantity. Therefore, when the letter length of the word to be matched is greater than the preset quantity, obtain the first preset quantity of target letters of the word to be matched, and query the target index path with the first preset quantity of letters of the word to narrow the query range of the word. And when the letter length of the word to be matched is less than or equal to the preset quantity, obtain all the English letters of the word to be matched as the target letters, and query the target index path of the word with all the target letters.

[0048] Step S103: Match the word to be matched with each English word under the target index path to confirm the target English word.

[0049] Specifically, after querying the target index path of the word to be matched, match each English word under the target index path with the word to be matched one by one to confirm the target English word. It should be understood that in some cases, when the user makes an input error, the correct word cannot be queried. At this time, a reminder message can be sent out to remind the user to query again.

[0050] Furthermore, to further reduce the computing power and time required for querying, step S103 specifically includes:

[0051] 1. When the letter length of the word to be matched is greater than the preset quantity, obtain the subsequent letter string of the word to be matched excluding the first preset quantity of target letters, and match the subsequent letter string with the letter string to be matched after excluding the first preset quantity of target letters of each English word under the target index path to confirm the target English word that matches successfully.

[0052] Specifically, to avoid repeatedly querying the first preset number of target letters during the query process, after confirming the target index path, obtain the subsequent letter string of the word to be queried after removing the first preset number of target letters. For example, for the word "accessible", assuming a three-level index directory, the first preset number of target letters is "acc", the target index path is "X:\a\c\c", and the subsequent letter string after removing the first preset number of target letters is "essible". The words included under this target index path are: "accent", "accident", "accessible", "accommodate", "accompany", etc. The letter strings to be matched after removing the first preset number of target letters from these words are: "ent", "ident", "essible

[0053] ", "ommodate", "ompany". By matching these letter strings to be matched with the subsequent letter string respectively, the target English word corresponding to the word to be queried can be confirmed. In this embodiment, by removing the letters for path index matching, the number of letters that need to be matched is reduced, thereby further reducing the computing power requirement and improving the matching efficiency.

[0054] 2. When the letter length of the word to be matched is less than or equal to the preset number, match the word to be matched with each English word under the target index path respectively to confirm the target English word with successful matching.

[0055] Further, the step of matching the subsequent letter string with the letter strings to be matched after removing the first preset number of target letters from each English word under the target index path to confirm the target English word with successful matching specifically includes:

[0056] 1.1. Obtain the pre-constructed mapping relationship table, which records the mapping relationship between the English letter strings after removing the first preset number of letters from each English word with a letter length exceeding the preset number and each English word.

[0057] 1.2. Retrieve the letter strings to be matched corresponding to each English word under the target index path.

[0058] 1.3. Match each letter string to be matched with the subsequent letter string respectively to confirm the target letter string.

[0059] 1.4. Confirm the target English word corresponding to the target letter string according to the mapping relationship.

[0060] Specifically, in order to reduce the computational complexity in the word matching process, in this embodiment, a mapping relationship is pre-constructed between the English letter strings obtained by removing the first preset number of letters from each English word and each English word. During the word query process, instead of splitting the English word into letter strings of a preset number of letters and the letter strings to be matched, the mapping relationship between the target letter string and the English word in the mapping relationship table is directly called to confirm the target English word corresponding to the target letter string.

[0061] Further, after step S103, it further includes:

[0062] Output the corresponding definition, graphics, and audio of the target English word.

[0063] Specifically, after the target English word is queried, the definition, graphic description, and audio file of the target word pre-stored in the storage space are output to facilitate users' learning.

[0064] The English word matching method according to the embodiment of the present invention pre-constructs a multi-level index directory, and then stores the known English words into different folders according to different index paths respectively. When querying a word, the multiple English letters arranged at the front of the word to be queried are matched with the index directory to confirm the corresponding index path, and then the words in the folder corresponding to the index path are matched with the word to be matched to obtain the matching result. It only needs to match the words in the folder under the index path, rather than matching the word to be matched with all the words, thus greatly reducing the number of word matches and the computing power requirement to adapt to the chip of a learning machine with relatively weak computing power and reducing the production cost.

[0065] Figure 2 It is a schematic diagram of the functional modules of the English word matching device according to the embodiment of the present invention. As Figure 2 shown, the English word matching device 20 includes a reading module 21, a path matching module 22, and a word matching module 23.

[0066] The reading module 21 is configured to read the pre-constructed multi-level index directory. Each level of the index directory includes folders named after the twenty-six English letters respectively, and each folder stores all the English words corresponding to the current index path and / or twenty-six sub-folders.

[0067] The path matching module 22 is configured to receive the word to be matched input by the user, and match the multiple English letters arranged at the front of the word to be matched with each level of the index directory one by one to confirm the target index path.

[0068] The word matching module 23 is configured to match the word to be matched with each English word under the target index path to confirm the target English word.

[0069] Optionally, the path matching module 22 performs an operation of matching multiple English letters arranged at the front of the word to be matched with each level of the index directory one by one to confirm the target index path, specifically including: whenever an English letter input by the user is received, matching the currently received English letter with the name of each folder under the current level of the index directory, confirming the target folder that matches, and using the target folder as the next level of the index directory until the number of English letters input by the user reaches the preset quantity or a confirmation signal input by the user is received, so as to obtain the target index path.

[0070] Optionally, the operation of the path matching module 22 matching multiple English letters arranged at the front of the word to be matched with each level of the index directory one by one to confirm the target index path may further include: when the letter length of the word to be matched is greater than the preset quantity, obtaining the first preset quantity of target letters of the word to be matched, or when the letter length of the word to be matched is less than or equal to the preset quantity, obtaining all English letters of the word to be matched as the target letters; sequentially matching each target letter with the name of the folder under each level of the index directory in order, confirming the target folder that matches, and using the target folder as the next level of the index directory until all the target letters are matched, so as to obtain the target index path.

[0071] Optionally, the word matching module 23 performs an operation of matching the word to be matched with each English word under the target index path to confirm the target English word, specifically including: when the letter length of the word to be matched is greater than the preset quantity, obtaining the subsequent letter string of the word to be matched excluding the first preset quantity of target letters, and matching the subsequent letter string with the letter string to be matched after excluding the first preset quantity of target letters of each English word under the target index path, so as to confirm the target English word with successful matching; when the letter length of the word to be matched is less than or equal to the preset quantity, matching the word to be matched with each English word under the target index path respectively, so as to confirm the target English word with successful matching.

[0072] Optionally, the operation of the word matching module 23 matching the subsequent letter string with the letter string to be matched after excluding the first preset quantity of target letters of each English word under the target index path to confirm the target English word with successful matching specifically includes: obtaining the pre-constructed mapping relation table, where the mapping relation table records the mapping relation between the English letter string after excluding the first preset quantity of letters of each English word with a letter length exceeding the preset quantity and each English word; retrieving the letter string to be matched corresponding to each English word under the target index path; matching each letter string to be matched with the subsequent letter string respectively to confirm the target letter string; and confirming the target English word corresponding to the target letter string according to the mapping relation.

[0073] Optionally, the reading module 21 is further configured to pre-construct a multi-level index directory, specifically including: constructing a multi-level index directory, where each level of the index directory includes folders named with twenty-six English letters; obtaining the first preset number of English letters of each known English word, and sequentially corresponding each English letter to the name of the folder under each level of the index directory to confirm the index path of each known English word; and storing each known English word into the corresponding folder according to the index path.

[0074] Optionally, after the word matching module 23 performs the operation of confirming the target English word, it is further configured to: output the corresponding interpretation, graphics, and audio of the target English word.

[0075] For other details of the technical solutions implemented by each module in the above-mentioned English word matching device of the embodiment, reference can be made to the description in the English word matching method in the above-mentioned embodiment, which will not be elaborated here.

[0076] It should be noted that the embodiments in this specification are all described in a progressive manner. Each embodiment focuses on the differences from other embodiments. The same or similar parts among the embodiments can be referred to each other. For the device embodiments, since they are basically similar to the method embodiments, the description is relatively simple. For the relevant parts, reference can be made to the partial description of the method embodiments.

[0077] Please refer to Figure 3 , Figure 3 which is a schematic structural diagram of the control chip according to an embodiment of the present invention. As Figure 3 shown, the control chip 30 includes a processor 31 and a memory 32 coupled to the processor 31. Program instructions are stored in the memory 32. When the program instructions are executed by the processor 31, the processor 31 executes the steps of the English word matching method described in any of the above embodiments.

[0078] Among them, the processor 31 can also be referred to as a resource (Central Processing Unit, CPU). The processor 31 may be an integrated circuit chip with signal processing capabilities. The processor 31 can also be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components. The general-purpose processor can be a microprocessor or the processor can also be any conventional processor, etc.

[0079] Please refer to Figure 4 , Figure 4 which is a schematic structural diagram of the learning machine according to an embodiment of the present invention. As Figure 4As shown, the learning machine 40 includes the above-mentioned implemented control chip 30 and a storage device 41. The storage device 41 stores a multi-level index directory. Each level of the index directory includes folders named after the twenty-six English letters respectively. Under each folder, all English words and / or twenty-six sub-folders corresponding to the current index path are stored.

[0080] Refer to Figure 5 , Figure 5 is a schematic structural diagram of the storage medium according to an embodiment of the present invention. The storage medium according to an embodiment of the present invention stores program instructions 51 that can implement the above-mentioned English word matching method. Among them, the program instructions 51 can be stored in the above-mentioned storage medium in the form of a software product, including several instructions for causing a control chip (which can be a personal computer, a server, or a network device, etc.) or a processor to execute all or part of the steps of the methods described in various embodiments of the present application. The foregoing storage medium includes: various media that can store program codes such as USB flash drives, mobile hard disks, read-only memories (ROMs), random access memories (RAMs), magnetic disks, or optical discs, or control chip devices such as computers, servers, mobile phones, and tablets.

[0081] In several embodiments provided in the present application, it should be understood that the disclosed control chip, device, and method can be implemented in other ways. For example, the device embodiments described above are merely illustrative. For example, the division of units is only a logical function division. In actual implementation, there may be other division methods. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the displayed or discussed coupling or direct coupling or communication connection between each other can be through some interfaces, and the indirect coupling or communication connection of devices or units can be in electrical, mechanical, or other forms.

[0082] In addition, each functional unit in various embodiments of the present invention can be integrated in a processing unit, or each unit can exist physically alone, or two or more units can be integrated in one unit. The above-mentioned integrated unit can be implemented in the form of hardware or in the form of a software functional unit. The above is only the embodiment of the present application, and it does not limit the patent scope of the present application. Any equivalent structural or equivalent process transformation made by using the content of the specification and drawings of the present application, or directly or indirectly applied in other related technical fields, is equally included in the patent protection scope of the present application.

Claims

1. An English word matching method, characterized in that, It is applied to a learning machine, and the method includes: Read a pre-constructed multi-level index directory. Each level of the index directory includes folders named after the twenty-six English letters respectively. Under each folder, all English words corresponding to the current index path and / or twenty-six sub-folders are stored; Receive a word to be matched input by the user, and match each of the first several English letters of the word to be matched with each level of the index directory one by one to confirm the target index path; Match the word to be matched with each English word under the target index path to confirm the target English word.

2. The English word matching method according to claim 1, wherein The step of matching each of the first several English letters of the word to be matched with each level of the index directory one by one to confirm the target index path includes: Whenever an English letter input by the user is received, match the currently received English letter with the name of each folder under the current level of the index directory to confirm the target folder that matches, and use the target folder as the next level of the index directory until the number of English letters input by the user reaches a preset number or a confirmation signal input by the user is received, so as to obtain the target index path.

3. The English word matching method according to claim 1, characterized in that The step of matching each of the first several English letters of the word to be matched with each level of the index directory one by one to confirm the target index path includes: Obtain the first preset number of target letters of the word to be matched, or when the number of letters of the word to be matched is less than or equal to the preset number, obtain all English letters of the word to be matched as the target letters; Match each target letter with the name of the folder under each level of the index directory in sequence according to the arrangement order to confirm the target folder that matches, and use the target folder as the next level of the index directory until all the target letters are matched, so as to obtain the target index path.

4. The English word matching method according to claim 2 or 3, characterized in that, The step of matching the word to be matched with each English word under the target index path to confirm the target English word includes: When the number of letters of the word to be matched is greater than the preset number, obtain the subsequent letter string of the word to be matched after removing the first preset number of target letters, and match the subsequent letter string with the letter string to be matched after removing the first preset number of target letters of each English word under the target index path to confirm the target English word with a successful match; When the number of letters of the word to be matched is less than or equal to the preset number, match the word to be matched with each English word under the target index path respectively to confirm the target English word with a successful match.

5. The English word matching method according to claim 4, wherein The step of matching the subsequent letter string with the letter string to be matched after removing the first preset number of target letters of each English word under the target index path to confirm the target English word with a successful match includes: Obtain a pre-constructed mapping relation table, and the mapping relation table records the mapping relation between the English letter string after removing the first preset number of letters of each English word with a letter length exceeding the preset number and each English word; Retrieve the letter string to be matched corresponding to each English word under the target index path; Match each letter string to be matched with the subsequent letter string respectively to confirm the target letter string; Confirm the target English word corresponding to the target letter string according to the mapping relationship.

6. The English word matching method according to claim 1, characterized in that, Pre-construct a multi-level index directory, including: Construct a multi-level index directory, and each level of index directory includes folders named with twenty-six English letters; Obtain the first preset number of English letters of each known English word, and correspond each English letter with the name of the folder under each level of index directory in turn to confirm the index path of each known English word; Store each known English word into the corresponding folder according to the index path.

7. The English word matching method according to claim 1, characterized in that After confirming the target English word, it further includes: Output the corresponding definition, picture and audio of the target English word.

8. An English word matching device, characterized in that, It includes: A reading module, configured to read the pre-constructed multi-level index directory. Each level of index directory includes folders named with twenty-six English letters respectively, and all English words and / or twenty-six sub-folders corresponding to the current index path are stored under each folder; A path matching module, configured to receive the word to be matched input by the user, and match each of the first several English letters of the word to be matched with each level of index directory one by one to confirm the target index path; A word matching module, configured to match the word to be matched with each English word under the target index path to confirm the target English word.

9. A control chip, characterized in that, The control chip includes a processor and a memory coupled to the processor. Program instructions are stored in the memory. When the program instructions are executed by the processor, the processor executes the steps of the English word matching method described in any one of claims 1-7.

10. A learning machine, characterized in that, It includes the control chip and the storage device described in claim 9. The storage device stores a multi-level index directory. Each level of index directory includes folders named with twenty-six English letters respectively, and all English words and / or twenty-six sub-folders corresponding to the current index path are stored under each folder.

11. A storage medium, characterized in that, Program instructions capable of implementing the English word matching method described in any one of claims 1-7 are stored.

Images