JPH07111636B2 - Automatic code addition device - Google Patents

Description

Description: TECHNICAL FIELD OF THE INVENTION The present invention relates to an automatic chord adding device capable of automatically adding a chord to a given melody.

[Prior Art] An automatic code adding device for automatically adding a code to a given melody is already known.

For example, the automatic code adding device disclosed in JP-A-58-87593 determines a code as follows.

(B) For 12 tones, calculate Σ (note scale × note value) -Σ (note outside note × note value),
Adopt the maximum tone.

(B) The final note of the melody is used to determine whether the key is a major key or a minor key (note that (a) does not distinguish parallel key, for example, c major and a minor key).

(C) Select seven chords (diatonic chords) from the keys determined in (A) and (B) above (for example, in C major, Cmaj, Dmin, Emin, Fmaj, Gmaj, Am
Select in, Bdim).

(D) For each block (measure), the compatibility (similarity) between the constituent notes of each of the seven chords and the pitch of the melody is calculated.

(E) The fitness is multiplied by the priority according to the chord priority table (transition frequency of two adjacent chords).

(F) Of the seven types of codes, the code that maximizes the evaluation value = the goodness of fit × the priority is determined.

The applicant of the present application also discloses an automatic code adding device in Japanese Patent Laid-Open No. 58-114097. This automatic code adding device adds a code as follows.

(A) Tonality is determined by the final tone.

(B) The dominant sound (tongue) is determined by the melody in the block (measure).

(C) The chord is determined by referring to the table based on the tonic and the previous chord.

However, in each of the conventional examples, there is an implicit limiting condition for the melody that is input (the melody must be input until the end of the song. Do not transpose in the middle of the song).
In addition, since there is only one chord progression as an output, other prominent chord progressions are discarded.

[Object of the Invention] Accordingly, an object of the present invention is to provide a melody based on a more musical basis without limiting conditions such as the length of a melody to be input and the presence or absence of modulation, and without discarding chords that can be added. In particular, it is to provide an automatic chord adding device for adding a chord suitable for a melody of tonal music.

[Configuration of the Invention] In order to achieve the above object, the present invention relates to a relation between a generating unit that generates an available note scale from a given chord candidate and a generated melody note and a given melody. By determining whether or not the chord candidate can be added to the melody (first configuration).

According to another aspect of the present invention, in addition to the above configuration, by applying knowledge for classifying nonharmonic sounds to a melody and chord candidates to classify nonharmonic sounds included in a melody, chord candidates can be obtained. Inspection means is provided to inspect whether or not the melody can be added. In this case, the chord candidates that have passed the inspections of both the determining means and the inspecting means are determined to be chords that can be added to the melody (second configuration).

[Operation of the Invention] According to the first configuration, when the chord candidate is given, the generating unit generates the available note scale corresponding to the chord candidate. The generated available note scale is compared with the melody by the determining means, the relationship between them (the relationship between the melody constituent sound and the available note scale constituent sound) is determined, and the chord candidate is the melody according to this determination. It is determined whether or not it can be added to. Since the available note scale (particularly the diatonic type) is closely related to the tonality, the automatic chord adding device of the present invention is particularly effective for coding the melody of tonality music. Further, in the present invention, since the key (key) for the melody is not specified in determining the chord to be added, erroneous chording based on erroneous key decision can be avoided, and therefore the length of the melody to be chorded is not limited. However, it can handle melody including modulation.

On the other hand, in the second configuration, means is provided for classifying the non-harmonic tones of the melody based on the chord candidate and the melody information. This means has the knowledge to classify non-harmonic sounds, considers the melody sounds that are the same as the constituent sounds of the given chord candidate to be harmony sounds, and analyzes the character of the remaining melody sounds (type of non-harmonic sounds). . This non-harmonic classification is done without considering scale. As a result, the chord candidates that the checking means can use represent a wide range of associations with the melody. On the other hand, the deciding means acts so as to narrow down the wide association of the checking means from the aspect of scale (scale) related to tonality.

