KR101798388B1 - Method Of CREATING A sentence FOR MEMORIZATION, and System there-of - Google Patents

Method Of CREATING A sentence FOR MEMORIZATION, and System there-of Download PDF

Info

Publication number
KR101798388B1
KR101798388B1 KR1020150186246A KR20150186246A KR101798388B1 KR 101798388 B1 KR101798388 B1 KR 101798388B1 KR 1020150186246 A KR1020150186246 A KR 1020150186246A KR 20150186246 A KR20150186246 A KR 20150186246A KR 101798388 B1 KR101798388 B1 KR 101798388B1
Authority
KR
South Korea
Prior art keywords
words
terminal
information
database
server
Prior art date
Application number
KR1020150186246A
Other languages
Korean (ko)
Other versions
KR20170076226A (en
Inventor
김영찬
김인량
김준현
Original Assignee
김영찬
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 김영찬 filed Critical 김영찬
Priority to KR1020150186246A priority Critical patent/KR101798388B1/en
Publication of KR20170076226A publication Critical patent/KR20170076226A/en
Application granted granted Critical
Publication of KR101798388B1 publication Critical patent/KR101798388B1/en

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/10—Services
    • G06Q50/20—Education
    • G06F17/2705—
    • G06F17/2735—
    • G06F17/2795—
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/10—Services
    • G06Q50/20—Education
    • G06Q50/205—Education administration or guidance
    • G06Q50/2057—Career enhancement or continuing education service
    • G—PHYSICS
    • G09—EDUCATION; CRYPTOGRAPHY; DISPLAY; ADVERTISING; SEALS
    • G09B—EDUCATIONAL OR DEMONSTRATION APPLIANCES; APPLIANCES FOR TEACHING, OR COMMUNICATING WITH, THE BLIND, DEAF OR MUTE; MODELS; PLANETARIA; GLOBES; MAPS; DIAGRAMS
    • G09B19/00—Teaching not covered by other main groups of this subclass
    • G09B19/06—Foreign languages

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Educational Administration (AREA)
  • Educational Technology (AREA)
  • Tourism & Hospitality (AREA)
  • Human Resources & Organizations (AREA)
  • Strategic Management (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Economics (AREA)
  • General Health & Medical Sciences (AREA)
  • Health & Medical Sciences (AREA)
  • Marketing (AREA)
  • Primary Health Care (AREA)
  • General Business, Economics & Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

A method for automatically generating a memorandum of a server that communicates with a terminal using a communication network according to embodiments of the present invention includes receiving an initial letter from the terminal, Sequentially receiving the sentence information and receiving sentence information, and generating a sentence based on the sentence information and the plurality of female gears.

Description

TECHNICAL FIELD The present invention relates to a method for automatically generating a memorizing statement,

More particularly, the present invention relates to a method for automatically generating a memorizing sentence using an acronym sent by a user, and a system using the same.

The memorization method that memorizes the memorized sentences generated by using the second letter is a memorizing method using associative method and is a representative type of effective memorizing means used by the examinee for fast memorizing.

In general, the method of memorizing the memorizing sentence written by oneself is more efficient than the method of memorizing the memorizing sentences written by others. However, it is time consuming and troublesome to write memorizing statements by using direct acronyms themselves.

Especially, considering that the people who mainly use these memorization methods are mainly examinees, it is practically impossible for ordinary examinees to memorize vast amounts of contents in the above-described manner in a long time.

delete

Korean Patent Publication No. 10-2009-0014145 (published Feb., 2009)

SUMMARY OF THE INVENTION The present invention has been made to solve the above-mentioned problems occurring in the prior art, and it is an object of the present invention to provide a method and system for automatically generating memorizing sentences by searching for amateur gears constituting a memorizing door by using double letters.

A method for automatically generating a memorandum statement for a server including a database, the method comprising: receiving an initial letter from the terminal, communicating with the terminal using a communication network according to embodiments of the present invention, Sequentially receiving each of the gears and receiving sentence information, and generating a sentence based on the sentence information and the plurality of female gears.

Wherein the step of sequentially receiving each of the plurality of female gears from the terminal and receiving the sentence information based on the acronym includes generating a plurality of combinations using the predetermined operation based on the acronym, Comparing the plurality of words stored in the database 240 with the words, and detecting a plurality of search terms based on the comparison result, and transmitting the plurality of search words to the terminal.

Wherein the step of sequentially receiving each of the plurality of female gears from the terminal and receiving the sentence information based on the acronym

Further comprising the steps of: receiving a female gear from the terminal; excluding a plurality of syllables corresponding to the female gear in the second letter; and determining whether the sentence information has been received from the terminal, , The process returns to the step of generating the plurality of combination words.

Wherein the step of comparing the plurality of words combined with the plurality of words stored in the database comprises the steps of: determining whether or not the coined word has been received from the terminal; and receiving, when the coined word is received, And determining whether the new coined word is duplicated.

Comparing the plurality of combinatorial words with a plurality of words stored in the database includes storing the coined word in the database if the words are not redundant, The method according to claim 1, further comprising the step of: determining whether or not the plurality of combinatorial words match the plurality of words if the coined word is not received, The process proceeds to a step of determining whether the plurality of words match.

Wherein the step of generating the memorized sentence based on the sentence information and the plurality of female gears comprises the steps of: completing the memorandum on the basis of the sentence information and the plurality of female gears; determining whether to store the memorandum in the database And determining whether to open the memorizing sentence to another user.

The predetermined operation includes a combination (nCr) operation or a permutation (nPr) operation.

The sentence information includes the order of the plurality of female gears or the contents of the corresponding words corresponding to each of the plurality of female gears.

The database stores a dictionary corresponding to each of a plurality of languages, a database corresponding to the language information input from the terminal is activated and a plurality of languages include Korean, English and Japanese.

The database classifies and stores a plurality of words by category, and the server compares a plurality of words corresponding to the inputted category information with the plurality of combinations according to category information input from the terminal.

Wherein the step of generating a plurality of combined words based on the acronym comprises: receiving maximum syllable information or minimum syllable information from the terminal; and extracting, based on the maximum syllable information or the minimum syllable information, And generating a plurality of combinations corresponding to the syllable information.

The program stored in the recording medium is coupled to a terminal capable of communicating with a server providing a pre-service through a communication network in order to execute a method of automatically generating a memorandum of a server according to embodiments of the present invention.

The program stored in the recording medium is recorded in a computer-readable recording medium so as to execute the method for automatically generating a memorized statement in the server according to the embodiments of the present invention.

In the case of using the automatic generation method of the memorized sentence according to the embodiment of the present invention, it is possible to efficiently extract memorized sentences by automatically extracting pre-registered words from a plurality of acronyms and combining them.

In addition, by storing and disclosing the created memories in the server, it is possible to share memorized statements generated by other users or to share memorized memories created by other users.

1 is a block diagram showing a schematic configuration of an automatic door generation service system according to embodiments of the present invention.
2 is a block diagram showing a configuration of a server according to an embodiment of the present invention.
3 is a flowchart illustrating a method for automatically generating a memorized sentence of a server according to an embodiment of the present invention.
4 is a flowchart illustrating in detail the steps of sequentially receiving each of the plurality of female gears based on the acronyms shown in FIG. 3 and receiving sentence information.
FIG. 5 is a flowchart detailing a step of comparing a plurality of words with a plurality of combinations shown in FIG. 4. FIG.
FIG. 6 is a flowchart detailing the steps of generating memorized phrases based on sentence information and a plurality of female gears according to the embodiments of the present invention shown in FIG.
7 is a data flow diagram illustrating the operation of the server system according to the embodiments of the present invention in detail.

It is to be understood that the specific structural or functional description of embodiments of the present invention disclosed herein is for illustrative purposes only and is not intended to limit the scope of the inventive concept But may be embodied in many different forms and is not limited to the embodiments set forth herein.

The embodiments according to the concept of the present invention can make various changes and can take various forms, so that the embodiments are illustrated in the drawings and described in detail herein. It should be understood, however, that it is not intended to limit the embodiments according to the concepts of the present invention to the particular forms disclosed, but includes all modifications, equivalents, or alternatives falling within the spirit and scope of the invention.

The terms first, second, etc. may be used to describe various elements, but the elements should not be limited by the terms. The terms may be named for the purpose of distinguishing one element from another, for example, without departing from the scope of the right according to the concept of the present invention, the first element may be referred to as a second element, The component may also be referred to as a first component.

It is to be understood that when an element is referred to as being "connected" or "connected" to another element, it may be directly connected or connected to the other element, . On the other hand, when an element is referred to as being "directly connected" or "directly connected" to another element, it should be understood that there are no other elements in between. Other expressions that describe the relationship between components, such as "between" and "between" or "neighboring to" and "directly adjacent to" should be interpreted as well.

The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. The singular expressions include plural expressions unless the context clearly dictates otherwise. In this specification, the terms "comprises" or "having" and the like are used to specify that there are features, numbers, steps, operations, elements, parts or combinations thereof described herein, But do not preclude the presence or addition of one or more other features, integers, steps, operations, components, parts, or combinations thereof.

Unless otherwise defined, all terms used herein, including technical or scientific terms, have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. Terms such as those defined in commonly used dictionaries are to be interpreted as having a meaning consistent with the meaning of the context in the relevant art and, unless explicitly defined herein, are to be interpreted as ideal or overly formal Do not.

BEST MODE FOR CARRYING OUT THE INVENTION Hereinafter, the present invention will be described in detail with reference to the preferred embodiments of the present invention with reference to the accompanying drawings.

1 is a block diagram showing a schematic configuration of an automatic door generation server system according to embodiments of the present invention.

 2 is a block diagram showing a configuration of a server according to an embodiment of the present invention.

Referring to FIGS. 1 and 2, a server system 1 may include a terminal 100 and a server 200.

The terminal 100 can communicate with the server 200 through the communication network 300. According to an embodiment, the server system 1 may include a plurality of terminals, in which case each of the plurality of terminals may communicate with another terminal through the communication network 300.

The terminal 100 may be implemented as a personal computer (PC), a laptop computer, or a portable terminal. The portable terminal may be a mobile phone, a smart phone, a tablet PC, a personal digital assistant (PDA), or the like.

The terminal 100 may include a user interface unit (not shown).

The user interface unit (not shown) may provide a user interface (UI) function for receiving a user request or information and outputting a result according to a user's request or data to the user.

The communication network 300 may be implemented as a wired, wireless, or wired / wireless hybrid communication network.

The server 200 includes a receiver 210, a preprocessor 220, a combination word generator 230, a controller 235, a database 240, a search word detector 250, a transmitter 260, And a generating unit 270.

The server 200 may be implemented as two or more server groups.

The receiving unit 210 receives server inputs (e.g., an acronym, an amalgamator, a coined word, a minimum syllable information, a maximum syllable information, a language information, category information, a sentence information, a public signal, a storage signal, etc.) from the terminal 100 Can be stored.

Here, an acronym can mean a plurality of words or a set of the first letters of sentences. For example, if the plural words are "olfactory nerve, optic nerve, temporal nerve, vagus nerve ", the acronym may be"

The memorizing means may mean a search term selected by a user through a terminal among a plurality of search terms.

The receiving unit 210 may transmit the received server inputs to the preprocessing unit 220 or the control unit 235. For example, the receiving unit 210 may transmit the acronym, female gear, minimum syllable information, and maximum syllable information to the preprocessing unit 220.

The receiving unit 210 may transmit the coined word, the language information, and the category information to the control unit 235.

The receiving unit 210 may transmit the female gear, the sentence information, the open signal, and the stored signal to the grammar generating unit 270. [

The preprocessing unit 220 may receive the acronym, female gear, minimum syllable information, and maximum syllable information from the receiving unit 210.

The preprocessing unit 220 receives the acronyms, and if the amble gears are not received, the preprocessing unit 220 can directly transmit the received acronyms to the combining unit 230.

The preprocessing unit 220 may transmit the modified acronyms to the combinator generation unit 230 except for a plurality of syllables corresponding to the female gears when the acronym and the female gear are input. For example, if the amateur word is "tailed", the receiving unit 210 may transmit an acronym "start" except for the letters "after"

The preprocessing unit 220 can transmit the minimum syllable information and the maximum syllable information to the combined speech generation unit 230 as it is.

The combination word generation unit 230 may receive the acronym, the minimum syllable information, and the maximum syllable information transmitted from the preprocessing unit 220.

The combination word generation unit 230 may generate a plurality of combined words by separating the received double letters into respective syllables and performing a predetermined operation on each of the separated plural syllables. The predetermined operation may be a combination (nCr) operation or a permutation (nPr) operation.

Here, the combination algorithm operation or the permutation algorithm operation is not a mathematical concept, but rather, in order to generate a plurality of combinations, r out of (n combinations) n syllables constituting a double letter, Lt; / RTI >

For example, if the pre-set operation is a permutation algorithm operation and the acronyms are "backward alligators ", the number n of different syllables constituting the acronyms may be determined to be four.

Thus, conceptually r can be a natural number from 1 to 4.

Assuming that the r-value is 1, a plurality of combinations can be generated as "after, hour, day, and minute ".

Assuming that the r value is 2, a plurality of combinations may be generated such as "backward, backward, backward, sigh, start, simile, posterior, simultaneous, homophone, hyphen, mi, mi.

The number of combinations is equal to the value calculated by Equation 1 or Equation 2 according to the values of n and r.

Figure 112015126947065-pat00001

Figure 112015126947065-pat00002

Here, n is a natural number of 1 or more, r is defined as a natural number greater than 0 and less than or equal to n.

If there are no other restrictions (e.g., minimum syllable information or maximum syllable information), combinator generator 230 may generate combinatorials for all defined r values. For example, when n is 4, and maximum syllable information and minimum syllable information are not received, r may be defined as a natural number from 1 to 4, and the combinator generation unit 230 may generate a plurality ≪ / RTI >

The combination word generator 230 may receive the maximum syllable information and the minimum syllable information transmitted from the preprocessing unit 220.

The combination word generating unit 230 may limit the range of the r value based on the maximum syllable information and the minimum syllable information. For example, when the minimum syllable information corresponds to 2 and the maximum syllable information corresponds to 4, the r value may be defined as a natural number of 2 or more and 4 or less. Therefore, the combinator 230 may perform the operation on the basis of the natural number r of 2 or more and 4 or less, and may generate a corresponding plurality of combined words.

The combination word generation unit 230 may transmit the plurality of combined words to the search word detection unit 260.

As described above, the control unit 235 can receive the coined word, language information, and category information from the receiving unit 210. [

When the control unit 235 receives the coined word, the control unit 235 can perform redundancy checking on the coined word. That is, the control unit 235 can check whether or not the new coined word is duplicated by comparing the words stored in the database 240 with the input coined word. If the received coined word is not redundant, the control unit 235 can store the coined word in the database 240. [

When the control unit 235 receives the language information, the control unit 235 can control the search word detection unit 250 to access the area of the database 240 corresponding to the received language information. For example, when the control unit 235 receives the language information corresponding to the English language, the control unit 235 can control the search word detection unit 250 to access the English words stored in the database 240. [

When the control unit 235 receives the category information, the control unit 235 can control the search word detection unit 250 to access the area of the database 240 corresponding to the received category information. For example, when the control unit 235 receives the category information corresponding to the history, the control unit 235 can control the search word detection unit 250 to access words belonging to the history category stored in the database 240. [

The database 240 may store a plurality of words. In particular, the database 240 may store words of various languages to provide dictionary services. For example, words registered in the English, Chinese, Korean, and Japanese dictionaries may be stored in the database 240.

The database 240 may store the received coined word. According to the embodiment, the co-word generated by the user may be stored in the database 240 when the control unit 235 passes the redundancy check.

The database 240 can classify and store words by category.

The search word detection unit 250 can receive a plurality of combination words from the combination word generation unit 230. [ The search word detection unit 250 can access a plurality of words stored in the database 240.

Under the control of the control unit 235, the search word detection unit 250 can access words of a specific language among a plurality of words stored in the database 240, or access words corresponding to specific categories.

According to the embodiment, as shown in FIG. 2, the control unit 235 activates a part of the database 240, so that the search word detection unit 250 can operate as described above

2, the search term detector 250 may receive a control signal from the controller 235 and the search term detector 250 may operate as described above. However, the present invention is not limited thereto It is not.

The search word detection unit 250 may compare words stored in the database 240 with a plurality of combinations obtained from the combination word generation unit 230. [

The search word detection unit 250 detects words identical to the words stored in the database 240 among a plurality of combination words received from the combination word generation unit 230 as a plurality of search words and transmits them to the transmission unit 260 .

The transmission unit 260 may receive and store a plurality of search terms transmitted from the search term detection unit 250. In addition, the transfer unit 260 may receive and store the memorandum sent from the memorandum generating unit 270. [

The transmitting unit 260 may transmit a plurality of stored search terms and a memorizing sentence to the terminal 100.

As described above, the receiving unit 210 can transmit the female gear, the sentence information, the storage signal, and the public signal to the memorizing unit generating unit 270.

The memorandum generator 270 can receive and store the female gear. According to the embodiment of the present invention, a plurality of female gears may be sequentially stored in the memorizing section 210. [

The memorizing statement generating unit 270 may determine whether or not the sentence information is received.

The sentence information may include the order of each of the plurality of female gears or the content of the corresponding links to each of the plurality of female gears.

In the present invention, the sentence information is received from the terminal, but the sentence information may be stored in the database 240, as shown in FIG.

The memorizing statement generating unit 270 can generate a memorizing sentence based on the received sentence information and the plurality of female gears. For example, if the acronym is "tail start" and the plurality of female gears are "backward" and "simultaneous ", memorizing statements can be generated based on the sentence information.

The memorizing statement generating unit 270 can determine whether to store the generated memorizing command based on the received stored signal. For example, the memorizing statement generating section 270 may store the memorizing statement in the database 240 according to the stored signal.

The memorizing statement generating unit 270 can determine whether or not the generated memorizing information is disclosed based on the received public signal. For example, the memorizing statement generating unit 270 may disclose the memorizing statement on the Internet according to a public signal. That is, the memorizing statement generating unit 270 can allow other users to access the memorandum stored in the database 240 via the Internet.

The memorizing statement generating unit 270 may transmit the generated memorizing sentence to the transmitting unit 260.

3 is a flowchart illustrating a method for automatically generating a memorized sentence of a server according to an embodiment of the present invention.

1 to 3, in step S110, the server 200 may receive an upper case letter from the terminal 100 through the communication network 300. [

As noted above, an acronym may mean a set of the earliest letters of a plurality of words or sentences. For example, if the plural words are "olfactory nerve, optic nerve, temporal nerve, vagus nerve ", the acronym may be" However, the present invention is not limited thereto.

In step S120, the server 200 may sequentially receive each of the plurality of female gears based on the initial letters, and receive the sentence information. The server 200 can receive a plurality of female gears until it receives the sentence information by sequentially receiving female gears based on the received double letters. Details related to this are described in Fig.

In step S130, the server 200 may generate a memorizing sentence based on sentence information and a plurality of female gears. The sentence information may include the order of each of the plurality of female gears or the connecting words corresponding to each of the plurality of female gears. In addition, the server 200 can determine whether or not the memorization is stored or released based on the storage signal and the public signal. Details related to this are described in Fig.

4 is a flowchart illustrating in detail step S120 of sequentially receiving each of the plurality of female gears based on the acronyms shown in FIG. 3 and receiving sentence information.

Referring to FIG. 4, in step S210, the server 200 may generate a plurality of combined words based on an initial letter. In detail, the server 200 may perform a predetermined operation on each of a plurality of syllables constituting an acronym. For example, the predetermined operation may include a combination algorithm operation and a permutation algorithm operation. Details related thereto are as described above. The server 200 can generate a plurality of combinations by performing the above operation. The combination may be a phrase in which each syllable contained in an acronym is randomly arranged.

In step S220, the server 200 may compare a plurality of words stored in the database 240 with a plurality of combinations. That is, the server 200 compares each of the plurality of combiners with a plurality of words stored in the database 240 (which may then include the added coined word). Details related to this will be described in Fig.

In step S230, the server 200 may detect a plurality of search terms and transmit them to the terminal 100. [ In detail, the server 200 can select matching combinations based on the comparison result. At this time, the server 200 may detect the selected combination words as a plurality of search words. In addition, the server 200 can transmit a plurality of detected search terms to the terminal.

In step S240, the server 200 may receive the female gear from the terminal 100. [ As a result, the server 200 can sequentially receive each of the plurality of female gears based on the double letters, because the memorized words are repeatedly transmitted from the terminal 100 by the operation to be described later

In step S250, the server 200 may exclude a plurality of syllables corresponding to the arm gears received in the two letters. For example, in the case where the acronym is "backward homemade" and the received memorandum is the back end, the server 200 may exclude a plurality of syllables corresponding to the female gears received in the double letters, .

In step S260, the server 200 can determine whether or not the sentence information has been received from the terminal 100. [ If the sentence information is received (YES in S250), the server 200 can proceed to the next step. If the sentence information is not received (NO in S250), the server 200 may proceed to step S210 of generating a plurality of combined words based on the initial letters.

Accordingly, the server 200 can repeatedly receive each of the plurality of female gears sequentially, until receiving the sentence information.

FIG. 5 is a flowchart detailing a step of comparing a plurality of words with a plurality of combinations shown in FIG. 4. FIG.

Referring to FIG. 5, in step S310, the server 200 may determine whether or not a new word has been received from the terminal 100. FIG.

If the coined word is received (YES in S310), the server 200 proceeds to step S320. If the coined word is not received (NO at S310), the server 200 proceeds to step S340.

In step S320, the server 200 may determine whether or not the received coined word is duplicated. For example, the server 200 may determine whether or not the coined word matches a plurality of words stored in the database 240 to determine whether the coined word is duplicated.

If the new coined word is duplicated (YES in S320), the server 200 proceeds to step S340. If the new coined word does not overlap (NO at S320), the server 200 proceeds to step S330.

In step S330, the server 200 may store the received coined word in the database 240. [ The coined word can be handled similarly to the words stored in the database 240 in the following steps. That is, the coined word stored in the database 240 can be compared with each of a plurality of combinations.

In step S340, the server 200 may determine whether a plurality of words stored in the database 240 match with a plurality of combinations. That is, the server 200 compares each of the plurality of combiners with a plurality of words stored in the database 240 (which may then include the added coined word).

FIG. 6 is a flowchart detailing the steps of generating memorized phrases based on sentence information and a plurality of female gears according to the embodiments of the present invention shown in FIG.

Referring to FIG. 6, in step S410, the server 200 may complete the memorization based on the received sentence information and the plurality of received female gears.

In step S420, the server 200 may determine whether to store the created memorandum in the database 240. [ For example, the server 200 may determine whether to store the query in the database 240 based on the stored signal received from the terminal. However, the present invention is not limited thereto.

If the memorandum is stored in the database 240, the user can read or download the memorized memo even if the user accesses the terminal through different terminals.

If the memorandum is stored in the database 240 (YES in S420), the server 200 may proceed to step S430.

In step S430, the server 200 can determine whether to open the memorized statement. For example, the server 200 can determine whether to disclose the memorized sentence based on a public signal received from the terminal. However, the present invention is not limited thereto.

When a memorizing statement is disclosed, different users can freely read or download the memorandum stored in the database 240.

7 is a data flow diagram illustrating the operation of the server system according to the embodiments of the present invention in detail.

Referring to FIG. 7, the terminal 100 can receive an acronym from a user.

The server 200 may receive an initial letter from the terminal 100 (S210). At this time, the server 200 may receive the minimum syllable information, maximum syllable information, language information, and category information from the terminal 100.

The server 200 may generate a plurality of combinations based on the initials (S220).

The server 200 can generate a plurality of combined words by separating the received double letters into respective syllables and performing a predetermined operation on each of the plurality of separated syllables. The predetermined operation may be a combination (nCr) operation or a permutation (nPr) operation.

Here, the combination algorithm operation or the permutation algorithm operation is not a mathematical concept, but rather, in order to generate a plurality of combinations, r out of (n combinations) n syllables constituting a double letter, Lt; / RTI > The details are as described above.

The server 200 may compare a plurality of words with a plurality of combinations (S220). That is, the server 200 may compare each of the plurality of combiners with a plurality of words stored in the database 240 (which may then include the added coined word). At this time, the server 200 may compare a plurality of words corresponding to the received language information with a plurality of combinations. In addition, the server 200 may compare a plurality of words corresponding to the received category information with a plurality of combinations.

In step S230, the server 200 may detect a plurality of search terms and transmit them to the terminal 100. [ In detail, the server 200 can select matching combinations based on the comparison result. At this time, the server 200 may detect the selected combination words as a plurality of search words. In addition, the server 200 may transmit a plurality of detected search terms to the terminal 100.

The server 200 may transmit a corresponding plurality of search terms to the terminal 100 based on the received maximum syllable information and minimum syllable information. For example, when the maximum syllable information is 6 and the minimum syllable information is 2, the server 200 can transmit a plurality of search words having a syllable number of 2 to 6 to the terminal 100.

The terminal 100 can select one of the received plural search terms as a memorized word according to the input of the user or a predetermined method. For example, the predetermined method may be a method of selecting the longest search term among a plurality of search terms as a memorized term.

The server 200 may receive the female gear from the terminal 100 (S240). As a result, the server 200 can sequentially receive each of the plurality of female gears based on the double letters, because the memorized words are repeatedly transmitted from the terminal 100 by the operation to be described later

The server 200 may exclude a plurality of syllables corresponding to the arm gears received in the double letters (S250). For example, in the case where the acronym is "backward homemade" and the received memorandum is the back end, the server 200 may exclude a plurality of syllables corresponding to the female gears received in the double letters, .

In FIG. 7, the sentence information is inputted to the terminal 100, but the present invention is not limited thereto. For example, the sentence information may be stored in the database 240 in advance.

The server 200 may determine whether or not the sentence information has been received from the terminal 100 (S260). If the sentence information is received (YES in S260), the server 200 can proceed to the next step. If the sentence information is not received (NO in S260), the server 200 may proceed to step S210 of generating a plurality of combined words based on the initial letters.

Accordingly, the server 200 can repeatedly receive each of the plurality of female gears sequentially, until receiving the sentence information.

The server 200 may generate a memorized sentence based on sentence information and a plurality of female gears (S130). At this time, the server 200 can determine whether to store the memorized information and whether or not the memorandum is stored according to the stored signal and the public signal.

1: Server system
100: terminal
200: Server
300: Network
210:
220:
230: Combination word generation unit
235:
240: Database
250:
260:
270:

Claims (13)

1. A server for communicating with a terminal using a communication network, the server including a database,
Receiving an acronym from the terminal;
Sequentially receiving each of the plurality of female gears from the terminal and receiving sentence information based on the initials;
Generating a sentence based on the sentence information and the plurality of female gears,
Wherein the step of sequentially receiving each of the plurality of female gears from the terminal and receiving the sentence information based on the acronym
Generating a plurality of combinations using the predetermined operation based on the initials;
Comparing the plurality of combinations with a plurality of words stored in the database; And
Detecting a plurality of search terms based on the comparison result, and transmitting the plurality of search words to the terminal; And
Receiving a female gear from the terminal,
Wherein the plurality of female gears are search terms selected from the terminal among the plurality of search words.
2. The method of claim 1, wherein generating a plurality of combinations based on the acronym based on the acronym comprises:
Receiving maximum syllable information or minimum syllable information from the terminal; And
And generating a plurality of combinations corresponding to the maximum syllable information and the minimum syllable information based on the maximum syllable information or the minimum syllable information.
3. The method of claim 2, wherein the step of sequentially receiving each of the plurality of female gears from the terminal and receiving the sentence information based on the acronym
Excluding a plurality of syllables corresponding to the female gears in the acronym; And
Further comprising determining whether the sentence information is received from the terminal.
3. The method of claim 2, wherein the comparing the plurality of combinatorial words with a plurality of words stored in the database
Determining whether a coined word is received from the terminal; And
Determining whether a plurality of words stored in the database are overlapped with the coined word when the coined word is received;
5. The method of claim 4, wherein comparing the plurality of combinatorial words to a plurality of words stored in the database
Storing the new coined word in the database if it is not redundant;
Further comprising determining whether or not the plurality of combinations and the plurality of words match with each other,
If the coined word is not received, proceeding to a step of judging whether or not the plurality of cooperating words match the plurality of words,
The method comprising the steps of: determining whether or not the plurality of words match the plurality of words if the words are overlapped;
2. The method according to claim 1, wherein generating the memorized sentence based on the sentence information and the plurality of female gears
Completing the memorizing sentence based on the sentence information and the plurality of female gears;
Determining whether to store the query in the database; And
And determining whether to open the memorized statement to another user.
3. The method of claim 2, wherein the pre-
Figure 112017037999188-pat00010
or
Figure 112017037999188-pat00011
ego,
n is the number of different syllables constituting the acronym, r is a natural number greater than 0 and less than or equal to n,
Wherein the r is determined based on the maximum syllable information and the minimum syllable information.
2. The method according to claim 1, wherein the sentence information includes the order of the plurality of female gears or the content of the connecting words corresponding to each of the plurality of female gears.
2. The method of claim 1, wherein the database stores a dictionary corresponding to each of a plurality of languages, a database corresponding to the language information input from the terminal is activated and operates, The method comprising the steps of:
2. The apparatus according to claim 1, wherein the database classifies and stores a plurality of words according to categories, and the server stores a plurality of words corresponding to the inputted category information according to category information input from the terminal, A method for automatically generating a memorizing statement for a server compared to a word.
delete A program stored in a recording medium for executing a method for automatically generating a program according to any one of claims 1 to 10, the program being coupled to a terminal capable of communicating with a server providing a preliminary service through a communication network.
A computer-readable recording medium having recorded thereon a program for executing the method for automatically generating a memorized statement according to any one of claims 1 to 10.

KR1020150186246A 2015-12-24 2015-12-24 Method Of CREATING A sentence FOR MEMORIZATION, and System there-of KR101798388B1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
KR1020150186246A KR101798388B1 (en) 2015-12-24 2015-12-24 Method Of CREATING A sentence FOR MEMORIZATION, and System there-of

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
KR1020150186246A KR101798388B1 (en) 2015-12-24 2015-12-24 Method Of CREATING A sentence FOR MEMORIZATION, and System there-of

Publications (2)

Publication Number Publication Date
KR20170076226A KR20170076226A (en) 2017-07-04
KR101798388B1 true KR101798388B1 (en) 2017-12-12

Family

ID=59357043

Family Applications (1)

Application Number Title Priority Date Filing Date
KR1020150186246A KR101798388B1 (en) 2015-12-24 2015-12-24 Method Of CREATING A sentence FOR MEMORIZATION, and System there-of

Country Status (1)

Country Link
KR (1) KR101798388B1 (en)

Also Published As

Publication number Publication date
KR20170076226A (en) 2017-07-04

Similar Documents

Publication Publication Date Title
CN110489538B (en) Statement response method and device based on artificial intelligence and electronic equipment
US11403680B2 (en) Method, apparatus for evaluating review, device and storage medium
US11093711B2 (en) Entity-specific conversational artificial intelligence
US9792279B2 (en) Methods and systems for analyzing communication situation based on emotion information
CN111523306A (en) Text error correction method, device and system
TWI613641B (en) Method and system of outputting content of text data to sender voice
JP2021518019A (en) Question answering interaction methods, devices, computer devices and computer readable storage media
CN105183761A (en) Sensitive word replacement method and apparatus
CN109299399B (en) Learning content recommendation method and terminal equipment
US9792909B2 (en) Methods and systems for recommending dialogue sticker based on similar situation detection
CN105229728A (en) The speech recognition of many recognizers
CN105408891A (en) Systems and methods for multi-user multi-lingual communications
US20210303636A1 (en) Systems and methods for automatically determining utterances, entities, and intents based on natural language inputs
CN111428025B (en) Text summarization method and device, electronic equipment and storage medium
CN111310440A (en) Text error correction method, device and system
CN112527967A (en) Text matching method, device, terminal and storage medium
CN110377706B (en) Search sentence mining method and device based on deep learning
CN116701604A (en) Question and answer corpus construction method and device, question and answer method, equipment and medium
KR101798388B1 (en) Method Of CREATING A sentence FOR MEMORIZATION, and System there-of
CN115964997A (en) Confusion option generation method and device for choice questions, electronic equipment and storage medium
KR20160138613A (en) Method for auto interpreting using emoticon and apparatus using the same
CN114896382A (en) Artificial intelligent question-answering model generation method, question-answering method, device and storage medium
KR102069676B1 (en) Electronic apparatus and method for extracting at least one keyword from search terms and computer readable recording medium
CN111428005A (en) Standard question and answer pair determining method and device and electronic equipment
CN114676319B (en) Method and device for acquiring merchant name and readable storage medium

Legal Events

Date Code Title Description
A201 Request for examination
E902 Notification of reason for refusal
E701 Decision to grant or registration of patent right
GRNT Written decision to grant