w11wo commited on
Commit
14c6759
1 Parent(s): 91eec11

Fix equations for KaTeX

Browse files
Files changed (1) hide show
  1. README.md +1 -1
README.md CHANGED
@@ -34,7 +34,7 @@ As proposed in §3.1.5 of [MMS](https://arxiv.org/abs/2305.13516), we also imple
34
 
35
  $$\frac{1}{T} \left[\log P\left(Y^{\text {aligned}} \mid X\right)-\log P\left(Y^{\text {greedy}} \mid X\right)\right]$$
36
 
37
- where $$T$$ is the length of the audio, $$P\left(Y^{\text{aligned}} \mid X\right)$$ is the probability of the forced-alignment path, and $$P\left(Y^{\text{greedy}} \mid X\right)$$ is the probability of the greedy sequence.
38
 
39
  Like MMS, we select `−0.2` as the default threshold and choose samples with scores greater than this threshold. We call the resultant subsets `clean`, which you can load as shown in the [Usage section](#usage).
40
 
 
34
 
35
  $$\frac{1}{T} \left[\log P\left(Y^{\text {aligned}} \mid X\right)-\log P\left(Y^{\text {greedy}} \mid X\right)\right]$$
36
 
37
+ where \\(T\\) is the length of the audio, \\(P\left(Y^{\text{aligned}} \mid X\right)\\) is the probability of the forced-alignment path, and \\(P\left(Y^{\text{greedy}} \mid X\right)\\) is the probability of the greedy sequence.
38
 
39
  Like MMS, we select `−0.2` as the default threshold and choose samples with scores greater than this threshold. We call the resultant subsets `clean`, which you can load as shown in the [Usage section](#usage).
40