[Embodiment] An embodiment of the present invention will be described below with reference to the drawings.

<Overall Configuration> FIG. 1 shows the overall configuration of the automatic code adding apparatus according to the present embodiment. Reference numeral 1 is a CPU, which performs overall control for code addition. The work memory 2 is used to temporarily store code data and the like. The input device 3 is used for inputting melody data and the like. As the melody input device, for example, a keyboard (real time input) can be used. Monitor 4
Is composed of CRT, tone forming circuit, sound system, etc., and displays and outputs melody and chord (accompaniment).
The melody data input from the input device 3 is stored in the melody data memory 5. In the production rule data memory 6, data expressing musical knowledge for classifying non-harmonic sounds included in a melody (production rule when a chord candidate and melody characteristics (pitch progression, position of harmonic sound, etc.) are given. ) Is stored. The chord component sound memory 7 stores chord component sound data of each chord type.

The automatic chord adding device of this embodiment processes a melody for each section (measure) and determines a code for the melody of each measure. Three means are used in the present embodiment for code determination. The first is determination of whether or not a chord is possible by matching a chord constituent sound and a melody, the second is chord determination by classification of non-harmonic tones, and the third is chord determination by a scale (available note scale). A code that passes the three judgments can be finally added. The first means does not depend on the production rule data and determines that the chord cannot be added to a melody having a low degree of coincidence with the chord-constituting sound. The second means (chord determination by classification of non-harmonic tones) derives the characteristic of the melody tone sequence by using the constituent note information of the given chord candidates, and the knowledge of the production rule data memory 6 based on this characteristic. Is applied to infer what kind of character each sound of the melody is. When the assumptions of chord candidates are correct, the character of all the notes in the melody is known. However, when the assumption of the code candidate is incorrect,
Sounds that cannot be classified in the melody (illegal sounds) are detected. Therefore, when the inference result includes an illegal sound, the assumed chord candidate is excluded from the chords that can be added to the melody. The third means generates an available note scale from the chord candidates. At that time, the three major functions of the code (tonic, dominant, subdominant)
Consider the possibility of. For example, when the available note scale is the diatonic scale, the diatonic scale with the root note of the chord candidate as the tonic, the diatonic scale with the root note of the chord candidate as the dominant sound, and the root note of the chord candidate Generates a diatonic scale as a subdominant sound. Then, by matching these available note scales with the melody constituent sounds, it is checked whether or not the melody is composed of the sounds of the available note scales. The chord candidates are determined as chords that can be added to the melody only when the relationship that the melody constituent notes are a subset of the available note scale is established.

<Overall Operation> FIG. 2 shows the general flow of this embodiment.

First, in 2-1 the CPU 1 reads the melody data from the melody data memory 5 into the work memory 2. In 2-2, the production rule data is read from the production rule data memory 6. Next, the resolution (BEAT) is determined (2-3). This processing is executed by the user directly inputting it, or when the melody input is performed in synchronization with the rhythm, it is determined from the selection information of the rhythm used for the melody input. BEAT has a value in which the length of one bar is expressed by the number of shortest notes. Next, in the initial setting 2-4, the number of melody sections (bars) is set, and the bar counter bar for bars is initialized to 1. This is because, in this example, chords are added to the melody for each measure. The information (where MDNO is the total number of notes in the melody and MRi is the length of the i-th note) is used as the ending condition of 2-10. Next, in 2-5, the melody in the section indicated by the bar counter bar is set to the data number Ps at the beginning and the data number at the end.
Select by specifying Pe.

After the above processing is completed, each code judgment is started. That is, in 2-6, it is determined whether or not each chord candidate can be added by matching the constituent sounds of the chord candidate with the melody. In order to store the discrimination result, for example, the variables CHOi, j (i
Is a chord type and j is a chord root), and an identification value indicating whether or not a chord can be added is set. Judgment in 2-7 2-
Only with respect to the chord candidates determined to be addable in step 6, the chord propriety is determined by the non-harmonic sound classification. In 2-8, it is determined whether or not the chord is available on the scale (available note scale) only for the chord candidates that pass the decision 2-7. In the processing of 2-9, the variable CHOi, j is changed to the variable CDbar, i, j.
This is a process of moving data to (variable indicating whether chord of type i and root j can be added in bar bar). At 2-10, it is checked whether the chord judgment is completed for all measures, and if not completed, the measure counter is incremented and the process returns to 2-5.

