JP2006350154A - Musical performance practice apparatus and program for musical performance practice processing - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To last beginner's practice desire for a long time by emphasizing that the result of practice is more improved as compared with user's own expectation. <P>SOLUTION: A CPU 1 sorts a plurality of phrases constituting an etude into groups in each same phrase, whether musical performance corresponding to the phrase of each sorted group reaches a reference level or not is judged, and when the musical performance reaches the reference level, all phrases in the group are recognized as passing phrases. Then the ratio of the number of passing phrases to all phrases is evaluated as the achievement degree of the etude. <P>COPYRIGHT: (C)2007,JPO&INPIT

Description

  The present invention relates to a performance practice device and a performance practice processing program, and more particularly to a performance practice device and a performance practice processing program having a function of determining whether or not a practice song is a correct performance.

  Some electronic musical instruments equipped with a keyboard have a function of guiding a performance by providing light emitting elements such as LEDs on the keyboard. This guide function allows a novice user to play a simple melody song. However, when it becomes a somewhat complicated song, it takes time to master the performance. In particular, there is a strong tendency to throw out along the way because the performance is not good at the beginning of the song. That is, simply providing a light emitting element to guide the performance does not necessarily lead to a long-lasting motivation for beginners to practice. A major reason is that it is difficult to obtain performance results that satisfy the user.

On the other hand, note sequences of the same phrase are often repeated even for fairly long songs, so the user can understand the characteristics of the score by displaying a sequence of notes so that the same phrases can be understood together. Several proposals have been made.
The invention of the electronic score analysis program according to a proposal can visually grasp the image of the entire music and can improve the performance performance in a short period of time. The note information having the difference information of the note sequence of the constituent unit specified by and the difference information of the predetermined similarity is extracted, and the attached information that can visually identify the extracted note sequence and the other note sequences is extracted. It is configured to give and display. In this case, for the specified note sequence, the same number of notes and the same difference information “forward” note sequence, and for the specified note sequence, the same number of notes and the difference information The "reverse" note string in which the sign of each value is reversed is displayed in different colors. (See Patent Document 1)
In addition, the invention of the music score that is color-coded for each pattern in other proposals is designed so that keyboard instrument players can understand at a glance, so that they can understand at a glance so that they are easier to read than before, regardless of advanced level. The repetitive patterns are grouped to provide a score that is distinguished from other note groups. (See Patent Document 2)
JP 2003-263154 A JP 2005-031619 A

