Update README.md

README.md

@@ -23,15 +23,15 @@ A noteworthy aspect is the copyright status. All tunes in the dataset are in the
 
 Inspired by [CTRL](https://huggingface.co/ctrl), we incorporate control codes into [TunesFormer](https://huggingface.co/sander-wood/tunesformer) to represent musical forms. These codes, positioned ahead of the ABC notation, enable users to specify the structures of the generated tunes. The following control codes are introduced:
 
-- **B:number of bars**: This code enables users to define the desired number of bars within a section. It utilizes the bar symbol `|` to establish the length of each section. The dataset's section length ranges from 1 to 32 bars (e.g., `B:1` for a one-bar section, and `B:32` for a section with 32 bars).
+- **S:number of sections**: determines the number of sections in the entire melody. It counts on several symbols that can be used to represent section boundaries: `[|`, `||`, `|]`, `|:`, `::`, and `:|`. In our dataset, the range is 1 to 8 (e.g., `S:1` for a single-section melody, and `S:8` for a melody with eight sections).
 
-- **S:number of sections**: With this control code, users can determine the overall structure of the generated melody by specifying the number of sections it should contain. Various symbols represent section boundaries, including `[|`, `||`, `|]`, `|:`, `::`, and `:|`. The dataset's range for the number of sections is from 1 to 8 (e.g., `S:1` for a single-section melody, and `S:8` for a melody with eight sections).
+- **B:number of bars**: specifies the desired number of bars within a section. It counts on the bar symbol `|`. In our dataset, the range is 1 to 32 (e.g., `B:1` for a one-bar section, and `B:32` for a section with 32 bars).
 
-- **E:edit distance similarity**: This control code provides fine-grained control over the similarity between the current section ($c$) and a previous section ($p$) in the generated melody. Similarity is calculated using the Levenshtein distance, measuring the difference between two sequences. The edit distance similarity ($eds(c,p)$) is calculated as:
+- **E:edit distance similarity**: controls the similarity level between the current section $c$ and a previous section $p$ in the melody. It is based on the Levenshtein distance $lev(c,p)$ , quantifying the difference between sections for creating variations or contrasts. Mathematically, it can be expressed as:
   ```
   eds(c,p) = 1 - lev(c,p) / max(|c|,|p|)
   ```
-  where $|c|$ and $|p|$ are the string lengths of the two sections. The control code has 11 levels, ranging from no match to an exact match (e.g., `E:0` for no similarity, and `E:10` for an exact match).
+  where $|c|$ and $|p|$ are the string lengths of the two sections. It is discretized into 11 levels, ranging from no match at all to an exact match (e.g., `E:0` for no similarity, and `E:10` for an exact match).
 
 ## Copyright Disclaimer
 This dataset is for research use only and not for commercial purposes. We believe all data in this dataset is in the public domain. If you own the copyright to any musical composition in the IrishMAN dataset and have concerns, please contact us at [email protected]. We will address your concerns and take appropriate action if needed.