<Data Format> FIG. 3 shows a format example of melody data and chord data used in the following flow. In this example, the melody data is represented by a string of pitch data and pitch length data, and the pitch data is 16 bits long, the upper 8 bits represent an octave, and the lower 8 bits are C for each semitone. The sound length data represented by an integer value incremented by 1 is represented by an integer value such that the shortest sound length is "1" and the doubled sound length is "2".

On the other hand, the code data is 16 bits long, and the upper 8 bits represent the type (code type) and the lower 8 bits represent the root note of the chord.

<Reading Melody Data> FIG. 5 shows the details of reading the melody data executed in 2-1 of the general flow of FIG. FIG. 4 shows an example of melody data (a song of Beethoven's joy) stored in the melody data memory 5. As a result of the processing of FIG.
The i-th pitch data is stored in MDi, the i-th pitch length data is stored in MRi, and the total number of melody sounds is stored in MDNO.

<Reading production rule data> Figure 6B shows the details of reading the production rule data executed in 2-2 of the general flow. FIG. 6A shows an example of the production rule data stored in the production rule data memory 6.

The entire production rule is based on music knowledge (FIG. 6A (b), for classifying non-harmonic sounds included in a melody,
(See (c)), and each production rule data is the lower limit data Li as the data that defines the preamble of the rule, and the function instruction data that indicates the type of function.
Xi, upper limit data Ui, and data as the conclusion part of the rule
It has Yi and Ni. The function is a numerical representation of the characteristics of the melody to be analyzed, an example of which is shown in FIG. 14 described later.
The premise (proposition) of the production rule is that the value Fxi of the function indicated by the data Xi is greater than or equal to Li and less than or equal to Ui (Li ≦ Fxi ≦ Ui), and the conclusion when this premise is satisfied is the data. It is shown by Yi, and the conclusion when this premise is not satisfied is shown by data Ni. When the data Yi or Ni has a positive value, that value indicates the number of the production rule to be referred to next in the forward inference described later, and when it has a negative value, it is not summed by its absolute value. The type of voice sound is expressed. Forward inference always starts with one rule, and this rule is called a rule. The forward inference ends when it finds a conclusion Yi or Ni with a negative value. This negative value includes data representing an illegal sound (sound that does not correspond to any non-harmonic sound) shown by ill in FIG. 6A (a). As will be described later, when such an illegal sound reaches the conclusion of the inference, it is considered that the assumption of the chord, which is the premise of the inference, is incorrect, and it is determined that the chord cannot be added to the melody. .

In the case of the address assignment of the production rule data shown in FIG. 6B, the data of each production rule is stored in five consecutive addresses starting from the address of the lower limit data Li. In detail, the address divisible by 5 is Li
However, the data of Xi is stored in the address of remainder 1 divided by 5, Ui is stored in the address of remainder 2, Yi is stored in the address of remainder 3, and Ni is stored in the address of remainder 4.

Note that the total number of production rules is set in ruleno in FIG. 6B.

<Selection of Melody Bar> Details of the selection of the bar of the melody executed in 2-5 of FIG. 2 are shown in FIGS. 7 to 9. By this process, Ps contains the number of the melody data {MDi}, {MRi} of the first note of the bar of interest, and Pe
Contains the order of the melody data, which is one note before the first note of the measure next to the measure of interest. The information of Ps and Pe defines the range of melody data to be investigated in the determination process described in detail later.

<Matching with chord constituent sounds> Fig. 10 shows the details of the chord addition possibility judgment flow based on the matching between the chord constituent sounds and the melody executed in 2-6 of the general flow. 29-1 initializes chord type cowton, and 29-2 initializes chord root counter. At 29-3, the constituent tone data of the chord type indicated by the chord type kautan is read from the chord constituent tone memory 7 (where the constituent tone data when the root note is C is stored), and the read data is read as a root note counter. By turning to the left by the value indicated by, the chord component sound of type i and root j is obtained. For example, the data (representing “do”, “mi”, “so”) in the chord component sound memory 7 for the major chord type is 000010010001.
If (binary) = 091 (hexadecimal) and the root note is C ^# (j = 1), 000100100010 is obtained. In 29-4, the pitch data (melody constituent sound) included in the notes of the Psth to Peth melodies is converted into the same data format as the chord constituent sound CC. That is, the converted melody component sound data mm is given by mm = 2 ^(MDpsΛooff) V ... V2 ^(MDpsΛooff) (Λ is a logical product, Λ is a logical sum). For example,
The mm for the melody of Mi, Le, and Do is 000000010101. In the 29-5 agreement evaluation, Thus, the proportion of coincidence between the melody constituent sound and the chord constituent sound is calculated. The numerator of the above equation is obtained by counting the number of digits of 1 for each bit of (CCΛmm),
The denominator is obtained by counting the number of ones digits for each bit of mm.

At 29-6, it is checked whether the degree of coincidence is a predetermined ratio (50% in the figure) or more. This check is for determining a chord candidate having a low degree of coincidence with the melody component sound as an unaddable chord and selecting only a chord candidate having a high degree. That is, when the check is established, the use is set by CHOij = 1 (29-7), and when the check is not established, the use is set by CHOij = 0. Then, the root note counter j is incremented (29-9), and j = 0 to ROOTN-1 (ROOTN =
12), that is, the processes of 29-2 and below are repeated for all roots (29-10). When the judgment for all root chords of one chord type is completed, the chord type counter i is incremented (29-11), and i = 0
~ TYPEN-1 (TYPEN is the total number of code types), that is, the determination process is repeated for all code types (29
-12).

As a result of the matching process in FIG. 10, all codes {i,
Only the chords of j} that match the melody constituent sounds to some extent or more are determined to be usable.

<Judgment by classification of non-harmonic sounds> For details of the processing executed in 2-7 of the general flow, refer to Section 11
Shown in the figure.

30-1 and 30-2 are the same as 29-1 and 29-2 and are the initial settings of the chord type counter i and the root note counter j. 30-
As shown in FIG. 3, the judgment based on the classification of non-harmonic sounds is actually made only when CHOij is available (CHOij = 1). The details of the non-harmonic sound classification 30-4 will be described later, but in this process, the discrimination value of the non-harmonic sound or the illegal sound (ill) is set in the variable RSk (k = 1 to RSNO). Initialize a counter k for the number of classified non-harmonic sounds to 1 (30-5),
If at least one of the identifiers RSk (k = 1 to RSNO) contains data ill representing an illegal sound, that CHOij is rewritten to an unusable value (30-6, 30-7, 30-8, 30). −
9). Therefore, it is determined that the chord candidate, which is the premise, can be added to the melody only when the accuracy of all the melody sounds can be specified by the non-harmonic sound classification 30-4.
This determination process is performed for all roots of all chord types (30-10, 30-11, 30-12, 30-13).

<Classification of nonharmonic sounds> The details of the classification of nonharmonic sounds executed in 30-4 of Fig. 11 are described in
Shown in Figure 12.

First, in 33-2, the counter j for non-harmonic sound is initialized, and 33-
In step 3, the note counter i of the melody data is set to the head position Ps of the bar of interest. 33-4, i is paying attention
Determine if the th note is a chord. Harmonic sounds are the same as the constituent sounds of the chord candidate. If it is not a harmony tone, the non-harmonic tone counter is incremented (33-5),
The function F representing the characteristic element of the melody centering on the note of interest is calculated (33-6), the forward inference by the production rule is executed (33-7), and the conclusion about the note of interest is set to RSj. Substitute (33-8). The note count i is incremented (33-9), and the processes after 33-4 are repeated until the last note of the measure of interest is reached (33-10).

Details of the process 33-4 are shown in FIG. In 34-1, the chord data is converted into chord component sound data. This conversion is performed by using the type data of the chord data as a pointer, from the chord component tone memory 7 to the component tone data represented in the C tone (for example, 00001001000 in the case of major).
It is performed by reading 1) and turning it left by the number indicated by the root note data of the chord data. 34-2, 34
The melody pitch data MDi is converted into data of the same format as the constituent sound data CC generated in -1. When the result of CC Λ mm (logical product) is not 0, the same sound as the melody sound is included in the chord constituent sounds. That is, MDi is a harmony sound (34-3, 34-5). When CCΛmm = 0, MDi is a non-harmonic sound (34-3, 34-4).