However, as shown in Patent Document 1, in order to visually grasp the image of the entire music, for example, in the score of Bach's inventory displayed on the display as shown in FIG. It is extremely difficult to specify a note string of a constituent unit, and an effect that lasts a beginner's willingness to practice cannot be obtained. Further, as described in Patent Document 2, simply displaying the repeated pattern of notes as a group does not provide an effect that lasts the beginner's willingness to practice.
The present invention is for solving such a conventional problem, and the user himself thinks based on the fact that even if a song is quite long, the same string of notes is often repeated. The aim is to make beginners' willingness to practice last longer by clearly showing that the results of practice have improved.

  The performance practice device according to claim 1 includes phrase classification means (corresponding to the function of the CPU 1 in FIG. 1 in the embodiment) that classifies a plurality of phrases constituting the practice music into groups for each identical phrase; It is determined whether or not the performance for each group of phrases classified by the group classification means has reached a reference level, and when the reference level is reached, performance determination means for setting all phrases of the group as acceptable phrases ( In the embodiment, it corresponds to the function of the CPU 1 in FIG. 1) and a practice evaluation in which the ratio between the number of pass phrases determined by the performance determination means and the number of all phrases of the practice music is evaluated as the achievement level of the practice music. Means (corresponding to the function of the CPU 1 in FIG. 1 in the embodiment).

  In the performance practice apparatus according to claim 1, as described in claim 2, performance guide means for guiding the performance of each group classified by the phrase classification means in descending order of the number of phrases (in the embodiment, the CPU 1 in FIG. 1). (Corresponding to the above function) may be further provided.

  In the performance practice device according to claim 1, as described in claim 3, it is searched whether or not the same phrase as the pass phrase of the practice music that has already been performed exists in another practice music, and the same If there is a phrase, a phrase search means (in the embodiment, corresponding to the function of the CPU 1 in FIG. 1) that uses the same phrase in the other practice music as a pass phrase may be provided. .

  In the performance practice apparatus according to claim 1, as described in claim 4, when an arbitrary practice song is selected and a pass phrase is present in the practice song, predetermined display means (embodiment) (Corresponding to the display unit 6 in FIG. 1), the display control means (implemented by color-coded in the embodiment) highlights and displays the notes of the pass phrase when the notes of the practice song are displayed. In the embodiment, the configuration may further include (corresponding to the function of the CPU 1 in FIG. 1).

  The performance practice processing program according to claim 5 includes a step A for classifying a plurality of phrases constituting the practice music into groups for each identical phrase, and a performance for each group of phrases classified in step A is a reference level. Step B with all phrases in the group as a pass phrase when the reference level is reached, and the number of pass phrases determined in Step B and all phrases in the practice song Step C which evaluates the ratio with the number as the achievement degree of the practice music is configured to be executed by a computer.

  In the performance practice processing program according to claim 5, as described in claim 6, each group classified by step A may further include a step D for guiding the performance in the descending order of the number of phrases. .

  In the performance practice processing program according to claim 5, as described in claim 7, a search is made as to whether or not another practice song has the same phrase as the pass phrase of the practice song that has already been played, In the case where the same phrase is present, it may be configured to further include step E in which the same phrase in the other practice music is regarded as a pass phrase.

  In the performance practice processing program according to claim 5, as described in claim 8, when an arbitrary practice song is selected and a passing phrase is present in the practice song, predetermined display means ( In the embodiment, when displaying the notes of the practice tune on the display section 6 (corresponding to the display unit 6 in FIG. 1), the step F of emphasizing and displaying the notes of the pass phrase (in the embodiment, color-coded) is performed. Furthermore, you may make it the structure which has.

  According to the performance practice device and the performance practice processing program of the present invention, it is possible to obtain the effect of prolonging the motivation of beginners by emphasizing that the results of practice are improved more than the user thinks. It is done.

Hereinafter, an embodiment of a performance practice device according to the present invention will be described with reference to the drawings, taking a performance system for playing a keyboard as an example.
FIG. 1 is a block diagram showing a configuration of a performance system in the embodiment. The CPU 1 is connected to a ROM 3, a RAM 4, an operation unit 5, a display unit 6, a MIDI I / F (interface) 7 and a music memory 8 via a system bus 2, and exchanges commands and data with these units. To control this system. An electronic musical instrument 9 such as a keyboard device is connected to the MIDI I / F 7.

  The ROM 3 stores in advance a performance practice processing program executed by the CPU 1 and other control programs, and initial data at initialization when the power switch is turned on. The RAM 4 is a work area for the CPU 1 and includes areas for registers, flags, and pointers (variables) for storing data to be processed by the CPU 1 in addition to the music data of practice songs. The operation unit 5 includes a group of switches such as a mode switch, a song selection switch, a start switch, a stop switch, an achievement rate switch, and a tone color setting switch, and inputs a corresponding command to the CPU 1 according to the operation of each switch. The display unit 6 displays a practice song selection screen, a practice song title and a score screen in accordance with the display control of the CPU 1. The MIDI I / F 7 inputs performance data corresponding to the performance of the electronic musical instrument 9 to the system bus 2 and inputs music data received by the electronic musical instrument 9 from an external MIDI device to the system bus 2. The song memory 8 stores a plurality of song data for performance practice input to the system bus 2 by the electronic musical instrument 9. Although not shown in the figure, the keyboard of the electronic musical instrument 9 is provided with an LED (light emitting diode) for guiding the performance of the practice music, and the practice music read from the music memory 8 to the RAM 4 is selected. In this case, the LED of the key to be pressed is turned on according to the performance guide process of the CPU 1.

  FIG. 2 is a diagram showing an area of the RAM 4 in which edit data for a plurality of song data read from the song memory 8 is stored. The edit data is composed of music data d1 read from the music memory 8 and color data d2 read from the ROM 3. Each piece of music data d1 includes the data body and phrase data composed of phrases (0) to (n), and an array of counter registers COUNT (0) to COUNT (M) and an order register by editing processing described later. Are composed of JUNI (0) to JUNI (L). Each phrase () is composed of a NO indicating the phrase classification number, a start address (start) and an end address (end) of the phrase, and a flag OK indicating the performance result. The color data d2 includes color [0] to color [L] of different colors for displaying a score.

Next, the operation of the electronic keyboard instrument of FIG. 1 will be described with reference to the flowcharts of the CPU 1 shown in FIGS.
FIG. 3 is a flowchart of the main routine of the CPU 1. First, after predetermined initialization (step SA1), it is determined whether the mode is a performance mode or an edit mode (step SA2). In the editing mode, editing processing is executed (step SA3), and in the performance mode, performance processing is executed (step SA4). After the editing process or performance process, it is determined whether or not a mode change operation has been performed by the operation unit 6 (step S5). When the mode change operation has been performed, a mode change process is performed (step SA6). After the mode change process or when the mode change operation is not performed, the process proceeds to step SA2 to determine the mode.

FIG. 4 is a flowchart of the editing process in step SA3 in the main routine of FIG. In the editing process, a music selection process (step SB1), a performance order setting process (step SB2), a display process (step SB3), an achievement rate generation process (step SB4), and an erasure process (step SB5) are performed, and the main routine is executed. Return.
FIG. 5 is a flowchart of the performance order setting process in step SB1 in the editing process. It is determined whether or not the song selection switch is turned on (step SC1). When this switch is turned on, a song selection screen is displayed on the display unit 6 (step SC2). That is, a list of a plurality of song names read from the song memory 8 to the RAM 4 is displayed. Next, it is determined whether or not a song selection operation has been performed from the operation unit 5 (step SC3). When a song selection operation is performed, the address of the selected song is designated (step SC4), and the score of the song is displayed (step SC5). Then, the process returns to the editing process flowchart of FIG.

FIG. 6 is a flowchart of the performance order setting process in step SB2 in the editing process. It is determined whether or not the performance order setting switch is turned on (step SD1). When this switch is turned on, grouping processing (step SD2) and order setting processing (step SD3) are performed.
FIG. 7 is a flowchart of the grouping process in step SD2. First, the pointer n designating the phrase of the selected music is cleared to 0, and the register N designating the phrase group is cleared to 0 (step SE1). Then, while incrementing the value of n, search for a phrase that has not been grouped. It is determined whether or not the value of n is less than or equal to the number of phrases (step SE2). If the value of n is less than or equal to the total number of phrases, that is, if there are phrases that are not grouped, phrase [n] [NO] is determined to be NULL (unprocessed) (step SE3). If [NO] of phrase [n] is not NULL and a numerical value is set, the value of n is incremented (step SE4), and the process proceeds to step SE2.

  When the phrase [n] [NO] is NULL, a numerical value of N is set to [NO] of the phrase [n] (step SE5). Next, a value of (n + 1) is set in the variable m (step SE6). And it is discriminate | determined whether the value of m is below a phrase total number (step SE7). If the value of m is equal to or less than the total number of phrases, it is determined whether [NO] of the phrase [m] is NULL (step SE10). When [NO] of the phrase [m] is NULL, it is determined whether or not the phrase [n] and the phrase [m] are the same (step SE11). When the phrase [n] and the phrase [m] are the same, the value of N is set to [NO] of the phrase [m] (step SE12).

If [NO] of phrase [m] is not NULL in step SE10, if phrase [n] and phrase [m] are different in step SE11, or if [NO] of phrase [m] is different in step SE12 Is set, m is incremented (step SE13). In step SE7, it is determined whether or not the value of m is equal to or less than the total number of phrases. If the value of m is larger than the total number of phrases, N is incremented (step SE8), n is incremented (step SE9), and the process proceeds to step SE2. In step SE2, when the value of n is larger than the total number of phrases, grouping of all phrases is completed, and the process returns to the flowchart of FIG.
For example, if there are five other phrases that are the same as the phrase [0], the values of [NO] of these six phrases are all zero.

  8 and 9 are flowcharts of the order setting process in step SD3 in the flowchart of FIG. 8, all COUNT [] are cleared to 0 (step SF1) and all JUNI [] are set to NULL (empty) in the register of the RAM 4 shown in FIG. 2 (step SF2). Next, after setting the value of the pointer n designating the phrase to 0 (step SF3), the number of phrases in each group is totaled by the loop processing from step SF4 to step SF7 while incrementing the value of n. It is determined whether or not the value of n is equal to or less than the total number of phrases (step SF4). If the value of n is equal to or less than the total number of phrases and the aggregation is not completed, the value of [NO] of phrase [n] is determined. Store in the register N (step SF5). Then, COUNT [N] is incremented (step SF6). Next, n is incremented (step SF7), the process proceeds to step SF4, and the loop process is repeated.

  When the value of n is larger than the total number of phrases in step SF4, that is, when the summation of the number of phrases is completed for all groups, the value of the pointer n for designating the phrase is set to 0 in FIG. 9 (step SF8) , N is incremented, and the number of phrases as a total result of each phrase group is searched by the loop processing from step SF9 to step SF17. It is determined whether or not the value of n is less than or equal to the total number of phrases (step SF9). If the value of n is less than or equal to the total number of phrases, variable m is set to 1 (step SF10), and phrase [n] 1 (the highest order) is stored in the register I for designating the order (step SF11). The lower the value of I, the higher the ranking.

  Next, while incrementing I and m, the loop processing from step SF12 to step SF15 is executed to determine the rank of each group. It is determined whether or not the value of (m + n) is less than or equal to the total number of phrases (step SF12). If the value of (m + n) is less than or equal to the total number of phrases, COUNT [n], which is the number of phrases of phrase [n] Is less than COUNT [m + n], which is the number of phrases [n + m] (step SF13). If COUNT [n] is less than COUNT [m + n], the value of I is incremented to lower the rank of phrase [n] by one (step SF14). After incrementing I, or if COUNT [n] is less than or equal to COUNT [m + n] in step SF13, m is incremented (step SF15). And it transfers to step SF12 and repeats a loop process.

  In step SF12, when the value of (m + n) becomes larger than the total number of phrases, the rank of the currently designated phrase [n] is fixed. Therefore, the value of the register I is stored in JUNI [n] (step SF16). Then, n is incremented to specify the next phrase (step SF17), the process proceeds to step SF9, and the loop process is repeated. When the value of n becomes larger than the total number of phrases in step SF9, that is, when the ranks of all groups are determined, the process returns to the flowchart of FIG.

  FIG. 10 is a flowchart of the display process. The musical score of the music data is displayed (step SG1), and the pointer n for designating the phrase is set to 0 (step SG2). Then, while incrementing the value of n, the loop processing from step SG3 to step SG7 is executed, and the grouped phrases are color-coded. In the loop processing, [NO] of phrase [n] is stored in register N (step SG3), and the rank of JUNI [N] corresponding to the value of N is stored in register I (step SG4). Next, the phrase [n] is colored into color [I] (step SG5), and n is incremented (step SG6). At this time, it is determined whether or not the value of n is larger than the number of phrases, that is, whether or not coloring has been completed for all phrases (step SG7). If the value of n is less than or equal to the number of phrases, the process proceeds to step SG3 and the loop process is repeated. If the value of n becomes larger than the number of phrases, the flag DISPF is set to 1 (step SG8), and the process returns to the editing process flowchart of FIG.

  FIG. 11 is a flowchart of the achievement rate generation process of step SB4 in the editing process. First, it is determined whether or not DISPF is 1 (step SH1), and when DISPF is 1 and each score phrase is colored, it is determined whether or not the achievement rate switch is turned on (step S1). SH2). When this switch is turned on, both the pointer n specifying the phrase and the variable m indicating the achievement rate are cleared to 0 (step SH3), and the loop processing from step SH4 to step SH7 is performed while incrementing n and m. Execute. In the loop processing, it is determined whether or not the flag [OK] of the phrase [n] is 1 (step SH4). If [OK] is 1, that is, if the performance of the phrase has reached the reference level, m is incremented (step SH5). After this, or when [OK] is 0 and the reference level has not yet been reached, n is incremented (step SH6). At this time, it is determined whether or not the value of n is larger than the number of phrases, that is, whether or not the value of [OK] is determined for all phrases (step SH7). If the value of n is less than or equal to the number of phrases, the process proceeds to step SH4 and loop processing is repeated. When the value of n becomes larger than the number of phrases, [m / n]% is displayed for a certain period of time (step SH8), and the process returns to the editing process flowchart of FIG. Further, in this case, if the phrase that has reached the reference level is displayed in blue, for example, the achievement rate can be easily grasped.

  FIG. 12 is a flowchart of the erasing process in step SB5 in the editing process. First, it is determined whether or not DISPF is 1 (step SJ1). If DISPF is 1 and a score is displayed, it is determined whether or not the erase switch is turned on (step SJ2). When this switch is turned on, the score display is erased (step SJ3), and DISPF is reset to 0 (step SJ4). Then, the process returns to the main routine of FIG.

