Mind map generation method and system and electronic equipment
A mind map and tree map technology, applied in the field of education system, can solve problems such as difficulty in memory, disconnection of various poems, and spending a lot of time.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0058] After long-term practice and research, the inventor of the present application found that in the prior art, it is difficult for students to memorize poems. If the method of rote memorization is used, it will take a long time for students to memorize, and it is easy to forget after recitation Therefore, the method for generating a mind map provided by the embodiment of the present application collects a plurality of different poems that need to be recited, and classifies the poems containing the same element connection in these poems by using a tree diagram, so that To assist students in memory, the specific implementation method is as follows:
[0059] S101: Acquiring poetry text information input by the user;
[0060] For the acquisition of text information, the acquisition method mainly uses OCR (OPTICAL CHARACTER RECOGNITION, optical character recognition) technology. The specific implementation method is to use electronic equipment to check the characters printed on...
Embodiment 2
[0073] see figure 2 , in an embodiment of the present invention,
[0074] There are multiple root nodes, and the comparison string is compared with the root strings of multiple root nodes. If any character in the comparison string is in the string of the root node, continue to compare to the next node to which the current node belongs , until the comparison string is not in the string of the node.
[0075]The multiple root nodes are the first root node, the second root node, and the third root node; the comparison string is compared with the strings of the first root node, the second root node, and the third root node respectively. If the comparison string If any character is in the string of the first root node, the second root node or the third root node, then continue to compare to the next node to which the corresponding root node belongs, until the comparison string is not in the string of the node .
[0076] For the initial root node in the dendrogram model, it can b...
Embodiment 3
[0079] see figure 2 , in an embodiment of the present invention, any root node includes a plurality of child nodes of the same level, after the comparison string is compared with the root node, the comparison string is compared with all child nodes of the same level respectively, if any If the character is in the string of any child node of the same level, then continue to compare along the next node to which the child node of the same level belongs, until the comparison string is not in the string of the node.
[0080] In the embodiment of the present invention, in order to make the classification more perfect and avoid implementation 2, the child nodes only have a part of the character strings of the root node, so any root node is set to include multiple child nodes of the same level, thereby utilizing multiple child nodes of the same level The character string of the node classifies and subdivides the character string of the root node, so that the poems can be further subd...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com