Details of calculation 33-6 of F in FIG. 12 are shown in FIG. In this example, the function F is as follows: F ₁ : how many notes (non-harmonic) the note of interest is located before (harmonic position of the rear) F ₂ : how many notes before the note of interest Is a chord in front (position of the front chord) F ₃ : Number of non-harmonics between the front and rear chords F ₄ : Difference in pitch between front and rear chords F ₅ : Pitch distribution of non-harmonic tones between the front and rear chords F ₆ : Whether the pitch of the melody from the front chord to the rear chord changes monotonically or not F ₇ : The rear chord Pitch difference from the preceding note (pitch progression to the rear chord) F ₈ : Calculate pitch difference between the front chord and the one after it (pitch progression from the front chord) ing. Besides this, information indicating weak or strong beats,
Information that distinguishes note lengths may be added to the set of functions F.
Flowchart of calculation of each function F (Figs. 15 to 22)
(Fig.) Is clear from the description of itself, and therefore its explanation is omitted.

The details of the forward reasoning in 33-7 of FIG. 12 are shown in FIG. First, the rule number pointer P is set to "1" which indicates the root rule among the production rules (44-1). Then, it is checked whether or not the premise part (Lp ≦ Fxp ≦ Up) of the rule indicated by the rule number pointer P is satisfied, and when it is satisfied, the data Yp of the positive conclusion part of the rule is used as a pointer to the next rule. If it is not established, the data Np of the uncertain conclusion part of the rule is used as a pointer to the next rule.
However, when the data Yp and Np are negative values, the final conclusion has been reached, so the absolute value (−Yp, −Np) is used as the conclusion register as the non-harmonic type identifier or the illegal sound identifier. Set to. According to the flow, the condition Lp of 44-3>
When the condition Fxp> Up of Fxp or 44-5 is satisfied, the premise part Lp ≦ Fxp ≦ Up of the rule P is not satisfied, so the data Np of the negative conclusion part of the rule is substituted into a (44-4, 44 -6),
In other cases, since the premise part is established, the data Yp of the affirmative conclusion part of the rule P is entered in a (44-2). Substituting this a into P (44-7), when P is a positive value, it returns to the inspection of the next rule as the next rule number pointer, and when P is negative, is a non-harmonic sound. The classification result (44-8,
44-9).