FIG. 13 is a flowchart of the performance process of step SA4 in the main routine. In this process, a start switch process (step SK1), a guide process (step SK2), a performance process (step SK3), and a stop switch process (step SK4) are executed.
FIG. 14 is a flowchart of the start switch process in step SK1 in the performance process. It is determined whether or not the start switch is turned on (step SL1). When this switch is turned on, the flag STF is set to 1 (step SL2), and the variable n indicating the priority of performance is set to 1 (1st place). (Step SL3), and a pointer m designating the group number of the rank register JUNI is set to 0 (step SL4). Then, the performance start address and performance end address are set in order from the group with the highest performance priority while incrementing m.

  It is determined whether or not the rank indicated by JUNI [m] is n (step SL5). Therefore, first, it is determined whether or not the rank indicated by JUNI [0] is 1. If the order indicated by JUNI [m] is not n, m is incremented (step SL6). And it is discriminate | determined whether m became larger than the number of data (step SL7). If m is larger than the number of data, the STF is reset to 0 (step SL8), and the process returns to the performance process of FIG. In this case, an error may be displayed because the data that should be originally cannot be found for some reason.

  In step SL7, if m is less than or equal to the number of data, it is determined in step SL5 whether the order indicated by JUNI [m] is n. That is, the group of number m corresponding to the rank n is searched for in the loop processing from step SL5 to step SL7. If the rank of JUNI [m] is n in step SL5, the pointer k designating the phrase is set to the initial value 0 (step SL9), and is classified into the group of number m while incrementing k. Search for a phrase. That is, it is determined whether or not [NO] of phrase [k] is m (step SL10). If [NO] of phrase [k] is not m, k is incremented (step SL11). The process proceeds to step SL10.

  In step SL10, when [NO] of phrase [k] is m, it is determined whether [OK] of phrase [k] is 0 (step SL12). When [OK] of phrase [k] is 1, since the performance of the phrase of group number m has reached the reference level, n is incremented and the next order is designated (step SL13). If [OK] of phrase [k] is 0 in step SL12, [start] of phrase [k] is set in register START (step SL14), and [end] of phrase [k] is set in register END. Set (step SL15). Next, data is read using START as an address (step SL16), and the content of the read data is determined (step SL17). If the data is an event, event processing is performed (step SL18), and the address is advanced (step SL19). If the data is time, the time is stored in T (step SL20), MISS is cleared to 0 (step SL21), and the process returns to the performance process of FIG.

  15 to 17 are flowcharts of the guide process in step SK2 in the performance process. In FIG. 15, it is determined whether or not STF is 1 (step SM1). If STF is 1, it is determined whether or not the minimum unit time, which is a reference for elapse of time, has elapsed (step SM2). . When the minimum unit time has elapsed, the value of the register T is decremented (step SM3). Then, it is determined whether or not the value of T has reached 0 (step SM4). When STF is 0, when the minimum unit time has not elapsed, or when the value of T has not reached 0, the process returns to the performance processing of FIG. 13, but when the value of T has reached 0, the address (Step SM5).

  Next, it is determined whether or not the advanced address has passed END (step SM6). If the address has passed END, it is determined whether or not the performance error value in the register MISS is equal to or greater than a predetermined value α (step SM7). When the MISS value is smaller than the predetermined value, that is, when the performance of the guided phrase has reached the reference level, the pointer a designating the phrase is cleared to 0 (step SM8), and the phrase [a] It is determined whether or not [NO] is m (step SM9). When [NO] of phrase [a] is m, that is, when phrase [a] is a phrase belonging to the group of number m, [OK] of phrase [k] is set to 1 (step SM10). ). After setting [OK] to 1 or when [NO] of phrase [a] is not m in step SM9, a is incremented to designate the next phrase (step SM11). At this time, it is determined whether or not the value of a exceeds the number of data (step SM12). When the value of a is equal to or less than the number of data, the process proceeds to step SM9, where it is determined whether or not [NO] of the phrase [a] is m. Then, the loop processing from step SM9 to step SM12 is repeated until the value of a exceeds the number of data, and [OK] of all phrases belonging to the group of number m is set to 1.

  In step SM7, if the performance miss value of MISS is greater than or equal to the predetermined value α, MISS is cleared to 0 (step SM14), and the start of the played phrase is set to the address again (step SM15). That is, in order to guide the practice of the same phrase, data is read from the address (step SM16), and the read data is determined (step SM17). If the data is an event, event processing is performed (step SM18), and the process proceeds to step SM5 to advance the address. If the data is time, the time is set in the register T (step SM19), and the process returns to the performance process of FIG.

