nicolaus625
commited on
Commit
•
61ff961
1
Parent(s):
ad2e61a
Add files using upload-large-folder tool
Browse filesThis view is limited to 50 files because it contains too many changes.
See raw diff
- DSing/sing_300x30x2/AU/AUVocals/1022289417_2551042-278347088_1608827102-AU-M-150315155.wav +3 -0
- DSing/sing_300x30x2/AU/AUVocals/179962242_116514-101086085_1543061866-AU-F-4846398.wav +3 -0
- DSing/sing_300x30x2/AU/AUVocals/225107596_304047-32449093_1581452380-AU-F-1336713592.wav +3 -0
- DSing/sing_300x30x2/AU/AUVocals/280516901_425059-443164992_1542410254-AU-F-456583237.wav +3 -0
- DSing/sing_300x30x2/AU/AUVocals/290042051_86217-1258702968_1548821093-AU-M-390351349.wav +3 -0
- DSing/sing_300x30x2/AU/AUVocals/3590651_3590651-282422939_1695346759-AU-M-110688534.wav +3 -0
- DSing/sing_300x30x2/AU/AUVocals/376911283_165597-1087617628_1689913134-AU-F-1221761583.wav +3 -0
- DSing/sing_300x30x2/AU/AUVocals/3770016_3770016-1335791110_1642947173-AU-F-1335760996.wav +3 -0
- DSing/sing_300x30x2/AU/AUVocals/3770043_3770043-401669803_1583463392-AU-M-1329829951.wav +3 -0
- DSing/sing_300x30x2/AU/AUVocals/3770278_3770278-69690556_1634104576-AU-M-390351349.wav +3 -0
- DSing/sing_300x30x2/AU/AUVocals/3771860_3771860-498574279_1645907647-AU-F-498571614.wav +3 -0
- DSing/sing_300x30x2/AU/AUVocals/3771926_3771926-1314788211_1599552712-AU-F-7952924.wav +3 -0
- DSing/sing_300x30x2/AU/AUVocals/3972802_3972802-1215021178_1506616387-AU-M-395812797.wav +3 -0
- DSing/sing_300x30x2/AU/AUVocals/414803040_1915191-497340845_1684015329-AU-M-632734324.wav +3 -0
- DSing/sing_300x30x2/AU/AUVocals/4157002_4157002-53147850_1602658775-AU-M-74071716.wav +3 -0
- DSing/sing_300x30x2/AU/AUVocals/522541149_2041807-1180823720_1571613027-AU-M-1309507986.wav +3 -0
- DSing/sing_300x30x2/AU/AUVocals/549506379_392936-614739111_1685426581-AU-F-528197368.wav +3 -0
- DSing/sing_300x30x2/AU/AUVocals/57651646_75016-1215520174_1507396896-AU-M-1215493391.wav +3 -0
- DSing/sing_300x30x2/AU/AUVocals/90787007_2368054-447204367_1648677369-AU-F-185465625.wav +3 -0
- DSing/sing_300x30x2/AU/AUVocals/95692178_198872-358410285_1576393835-AU-F-398921062.wav +3 -0
- DSing/sing_300x30x2/AU/AUVocals/95692178_198872-409799938_1534215234-AU-M-413481619.wav +3 -0
- DSing/sing_300x30x2/IT/ITVocals/375305754_75327-1205159559_1660083719-IT-F-1205158836.wav +3 -0
- DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Kaldi Recipe/dsing/README.md +9 -0
- DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Kaldi Recipe/dsing/s5/cmd.sh +24 -0
- DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Kaldi Recipe/dsing/s5/conf/decode.config +3 -0
- DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Kaldi Recipe/dsing/s5/conf/dev.json +0 -0
- DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Kaldi Recipe/dsing/s5/conf/mfcc.conf +6 -0
- DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Kaldi Recipe/dsing/s5/conf/mfcc_hires.conf +11 -0
- DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Kaldi Recipe/dsing/s5/conf/online_cmvn.conf +1 -0
- DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Kaldi Recipe/dsing/s5/conf/queue.conf +9 -0
- DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Kaldi Recipe/dsing/s5/conf/test.json +0 -0
- DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Kaldi Recipe/dsing/s5/conf/train1.json +0 -0
- DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Kaldi Recipe/dsing/s5/conf/train3.json +0 -0
- DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Kaldi Recipe/dsing/s5/local/check_tools.sh +50 -0
- DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Kaldi Recipe/dsing/s5/local/prepare_dict.sh +154 -0
- DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Kaldi Recipe/dsing/s5/local/train_lms_srilm.sh +167 -0
- DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Kaldi Recipe/dsing/s5/path.sh +8 -0
- DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Kaldi Recipe/dsing/s5/run.sh +226 -0
- DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Kaldi Recipe/dsing/s5/setup_env.sh +28 -0
- DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Preconstructed/DSing1.csv +0 -0
- DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Preconstructed/DSing3.csv +0 -0
- DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Preconstructed/dev.csv +0 -0
- DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Preconstructed/test.csv +0 -0
- DSing/sing_300x30x2/Kaldi-Dsing-task/LICENSE +674 -0
- DSing/sing_300x30x2/Kaldi-Dsing-task/README.md +28 -0
- DSing/sing_300x30x2/PT/PTArrangementMeta/235546191_2197388.txt +6 -0
- DSing/sing_300x30x2/PT/PTArrangementMeta/3771663_3771663.txt +6 -0
- DSing/sing_300x30x2/PT/PTArrangementMeta/416273850_387685.txt +6 -0
- DSing/sing_300x30x2/PT/PTArrangementMeta/447282422_402184.txt +6 -0
- DSing/sing_300x30x2/PT/PTArrangementMeta/584358163_1439214.txt +6 -0
DSing/sing_300x30x2/AU/AUVocals/1022289417_2551042-278347088_1608827102-AU-M-150315155.wav
ADDED
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
1 |
+
version https://git-lfs.github.com/spec/v1
|
2 |
+
oid sha256:3738c000ae8081d551e6ccf93a59c756fc6bbf932d094c25a4bfa6c4e6f042da
|
3 |
+
size 2270536
|
DSing/sing_300x30x2/AU/AUVocals/179962242_116514-101086085_1543061866-AU-F-4846398.wav
ADDED
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
1 |
+
version https://git-lfs.github.com/spec/v1
|
2 |
+
oid sha256:023fbc7e89f0c86dd692506d52f0961f34eb191564bd2ad88046137c65e56ef3
|
3 |
+
size 28114904
|
DSing/sing_300x30x2/AU/AUVocals/225107596_304047-32449093_1581452380-AU-F-1336713592.wav
ADDED
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
1 |
+
version https://git-lfs.github.com/spec/v1
|
2 |
+
oid sha256:c57190e8053ee41ab5c61960e10105242ed51d9f4060a1f0d3ec83b6fe1ddf96
|
3 |
+
size 24848552
|
DSing/sing_300x30x2/AU/AUVocals/280516901_425059-443164992_1542410254-AU-F-456583237.wav
ADDED
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
1 |
+
version https://git-lfs.github.com/spec/v1
|
2 |
+
oid sha256:7451920afcfcf8d10d936a3fd91a2713571862e81db243ebfce2c86e6e2abae5
|
3 |
+
size 26111344
|
DSing/sing_300x30x2/AU/AUVocals/290042051_86217-1258702968_1548821093-AU-M-390351349.wav
ADDED
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
1 |
+
version https://git-lfs.github.com/spec/v1
|
2 |
+
oid sha256:64f61e8675f84addb230faf38512cd821720b234748da0a427c3cf192bf9dd22
|
3 |
+
size 18200212
|
DSing/sing_300x30x2/AU/AUVocals/3590651_3590651-282422939_1695346759-AU-M-110688534.wav
ADDED
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
1 |
+
version https://git-lfs.github.com/spec/v1
|
2 |
+
oid sha256:bbd3612a2f3224742d30d74afbd9b856184c19545b911a98e39a14d048f6d035
|
3 |
+
size 26356548
|
DSing/sing_300x30x2/AU/AUVocals/376911283_165597-1087617628_1689913134-AU-F-1221761583.wav
ADDED
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
1 |
+
version https://git-lfs.github.com/spec/v1
|
2 |
+
oid sha256:3efb8f6519080ee2369911583e6c7d806d854d33090bdf268a1fe7e4cdc945cf
|
3 |
+
size 18766408
|
DSing/sing_300x30x2/AU/AUVocals/3770016_3770016-1335791110_1642947173-AU-F-1335760996.wav
ADDED
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
1 |
+
version https://git-lfs.github.com/spec/v1
|
2 |
+
oid sha256:0a8c9ec66bdb816afc507331ea8197925b2c8de5a202bd743afa0eee639b859b
|
3 |
+
size 20526996
|
DSing/sing_300x30x2/AU/AUVocals/3770043_3770043-401669803_1583463392-AU-M-1329829951.wav
ADDED
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
1 |
+
version https://git-lfs.github.com/spec/v1
|
2 |
+
oid sha256:f7c00f23bc698a4bbee3950b64acd3d1dabe78c1d4985ea70f60aaf0c4433960
|
3 |
+
size 20976440
|
DSing/sing_300x30x2/AU/AUVocals/3770278_3770278-69690556_1634104576-AU-M-390351349.wav
ADDED
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
1 |
+
version https://git-lfs.github.com/spec/v1
|
2 |
+
oid sha256:30cf3e5f939cb1f60c811772e8b0fa0fcd16fe42acb32e922f5ea40a1e1ee6c2
|
3 |
+
size 24079508
|
DSing/sing_300x30x2/AU/AUVocals/3771860_3771860-498574279_1645907647-AU-F-498571614.wav
ADDED
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
1 |
+
version https://git-lfs.github.com/spec/v1
|
2 |
+
oid sha256:5f672134c5fac27c89d19328dcc25cd246cd7b2b78a57c2186f2d40b6ab31b99
|
3 |
+
size 20935480
|
DSing/sing_300x30x2/AU/AUVocals/3771926_3771926-1314788211_1599552712-AU-F-7952924.wav
ADDED
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
1 |
+
version https://git-lfs.github.com/spec/v1
|
2 |
+
oid sha256:f7a883777a0d384d67a78bd19da0107a78b246e43e30cc1a33ff5e8682379545
|
3 |
+
size 22327564
|
DSing/sing_300x30x2/AU/AUVocals/3972802_3972802-1215021178_1506616387-AU-M-395812797.wav
ADDED
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
1 |
+
version https://git-lfs.github.com/spec/v1
|
2 |
+
oid sha256:568aef212ff2b84bd9377604f4af6731a0fe3236d87afffa0d178fdadc7c65d6
|
3 |
+
size 17287392
|
DSing/sing_300x30x2/AU/AUVocals/414803040_1915191-497340845_1684015329-AU-M-632734324.wav
ADDED
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
1 |
+
version https://git-lfs.github.com/spec/v1
|
2 |
+
oid sha256:1f3f440502cd48eb15aa2e7c3b5e8623db9244ee4e3ddab2e5513ad0658130ef
|
3 |
+
size 21135960
|
DSing/sing_300x30x2/AU/AUVocals/4157002_4157002-53147850_1602658775-AU-M-74071716.wav
ADDED
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
1 |
+
version https://git-lfs.github.com/spec/v1
|
2 |
+
oid sha256:657a96e792e0fcdbcf3ea3523f61259d487ad707bd5ae09bfd99fa27c06e565b
|
3 |
+
size 28661452
|
DSing/sing_300x30x2/AU/AUVocals/522541149_2041807-1180823720_1571613027-AU-M-1309507986.wav
ADDED
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
1 |
+
version https://git-lfs.github.com/spec/v1
|
2 |
+
oid sha256:70c8520d7efade6b1a3394d7105c9c73533265a8b8e77738cf886480edc6800b
|
3 |
+
size 6084972
|
DSing/sing_300x30x2/AU/AUVocals/549506379_392936-614739111_1685426581-AU-F-528197368.wav
ADDED
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
1 |
+
version https://git-lfs.github.com/spec/v1
|
2 |
+
oid sha256:72ced1dfdeb1061ef6b145b6e51aff81c83084a4994d03488feac66a4fd635d2
|
3 |
+
size 20440492
|
DSing/sing_300x30x2/AU/AUVocals/57651646_75016-1215520174_1507396896-AU-M-1215493391.wav
ADDED
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
1 |
+
version https://git-lfs.github.com/spec/v1
|
2 |
+
oid sha256:29555f0f2adfc8c15bf9f89d58bb2e8f82b527c36298a11273ce0971f52e8b25
|
3 |
+
size 18876612
|
DSing/sing_300x30x2/AU/AUVocals/90787007_2368054-447204367_1648677369-AU-F-185465625.wav
ADDED
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
1 |
+
version https://git-lfs.github.com/spec/v1
|
2 |
+
oid sha256:a912f6c76dfa8ae0c3fa1e2fbbdb057a950de2ff71eb484e2b2ee20d06297848
|
3 |
+
size 23586872
|
DSing/sing_300x30x2/AU/AUVocals/95692178_198872-358410285_1576393835-AU-F-398921062.wav
ADDED
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
1 |
+
version https://git-lfs.github.com/spec/v1
|
2 |
+
oid sha256:0fb21e14020051d4c555782009b6de1c858b6d1b2c430491a14c64d10cb23301
|
3 |
+
size 21598084
|
DSing/sing_300x30x2/AU/AUVocals/95692178_198872-409799938_1534215234-AU-M-413481619.wav
ADDED
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
1 |
+
version https://git-lfs.github.com/spec/v1
|
2 |
+
oid sha256:9dc07c693b76d7d3c53e2563ace038e1a2be3eec80aaa63635e6220388563412
|
3 |
+
size 21267476
|
DSing/sing_300x30x2/IT/ITVocals/375305754_75327-1205159559_1660083719-IT-F-1205158836.wav
ADDED
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
1 |
+
version https://git-lfs.github.com/spec/v1
|
2 |
+
oid sha256:8ee09b63efe27fc521304832e9a82d8a5809e7302d70e7a7738e4faef4cf7a90
|
3 |
+
size 27648320
|
DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Kaldi Recipe/dsing/README.md
ADDED
@@ -0,0 +1,9 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
This is the baseline Kaldi recipe for unaccompanied karaoke singing using DSing corpus.
|
2 |
+
The DSing corpus is derived from the Smule Sing! 300x30x2 karaoke corpus [1].
|
3 |
+
It possesses three training sets: DSing1 with 15 hours of GB accent,
|
4 |
+
DSing3 with 45 hours of GB+US+AU accents, and DSing30 with mix of accents from 30 countries.
|
5 |
+
It was prepare as a speech recognition corpus by Gerardo Roa Dabike.
|
6 |
+
The recipe is in s5/
|
7 |
+
|
8 |
+
|
9 |
+
[1] Smule Sing! 300x30x2 Dataset, “https://ccrma.stanford.edu/damp/” accessed September 2018.
|
DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Kaldi Recipe/dsing/s5/cmd.sh
ADDED
@@ -0,0 +1,24 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
#!/bin/bash
|
2 |
+
|
3 |
+
# "queue.pl" uses qsub. The options to it are
|
4 |
+
# options to qsub. If you have GridEngine installed,
|
5 |
+
# change this to a queue you have access to.
|
6 |
+
# Otherwise, use "run.pl", which will run jobs locally
|
7 |
+
# (make sure your --num-jobs options are no more than
|
8 |
+
# the number of cpus on your machine.
|
9 |
+
|
10 |
+
# This cmd.sh file is to be used on Sharc in RSE queue
|
11 |
+
|
12 |
+
export train_cmd="run.pl"
|
13 |
+
export decode_cmd="run.pl"
|
14 |
+
|
15 |
+
|
16 |
+
if [[ "$HOSTNAME" == *"sharc"* ]]; then
|
17 |
+
export train_cmd="queue.pl --mem 6G"
|
18 |
+
export decode_cmd="queue.pl --mem 8G"
|
19 |
+
fi
|
20 |
+
if [[ "$HOSTNAME" == *"bessemer"* ]]; then
|
21 |
+
export train_cmd="slurm.pl --mem 6G"
|
22 |
+
export decode_cmd="slurm.pl --mem 8G"
|
23 |
+
|
24 |
+
fi
|
DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Kaldi Recipe/dsing/s5/conf/decode.config
ADDED
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
1 |
+
#first_beam=10.0
|
2 |
+
beam=18.0 # Was 13.0
|
3 |
+
lattice_beam=10.0 # Was 6.0
|
DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Kaldi Recipe/dsing/s5/conf/dev.json
ADDED
The diff for this file is too large to render.
See raw diff
|
|
DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Kaldi Recipe/dsing/s5/conf/mfcc.conf
ADDED
@@ -0,0 +1,6 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
--use-energy=false # only non-default option.
|
2 |
+
--sample-frequency=16000 # sampled at 16kHz
|
3 |
+
--allow_downsample=true
|
4 |
+
#--num-ceps=23
|
5 |
+
#--low-freq=20 # the default.
|
6 |
+
#--frame-length=25 # the default is 25
|
DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Kaldi Recipe/dsing/s5/conf/mfcc_hires.conf
ADDED
@@ -0,0 +1,11 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
# config for high-resolution MFCC features, intended for neural network training
|
2 |
+
# Note: we keep all cepstra, so it has the same info as filterbank features,
|
3 |
+
# but MFCC is more easily compressible (because less correlated) which is why
|
4 |
+
# we prefer this method.
|
5 |
+
--use-energy=false # use average of log energy, not energy.
|
6 |
+
--num-mel-bins=40 # similar to Google's setup.
|
7 |
+
--num-ceps=40 # there is no dimensionality reduction.
|
8 |
+
--low-freq=20 # low cutoff frequency for mel bins... this is high-bandwidth data, so
|
9 |
+
# there might be some information at the low end.
|
10 |
+
--high-freq=7600 # high cutoff frequently, relative to Nyquist of 8000 (=7600)
|
11 |
+
--allow_downsample=true
|
DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Kaldi Recipe/dsing/s5/conf/online_cmvn.conf
ADDED
@@ -0,0 +1 @@
|
|
|
|
|
1 |
+
# configuration file for apply-cmvn-online, used in the script ../local/run_online_decoding.sh
|
DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Kaldi Recipe/dsing/s5/conf/queue.conf
ADDED
@@ -0,0 +1,9 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
command qsub -v PATH -cwd -S /bin/bash -j y
|
2 |
+
option mem=* -l rmem=$0 -j y
|
3 |
+
option mem=0 # Do not add anything to qsub_opts
|
4 |
+
option num_threads=* -pe smp $0
|
5 |
+
option num_threads=1 # Do not add anything to qsub_opts
|
6 |
+
option max_jobs_run=* -tc $0
|
7 |
+
default gpu=0
|
8 |
+
option gpu=0
|
9 |
+
option gpu=* -l gpu=$0
|
DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Kaldi Recipe/dsing/s5/conf/test.json
ADDED
The diff for this file is too large to render.
See raw diff
|
|
DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Kaldi Recipe/dsing/s5/conf/train1.json
ADDED
The diff for this file is too large to render.
See raw diff
|
|
DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Kaldi Recipe/dsing/s5/conf/train3.json
ADDED
The diff for this file is too large to render.
See raw diff
|
|
DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Kaldi Recipe/dsing/s5/local/check_tools.sh
ADDED
@@ -0,0 +1,50 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
#!/bin/bash -u
|
2 |
+
|
3 |
+
# Copyright 2015 (c) Johns Hopkins University (Jan Trmal <jtrmal@gmail.com>)
|
4 |
+
|
5 |
+
# Licensed under the Apache License, Version 2.0 (the "License");
|
6 |
+
# you may not use this file except in compliance with the License.
|
7 |
+
# You may obtain a copy of the License at
|
8 |
+
#
|
9 |
+
# http://www.apache.org/licenses/LICENSE-2.0
|
10 |
+
#
|
11 |
+
# THIS CODE IS PROVIDED *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
|
12 |
+
# KIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED
|
13 |
+
# WARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,
|
14 |
+
# MERCHANTABLITY OR NON-INFRINGEMENT.
|
15 |
+
# See the Apache 2 License for the specific language governing permissions and
|
16 |
+
# limitations under the License.
|
17 |
+
|
18 |
+
[ -f ./path.sh ] && . ./path.sh
|
19 |
+
|
20 |
+
command -v uconv &>/dev/null \
|
21 |
+
|| { echo >&2 "uconv not found on PATH. You will have to install ICU4C"; exit 1; }
|
22 |
+
|
23 |
+
command -v ngram &>/dev/null \
|
24 |
+
|| { echo >&2 "srilm not found on PATH. Please use the script $KALDI_ROOT/tools/extras/install_srilm.sh to install it"; exit 1; }
|
25 |
+
|
26 |
+
if [ -z ${LIBLBFGS} ]; then
|
27 |
+
echo >&2 "SRILM is not compiled with the support of MaxEnt models."
|
28 |
+
echo >&2 "You should use the script in \$KALDI_ROOT/tools/install_srilm.sh"
|
29 |
+
echo >&2 "which will take care of compiling the SRILM with MaxEnt support"
|
30 |
+
exit 1;
|
31 |
+
fi
|
32 |
+
|
33 |
+
sox=`command -v sox 2>/dev/null` \
|
34 |
+
|| { echo >&2 "sox not found on PATH. Please install it manually (you will need version 14.4.0 and higher)."; exit 1; }
|
35 |
+
|
36 |
+
# If sox is found on path, check if the version is correct
|
37 |
+
if [ ! -z "$sox" ]; then
|
38 |
+
sox_version=`$sox --version 2>&1| head -1 | sed -e 's?.*: ??' -e 's?.* ??'`
|
39 |
+
if [[ ! $sox_version =~ v14.4.* ]]; then
|
40 |
+
echo "Unsupported sox version $sox_version found on path. You will need version v14.4.0 and higher."
|
41 |
+
exit 1
|
42 |
+
fi
|
43 |
+
fi
|
44 |
+
|
45 |
+
command -v phonetisaurus-align &>/dev/null \
|
46 |
+
|| { echo >&2 "Phonetisaurus not found on PATH. Please use the script $KALDI_ROOT/tools/extras/install_phonetisaurus.sh to install it"; exit 1; }
|
47 |
+
|
48 |
+
exit 0
|
49 |
+
|
50 |
+
|
DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Kaldi Recipe/dsing/s5/local/prepare_dict.sh
ADDED
@@ -0,0 +1,154 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
#!/bin/bash
|
2 |
+
|
3 |
+
#adapted from ami and chime5 dict preparation script
|
4 |
+
#Author: Gerardo Roa
|
5 |
+
|
6 |
+
# Begin configuration section.
|
7 |
+
words=5000
|
8 |
+
# End configuration section
|
9 |
+
|
10 |
+
echo "$0 $@" # Print the command line for logging
|
11 |
+
|
12 |
+
if [ -f path.sh ]; then . ./path.sh; fi
|
13 |
+
. utils/parse_options.sh || exit 1;
|
14 |
+
|
15 |
+
# The parts of the output of this that will be needed are
|
16 |
+
# [in data/local/dict/ ]
|
17 |
+
# lexicon.txt
|
18 |
+
# extra_questions.txt
|
19 |
+
# nonsilence_phones.txt
|
20 |
+
# optional_silence.txt
|
21 |
+
# silence_phones.txt
|
22 |
+
|
23 |
+
mkdir -p data
|
24 |
+
|
25 |
+
|
26 |
+
|
27 |
+
dir=data/local/dict
|
28 |
+
mkdir -p $dir
|
29 |
+
|
30 |
+
echo "$0: Getting CMU dictionary"
|
31 |
+
if [ ! -f $dir/cmudict.done ]; then
|
32 |
+
[ -d $dir/cmudict ] && rm -rf $dir/cmudict
|
33 |
+
svn co https://svn.code.sf.net/p/cmusphinx/code/trunk/cmudict $dir/cmudict
|
34 |
+
touch $dir/cmudict.done
|
35 |
+
fi
|
36 |
+
|
37 |
+
echo "$0: Preparing files in $dir"
|
38 |
+
# Silence phones
|
39 |
+
for w in SIL SPN; do echo $w; done > $dir/silence_phones.txt
|
40 |
+
echo SIL > $dir/optional_silence.txt
|
41 |
+
|
42 |
+
|
43 |
+
# For this setup we're discarding stress.
|
44 |
+
cat $dir/cmudict/cmudict-0.7b.symbols | \
|
45 |
+
perl -ne 's:[0-9]::g; s:\r::; print lc($_)' | \
|
46 |
+
tr a-z A-Z | \
|
47 |
+
sort -u > $dir/nonsilence_phones.txt
|
48 |
+
|
49 |
+
# An extra question will be added by including the silence phones in one class.
|
50 |
+
paste -d ' ' -s $dir/silence_phones.txt > $dir/extra_questions.txt
|
51 |
+
|
52 |
+
|
53 |
+
grep -v ';;;' $dir/cmudict/cmudict-0.7b |\
|
54 |
+
uconv -f latin1 -t utf-8 -x Any-Lower |\
|
55 |
+
perl -ne 's:(\S+)\(\d+\) :$1 :; s: : :; print;' |\
|
56 |
+
perl -ne '@F = split " ",$_,2; $F[1] =~ s/[0-9]//g; print "$F[0] $F[1]";' \
|
57 |
+
> $dir/lexicon1_raw_nosil.txt || exit 1;
|
58 |
+
|
59 |
+
|
60 |
+
# Add prons for laughter, noise, oov
|
61 |
+
for w in `grep -v sil $dir/silence_phones.txt`; do
|
62 |
+
echo "[$w] $w"
|
63 |
+
done | cat - $dir/lexicon1_raw_nosil.txt > $dir/lexicon2_raw.txt || exit 1;
|
64 |
+
|
65 |
+
|
66 |
+
# we keep all words from the cmudict in the lexicon
|
67 |
+
# might reduce OOV rate on dev and test
|
68 |
+
cat $dir/lexicon2_raw.txt \
|
69 |
+
<( echo "mm m"
|
70 |
+
echo "<unk> spn" \
|
71 |
+
) | sed 's/[\t ]/\t/' | tr a-z A-Z | sort -u > $dir/iv_lexicon.txt
|
72 |
+
|
73 |
+
|
74 |
+
cat data/local/corpus.txt | \
|
75 |
+
awk '{for (n=1;n<=NF;n++){ count[$n]++; } } END { for(n in count) { print count[n], n; }}' | \
|
76 |
+
sort -nr > $dir/word_counts_b
|
77 |
+
|
78 |
+
|
79 |
+
# Select the N numbers of words increasingly in order to select all the words with same count
|
80 |
+
|
81 |
+
vocab_size=0
|
82 |
+
start_line=3 # first two are <s> and </s>
|
83 |
+
touch $dir/word_list
|
84 |
+
|
85 |
+
while [ "$vocab_size" -le "$words" ]; do
|
86 |
+
current_count=`sed "${start_line}q;d" $dir/word_counts_b | awk '{print $1}'`
|
87 |
+
cat $dir/word_counts_b | grep "^$current_count " | awk '{print $2}' >> $dir/word_list
|
88 |
+
vocab_size=`cat $dir/word_list | wc -l`
|
89 |
+
start_line=$((vocab_size + 1 ))
|
90 |
+
done
|
91 |
+
|
92 |
+
|
93 |
+
head -n $vocab_size $dir/word_counts_b > $dir/word_counts
|
94 |
+
sort -u $dir/word_list > $dir/word_list_sorted
|
95 |
+
|
96 |
+
|
97 |
+
awk '{print $1}' $dir/iv_lexicon.txt | \
|
98 |
+
perl -e '($word_counts)=@ARGV;
|
99 |
+
open(W, "<$word_counts")||die "opening word-counts $word_counts";
|
100 |
+
while(<STDIN>) { chop; $seen{$_}=1; }
|
101 |
+
while(<W>) {
|
102 |
+
($c,$w) = split;
|
103 |
+
if (!defined $seen{$w}) { print; }
|
104 |
+
} ' $dir/word_counts > $dir/oov_counts.txt
|
105 |
+
|
106 |
+
|
107 |
+
echo "*Highest-count OOVs (including fragments) are:"
|
108 |
+
head -n 10 $dir/oov_counts.txt
|
109 |
+
echo "*Highest-count OOVs (excluding fragments) are:"
|
110 |
+
grep -v -E '^-|-$' $dir/oov_counts.txt | head -n 10 || true
|
111 |
+
|
112 |
+
|
113 |
+
echo "*Training a G2P and generating missing pronunciations"
|
114 |
+
mkdir -p $dir/g2p/
|
115 |
+
|
116 |
+
if [ -e $dir/g2p/g2p.fst ]
|
117 |
+
then
|
118 |
+
echo "$0: Phonetisaurus exist. $dir/g2p/g2p.fst will be used"
|
119 |
+
else
|
120 |
+
phonetisaurus-align --input=$dir/iv_lexicon.txt --ofile=$dir/g2p/aligned_lexicon.corpus
|
121 |
+
ngram-count -order 4 -kn-modify-counts-at-end -ukndiscount\
|
122 |
+
-gt1min 0 -gt2min 0 -gt3min 0 -gt4min 0 \
|
123 |
+
-text $dir/g2p/aligned_lexicon.corpus -lm $dir/g2p/aligned_lexicon.arpa
|
124 |
+
phonetisaurus-arpa2wfst --lm=$dir/g2p/aligned_lexicon.arpa --ofile=$dir/g2p/g2p.fst
|
125 |
+
fi
|
126 |
+
|
127 |
+
awk '{print $2}' $dir/oov_counts.txt > $dir/oov_words.txt
|
128 |
+
phonetisaurus-apply --nbest 2 --model $dir/g2p/g2p.fst --thresh 5 --accumulate \
|
129 |
+
--word_list $dir/oov_words.txt > $dir/oov_lexicon.txt
|
130 |
+
|
131 |
+
|
132 |
+
## We join pronunciation with the selected words to create lexicon.txt
|
133 |
+
cat $dir/oov_lexicon.txt $dir/iv_lexicon.txt | sort -u > $dir/lexicon1_plus_g2p.txt
|
134 |
+
join $dir/lexicon1_plus_g2p.txt $dir/word_list_sorted > $dir/lexicon.txt
|
135 |
+
|
136 |
+
echo "<UNK> SPN" >> $dir/lexicon.txt
|
137 |
+
|
138 |
+
## The next section is again just for debug purposes
|
139 |
+
## to show words for which the G2P failed
|
140 |
+
rm -f $dir/lexiconp.txt 2>null; # can confuse later script if this exists.
|
141 |
+
awk '{print $1}' $dir/lexicon.txt | \
|
142 |
+
perl -e '($word_counts)=@ARGV;
|
143 |
+
open(W, "<$word_counts")||die "opening word-counts $word_counts";
|
144 |
+
while(<STDIN>) { chop; $seen{$_}=1; }
|
145 |
+
while(<W>) {
|
146 |
+
($c,$w) = split;
|
147 |
+
if (!defined $seen{$w}) { print; }
|
148 |
+
} ' $dir/word_counts > $dir/oov_counts.g2p.txt
|
149 |
+
|
150 |
+
echo "*Highest-count OOVs (including fragments) after G2P are:"
|
151 |
+
head -n 10 $dir/oov_counts.g2p.txt
|
152 |
+
|
153 |
+
utils/validate_dict_dir.pl $dir
|
154 |
+
exit 0;
|
DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Kaldi Recipe/dsing/s5/local/train_lms_srilm.sh
ADDED
@@ -0,0 +1,167 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
#!/bin/bash
|
2 |
+
# Copyright (c) 2017 Johns Hopkins University (Author: Yenda Trmal, Shinji Watanabe)
|
3 |
+
# Apache 2.0
|
4 |
+
|
5 |
+
export LC_ALL=C
|
6 |
+
|
7 |
+
# Begin configuration section.
|
8 |
+
words_file=
|
9 |
+
train_text=
|
10 |
+
dev_text=
|
11 |
+
oov_symbol="<UNK>"
|
12 |
+
# End configuration section
|
13 |
+
|
14 |
+
echo "$0 $@"
|
15 |
+
|
16 |
+
[ -f path.sh ] && . ./path.sh
|
17 |
+
. ./utils/parse_options.sh || exit 1
|
18 |
+
|
19 |
+
echo "-------------------------------------"
|
20 |
+
echo "Building an SRILM language model "
|
21 |
+
echo "-------------------------------------"
|
22 |
+
|
23 |
+
if [ $# -ne 2 ] ; then
|
24 |
+
echo "Incorrect number of parameters. "
|
25 |
+
echo "Script has to be called like this:"
|
26 |
+
echo " $0 [switches] <datadir> <tgtdir>"
|
27 |
+
echo "For example: "
|
28 |
+
echo " $0 data data/srilm"
|
29 |
+
echo "The allowed switches are: "
|
30 |
+
echo " words_file=<word_file|> word list file -- data/lang/words.txt by default"
|
31 |
+
echo " train_text=<train_text|> data/train/text is used in case when not specified"
|
32 |
+
echo " dev_text=<dev_text|> last 10 % of the train text is used by default"
|
33 |
+
echo " oov_symbol=<unk_sumbol|<UNK>> symbol to use for oov modeling -- <UNK> by default"
|
34 |
+
exit 1
|
35 |
+
fi
|
36 |
+
|
37 |
+
datadir=$1
|
38 |
+
tgtdir=$2
|
39 |
+
|
40 |
+
##End of configuration
|
41 |
+
loc=`which ngram-count`;
|
42 |
+
if [ -z $loc ]; then
|
43 |
+
echo >&2 "You appear to not have SRILM tools installed, either on your path,"
|
44 |
+
echo >&2 "Use the script \$KALDI_ROOT/tools/install_srilm.sh to install it."
|
45 |
+
exit 1
|
46 |
+
fi
|
47 |
+
|
48 |
+
# Prepare the destination directory
|
49 |
+
mkdir -p $tgtdir
|
50 |
+
|
51 |
+
for f in $words_file $train_text $dev_text; do
|
52 |
+
[ ! -s $f ] && echo "No such file $f" && exit 1;
|
53 |
+
done
|
54 |
+
|
55 |
+
[ -z $words_file ] && words_file=$datadir/lang/words.txt
|
56 |
+
if [ ! -z "$train_text" ] && [ -z "$dev_text" ] ; then
|
57 |
+
nr=`cat $train_text | wc -l`
|
58 |
+
nr_dev=$(($nr / 10 ))
|
59 |
+
nr_train=$(( $nr - $nr_dev ))
|
60 |
+
orig_train_text=$train_text
|
61 |
+
head -n $nr_train $train_text > $tgtdir/train_text
|
62 |
+
tail -n $nr_dev $train_text > $tgtdir/dev_text
|
63 |
+
|
64 |
+
train_text=$tgtdir/train_text
|
65 |
+
dev_text=$tgtdir/dev_text
|
66 |
+
echo "Using words file: $words_file"
|
67 |
+
echo "Using train text: 9/10 of $orig_train_text"
|
68 |
+
echo "Using dev text : 1/10 of $orig_train_text"
|
69 |
+
elif [ ! -z "$train_text" ] && [ ! -z "$dev_text" ] ; then
|
70 |
+
echo "Using words file: $words_file"
|
71 |
+
echo "Using train text: $train_text"
|
72 |
+
echo "Using dev text : $dev_text"
|
73 |
+
train_text=$train_text
|
74 |
+
dev_text=$dev_text
|
75 |
+
else
|
76 |
+
train_text=$datadir/train/text
|
77 |
+
dev_text=$datadir/dev2h/text
|
78 |
+
echo "Using words file: $words_file"
|
79 |
+
echo "Using train text: $train_text"
|
80 |
+
echo "Using dev text : $dev_text"
|
81 |
+
|
82 |
+
fi
|
83 |
+
|
84 |
+
[ ! -f $words_file ] && echo >&2 "File $words_file must exist!" && exit 1
|
85 |
+
[ ! -f $train_text ] && echo >&2 "File $train_text must exist!" && exit 1
|
86 |
+
[ ! -f $dev_text ] && echo >&2 "File $dev_text must exist!" && exit 1
|
87 |
+
|
88 |
+
|
89 |
+
# Extract the word list from the training dictionary; exclude special symbols
|
90 |
+
sort $words_file | awk '{print $1}' | grep -v '\#0' | grep -v '<eps>' | grep -v -F "$oov_symbol" > $tgtdir/vocab
|
91 |
+
if (($?)); then
|
92 |
+
echo "Failed to create vocab from $words_file"
|
93 |
+
exit 1
|
94 |
+
else
|
95 |
+
# wc vocab # doesn't work due to some encoding issues
|
96 |
+
echo vocab contains `cat $tgtdir/vocab | perl -ne 'BEGIN{$l=$w=0;}{split; $w+=$#_; $w++; $l++;}END{print "$l lines, $w words\n";}'`
|
97 |
+
fi
|
98 |
+
|
99 |
+
# corpus file has <s> <\s> tag; remove it
|
100 |
+
sed -e 's/^\w*\ *//' -e 's/ \+[^ ]\+$//' $train_text | sort -u | \
|
101 |
+
perl -ane 'print join(" ", @F[1..$#F]) . "\n" if @F > 1' > $tgtdir/train.txt
|
102 |
+
if (($?)); then
|
103 |
+
echo "Failed to create $tgtdir/train.txt from $train_text"
|
104 |
+
exit 1
|
105 |
+
else
|
106 |
+
echo "Removed first and last word (<s> <\s> tags) from every line of $train_text"
|
107 |
+
# wc text.train train.txt # doesn't work due to some encoding issues
|
108 |
+
echo $train_text contains `cat $train_text | perl -ane 'BEGIN{$w=$s=0;}{$w+=@F; $w--; $s++;}END{print "$w words, $s sentences\n";}'`
|
109 |
+
echo train.txt contains `cat $tgtdir/train.txt | perl -ane 'BEGIN{$w=$s=0;}{$w+=@F; $s++;}END{print "$w words, $s sentences\n";}'`
|
110 |
+
fi
|
111 |
+
|
112 |
+
# data/dev/text
|
113 |
+
cat $dev_text | cut -d ' ' -f 2- > $tgtdir/dev.txt
|
114 |
+
if (($?)); then
|
115 |
+
echo "Failed to create $tgtdir/dev.txt from $dev_text"
|
116 |
+
exit 1
|
117 |
+
else
|
118 |
+
echo "Removed first word (uid) from every line of $dev_text"
|
119 |
+
# wc text.train train.txt # doesn't work due to some encoding issues
|
120 |
+
echo $dev_text contains `cat $dev_text | perl -ane 'BEGIN{$w=$s=0;}{$w+=@F; $w--; $s++;}END{print "$w words, $s sentences\n";}'`
|
121 |
+
echo $tgtdir/dev.txt contains `cat $tgtdir/dev.txt | perl -ane 'BEGIN{$w=$s=0;}{$w+=@F; $s++;}END{print "$w words, $s sentences\n";}'`
|
122 |
+
fi
|
123 |
+
|
124 |
+
|
125 |
+
if [ ! -z ${LIBLBFGS} ]; then
|
126 |
+
#please note that if the switch -map-unk "$oov_symbol" is used with -maxent-convert-to-arpa, ngram-count will segfault
|
127 |
+
#instead of that, we simply output the model in the maxent format and convert it using the "ngram"
|
128 |
+
echo "-------------------"
|
129 |
+
echo "Maxent 3grams"
|
130 |
+
echo "-------------------"
|
131 |
+
sed 's/'${oov_symbol}'/<unk>/g' $tgtdir/train.txt | \
|
132 |
+
ngram-count -lm - -order 3 -text - -vocab $tgtdir/vocab -unk -sort -maxent -maxent-convert-to-arpa|\
|
133 |
+
ngram -lm - -order 3 -unk -map-unk "$oov_symbol" -prune-lowprobs -write-lm - |\
|
134 |
+
sed 's/<unk>/'${oov_symbol}'/g' | gzip -c > $tgtdir/3gram.me.gz || exit 1
|
135 |
+
|
136 |
+
echo "-------------------"
|
137 |
+
echo "Maxent 4grams"
|
138 |
+
echo "-------------------"
|
139 |
+
sed 's/'${oov_symbol}'/<unk>/g' $tgtdir/train.txt | \
|
140 |
+
ngram-count -lm - -order 4 -text - -vocab $tgtdir/vocab -unk -sort -maxent -maxent-convert-to-arpa|\
|
141 |
+
ngram -lm - -order 4 -unk -map-unk "$oov_symbol" -prune-lowprobs -write-lm - |\
|
142 |
+
sed 's/<unk>/'${oov_symbol}'/g' | gzip -c > $tgtdir/4gram.me.gz || exit 1
|
143 |
+
else
|
144 |
+
echo >&2 "SRILM is not compiled with the support of MaxEnt models."
|
145 |
+
echo >&2 "You should use the script in \$KALDI_ROOT/tools/install_srilm.sh"
|
146 |
+
echo >&2 "which will take care of compiling the SRILM with MaxEnt support"
|
147 |
+
exit 1;
|
148 |
+
fi
|
149 |
+
|
150 |
+
|
151 |
+
echo "--------------------"
|
152 |
+
echo "Computing perplexity"
|
153 |
+
echo "--------------------"
|
154 |
+
(
|
155 |
+
for f in $tgtdir/3gram* ; do ( echo $f; ngram -order 3 -lm $f -unk -map-unk "$oov_symbol" -prune-lowprobs -ppl $tgtdir/dev.txt ) | paste -s -d ' ' ; done
|
156 |
+
for f in $tgtdir/4gram* ; do ( echo $f; ngram -order 4 -lm $f -unk -map-unk "$oov_symbol" -prune-lowprobs -ppl $tgtdir/dev.txt ) | paste -s -d ' ' ; done
|
157 |
+
) | sort -r -n -k 15,15g | column -t | tee $tgtdir/perplexities.txt
|
158 |
+
|
159 |
+
echo "The perlexity scores report is stored in $tgtdir/perplexities.txt "
|
160 |
+
echo ""
|
161 |
+
|
162 |
+
for best_ngram in {3,4}gram ; do
|
163 |
+
outlm=best_${best_ngram}.gz
|
164 |
+
lmfilename=$(grep "${best_ngram}" $tgtdir/perplexities.txt | head -n 1 | cut -f 1 -d ' ')
|
165 |
+
echo "$outlm -> $lmfilename"
|
166 |
+
(cd $tgtdir; rm -f $outlm; ln -sf $(basename $lmfilename) $outlm )
|
167 |
+
done
|
DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Kaldi Recipe/dsing/s5/path.sh
ADDED
@@ -0,0 +1,8 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
export KALDI_ROOT=`pwd`/../../..
|
2 |
+
[ -f $KALDI_ROOT/tools/env.sh ] && . $KALDI_ROOT/tools/env.sh
|
3 |
+
export PATH=$PWD/utils/:$KALDI_ROOT/tools/openfst/bin:$PWD:$PATH
|
4 |
+
[ ! -f $KALDI_ROOT/tools/config/common_path.sh ] && echo >&2 "The standard file $KALDI_ROOT/tools/config/common_path.sh is not present -> Exit!" && exit 1
|
5 |
+
. $KALDI_ROOT/tools/config/common_path.sh
|
6 |
+
export LC_ALL=C
|
7 |
+
source setup_env.sh
|
8 |
+
|
DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Kaldi Recipe/dsing/s5/run.sh
ADDED
@@ -0,0 +1,226 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
#!/bin/bash
|
2 |
+
#
|
3 |
+
# Recipe for the Dsing baseline
|
4 |
+
# Based mostly on the Librispeech recipe
|
5 |
+
#
|
6 |
+
# Copyright 2019 Gerardo Roa
|
7 |
+
# University of Sheffield
|
8 |
+
# Apache 2.0
|
9 |
+
|
10 |
+
# Begin configuration section
|
11 |
+
|
12 |
+
nj=40
|
13 |
+
stage=0
|
14 |
+
dsing=1 # Set: 1 for DSing1
|
15 |
+
# 3 for DSing3
|
16 |
+
# 30 for DSing30
|
17 |
+
|
18 |
+
# For TDNN-F only
|
19 |
+
decode_nj=1
|
20 |
+
|
21 |
+
# End configuration section
|
22 |
+
. ./utils/parse_options.sh
|
23 |
+
|
24 |
+
. ./path.sh
|
25 |
+
. ./cmd.sh
|
26 |
+
|
27 |
+
set -e # exit on error
|
28 |
+
|
29 |
+
# Sing! 300x30x2 corpus path
|
30 |
+
# please change the path accordingly
|
31 |
+
sing_corpus=/fastdata/acp13gr/DAMP300x30x20/sing_300x30x2
|
32 |
+
|
33 |
+
|
34 |
+
echo "Using steps and utils from WSJ recipe"
|
35 |
+
[[ ! -L "wav" ]] && ln -s $sing_corpus wav
|
36 |
+
[[ ! -L "steps" ]] && ln -s $KALDI_ROOT/egs/wsj/s5/steps
|
37 |
+
[[ ! -L "utils" ]] && ln -s $KALDI_ROOT/egs/wsj/s5/utils
|
38 |
+
|
39 |
+
|
40 |
+
trainset=train${dsing}
|
41 |
+
devset="dev"
|
42 |
+
testset="test"
|
43 |
+
|
44 |
+
# This script also needs the phonetisaurus g2p, srilm, sox
|
45 |
+
./local/check_tools.sh || exit 1
|
46 |
+
|
47 |
+
|
48 |
+
echo; echo "===== Starting at $(date +"%D_%T") ====="; echo
|
49 |
+
|
50 |
+
|
51 |
+
if [ $stage -le 1 ]; then
|
52 |
+
mkdir -p data/local/dict
|
53 |
+
cp conf/corpus.txt data/local/corpus.txt # Corpus.txt for language model
|
54 |
+
|
55 |
+
for datadir in $devset $testset $trainset; do
|
56 |
+
python local/prepare_data.py data/ wav/ conf/${datadir}.json $datadir
|
57 |
+
done
|
58 |
+
|
59 |
+
# Selecting the top 25000 words by frequency
|
60 |
+
# Is expected that the final size will be larger as
|
61 |
+
# it use all the words with the same frequency avoiding an arbitrary cut-off
|
62 |
+
local/prepare_dict.sh --words 26000
|
63 |
+
|
64 |
+
utils/prepare_lang.sh data/local/dict "<UNK>" data/local/lang data/lang
|
65 |
+
|
66 |
+
local/train_lms_srilm.sh \
|
67 |
+
--train-text data/local/corpus.txt \
|
68 |
+
--dev_text data/dev/text \
|
69 |
+
--oov-symbol "<UNK>" --words-file data/lang/words.txt \
|
70 |
+
data/ data/srilm
|
71 |
+
|
72 |
+
# Compiles G for DSing Preconstructed trigram LM
|
73 |
+
utils/format_lm.sh data/lang data/srilm/best_3gram.gz data/local/dict/lexicon.txt data/lang_3G
|
74 |
+
utils/format_lm.sh data/lang data/srilm/best_4gram.gz data/local/dict/lexicon.txt data/lang_4G
|
75 |
+
fi
|
76 |
+
|
77 |
+
# Features Extraction
|
78 |
+
if [[ $stage -le 2 ]]; then
|
79 |
+
|
80 |
+
echo
|
81 |
+
echo "============================="
|
82 |
+
echo "---- MFCC FEATURES EXTRACTION ----"
|
83 |
+
echo "===== $(date +"%D_%T") ====="
|
84 |
+
|
85 |
+
for datadir in $trainset $devset $testset; do
|
86 |
+
echo; echo "---- $datadir"
|
87 |
+
utils/fix_data_dir.sh data/$datadir
|
88 |
+
steps/make_mfcc.sh --cmd "$train_cmd" --nj $nj data/${datadir} exp/make_mfcc/${datadir} mfcc
|
89 |
+
steps/compute_cmvn_stats.sh data/${datadir}
|
90 |
+
utils/fix_data_dir.sh data/$datadir
|
91 |
+
done
|
92 |
+
fi
|
93 |
+
|
94 |
+
if [[ $stage -le 3 ]]; then
|
95 |
+
|
96 |
+
echo
|
97 |
+
echo "============================="
|
98 |
+
echo "-------- Train GMM ----------"
|
99 |
+
echo
|
100 |
+
|
101 |
+
echo
|
102 |
+
echo "Mono"
|
103 |
+
echo "===== $(date +"%D_%T") ====="
|
104 |
+
|
105 |
+
# Monophone
|
106 |
+
steps/train_mono.sh --nj $nj --cmd "$train_cmd" \
|
107 |
+
data/${trainset} data/lang exp/mono
|
108 |
+
|
109 |
+
steps/align_si.sh --nj $nj --cmd "$train_cmd" \
|
110 |
+
data/${trainset} data/lang exp/mono exp/mono_ali
|
111 |
+
|
112 |
+
echo
|
113 |
+
echo "Tri 1 - delta-based triphones"
|
114 |
+
echo "===== $(date +"%D_%T") ====="
|
115 |
+
|
116 |
+
# Tri1
|
117 |
+
|
118 |
+
|
119 |
+
steps/train_deltas.sh --cmd "$train_cmd" 2000 15000 \
|
120 |
+
data/${trainset} data/lang exp/mono_ali exp/tri1
|
121 |
+
|
122 |
+
steps/align_si.sh --nj $nj --cmd "$train_cmd" \
|
123 |
+
data/${trainset} data/lang exp/tri1 exp/tri1_ali
|
124 |
+
|
125 |
+
echo
|
126 |
+
echo "Tri 2 - LDA-MLLT triphones"
|
127 |
+
echo "===== $(date +"%D_%T") ====="
|
128 |
+
# Tri2
|
129 |
+
|
130 |
+
|
131 |
+
steps/train_lda_mllt.sh --cmd "$train_cmd" 2500 20000 \
|
132 |
+
data/${trainset} data/lang exp/tri1_ali exp/tri2b
|
133 |
+
|
134 |
+
steps/align_si.sh --nj $nj --cmd "$train_cmd" \
|
135 |
+
data/${trainset} data/lang exp/tri2b exp/tri2b_ali
|
136 |
+
|
137 |
+
echo
|
138 |
+
echo "Tri 3 - SAT triphones"
|
139 |
+
echo "===== $(date +"%D_%T") ====="
|
140 |
+
|
141 |
+
# Tri3 SAT
|
142 |
+
|
143 |
+
|
144 |
+
steps/train_sat.sh --cmd "$train_cmd" 3000 25000 \
|
145 |
+
data/${trainset} data/lang exp/tri2b_ali exp/tri3b
|
146 |
+
|
147 |
+
utils/mkgraph.sh data/lang_3G exp/tri3b exp/tri3b/graph
|
148 |
+
|
149 |
+
echo
|
150 |
+
echo "------ End Train GMM --------"
|
151 |
+
echo "===== $(date +"%D_%T") ====="
|
152 |
+
fi
|
153 |
+
|
154 |
+
|
155 |
+
if [[ $stage -le 4 ]]; then
|
156 |
+
echo
|
157 |
+
echo "============================="
|
158 |
+
echo "------- Decode TRI3B --------"
|
159 |
+
echo "===== $(date +"%D_%T") ====="
|
160 |
+
echo
|
161 |
+
|
162 |
+
|
163 |
+
|
164 |
+
echo; echo "--------decode ${devset}"; echo
|
165 |
+
steps/decode_fmllr.sh --config conf/decode.config --nj $nj --cmd "$decode_cmd" \
|
166 |
+
--scoring-opts "--min-lmwt 10 --max-lmwt 20" --num-threads 4 \
|
167 |
+
exp/tri3b/graph data/${devset} exp/tri3b/decode_${devset}
|
168 |
+
|
169 |
+
|
170 |
+
# Scoring test model with the best
|
171 |
+
lmwt=$(cat exp/tri3b/decode_${devset}/scoring_kaldi/wer_details/lmwt)
|
172 |
+
wip=$(cat exp/tri3b/decode_${devset}/scoring_kaldi/wer_details/wip)
|
173 |
+
echo; echo "--------decode ${testset}"
|
174 |
+
echo "Using [lmwt=$lmwt, wip=$wip] to score"; echo
|
175 |
+
steps/decode_fmllr.sh --config conf/decode.config --nj $nj --cmd "$decode_cmd" \
|
176 |
+
--scoring-opts "--min_lmwt $lmwt --max_lmwt $lmwt --word_ins_penalty $wip" --num-threads 4 \
|
177 |
+
exp/tri3b/graph data/${testset} exp/tri3b/decode_${testset}
|
178 |
+
|
179 |
+
|
180 |
+
fi
|
181 |
+
|
182 |
+
# Produce clean data
|
183 |
+
if [[ $stage -le 5 ]]; then
|
184 |
+
echo
|
185 |
+
echo "============================="
|
186 |
+
echo "------- Cleanup Tri3b -------"
|
187 |
+
echo "===== $(date +"%D_%T") ====="
|
188 |
+
echo
|
189 |
+
|
190 |
+
steps/cleanup/clean_and_segment_data.sh --nj $nj --cmd "$train_cmd" \
|
191 |
+
--segmentation-opts "--min-segment-length 0.3 --min-new-segment-length 0.6" \
|
192 |
+
data/${trainset} data/lang exp/tri3b exp/tri3b_cleaned \
|
193 |
+
data/${trainset}_cleaned
|
194 |
+
fi
|
195 |
+
|
196 |
+
if [[ $stage -le 6 ]]; then
|
197 |
+
echo
|
198 |
+
echo "=================="
|
199 |
+
echo "----- TDNN-F -----"
|
200 |
+
echo "===== $(date +"%D_%T") ====="
|
201 |
+
echo
|
202 |
+
|
203 |
+
local/chain/run_tdnn_1d.sh --nj $nj --decode_nj $decode_nj \
|
204 |
+
--train_set ${trainset}_cleaned --test_sets "$devset $testset" \
|
205 |
+
--gmm tri3b_cleaned --nnet3-affix _${trainset}_cleaned
|
206 |
+
fi
|
207 |
+
|
208 |
+
|
209 |
+
if [[ $stage -le 7 ]]; then
|
210 |
+
echo
|
211 |
+
echo "============================="
|
212 |
+
echo "------- FINAL SCORES --------"
|
213 |
+
echo "===== $(date +"%D_%T") ====="
|
214 |
+
echo
|
215 |
+
|
216 |
+
for x in `find exp/* -name "best_wer"`; do
|
217 |
+
cat $x | grep -v ".si"
|
218 |
+
done
|
219 |
+
fi
|
220 |
+
|
221 |
+
echo
|
222 |
+
echo "===== $(date +"%D_%T") ====="
|
223 |
+
echo "===== PROCESS ENDED ====="
|
224 |
+
echo
|
225 |
+
|
226 |
+
exit 1
|
DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Kaldi Recipe/dsing/s5/setup_env.sh
ADDED
@@ -0,0 +1,28 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
# setup_env.sh
|
2 |
+
|
3 |
+
# Sharc HPC
|
4 |
+
if [[ "$HOSTNAME" == *"sharc"* ]]; then
|
5 |
+
module load apps/python/conda
|
6 |
+
module load libs/CUDA/9.0.176/binary
|
7 |
+
module load libs/cudnn/7.3.1.20/binary-cuda-9.0.176
|
8 |
+
module load dev/gcc/5.4
|
9 |
+
module load libs/icu/58.2/gcc-4.9.4
|
10 |
+
PATH=$PATH:/usr/local/packages/libs/icu/58.2/gcc-4.9.4/bin
|
11 |
+
module load libs/intel-mkl/2019.3/binary
|
12 |
+
|
13 |
+
# Add SOX PATH
|
14 |
+
LD_LIBRARY_PATH=$LD_LIBRARY_PATH:/home/acp13gr/apps/sox/lib
|
15 |
+
PATH=$PATH:/home/acp13gr/apps/sox/bin
|
16 |
+
source activate py27
|
17 |
+
fi
|
18 |
+
if [[ "$HOSTNAME" == *"bessemer"* ]]; then
|
19 |
+
module load Anaconda3/5.3.0
|
20 |
+
source activate py27
|
21 |
+
module load fosscuda/2019a
|
22 |
+
module load imkl/2019.1.144-iimpi-2019a
|
23 |
+
|
24 |
+
# Sox PATH
|
25 |
+
LD_LIBRARY_PATH=$LD_LIBRARY_PATH:$HOME/apps/sox/lib
|
26 |
+
PATH=$PATH:$HOME/apps/sox/bin
|
27 |
+
fi
|
28 |
+
|
DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Preconstructed/DSing1.csv
ADDED
The diff for this file is too large to render.
See raw diff
|
|
DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Preconstructed/DSing3.csv
ADDED
The diff for this file is too large to render.
See raw diff
|
|
DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Preconstructed/dev.csv
ADDED
The diff for this file is too large to render.
See raw diff
|
|
DSing/sing_300x30x2/Kaldi-Dsing-task/DSing Preconstructed/test.csv
ADDED
The diff for this file is too large to render.
See raw diff
|
|
DSing/sing_300x30x2/Kaldi-Dsing-task/LICENSE
ADDED
@@ -0,0 +1,674 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
GNU GENERAL PUBLIC LICENSE
|
2 |
+
Version 3, 29 June 2007
|
3 |
+
|
4 |
+
Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
|
5 |
+
Everyone is permitted to copy and distribute verbatim copies
|
6 |
+
of this license document, but changing it is not allowed.
|
7 |
+
|
8 |
+
Preamble
|
9 |
+
|
10 |
+
The GNU General Public License is a free, copyleft license for
|
11 |
+
software and other kinds of works.
|
12 |
+
|
13 |
+
The licenses for most software and other practical works are designed
|
14 |
+
to take away your freedom to share and change the works. By contrast,
|
15 |
+
the GNU General Public License is intended to guarantee your freedom to
|
16 |
+
share and change all versions of a program--to make sure it remains free
|
17 |
+
software for all its users. We, the Free Software Foundation, use the
|
18 |
+
GNU General Public License for most of our software; it applies also to
|
19 |
+
any other work released this way by its authors. You can apply it to
|
20 |
+
your programs, too.
|
21 |
+
|
22 |
+
When we speak of free software, we are referring to freedom, not
|
23 |
+
price. Our General Public Licenses are designed to make sure that you
|
24 |
+
have the freedom to distribute copies of free software (and charge for
|
25 |
+
them if you wish), that you receive source code or can get it if you
|
26 |
+
want it, that you can change the software or use pieces of it in new
|
27 |
+
free programs, and that you know you can do these things.
|
28 |
+
|
29 |
+
To protect your rights, we need to prevent others from denying you
|
30 |
+
these rights or asking you to surrender the rights. Therefore, you have
|
31 |
+
certain responsibilities if you distribute copies of the software, or if
|
32 |
+
you modify it: responsibilities to respect the freedom of others.
|
33 |
+
|
34 |
+
For example, if you distribute copies of such a program, whether
|
35 |
+
gratis or for a fee, you must pass on to the recipients the same
|
36 |
+
freedoms that you received. You must make sure that they, too, receive
|
37 |
+
or can get the source code. And you must show them these terms so they
|
38 |
+
know their rights.
|
39 |
+
|
40 |
+
Developers that use the GNU GPL protect your rights with two steps:
|
41 |
+
(1) assert copyright on the software, and (2) offer you this License
|
42 |
+
giving you legal permission to copy, distribute and/or modify it.
|
43 |
+
|
44 |
+
For the developers' and authors' protection, the GPL clearly explains
|
45 |
+
that there is no warranty for this free software. For both users' and
|
46 |
+
authors' sake, the GPL requires that modified versions be marked as
|
47 |
+
changed, so that their problems will not be attributed erroneously to
|
48 |
+
authors of previous versions.
|
49 |
+
|
50 |
+
Some devices are designed to deny users access to install or run
|
51 |
+
modified versions of the software inside them, although the manufacturer
|
52 |
+
can do so. This is fundamentally incompatible with the aim of
|
53 |
+
protecting users' freedom to change the software. The systematic
|
54 |
+
pattern of such abuse occurs in the area of products for individuals to
|
55 |
+
use, which is precisely where it is most unacceptable. Therefore, we
|
56 |
+
have designed this version of the GPL to prohibit the practice for those
|
57 |
+
products. If such problems arise substantially in other domains, we
|
58 |
+
stand ready to extend this provision to those domains in future versions
|
59 |
+
of the GPL, as needed to protect the freedom of users.
|
60 |
+
|
61 |
+
Finally, every program is threatened constantly by software patents.
|
62 |
+
States should not allow patents to restrict development and use of
|
63 |
+
software on general-purpose computers, but in those that do, we wish to
|
64 |
+
avoid the special danger that patents applied to a free program could
|
65 |
+
make it effectively proprietary. To prevent this, the GPL assures that
|
66 |
+
patents cannot be used to render the program non-free.
|
67 |
+
|
68 |
+
The precise terms and conditions for copying, distribution and
|
69 |
+
modification follow.
|
70 |
+
|
71 |
+
TERMS AND CONDITIONS
|
72 |
+
|
73 |
+
0. Definitions.
|
74 |
+
|
75 |
+
"This License" refers to version 3 of the GNU General Public License.
|
76 |
+
|
77 |
+
"Copyright" also means copyright-like laws that apply to other kinds of
|
78 |
+
works, such as semiconductor masks.
|
79 |
+
|
80 |
+
"The Program" refers to any copyrightable work licensed under this
|
81 |
+
License. Each licensee is addressed as "you". "Licensees" and
|
82 |
+
"recipients" may be individuals or organizations.
|
83 |
+
|
84 |
+
To "modify" a work means to copy from or adapt all or part of the work
|
85 |
+
in a fashion requiring copyright permission, other than the making of an
|
86 |
+
exact copy. The resulting work is called a "modified version" of the
|
87 |
+
earlier work or a work "based on" the earlier work.
|
88 |
+
|
89 |
+
A "covered work" means either the unmodified Program or a work based
|
90 |
+
on the Program.
|
91 |
+
|
92 |
+
To "propagate" a work means to do anything with it that, without
|
93 |
+
permission, would make you directly or secondarily liable for
|
94 |
+
infringement under applicable copyright law, except executing it on a
|
95 |
+
computer or modifying a private copy. Propagation includes copying,
|
96 |
+
distribution (with or without modification), making available to the
|
97 |
+
public, and in some countries other activities as well.
|
98 |
+
|
99 |
+
To "convey" a work means any kind of propagation that enables other
|
100 |
+
parties to make or receive copies. Mere interaction with a user through
|
101 |
+
a computer network, with no transfer of a copy, is not conveying.
|
102 |
+
|
103 |
+
An interactive user interface displays "Appropriate Legal Notices"
|
104 |
+
to the extent that it includes a convenient and prominently visible
|
105 |
+
feature that (1) displays an appropriate copyright notice, and (2)
|
106 |
+
tells the user that there is no warranty for the work (except to the
|
107 |
+
extent that warranties are provided), that licensees may convey the
|
108 |
+
work under this License, and how to view a copy of this License. If
|
109 |
+
the interface presents a list of user commands or options, such as a
|
110 |
+
menu, a prominent item in the list meets this criterion.
|
111 |
+
|
112 |
+
1. Source Code.
|
113 |
+
|
114 |
+
The "source code" for a work means the preferred form of the work
|
115 |
+
for making modifications to it. "Object code" means any non-source
|
116 |
+
form of a work.
|
117 |
+
|
118 |
+
A "Standard Interface" means an interface that either is an official
|
119 |
+
standard defined by a recognized standards body, or, in the case of
|
120 |
+
interfaces specified for a particular programming language, one that
|
121 |
+
is widely used among developers working in that language.
|
122 |
+
|
123 |
+
The "System Libraries" of an executable work include anything, other
|
124 |
+
than the work as a whole, that (a) is included in the normal form of
|
125 |
+
packaging a Major Component, but which is not part of that Major
|
126 |
+
Component, and (b) serves only to enable use of the work with that
|
127 |
+
Major Component, or to implement a Standard Interface for which an
|
128 |
+
implementation is available to the public in source code form. A
|
129 |
+
"Major Component", in this context, means a major essential component
|
130 |
+
(kernel, window system, and so on) of the specific operating system
|
131 |
+
(if any) on which the executable work runs, or a compiler used to
|
132 |
+
produce the work, or an object code interpreter used to run it.
|
133 |
+
|
134 |
+
The "Corresponding Source" for a work in object code form means all
|
135 |
+
the source code needed to generate, install, and (for an executable
|
136 |
+
work) run the object code and to modify the work, including scripts to
|
137 |
+
control those activities. However, it does not include the work's
|
138 |
+
System Libraries, or general-purpose tools or generally available free
|
139 |
+
programs which are used unmodified in performing those activities but
|
140 |
+
which are not part of the work. For example, Corresponding Source
|
141 |
+
includes interface definition files associated with source files for
|
142 |
+
the work, and the source code for shared libraries and dynamically
|
143 |
+
linked subprograms that the work is specifically designed to require,
|
144 |
+
such as by intimate data communication or control flow between those
|
145 |
+
subprograms and other parts of the work.
|
146 |
+
|
147 |
+
The Corresponding Source need not include anything that users
|
148 |
+
can regenerate automatically from other parts of the Corresponding
|
149 |
+
Source.
|
150 |
+
|
151 |
+
The Corresponding Source for a work in source code form is that
|
152 |
+
same work.
|
153 |
+
|
154 |
+
2. Basic Permissions.
|
155 |
+
|
156 |
+
All rights granted under this License are granted for the term of
|
157 |
+
copyright on the Program, and are irrevocable provided the stated
|
158 |
+
conditions are met. This License explicitly affirms your unlimited
|
159 |
+
permission to run the unmodified Program. The output from running a
|
160 |
+
covered work is covered by this License only if the output, given its
|
161 |
+
content, constitutes a covered work. This License acknowledges your
|
162 |
+
rights of fair use or other equivalent, as provided by copyright law.
|
163 |
+
|
164 |
+
You may make, run and propagate covered works that you do not
|
165 |
+
convey, without conditions so long as your license otherwise remains
|
166 |
+
in force. You may convey covered works to others for the sole purpose
|
167 |
+
of having them make modifications exclusively for you, or provide you
|
168 |
+
with facilities for running those works, provided that you comply with
|
169 |
+
the terms of this License in conveying all material for which you do
|
170 |
+
not control copyright. Those thus making or running the covered works
|
171 |
+
for you must do so exclusively on your behalf, under your direction
|
172 |
+
and control, on terms that prohibit them from making any copies of
|
173 |
+
your copyrighted material outside their relationship with you.
|
174 |
+
|
175 |
+
Conveying under any other circumstances is permitted solely under
|
176 |
+
the conditions stated below. Sublicensing is not allowed; section 10
|
177 |
+
makes it unnecessary.
|
178 |
+
|
179 |
+
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
|
180 |
+
|
181 |
+
No covered work shall be deemed part of an effective technological
|
182 |
+
measure under any applicable law fulfilling obligations under article
|
183 |
+
11 of the WIPO copyright treaty adopted on 20 December 1996, or
|
184 |
+
similar laws prohibiting or restricting circumvention of such
|
185 |
+
measures.
|
186 |
+
|
187 |
+
When you convey a covered work, you waive any legal power to forbid
|
188 |
+
circumvention of technological measures to the extent such circumvention
|
189 |
+
is effected by exercising rights under this License with respect to
|
190 |
+
the covered work, and you disclaim any intention to limit operation or
|
191 |
+
modification of the work as a means of enforcing, against the work's
|
192 |
+
users, your or third parties' legal rights to forbid circumvention of
|
193 |
+
technological measures.
|
194 |
+
|
195 |
+
4. Conveying Verbatim Copies.
|
196 |
+
|
197 |
+
You may convey verbatim copies of the Program's source code as you
|
198 |
+
receive it, in any medium, provided that you conspicuously and
|
199 |
+
appropriately publish on each copy an appropriate copyright notice;
|
200 |
+
keep intact all notices stating that this License and any
|
201 |
+
non-permissive terms added in accord with section 7 apply to the code;
|
202 |
+
keep intact all notices of the absence of any warranty; and give all
|
203 |
+
recipients a copy of this License along with the Program.
|
204 |
+
|
205 |
+
You may charge any price or no price for each copy that you convey,
|
206 |
+
and you may offer support or warranty protection for a fee.
|
207 |
+
|
208 |
+
5. Conveying Modified Source Versions.
|
209 |
+
|
210 |
+
You may convey a work based on the Program, or the modifications to
|
211 |
+
produce it from the Program, in the form of source code under the
|
212 |
+
terms of section 4, provided that you also meet all of these conditions:
|
213 |
+
|
214 |
+
a) The work must carry prominent notices stating that you modified
|
215 |
+
it, and giving a relevant date.
|
216 |
+
|
217 |
+
b) The work must carry prominent notices stating that it is
|
218 |
+
released under this License and any conditions added under section
|
219 |
+
7. This requirement modifies the requirement in section 4 to
|
220 |
+
"keep intact all notices".
|
221 |
+
|
222 |
+
c) You must license the entire work, as a whole, under this
|
223 |
+
License to anyone who comes into possession of a copy. This
|
224 |
+
License will therefore apply, along with any applicable section 7
|
225 |
+
additional terms, to the whole of the work, and all its parts,
|
226 |
+
regardless of how they are packaged. This License gives no
|
227 |
+
permission to license the work in any other way, but it does not
|
228 |
+
invalidate such permission if you have separately received it.
|
229 |
+
|
230 |
+
d) If the work has interactive user interfaces, each must display
|
231 |
+
Appropriate Legal Notices; however, if the Program has interactive
|
232 |
+
interfaces that do not display Appropriate Legal Notices, your
|
233 |
+
work need not make them do so.
|
234 |
+
|
235 |
+
A compilation of a covered work with other separate and independent
|
236 |
+
works, which are not by their nature extensions of the covered work,
|
237 |
+
and which are not combined with it such as to form a larger program,
|
238 |
+
in or on a volume of a storage or distribution medium, is called an
|
239 |
+
"aggregate" if the compilation and its resulting copyright are not
|
240 |
+
used to limit the access or legal rights of the compilation's users
|
241 |
+
beyond what the individual works permit. Inclusion of a covered work
|
242 |
+
in an aggregate does not cause this License to apply to the other
|
243 |
+
parts of the aggregate.
|
244 |
+
|
245 |
+
6. Conveying Non-Source Forms.
|
246 |
+
|
247 |
+
You may convey a covered work in object code form under the terms
|
248 |
+
of sections 4 and 5, provided that you also convey the
|
249 |
+
machine-readable Corresponding Source under the terms of this License,
|
250 |
+
in one of these ways:
|
251 |
+
|
252 |
+
a) Convey the object code in, or embodied in, a physical product
|
253 |
+
(including a physical distribution medium), accompanied by the
|
254 |
+
Corresponding Source fixed on a durable physical medium
|
255 |
+
customarily used for software interchange.
|
256 |
+
|
257 |
+
b) Convey the object code in, or embodied in, a physical product
|
258 |
+
(including a physical distribution medium), accompanied by a
|
259 |
+
written offer, valid for at least three years and valid for as
|
260 |
+
long as you offer spare parts or customer support for that product
|
261 |
+
model, to give anyone who possesses the object code either (1) a
|
262 |
+
copy of the Corresponding Source for all the software in the
|
263 |
+
product that is covered by this License, on a durable physical
|
264 |
+
medium customarily used for software interchange, for a price no
|
265 |
+
more than your reasonable cost of physically performing this
|
266 |
+
conveying of source, or (2) access to copy the
|
267 |
+
Corresponding Source from a network server at no charge.
|
268 |
+
|
269 |
+
c) Convey individual copies of the object code with a copy of the
|
270 |
+
written offer to provide the Corresponding Source. This
|
271 |
+
alternative is allowed only occasionally and noncommercially, and
|
272 |
+
only if you received the object code with such an offer, in accord
|
273 |
+
with subsection 6b.
|
274 |
+
|
275 |
+
d) Convey the object code by offering access from a designated
|
276 |
+
place (gratis or for a charge), and offer equivalent access to the
|
277 |
+
Corresponding Source in the same way through the same place at no
|
278 |
+
further charge. You need not require recipients to copy the
|
279 |
+
Corresponding Source along with the object code. If the place to
|
280 |
+
copy the object code is a network server, the Corresponding Source
|
281 |
+
may be on a different server (operated by you or a third party)
|
282 |
+
that supports equivalent copying facilities, provided you maintain
|
283 |
+
clear directions next to the object code saying where to find the
|
284 |
+
Corresponding Source. Regardless of what server hosts the
|
285 |
+
Corresponding Source, you remain obligated to ensure that it is
|
286 |
+
available for as long as needed to satisfy these requirements.
|
287 |
+
|
288 |
+
e) Convey the object code using peer-to-peer transmission, provided
|
289 |
+
you inform other peers where the object code and Corresponding
|
290 |
+
Source of the work are being offered to the general public at no
|
291 |
+
charge under subsection 6d.
|
292 |
+
|
293 |
+
A separable portion of the object code, whose source code is excluded
|
294 |
+
from the Corresponding Source as a System Library, need not be
|
295 |
+
included in conveying the object code work.
|
296 |
+
|
297 |
+
A "User Product" is either (1) a "consumer product", which means any
|
298 |
+
tangible personal property which is normally used for personal, family,
|
299 |
+
or household purposes, or (2) anything designed or sold for incorporation
|
300 |
+
into a dwelling. In determining whether a product is a consumer product,
|
301 |
+
doubtful cases shall be resolved in favor of coverage. For a particular
|
302 |
+
product received by a particular user, "normally used" refers to a
|
303 |
+
typical or common use of that class of product, regardless of the status
|
304 |
+
of the particular user or of the way in which the particular user
|
305 |
+
actually uses, or expects or is expected to use, the product. A product
|
306 |
+
is a consumer product regardless of whether the product has substantial
|
307 |
+
commercial, industrial or non-consumer uses, unless such uses represent
|
308 |
+
the only significant mode of use of the product.
|
309 |
+
|
310 |
+
"Installation Information" for a User Product means any methods,
|
311 |
+
procedures, authorization keys, or other information required to install
|
312 |
+
and execute modified versions of a covered work in that User Product from
|
313 |
+
a modified version of its Corresponding Source. The information must
|
314 |
+
suffice to ensure that the continued functioning of the modified object
|
315 |
+
code is in no case prevented or interfered with solely because
|
316 |
+
modification has been made.
|
317 |
+
|
318 |
+
If you convey an object code work under this section in, or with, or
|
319 |
+
specifically for use in, a User Product, and the conveying occurs as
|
320 |
+
part of a transaction in which the right of possession and use of the
|
321 |
+
User Product is transferred to the recipient in perpetuity or for a
|
322 |
+
fixed term (regardless of how the transaction is characterized), the
|
323 |
+
Corresponding Source conveyed under this section must be accompanied
|
324 |
+
by the Installation Information. But this requirement does not apply
|
325 |
+
if neither you nor any third party retains the ability to install
|
326 |
+
modified object code on the User Product (for example, the work has
|
327 |
+
been installed in ROM).
|
328 |
+
|
329 |
+
The requirement to provide Installation Information does not include a
|
330 |
+
requirement to continue to provide support service, warranty, or updates
|
331 |
+
for a work that has been modified or installed by the recipient, or for
|
332 |
+
the User Product in which it has been modified or installed. Access to a
|
333 |
+
network may be denied when the modification itself materially and
|
334 |
+
adversely affects the operation of the network or violates the rules and
|
335 |
+
protocols for communication across the network.
|
336 |
+
|
337 |
+
Corresponding Source conveyed, and Installation Information provided,
|
338 |
+
in accord with this section must be in a format that is publicly
|
339 |
+
documented (and with an implementation available to the public in
|
340 |
+
source code form), and must require no special password or key for
|
341 |
+
unpacking, reading or copying.
|
342 |
+
|
343 |
+
7. Additional Terms.
|
344 |
+
|
345 |
+
"Additional permissions" are terms that supplement the terms of this
|
346 |
+
License by making exceptions from one or more of its conditions.
|
347 |
+
Additional permissions that are applicable to the entire Program shall
|
348 |
+
be treated as though they were included in this License, to the extent
|
349 |
+
that they are valid under applicable law. If additional permissions
|
350 |
+
apply only to part of the Program, that part may be used separately
|
351 |
+
under those permissions, but the entire Program remains governed by
|
352 |
+
this License without regard to the additional permissions.
|
353 |
+
|
354 |
+
When you convey a copy of a covered work, you may at your option
|
355 |
+
remove any additional permissions from that copy, or from any part of
|
356 |
+
it. (Additional permissions may be written to require their own
|
357 |
+
removal in certain cases when you modify the work.) You may place
|
358 |
+
additional permissions on material, added by you to a covered work,
|
359 |
+
for which you have or can give appropriate copyright permission.
|
360 |
+
|
361 |
+
Notwithstanding any other provision of this License, for material you
|
362 |
+
add to a covered work, you may (if authorized by the copyright holders of
|
363 |
+
that material) supplement the terms of this License with terms:
|
364 |
+
|
365 |
+
a) Disclaiming warranty or limiting liability differently from the
|
366 |
+
terms of sections 15 and 16 of this License; or
|
367 |
+
|
368 |
+
b) Requiring preservation of specified reasonable legal notices or
|
369 |
+
author attributions in that material or in the Appropriate Legal
|
370 |
+
Notices displayed by works containing it; or
|
371 |
+
|
372 |
+
c) Prohibiting misrepresentation of the origin of that material, or
|
373 |
+
requiring that modified versions of such material be marked in
|
374 |
+
reasonable ways as different from the original version; or
|
375 |
+
|
376 |
+
d) Limiting the use for publicity purposes of names of licensors or
|
377 |
+
authors of the material; or
|
378 |
+
|
379 |
+
e) Declining to grant rights under trademark law for use of some
|
380 |
+
trade names, trademarks, or service marks; or
|
381 |
+
|
382 |
+
f) Requiring indemnification of licensors and authors of that
|
383 |
+
material by anyone who conveys the material (or modified versions of
|
384 |
+
it) with contractual assumptions of liability to the recipient, for
|
385 |
+
any liability that these contractual assumptions directly impose on
|
386 |
+
those licensors and authors.
|
387 |
+
|
388 |
+
All other non-permissive additional terms are considered "further
|
389 |
+
restrictions" within the meaning of section 10. If the Program as you
|
390 |
+
received it, or any part of it, contains a notice stating that it is
|
391 |
+
governed by this License along with a term that is a further
|
392 |
+
restriction, you may remove that term. If a license document contains
|
393 |
+
a further restriction but permits relicensing or conveying under this
|
394 |
+
License, you may add to a covered work material governed by the terms
|
395 |
+
of that license document, provided that the further restriction does
|
396 |
+
not survive such relicensing or conveying.
|
397 |
+
|
398 |
+
If you add terms to a covered work in accord with this section, you
|
399 |
+
must place, in the relevant source files, a statement of the
|
400 |
+
additional terms that apply to those files, or a notice indicating
|
401 |
+
where to find the applicable terms.
|
402 |
+
|
403 |
+
Additional terms, permissive or non-permissive, may be stated in the
|
404 |
+
form of a separately written license, or stated as exceptions;
|
405 |
+
the above requirements apply either way.
|
406 |
+
|
407 |
+
8. Termination.
|
408 |
+
|
409 |
+
You may not propagate or modify a covered work except as expressly
|
410 |
+
provided under this License. Any attempt otherwise to propagate or
|
411 |
+
modify it is void, and will automatically terminate your rights under
|
412 |
+
this License (including any patent licenses granted under the third
|
413 |
+
paragraph of section 11).
|
414 |
+
|
415 |
+
However, if you cease all violation of this License, then your
|
416 |
+
license from a particular copyright holder is reinstated (a)
|
417 |
+
provisionally, unless and until the copyright holder explicitly and
|
418 |
+
finally terminates your license, and (b) permanently, if the copyright
|
419 |
+
holder fails to notify you of the violation by some reasonable means
|
420 |
+
prior to 60 days after the cessation.
|
421 |
+
|
422 |
+
Moreover, your license from a particular copyright holder is
|
423 |
+
reinstated permanently if the copyright holder notifies you of the
|
424 |
+
violation by some reasonable means, this is the first time you have
|
425 |
+
received notice of violation of this License (for any work) from that
|
426 |
+
copyright holder, and you cure the violation prior to 30 days after
|
427 |
+
your receipt of the notice.
|
428 |
+
|
429 |
+
Termination of your rights under this section does not terminate the
|
430 |
+
licenses of parties who have received copies or rights from you under
|
431 |
+
this License. If your rights have been terminated and not permanently
|
432 |
+
reinstated, you do not qualify to receive new licenses for the same
|
433 |
+
material under section 10.
|
434 |
+
|
435 |
+
9. Acceptance Not Required for Having Copies.
|
436 |
+
|
437 |
+
You are not required to accept this License in order to receive or
|
438 |
+
run a copy of the Program. Ancillary propagation of a covered work
|
439 |
+
occurring solely as a consequence of using peer-to-peer transmission
|
440 |
+
to receive a copy likewise does not require acceptance. However,
|
441 |
+
nothing other than this License grants you permission to propagate or
|
442 |
+
modify any covered work. These actions infringe copyright if you do
|
443 |
+
not accept this License. Therefore, by modifying or propagating a
|
444 |
+
covered work, you indicate your acceptance of this License to do so.
|
445 |
+
|
446 |
+
10. Automatic Licensing of Downstream Recipients.
|
447 |
+
|
448 |
+
Each time you convey a covered work, the recipient automatically
|
449 |
+
receives a license from the original licensors, to run, modify and
|
450 |
+
propagate that work, subject to this License. You are not responsible
|
451 |
+
for enforcing compliance by third parties with this License.
|
452 |
+
|
453 |
+
An "entity transaction" is a transaction transferring control of an
|
454 |
+
organization, or substantially all assets of one, or subdividing an
|
455 |
+
organization, or merging organizations. If propagation of a covered
|
456 |
+
work results from an entity transaction, each party to that
|
457 |
+
transaction who receives a copy of the work also receives whatever
|
458 |
+
licenses to the work the party's predecessor in interest had or could
|
459 |
+
give under the previous paragraph, plus a right to possession of the
|
460 |
+
Corresponding Source of the work from the predecessor in interest, if
|
461 |
+
the predecessor has it or can get it with reasonable efforts.
|
462 |
+
|
463 |
+
You may not impose any further restrictions on the exercise of the
|
464 |
+
rights granted or affirmed under this License. For example, you may
|
465 |
+
not impose a license fee, royalty, or other charge for exercise of
|
466 |
+
rights granted under this License, and you may not initiate litigation
|
467 |
+
(including a cross-claim or counterclaim in a lawsuit) alleging that
|
468 |
+
any patent claim is infringed by making, using, selling, offering for
|
469 |
+
sale, or importing the Program or any portion of it.
|
470 |
+
|
471 |
+
11. Patents.
|
472 |
+
|
473 |
+
A "contributor" is a copyright holder who authorizes use under this
|
474 |
+
License of the Program or a work on which the Program is based. The
|
475 |
+
work thus licensed is called the contributor's "contributor version".
|
476 |
+
|
477 |
+
A contributor's "essential patent claims" are all patent claims
|
478 |
+
owned or controlled by the contributor, whether already acquired or
|
479 |
+
hereafter acquired, that would be infringed by some manner, permitted
|
480 |
+
by this License, of making, using, or selling its contributor version,
|
481 |
+
but do not include claims that would be infringed only as a
|
482 |
+
consequence of further modification of the contributor version. For
|
483 |
+
purposes of this definition, "control" includes the right to grant
|
484 |
+
patent sublicenses in a manner consistent with the requirements of
|
485 |
+
this License.
|
486 |
+
|
487 |
+
Each contributor grants you a non-exclusive, worldwide, royalty-free
|
488 |
+
patent license under the contributor's essential patent claims, to
|
489 |
+
make, use, sell, offer for sale, import and otherwise run, modify and
|
490 |
+
propagate the contents of its contributor version.
|
491 |
+
|
492 |
+
In the following three paragraphs, a "patent license" is any express
|
493 |
+
agreement or commitment, however denominated, not to enforce a patent
|
494 |
+
(such as an express permission to practice a patent or covenant not to
|
495 |
+
sue for patent infringement). To "grant" such a patent license to a
|
496 |
+
party means to make such an agreement or commitment not to enforce a
|
497 |
+
patent against the party.
|
498 |
+
|
499 |
+
If you convey a covered work, knowingly relying on a patent license,
|
500 |
+
and the Corresponding Source of the work is not available for anyone
|
501 |
+
to copy, free of charge and under the terms of this License, through a
|
502 |
+
publicly available network server or other readily accessible means,
|
503 |
+
then you must either (1) cause the Corresponding Source to be so
|
504 |
+
available, or (2) arrange to deprive yourself of the benefit of the
|
505 |
+
patent license for this particular work, or (3) arrange, in a manner
|
506 |
+
consistent with the requirements of this License, to extend the patent
|
507 |
+
license to downstream recipients. "Knowingly relying" means you have
|
508 |
+
actual knowledge that, but for the patent license, your conveying the
|
509 |
+
covered work in a country, or your recipient's use of the covered work
|
510 |
+
in a country, would infringe one or more identifiable patents in that
|
511 |
+
country that you have reason to believe are valid.
|
512 |
+
|
513 |
+
If, pursuant to or in connection with a single transaction or
|
514 |
+
arrangement, you convey, or propagate by procuring conveyance of, a
|
515 |
+
covered work, and grant a patent license to some of the parties
|
516 |
+
receiving the covered work authorizing them to use, propagate, modify
|
517 |
+
or convey a specific copy of the covered work, then the patent license
|
518 |
+
you grant is automatically extended to all recipients of the covered
|
519 |
+
work and works based on it.
|
520 |
+
|
521 |
+
A patent license is "discriminatory" if it does not include within
|
522 |
+
the scope of its coverage, prohibits the exercise of, or is
|
523 |
+
conditioned on the non-exercise of one or more of the rights that are
|
524 |
+
specifically granted under this License. You may not convey a covered
|
525 |
+
work if you are a party to an arrangement with a third party that is
|
526 |
+
in the business of distributing software, under which you make payment
|
527 |
+
to the third party based on the extent of your activity of conveying
|
528 |
+
the work, and under which the third party grants, to any of the
|
529 |
+
parties who would receive the covered work from you, a discriminatory
|
530 |
+
patent license (a) in connection with copies of the covered work
|
531 |
+
conveyed by you (or copies made from those copies), or (b) primarily
|
532 |
+
for and in connection with specific products or compilations that
|
533 |
+
contain the covered work, unless you entered into that arrangement,
|
534 |
+
or that patent license was granted, prior to 28 March 2007.
|
535 |
+
|
536 |
+
Nothing in this License shall be construed as excluding or limiting
|
537 |
+
any implied license or other defenses to infringement that may
|
538 |
+
otherwise be available to you under applicable patent law.
|
539 |
+
|
540 |
+
12. No Surrender of Others' Freedom.
|
541 |
+
|
542 |
+
If conditions are imposed on you (whether by court order, agreement or
|
543 |
+
otherwise) that contradict the conditions of this License, they do not
|
544 |
+
excuse you from the conditions of this License. If you cannot convey a
|
545 |
+
covered work so as to satisfy simultaneously your obligations under this
|
546 |
+
License and any other pertinent obligations, then as a consequence you may
|
547 |
+
not convey it at all. For example, if you agree to terms that obligate you
|
548 |
+
to collect a royalty for further conveying from those to whom you convey
|
549 |
+
the Program, the only way you could satisfy both those terms and this
|
550 |
+
License would be to refrain entirely from conveying the Program.
|
551 |
+
|
552 |
+
13. Use with the GNU Affero General Public License.
|
553 |
+
|
554 |
+
Notwithstanding any other provision of this License, you have
|
555 |
+
permission to link or combine any covered work with a work licensed
|
556 |
+
under version 3 of the GNU Affero General Public License into a single
|
557 |
+
combined work, and to convey the resulting work. The terms of this
|
558 |
+
License will continue to apply to the part which is the covered work,
|
559 |
+
but the special requirements of the GNU Affero General Public License,
|
560 |
+
section 13, concerning interaction through a network will apply to the
|
561 |
+
combination as such.
|
562 |
+
|
563 |
+
14. Revised Versions of this License.
|
564 |
+
|
565 |
+
The Free Software Foundation may publish revised and/or new versions of
|
566 |
+
the GNU General Public License from time to time. Such new versions will
|
567 |
+
be similar in spirit to the present version, but may differ in detail to
|
568 |
+
address new problems or concerns.
|
569 |
+
|
570 |
+
Each version is given a distinguishing version number. If the
|
571 |
+
Program specifies that a certain numbered version of the GNU General
|
572 |
+
Public License "or any later version" applies to it, you have the
|
573 |
+
option of following the terms and conditions either of that numbered
|
574 |
+
version or of any later version published by the Free Software
|
575 |
+
Foundation. If the Program does not specify a version number of the
|
576 |
+
GNU General Public License, you may choose any version ever published
|
577 |
+
by the Free Software Foundation.
|
578 |
+
|
579 |
+
If the Program specifies that a proxy can decide which future
|
580 |
+
versions of the GNU General Public License can be used, that proxy's
|
581 |
+
public statement of acceptance of a version permanently authorizes you
|
582 |
+
to choose that version for the Program.
|
583 |
+
|
584 |
+
Later license versions may give you additional or different
|
585 |
+
permissions. However, no additional obligations are imposed on any
|
586 |
+
author or copyright holder as a result of your choosing to follow a
|
587 |
+
later version.
|
588 |
+
|
589 |
+
15. Disclaimer of Warranty.
|
590 |
+
|
591 |
+
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
|
592 |
+
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
|
593 |
+
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
|
594 |
+
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
|
595 |
+
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
596 |
+
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
|
597 |
+
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
|
598 |
+
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
599 |
+
|
600 |
+
16. Limitation of Liability.
|
601 |
+
|
602 |
+
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
603 |
+
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
|
604 |
+
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
|
605 |
+
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
|
606 |
+
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
|
607 |
+
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
|
608 |
+
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
|
609 |
+
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
|
610 |
+
SUCH DAMAGES.
|
611 |
+
|
612 |
+
17. Interpretation of Sections 15 and 16.
|
613 |
+
|
614 |
+
If the disclaimer of warranty and limitation of liability provided
|
615 |
+
above cannot be given local legal effect according to their terms,
|
616 |
+
reviewing courts shall apply local law that most closely approximates
|
617 |
+
an absolute waiver of all civil liability in connection with the
|
618 |
+
Program, unless a warranty or assumption of liability accompanies a
|
619 |
+
copy of the Program in return for a fee.
|
620 |
+
|
621 |
+
END OF TERMS AND CONDITIONS
|
622 |
+
|
623 |
+
How to Apply These Terms to Your New Programs
|
624 |
+
|
625 |
+
If you develop a new program, and you want it to be of the greatest
|
626 |
+
possible use to the public, the best way to achieve this is to make it
|
627 |
+
free software which everyone can redistribute and change under these terms.
|
628 |
+
|
629 |
+
To do so, attach the following notices to the program. It is safest
|
630 |
+
to attach them to the start of each source file to most effectively
|
631 |
+
state the exclusion of warranty; and each file should have at least
|
632 |
+
the "copyright" line and a pointer to where the full notice is found.
|
633 |
+
|
634 |
+
<one line to give the program's name and a brief idea of what it does.>
|
635 |
+
Copyright (C) <year> <name of author>
|
636 |
+
|
637 |
+
This program is free software: you can redistribute it and/or modify
|
638 |
+
it under the terms of the GNU General Public License as published by
|
639 |
+
the Free Software Foundation, either version 3 of the License, or
|
640 |
+
(at your option) any later version.
|
641 |
+
|
642 |
+
This program is distributed in the hope that it will be useful,
|
643 |
+
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
644 |
+
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
645 |
+
GNU General Public License for more details.
|
646 |
+
|
647 |
+
You should have received a copy of the GNU General Public License
|
648 |
+
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
649 |
+
|
650 |
+
Also add information on how to contact you by electronic and paper mail.
|
651 |
+
|
652 |
+
If the program does terminal interaction, make it output a short
|
653 |
+
notice like this when it starts in an interactive mode:
|
654 |
+
|
655 |
+
<program> Copyright (C) <year> <name of author>
|
656 |
+
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
657 |
+
This is free software, and you are welcome to redistribute it
|
658 |
+
under certain conditions; type `show c' for details.
|
659 |
+
|
660 |
+
The hypothetical commands `show w' and `show c' should show the appropriate
|
661 |
+
parts of the General Public License. Of course, your program's commands
|
662 |
+
might be different; for a GUI interface, you would use an "about box".
|
663 |
+
|
664 |
+
You should also get your employer (if you work as a programmer) or school,
|
665 |
+
if any, to sign a "copyright disclaimer" for the program, if necessary.
|
666 |
+
For more information on this, and how to apply and follow the GNU GPL, see
|
667 |
+
<https://www.gnu.org/licenses/>.
|
668 |
+
|
669 |
+
The GNU General Public License does not permit incorporating your program
|
670 |
+
into proprietary programs. If your program is a subroutine library, you
|
671 |
+
may consider it more useful to permit linking proprietary applications with
|
672 |
+
the library. If this is what you want to do, use the GNU Lesser General
|
673 |
+
Public License instead of this License. But first, please read
|
674 |
+
<https://www.gnu.org/licenses/why-not-lgpl.html>.
|
DSing/sing_300x30x2/Kaldi-Dsing-task/README.md
ADDED
@@ -0,0 +1,28 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
# DSing ASR task: Resources and Baseline for an unaccompanied singing ASR.
|
2 |
+
|
3 |
+
In this repository, you will find the scripts used to construct the DSing ASR-oriented dataset
|
4 |
+
and the baseline system constructed on Kaldi.
|
5 |
+
|
6 |
+
Cite:
|
7 |
+
```
|
8 |
+
@inproceedings{Roa_Dabike-Barker_2019,
|
9 |
+
author = {Roa Dabike, Gerardo and Barker, Jon}
|
10 |
+
title = {{Automatic Lyric Transcription from Karaoke Vocal Tracks: Resources and a Baseline System}},
|
11 |
+
year = 2019,
|
12 |
+
booktitle = {Proceedings of the 20th Annual Conference of the International Speech Communication Association (INTERSPEECH 2019)}
|
13 |
+
}
|
14 |
+
```
|
15 |
+
|
16 |
+
## 1- DSing dataset
|
17 |
+
|
18 |
+
DSing is an ASR-oriented dataset constructed from the [Smule Sing!300x30x2](https://ccrma.stanford.edu/damp/) dataset (**Sing!**).
|
19 |
+
This repository provides the scripts to transform **Sing!** to the DSing ASR task.
|
20 |
+
|
21 |
+
## 2- Initial steps
|
22 |
+
|
23 |
+
The first step before running any of the scripts is to obtain access to **Sing!** dataset.
|
24 |
+
For more details, go to [DAMP repository](https://ccrma.stanford.edu/damp/).
|
25 |
+
|
26 |
+
## 3- Extract DSing dataset using pre-segmented data.
|
27 |
+
|
28 |
+
In directory **[DSing preconstructed](DSing preconstructed)** you can find the DSing dataset segmentation.
|
DSing/sing_300x30x2/PT/PTArrangementMeta/235546191_2197388.txt
ADDED
@@ -0,0 +1,6 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
Arrangement ID: 235546191_2197388
|
2 |
+
Arrangement title: K.O.
|
3 |
+
Arrangement has lyrics: True
|
4 |
+
Arrangement has PitchTrack: False
|
5 |
+
Arrangement tags: pablo, vittar, pablovittar, ko, KO
|
6 |
+
Arrangement artist: Pablo Vittar
|
DSing/sing_300x30x2/PT/PTArrangementMeta/3771663_3771663.txt
ADDED
@@ -0,0 +1,6 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
Arrangement ID: 3771663_3771663
|
2 |
+
Arrangement title: Que Sorte a Nossa
|
3 |
+
Arrangement has lyrics: True
|
4 |
+
Arrangement has PitchTrack: True
|
5 |
+
Arrangement tags: 2010s, brasil, brasilian, brazil, brazillian, pop, portuguese, sertanejo
|
6 |
+
Arrangement artist: Matheus & Kauan
|
DSing/sing_300x30x2/PT/PTArrangementMeta/416273850_387685.txt
ADDED
@@ -0,0 +1,6 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
Arrangement ID: 416273850_387685
|
2 |
+
Arrangement title: Ó gente da minha terra
|
3 |
+
Arrangement has lyrics: True
|
4 |
+
Arrangement has PitchTrack: True
|
5 |
+
Arrangement tags: Mariza, gente, da, minha, terra, portuguesa, fado
|
6 |
+
Arrangement artist: Mariza
|
DSing/sing_300x30x2/PT/PTArrangementMeta/447282422_402184.txt
ADDED
@@ -0,0 +1,6 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
Arrangement ID: 447282422_402184
|
2 |
+
Arrangement title: Amar Não É Pecado
|
3 |
+
Arrangement has lyrics: True
|
4 |
+
Arrangement has PitchTrack: True
|
5 |
+
Arrangement tags:
|
6 |
+
Arrangement artist: Luan Santana
|
DSing/sing_300x30x2/PT/PTArrangementMeta/584358163_1439214.txt
ADDED
@@ -0,0 +1,6 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
Arrangement ID: 584358163_1439214
|
2 |
+
Arrangement title: Tumbalatum
|
3 |
+
Arrangement has lyrics: True
|
4 |
+
Arrangement has PitchTrack: False
|
5 |
+
Arrangement tags:
|
6 |
+
Arrangement artist: MC Kevinho
|