<Judgment by scale> Figure 24 shows the details of the judgment by the scale (available note scale) executed in 2-8 of the general flow.

Before going into this explanation, I will briefly explain the available note scale. Generally, one or several scales are envisioned for a given code type. On the other hand, the code can be divided into a tonic code, a dominant code, and a subdominant code according to its function. Available note scale is determined by chords and chord functions. For example, for the major chord of C, if the major chord C is functioning as a tonic chord, the diatonic scale of Dremi Fasolacid with the root of the major chord (in this case, C) as the tonic is the available note scale. Becomes When the major chord C is a dominant chord, the diatonic scale having the root note C of the chord as the dominant, that is, the diatonic scale having F as the tonic is the available note scale. When the major chord C is a subdominant chord, the diatonic scale with G as the tonic is the available note scale. In view of this point, in the flow of FIG. 24, three available note scales are generated for a certain chord candidate in consideration of the three possibilities of tonic, dominant, and subdominant. Then, if the melody does not include a sound other than the sound formed by any of the note scales of the three available note scales, the chord candidate causing the generation of the available note is set as a chord that can be added to the melody. .

However, for the sake of simplicity in the illustrated flow, the chord set is limited to major and minor chords, and the scale for major chords is limited to the Dremi Fasolacid diatonic scale (long scale).
The scale for minor chords is the Doremi ^b fasola ^b si ^b diatonic scale (natural minor scale).
Limited to only. If desired, a part to be checked by a harmonic scale, a melody minor scale, etc. may be added.