In step SM12, when the value of a exceeds the number of data, n is incremented (step SM13), and in step SM20 of the flowchart of FIG. 16, whether there is song data different from the current performance song. Is determined. As another piece of music data, not only another piece of music data in the RAM 4 as shown in FIG. 2 but also another piece of music data stored in the piece memory 8 may be included. If there is another song data, the song data is specified (step SM21), the pointer b specifying the phrase of the song data is set to 0 (step SM22), A loop process from SM23 to step SM26 is executed.
In this loop processing, it is determined whether or not the phrase [b] of another song is the same as the phrase [k] of the performance song (step SM23). [OK] of b] is set to 1 (step SM24). After [OK] is set to 1 or if the phrase [b] of another song is different from the phrase [k] of the performance song in step SM23, b is incremented (step SM25). At this time, it is determined whether or not the value of b exceeds the number of phrases of another song (step SM26). If the value of b is equal to or less than the number of phrases of another song, the process proceeds to step SM23 and loops. Repeat the process.

  When the value of b exceeds the number of phrases of another song, another song is searched (step SM27). Then, the process proceeds to step 20 to determine whether there is another song data. If there is another piece of music data, the processing from step SM21 to step SM27 is repeated. If there is no other music data in step 20, m is set to 0 in step SM28 of FIG. Then, it is determined whether or not the rank indicated by JUNI [m] is n (step SM29). If the order indicated by JUNI [m] is not n, m is incremented (step SM30). Then, it is determined whether m is larger than the number of data (step SM31). If m is larger than the number of data, the STF is reset to 0 (step SM32), and the process returns to the performance process of FIG. In this case, an error may be displayed because the data that should be originally cannot be found for some reason.

  In step SM31, if m is less than or equal to the number of data, it is determined in step SM29 whether the order indicated by JUNI [m] is n. That is, in the loop process from step SM29 to step SM31, the group of number m corresponding to the rank n is searched. If the rank of JUNI [m] is n in step SM29, the pointer k for designating the phrase is set to the initial value 0 (step SM33), and the number m is classified while incrementing k. Search for a phrase. That is, it is determined whether or not [NO] of the phrase [k] is m (step SM34). If [NO] of the phrase [k] is not m, k is incremented (step SM35). Control goes to step SM34.

  In step SM34, when [NO] of phrase [k] is m, it is determined whether [OK] of phrase [k] is 0 (step SM36). When [OK] of phrase [k] is 1, since the performance of the phrase of group number m has reached the reference level, n is incremented to designate the next order (step SM37). If [OK] of phrase [k] is 0 in step SM36, [start] of phrase [k] is set in register START (step SM38), and [end] of phrase [k] is set in register END. Set (step SM39). Next, MISS is cleared to 0 (step SM40), the process proceeds to step SM16 in FIG. 15, and data is read by address.

  FIG. 18 is a flowchart of the performance process of step SK3 of FIG. It is determined whether or not there is a performance input (step SN1). If there is an input, an event is created (step SN2), and event processing is performed to send the created event to the sound source, that is, the electronic musical instrument 9 (step SN3). ). Next, it is determined whether or not the STF is 1 (step SN4). If the STF is 0, the process returns to the flowchart of FIG. It is determined whether the event is the same (step SN5). If these two events are the same, the correct performance according to the guide has been performed, and the flow returns to the flowchart of FIG. However, if the two events are different, the performance is incorrect, the MISS value is incremented (step SN6), and the process returns to the flowchart of FIG.

  FIG. 19 is a flowchart of the stop process in step SK4 of the flowchart of FIG. It is determined whether or not the stop switch is turned on (step SP1). When this switch is turned on, the STF is reset to 0 (step SP2) so that all the sound sources are muted to the electronic musical instrument 9. All note-off processing is performed (step SP3). Then, the process returns to the main routine of FIG.

As described above, according to this embodiment, a plurality of phrases constituting a practice song are grouped into groups for each identical phrase, and it is determined whether or not the performance for each grouped phrase has reached a reference level. When the reference level is reached, all phrases in the group are accepted. Then, the ratio between the number of accepted phrases and the number of all phrases in the practice song is evaluated as the achievement level of the practice song.
Therefore, by emphasizing that the result of practice is improved more than the user thinks, it is possible to continue the motivation for beginners to practice.

In this case, performance is guided through the sorted groups in descending order of the number of phrases.
Therefore, the number of phrases that have reached the reference level increases as the initial stage increases, and the motivation of beginners can be further prolonged by increasing the sense of achievement of the user.
Also, it is searched whether the same phrase as the passing phrase of the practice song that has already been performed exists in another practice song. If the same phrase exists in another practice song, The same phrase in the song is regarded as a pass phrase.
Therefore, even when other practice music is played for the first time, the user's willingness to practice can be stimulated by making the user recognize the existence of a pass phrase that has already reached the reference level before performance.
Furthermore, when an arbitrary practice song is selected and there is a pass phrase in the practice song, when the note of the practice song is displayed on the display unit 6, the note of the pass phrase is specified. Display with color highlighting.
Also in this case, the user's willingness to practice can be aroused by making the user recognize the presence of the pass phrase before the performance.

  In the above-described embodiment, the invention of the apparatus in which the CPU 1 executes the performance practice processing program stored in advance in the ROM 3 has been described. However, it is recorded on a storage medium such as a flexible disk (FD), CD, or MD. It is also possible to install a performance practice processing program in a non-volatile memory such as a flash ROM, or install a performance practice processing program downloaded from a network such as the Internet in a non-volatile memory and execute the program by the CPU. is there. In this case, the invention of the program and the invention of the recording medium on which the program is recorded can be realized.

That is, the performance practice processing program according to the present invention is:
Step A for classifying a plurality of phrases constituting the practice song into groups for each same phrase, and determining whether or not the performance for each group of phrases classified in Step A has reached a reference level, When the reference level is reached, step B, which uses all phrases in the group as pass phrases, and the ratio between the number of pass phrases determined in step B and the number of all phrases in the practice songs achieve the practice song. Step C evaluated as a degree is executed by the computer.

The method further comprises step D for guiding the performance of each group classified in step A in descending order of the number of phrases.
Search for whether or not the same phrase as the pass phrase of the practice song that has already been performed exists in another practice song. If the same phrase exists, the same phrase in the other practice song is searched. It further has Step E which makes it a pass phrase.
If any practice song is selected and there is a pass phrase in the practice song, when the note of the practice song is displayed on the predetermined display means, the note of the pass phrase is highlighted. Step F is further included.

The block diagram which shows the structure of the performance system in embodiment. The figure which shows the area of RAM which memorize | stores the edit data with respect to practice music. The flowchart of the main routine of CPU in FIG. The flowchart of the edit process in the main routine of FIG. The flowchart of the music selection process in the edit process of FIG. The flowchart of the performance order setting process in the edit process of FIG. The flowchart of the grouping process in the performance order setting process of FIG. The flowchart of the order setting process in the performance order setting process of FIG. The flowchart of the order setting process following FIG. 5 is a flowchart of display processing in the editing processing of FIG. The flowchart of the achievement rate generation process in the edit process of FIG. 5 is a flowchart of an erasing process in the editing process of FIG. The flowchart of the performance process in the main routine of FIG. The flowchart of the start switch process in the performance process of FIG. 14 is a flowchart of guide processing in the performance processing of FIG. The flowchart of the guide process following FIG. The flowchart of the guide process following FIG. 14 is a flowchart of performance processing in FIG. The flowchart of the stop switch process in the performance process of FIG.

Explanation of symbols

1 CPU
2 System bus 3 ROM
4 RAM
5 Switch section 6 Display section 7 MIDI interface 8 Song memory 9 Electronic musical instrument

Claims (8)

Phrase classifying means for classifying a plurality of phrases constituting a practice song into groups for each identical phrase;
It is determined whether or not the performance for each group of phrases classified by the group classification means has reached a reference level, and when the reference level is reached, performance determination means that uses all the phrases of the group as a pass phrase. When,
Practice evaluation means for evaluating the ratio of the number of accepted phrases determined by the performance determination means and the number of all phrases of the practice music as an achievement level of the practice music;
A performance practice device with   The performance practice device according to claim 1, further comprising performance guide means for guiding the performance of each group classified by the phrase classification means in descending order of the number of phrases.   Search for whether or not the same phrase as the pass phrase of the practice song that has already been performed exists in another practice song. If the same phrase exists, the same phrase in the other practice song is searched. The performance practice device according to claim 1, further comprising phrase search means for making a pass phrase.   If any practice song is selected and there is a pass phrase in the practice song, when the note of the practice song is displayed on the predetermined display means, the note of the pass phrase is highlighted. The performance practice device according to claim 1, further comprising display control means for performing the operation. Step A for classifying a plurality of phrases constituting the practice song into groups for the same phrases;
Determining whether or not the performance for each group of phrases classified in the step A has reached a reference level, and when reaching the reference level, all the phrases in the group are set as pass phrases;
Step C for evaluating the ratio of the number of accepted phrases determined in Step B and the number of all phrases of the practice song as the achievement level of the practice song;
A performance practice program that causes a computer to execute.   6. The performance practice processing program according to claim 5, further comprising a step D for guiding performance of each group classified in the step A in descending order of the number of phrases.   Search for whether or not the same phrase as the pass phrase of the practice song that has already been performed exists in another practice song. If the same phrase exists, the same phrase in the other practice song is searched. The performance practice processing program according to claim 1, further comprising step E as a pass phrase.   If any practice song is selected and there is a pass phrase in the practice song, when the note of the practice song is displayed on the predetermined display means, the note of the pass phrase is highlighted. 6. The performance practice processing program according to claim 5, further comprising a step F for performing the performance practice.

Images