According to the flow of FIG. 24, first, 45-1 initializes the chord type counter, and 45-2 initializes the chord root counter. It is not necessary to perform the scale-based determination for chords that have already been determined to be unusable (CHOij = 0) in the determination 2-6 or 2-7, and therefore skipped (45-3, 45-7). For a code that is usable, the identifier indicating whether it is permitted is set to a value that is not permitted (45-4). In the next 45-5, it is determined whether the chord candidate is a major chord or a minor chord by checking whether the pitch of the chord root and the third chord is a major third. SC for major
To (ab5) 16 (representing the scale of Doremi Fasolasi)
Substituting 5ad (representing the scale of Doremi ^b Fasora ^b Si _b ) into SC for the minor system (45-6,
45-7). Then, SC is rotated by the root j and substituted for SC1 (45-8). This SC1 represents the available note scale when the chord candidate is considered as a tonic chord. At 45-7, it is determined whether the melody constituent sounds are a subset (mm⊂SC1) of the available note scale SC1. This is done depending on whether (mmΛSC1) matches mm. When they match, the corresponding code availability identifier CHOi
Set j to a usable value of 1 (45-10). In 45-11, SC is set to (j + 7) in order to generate an available note scale when considering dominant chords as chord candidates.
Just rotate and substitute in SC2. Then, it is checked whether mm is a subset of the available note scale SC2, and if it is a subset, CHOij = 1 is set (45-12, 4
5-13). In 45-14, in order to generate an available note scale when the chord candidate is considered as a subdominant chord, SC is rotated by (j + 5) and substituted into SC3. Similarly, mm is available note scale SC3 Is a subset, and if it is a subset, CHOij =
1 is executed (45-15, 45-16). Therefore, for any available note scale for a chord candidate, when the melody contains a sound that is not on the scale, the chord candidate is disabled (CHOij = 0).

The point where the root loop counter j is moved from j = 0 to ROOTN-1 and the type counter i is moved from i = 0 to TYPE-1 and the judgment loop is repeated is the same as the other judgment flows (45-17 to 45-20). .

In terms of treatment, all the scales are not collated with the melody, and only some of the scales (available note scales) are examined, which has the advantage of saving the processing amount.

<Data migration> The details of the data migration 2-9 in Fig. 2 are shown in Fig. 25.
As shown in the figure, CHOij is moved to an identifier CDbar, i, j indicating whether or not a chord of chord type i and root note j can be added in the bar inspected.

<Operation Example> FIG. 26 shows an operation example of the automatic code adding apparatus according to the present embodiment. The operating conditions are as follows. The chord types are only major chords and minor chords. The production rules used were those shown in Figure 6A. The melody to be evaluated is Beethoven's joy song (for four measures) shown in FIG. Data CDba shown in the (Scale) column
The code (i, j) corresponding to the data which is 1 out of r, i, j can be finally added.

Another operation example is shown in FIG. The data shown in the upper part of FIG. 27 is the evaluated melody. In this example, the chord of C ^# major is discarded in the judgment based on the non-harmonic classification.
The first "do" in the melody is not a harmony,
Because it leapt to, it is because an illegal sound was detected.

C major and F major are abandoned according to the scale. For C major, the sound of "La ^b", "Do-Re-Mi Faso brush" (tonic) "Sorashido Remy file ^♯" (dominant) "Fasorashi ^b Do Re Mi" not included in any of the available note scale (sub-dominant) Because. F for major is because not included in any of the available note scale of "La ^b" sound of "Fasorashi ^b Do Re Mi""Do Re Mi Faso brush""Death ^b Doremi ^b Fasora".

Although the description of the embodiment is completed above, the present invention is not limited to the above embodiment, and various modifications and changes can be made. For example, the code candidate may be input by the user. This will provide a learning machine for coding.

[Effects of the Invention] As described above, the automatic chord adding device of the present invention generates an available note scale from given chord candidates and evaluates the relationship between the generated available note scale and a melody note. By doing so, it is determined whether or not the chord candidate is a chord to which a melody can be added. Therefore, the length of the inputted melody is not limited, and effective coding can be performed even on a melody including transposition, and coding with a tonality is possible.

In addition, in another configuration of the present invention, in addition to the above configuration, means for classifying non-harmonic tones from chord candidates and melody and inspecting whether chord candidates can be added according to the result is provided. Since it is a necessary condition for effective coding, more appropriate code addition can be performed.

[Brief description of drawings]

FIG. 1 is an overall configuration diagram of an automatic chord adding device according to an embodiment of the present invention, FIG. 2 is a general flow showing the operation of the embodiment, and FIG. 3 is a diagram showing an example of a melody and chord data format, FIG. 4 is a diagram showing an example of melody data, FIG. 5 is a flow chart of reading melody data, FIG. 6A is a diagram showing an example of production rule data for classification of non-harmonic sounds, and FIG. 6B is a diagram showing production rule data being read. FIG. 7 is a flow chart, FIG. 7 is a flow chart for obtaining the first (Ps) and the last (Pe) of the melody data of the section to be inspected, FIG. 8 is a flow chart for calculating Ps, FIG. 9 is a flow chart for calculating Pe, and FIG. FIG. 11 is a flow chart of judgment by matching between melody constituent sounds and chord constituent sounds, FIG. FIG. 12 is a flowchart for classifying nonharmonic sounds, FIG. 13 is a flowchart for distinguishing harmonic sounds and nonharmonic sounds, FIG. 14 is a flowchart for calculating a function F representing the situation of a melody to be analyzed, and FIG. 15 is a function. F1 calculation flowchart, FIG. 16 is a function F2 calculation flowchart, FIG. 17 is a function F3 calculation flowchart, FIG. 18 is a function F4 calculation flowchart, FIG. 19 is a function F5 calculation flowchart, FIG. 20 is a flow chart for calculating the function F6, FIG. 21 is a flow chart for calculating the functions F7 and F8,
FIG. 22 is a flowchart for temporarily storing the calculated function F, FIG. 23 is a flowchart for classifying non-harmonic sounds by forward inference, and FIG. 24 is for adding chords to a melody by an available note scale for chord candidates. FIG. 25 is a flowchart showing data movement, FIG. 26 is a diagram showing an operation example (1) of the embodiment, and FIG. 27 is a diagram showing an operation example (2) of the embodiment. 1 ... CPU, 5 ... melody data memory, 7 ... chord composition sound memory, 6 ... production rule data memory, RSi ... identifier showing classification result of non-harmonic sound, ill ...
… Illegal sound identifiers, SC1, SC2, SC3… Available note scale data.

Claims (2)

[Claims] 1. An automatic chord adding device for automatically adding chords to a given melody, producing means for producing an available note scale from given chord candidates, said melody and said available An automatic chord adding device comprising: a deciding unit that decides whether or not the chord candidate is a chord that can be added to the melody by evaluating a relationship with a note scale. 2. An automatic chord adding device for automatically adding a chord to a given melody, wherein the melody is applied to the melody and chord candidates by applying knowledge for classifying non-harmonic sounds contained in the melody. By classifying the non-harmonic sounds included in, the checking means for checking whether the chord candidate is a chord that can be added to the melody, and an available note scale from chord candidates that have passed the checking of the checking means. Generating means for generating, and determining means for determining whether or not a chord candidate that has passed the inspection of the inspecting means is a chord that can be added to the melody by evaluating the relationship between the melody and the available note scale. An automatic code adding device comprising: