Datasets:
Add files using upload-large-folder tool
Browse files- .gitattributes +1 -59
- LICENSE.txt +395 -0
- README.md +97 -0
- build_parquet.py +340 -0
- data/labels.parquet +3 -0
- data/test-00000-of-00008.parquet +3 -0
- data/test-00001-of-00008.parquet +3 -0
- data/test-00002-of-00008.parquet +3 -0
- data/test-00003-of-00008.parquet +3 -0
- data/test-00004-of-00008.parquet +3 -0
- data/test-00005-of-00008.parquet +3 -0
- data/test-00006-of-00008.parquet +3 -0
- data/test-00007-of-00008.parquet +3 -0
- eval.yaml +25 -0
- push.py +38 -0
- submissions/README.md +81 -0
- submissions/results_template.yaml +44 -0
.gitattributes
CHANGED
|
@@ -1,60 +1,2 @@
|
|
| 1 |
-
*.
|
| 2 |
-
*.arrow filter=lfs diff=lfs merge=lfs -text
|
| 3 |
-
*.avro filter=lfs diff=lfs merge=lfs -text
|
| 4 |
-
*.bin filter=lfs diff=lfs merge=lfs -text
|
| 5 |
-
*.bz2 filter=lfs diff=lfs merge=lfs -text
|
| 6 |
-
*.ckpt filter=lfs diff=lfs merge=lfs -text
|
| 7 |
-
*.ftz filter=lfs diff=lfs merge=lfs -text
|
| 8 |
-
*.gz filter=lfs diff=lfs merge=lfs -text
|
| 9 |
-
*.h5 filter=lfs diff=lfs merge=lfs -text
|
| 10 |
-
*.joblib filter=lfs diff=lfs merge=lfs -text
|
| 11 |
-
*.lfs.* filter=lfs diff=lfs merge=lfs -text
|
| 12 |
-
*.lz4 filter=lfs diff=lfs merge=lfs -text
|
| 13 |
-
*.mds filter=lfs diff=lfs merge=lfs -text
|
| 14 |
-
*.mlmodel filter=lfs diff=lfs merge=lfs -text
|
| 15 |
-
*.model filter=lfs diff=lfs merge=lfs -text
|
| 16 |
-
*.msgpack filter=lfs diff=lfs merge=lfs -text
|
| 17 |
-
*.npy filter=lfs diff=lfs merge=lfs -text
|
| 18 |
-
*.npz filter=lfs diff=lfs merge=lfs -text
|
| 19 |
-
*.onnx filter=lfs diff=lfs merge=lfs -text
|
| 20 |
-
*.ot filter=lfs diff=lfs merge=lfs -text
|
| 21 |
*.parquet filter=lfs diff=lfs merge=lfs -text
|
| 22 |
-
*.pb filter=lfs diff=lfs merge=lfs -text
|
| 23 |
-
*.pickle filter=lfs diff=lfs merge=lfs -text
|
| 24 |
-
*.pkl filter=lfs diff=lfs merge=lfs -text
|
| 25 |
-
*.pt filter=lfs diff=lfs merge=lfs -text
|
| 26 |
-
*.pth filter=lfs diff=lfs merge=lfs -text
|
| 27 |
-
*.rar filter=lfs diff=lfs merge=lfs -text
|
| 28 |
-
*.safetensors filter=lfs diff=lfs merge=lfs -text
|
| 29 |
-
saved_model/**/* filter=lfs diff=lfs merge=lfs -text
|
| 30 |
-
*.tar.* filter=lfs diff=lfs merge=lfs -text
|
| 31 |
-
*.tar filter=lfs diff=lfs merge=lfs -text
|
| 32 |
-
*.tflite filter=lfs diff=lfs merge=lfs -text
|
| 33 |
-
*.tgz filter=lfs diff=lfs merge=lfs -text
|
| 34 |
-
*.wasm filter=lfs diff=lfs merge=lfs -text
|
| 35 |
-
*.xz filter=lfs diff=lfs merge=lfs -text
|
| 36 |
-
*.zip filter=lfs diff=lfs merge=lfs -text
|
| 37 |
-
*.zst filter=lfs diff=lfs merge=lfs -text
|
| 38 |
-
*tfevents* filter=lfs diff=lfs merge=lfs -text
|
| 39 |
-
# Audio files - uncompressed
|
| 40 |
-
*.pcm filter=lfs diff=lfs merge=lfs -text
|
| 41 |
-
*.sam filter=lfs diff=lfs merge=lfs -text
|
| 42 |
-
*.raw filter=lfs diff=lfs merge=lfs -text
|
| 43 |
-
# Audio files - compressed
|
| 44 |
-
*.aac filter=lfs diff=lfs merge=lfs -text
|
| 45 |
-
*.flac filter=lfs diff=lfs merge=lfs -text
|
| 46 |
-
*.mp3 filter=lfs diff=lfs merge=lfs -text
|
| 47 |
-
*.ogg filter=lfs diff=lfs merge=lfs -text
|
| 48 |
-
*.wav filter=lfs diff=lfs merge=lfs -text
|
| 49 |
-
# Image files - uncompressed
|
| 50 |
-
*.bmp filter=lfs diff=lfs merge=lfs -text
|
| 51 |
-
*.gif filter=lfs diff=lfs merge=lfs -text
|
| 52 |
-
*.png filter=lfs diff=lfs merge=lfs -text
|
| 53 |
-
*.tiff filter=lfs diff=lfs merge=lfs -text
|
| 54 |
-
# Image files - compressed
|
| 55 |
-
*.jpg filter=lfs diff=lfs merge=lfs -text
|
| 56 |
-
*.jpeg filter=lfs diff=lfs merge=lfs -text
|
| 57 |
-
*.webp filter=lfs diff=lfs merge=lfs -text
|
| 58 |
-
# Video files - compressed
|
| 59 |
-
*.mp4 filter=lfs diff=lfs merge=lfs -text
|
| 60 |
-
*.webm filter=lfs diff=lfs merge=lfs -text
|
|
|
|
| 1 |
+
*.tar.gz filter=lfs diff=lfs merge=lfs -text
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 2 |
*.parquet filter=lfs diff=lfs merge=lfs -text
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
LICENSE.txt
ADDED
|
@@ -0,0 +1,395 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
Attribution 4.0 International
|
| 2 |
+
|
| 3 |
+
=======================================================================
|
| 4 |
+
|
| 5 |
+
Creative Commons Corporation ("Creative Commons") is not a law firm and
|
| 6 |
+
does not provide legal services or legal advice. Distribution of
|
| 7 |
+
Creative Commons public licenses does not create a lawyer-client or
|
| 8 |
+
other relationship. Creative Commons makes its licenses and related
|
| 9 |
+
information available on an "as-is" basis. Creative Commons gives no
|
| 10 |
+
warranties regarding its licenses, any material licensed under their
|
| 11 |
+
terms and conditions, or any related information. Creative Commons
|
| 12 |
+
disclaims all liability for damages resulting from their use to the
|
| 13 |
+
fullest extent possible.
|
| 14 |
+
|
| 15 |
+
Using Creative Commons Public Licenses
|
| 16 |
+
|
| 17 |
+
Creative Commons public licenses provide a standard set of terms and
|
| 18 |
+
conditions that creators and other rights holders may use to share
|
| 19 |
+
original works of authorship and other material subject to copyright
|
| 20 |
+
and certain other rights specified in the public license below. The
|
| 21 |
+
following considerations are for informational purposes only, are not
|
| 22 |
+
exhaustive, and do not form part of our licenses.
|
| 23 |
+
|
| 24 |
+
Considerations for licensors: Our public licenses are
|
| 25 |
+
intended for use by those authorized to give the public
|
| 26 |
+
permission to use material in ways otherwise restricted by
|
| 27 |
+
copyright and certain other rights. Our licenses are
|
| 28 |
+
irrevocable. Licensors should read and understand the terms
|
| 29 |
+
and conditions of the license they choose before applying it.
|
| 30 |
+
Licensors should also secure all rights necessary before
|
| 31 |
+
applying our licenses so that the public can reuse the
|
| 32 |
+
material as expected. Licensors should clearly mark any
|
| 33 |
+
material not subject to the license. This includes other CC-
|
| 34 |
+
licensed material, or material used under an exception or
|
| 35 |
+
limitation to copyright. More considerations for licensors:
|
| 36 |
+
wiki.creativecommons.org/Considerations_for_licensors
|
| 37 |
+
|
| 38 |
+
Considerations for the public: By using one of our public
|
| 39 |
+
licenses, a licensor grants the public permission to use the
|
| 40 |
+
licensed material under specified terms and conditions. If
|
| 41 |
+
the licensor's permission is not necessary for any reason--for
|
| 42 |
+
example, because of any applicable exception or limitation to
|
| 43 |
+
copyright--then that use is not regulated by the license. Our
|
| 44 |
+
licenses grant only permissions under copyright and certain
|
| 45 |
+
other rights that a licensor has authority to grant. Use of
|
| 46 |
+
the licensed material may still be restricted for other
|
| 47 |
+
reasons, including because others have copyright or other
|
| 48 |
+
rights in the material. A licensor may make special requests,
|
| 49 |
+
such as asking that all changes be marked or described.
|
| 50 |
+
Although not required by our licenses, you are encouraged to
|
| 51 |
+
respect those requests where reasonable. More considerations
|
| 52 |
+
for the public:
|
| 53 |
+
wiki.creativecommons.org/Considerations_for_licensees
|
| 54 |
+
|
| 55 |
+
=======================================================================
|
| 56 |
+
|
| 57 |
+
Creative Commons Attribution 4.0 International Public License
|
| 58 |
+
|
| 59 |
+
By exercising the Licensed Rights (defined below), You accept and agree
|
| 60 |
+
to be bound by the terms and conditions of this Creative Commons
|
| 61 |
+
Attribution 4.0 International Public License ("Public License"). To the
|
| 62 |
+
extent this Public License may be interpreted as a contract, You are
|
| 63 |
+
granted the Licensed Rights in consideration of Your acceptance of
|
| 64 |
+
these terms and conditions, and the Licensor grants You such rights in
|
| 65 |
+
consideration of benefits the Licensor receives from making the
|
| 66 |
+
Licensed Material available under these terms and conditions.
|
| 67 |
+
|
| 68 |
+
|
| 69 |
+
Section 1 -- Definitions.
|
| 70 |
+
|
| 71 |
+
a. Adapted Material means material subject to Copyright and Similar
|
| 72 |
+
Rights that is derived from or based upon the Licensed Material
|
| 73 |
+
and in which the Licensed Material is translated, altered,
|
| 74 |
+
arranged, transformed, or otherwise modified in a manner requiring
|
| 75 |
+
permission under the Copyright and Similar Rights held by the
|
| 76 |
+
Licensor. For purposes of this Public License, where the Licensed
|
| 77 |
+
Material is a musical work, performance, or sound recording,
|
| 78 |
+
Adapted Material is always produced where the Licensed Material is
|
| 79 |
+
synched in timed relation with a moving image.
|
| 80 |
+
|
| 81 |
+
b. Adapter's License means the license You apply to Your Copyright
|
| 82 |
+
and Similar Rights in Your contributions to Adapted Material in
|
| 83 |
+
accordance with the terms and conditions of this Public License.
|
| 84 |
+
|
| 85 |
+
c. Copyright and Similar Rights means copyright and/or similar rights
|
| 86 |
+
closely related to copyright including, without limitation,
|
| 87 |
+
performance, broadcast, sound recording, and Sui Generis Database
|
| 88 |
+
Rights, without regard to how the rights are labeled or
|
| 89 |
+
categorized. For purposes of this Public License, the rights
|
| 90 |
+
specified in Section 2(b)(1)-(2) are not Copyright and Similar
|
| 91 |
+
Rights.
|
| 92 |
+
|
| 93 |
+
d. Effective Technological Measures means those measures that, in the
|
| 94 |
+
absence of proper authority, may not be circumvented under laws
|
| 95 |
+
fulfilling obligations under Article 11 of the WIPO Copyright
|
| 96 |
+
Treaty adopted on December 20, 1996, and/or similar international
|
| 97 |
+
agreements.
|
| 98 |
+
|
| 99 |
+
e. Exceptions and Limitations means fair use, fair dealing, and/or
|
| 100 |
+
any other exception or limitation to Copyright and Similar Rights
|
| 101 |
+
that applies to Your use of the Licensed Material.
|
| 102 |
+
|
| 103 |
+
f. Licensed Material means the artistic or literary work, database,
|
| 104 |
+
or other material to which the Licensor applied this Public
|
| 105 |
+
License.
|
| 106 |
+
|
| 107 |
+
g. Licensed Rights means the rights granted to You subject to the
|
| 108 |
+
terms and conditions of this Public License, which are limited to
|
| 109 |
+
all Copyright and Similar Rights that apply to Your use of the
|
| 110 |
+
Licensed Material and that the Licensor has authority to license.
|
| 111 |
+
|
| 112 |
+
h. Licensor means the individual(s) or entity(ies) granting rights
|
| 113 |
+
under this Public License.
|
| 114 |
+
|
| 115 |
+
i. Share means to provide material to the public by any means or
|
| 116 |
+
process that requires permission under the Licensed Rights, such
|
| 117 |
+
as reproduction, public display, public performance, distribution,
|
| 118 |
+
dissemination, communication, or importation, and to make material
|
| 119 |
+
available to the public including in ways that members of the
|
| 120 |
+
public may access the material from a place and at a time
|
| 121 |
+
individually chosen by them.
|
| 122 |
+
|
| 123 |
+
j. Sui Generis Database Rights means rights other than copyright
|
| 124 |
+
resulting from Directive 96/9/EC of the European Parliament and of
|
| 125 |
+
the Council of 11 March 1996 on the legal protection of databases,
|
| 126 |
+
as amended and/or succeeded, as well as other essentially
|
| 127 |
+
equivalent rights anywhere in the world.
|
| 128 |
+
|
| 129 |
+
k. You means the individual or entity exercising the Licensed Rights
|
| 130 |
+
under this Public License. Your has a corresponding meaning.
|
| 131 |
+
|
| 132 |
+
|
| 133 |
+
Section 2 -- Scope.
|
| 134 |
+
|
| 135 |
+
a. License grant.
|
| 136 |
+
|
| 137 |
+
1. Subject to the terms and conditions of this Public License,
|
| 138 |
+
the Licensor hereby grants You a worldwide, royalty-free,
|
| 139 |
+
non-sublicensable, non-exclusive, irrevocable license to
|
| 140 |
+
exercise the Licensed Rights in the Licensed Material to:
|
| 141 |
+
|
| 142 |
+
a. reproduce and Share the Licensed Material, in whole or
|
| 143 |
+
in part; and
|
| 144 |
+
|
| 145 |
+
b. produce, reproduce, and Share Adapted Material.
|
| 146 |
+
|
| 147 |
+
2. Exceptions and Limitations. For the avoidance of doubt, where
|
| 148 |
+
Exceptions and Limitations apply to Your use, this Public
|
| 149 |
+
License does not apply, and You do not need to comply with
|
| 150 |
+
its terms and conditions.
|
| 151 |
+
|
| 152 |
+
3. Term. The term of this Public License is specified in Section
|
| 153 |
+
6(a).
|
| 154 |
+
|
| 155 |
+
4. Media and formats; technical modifications allowed. The
|
| 156 |
+
Licensor authorizes You to exercise the Licensed Rights in
|
| 157 |
+
all media and formats whether now known or hereafter created,
|
| 158 |
+
and to make technical modifications necessary to do so. The
|
| 159 |
+
Licensor waives and/or agrees not to assert any right or
|
| 160 |
+
authority to forbid You from making technical modifications
|
| 161 |
+
necessary to exercise the Licensed Rights, including
|
| 162 |
+
technical modifications necessary to circumvent Effective
|
| 163 |
+
Technological Measures. For purposes of this Public License,
|
| 164 |
+
simply making modifications authorized by this Section 2(a)
|
| 165 |
+
(4) never produces Adapted Material.
|
| 166 |
+
|
| 167 |
+
5. Downstream recipients.
|
| 168 |
+
|
| 169 |
+
a. Offer from the Licensor -- Licensed Material. Every
|
| 170 |
+
recipient of the Licensed Material automatically
|
| 171 |
+
receives an offer from the Licensor to exercise the
|
| 172 |
+
Licensed Rights under the terms and conditions of this
|
| 173 |
+
Public License.
|
| 174 |
+
|
| 175 |
+
b. No downstream restrictions. You may not offer or impose
|
| 176 |
+
any additional or different terms or conditions on, or
|
| 177 |
+
apply any Effective Technological Measures to, the
|
| 178 |
+
Licensed Material if doing so restricts exercise of the
|
| 179 |
+
Licensed Rights by any recipient of the Licensed
|
| 180 |
+
Material.
|
| 181 |
+
|
| 182 |
+
6. No endorsement. Nothing in this Public License constitutes or
|
| 183 |
+
may be construed as permission to assert or imply that You
|
| 184 |
+
are, or that Your use of the Licensed Material is, connected
|
| 185 |
+
with, or sponsored, endorsed, or granted official status by,
|
| 186 |
+
the Licensor or others designated to receive attribution as
|
| 187 |
+
provided in Section 3(a)(1)(A)(i).
|
| 188 |
+
|
| 189 |
+
b. Other rights.
|
| 190 |
+
|
| 191 |
+
1. Moral rights, such as the right of integrity, are not
|
| 192 |
+
licensed under this Public License, nor are publicity,
|
| 193 |
+
privacy, and/or other similar personality rights; however, to
|
| 194 |
+
the extent possible, the Licensor waives and/or agrees not to
|
| 195 |
+
assert any such rights held by the Licensor to the limited
|
| 196 |
+
extent necessary to allow You to exercise the Licensed
|
| 197 |
+
Rights, but not otherwise.
|
| 198 |
+
|
| 199 |
+
2. Patent and trademark rights are not licensed under this
|
| 200 |
+
Public License.
|
| 201 |
+
|
| 202 |
+
3. To the extent possible, the Licensor waives any right to
|
| 203 |
+
collect royalties from You for the exercise of the Licensed
|
| 204 |
+
Rights, whether directly or through a collecting society
|
| 205 |
+
under any voluntary or waivable statutory or compulsory
|
| 206 |
+
licensing scheme. In all other cases the Licensor expressly
|
| 207 |
+
reserves any right to collect such royalties.
|
| 208 |
+
|
| 209 |
+
|
| 210 |
+
Section 3 -- License Conditions.
|
| 211 |
+
|
| 212 |
+
Your exercise of the Licensed Rights is expressly made subject to the
|
| 213 |
+
following conditions.
|
| 214 |
+
|
| 215 |
+
a. Attribution.
|
| 216 |
+
|
| 217 |
+
1. If You Share the Licensed Material (including in modified
|
| 218 |
+
form), You must:
|
| 219 |
+
|
| 220 |
+
a. retain the following if it is supplied by the Licensor
|
| 221 |
+
with the Licensed Material:
|
| 222 |
+
|
| 223 |
+
i. identification of the creator(s) of the Licensed
|
| 224 |
+
Material and any others designated to receive
|
| 225 |
+
attribution, in any reasonable manner requested by
|
| 226 |
+
the Licensor (including by pseudonym if
|
| 227 |
+
designated);
|
| 228 |
+
|
| 229 |
+
ii. a copyright notice;
|
| 230 |
+
|
| 231 |
+
iii. a notice that refers to this Public License;
|
| 232 |
+
|
| 233 |
+
iv. a notice that refers to the disclaimer of
|
| 234 |
+
warranties;
|
| 235 |
+
|
| 236 |
+
v. a URI or hyperlink to the Licensed Material to the
|
| 237 |
+
extent reasonably practicable;
|
| 238 |
+
|
| 239 |
+
b. indicate if You modified the Licensed Material and
|
| 240 |
+
retain an indication of any previous modifications; and
|
| 241 |
+
|
| 242 |
+
c. indicate the Licensed Material is licensed under this
|
| 243 |
+
Public License, and include the text of, or the URI or
|
| 244 |
+
hyperlink to, this Public License.
|
| 245 |
+
|
| 246 |
+
2. You may satisfy the conditions in Section 3(a)(1) in any
|
| 247 |
+
reasonable manner based on the medium, means, and context in
|
| 248 |
+
which You Share the Licensed Material. For example, it may be
|
| 249 |
+
reasonable to satisfy the conditions by providing a URI or
|
| 250 |
+
hyperlink to a resource that includes the required
|
| 251 |
+
information.
|
| 252 |
+
|
| 253 |
+
3. If requested by the Licensor, You must remove any of the
|
| 254 |
+
information required by Section 3(a)(1)(A) to the extent
|
| 255 |
+
reasonably practicable.
|
| 256 |
+
|
| 257 |
+
4. If You Share Adapted Material You produce, the Adapter's
|
| 258 |
+
License You apply must not prevent recipients of the Adapted
|
| 259 |
+
Material from complying with this Public License.
|
| 260 |
+
|
| 261 |
+
|
| 262 |
+
Section 4 -- Sui Generis Database Rights.
|
| 263 |
+
|
| 264 |
+
Where the Licensed Rights include Sui Generis Database Rights that
|
| 265 |
+
apply to Your use of the Licensed Material:
|
| 266 |
+
|
| 267 |
+
a. for the avoidance of doubt, Section 2(a)(1) grants You the right
|
| 268 |
+
to extract, reuse, reproduce, and Share all or a substantial
|
| 269 |
+
portion of the contents of the database;
|
| 270 |
+
|
| 271 |
+
b. if You include all or a substantial portion of the database
|
| 272 |
+
contents in a database in which You have Sui Generis Database
|
| 273 |
+
Rights, then the database in which You have Sui Generis Database
|
| 274 |
+
Rights (but not its individual contents) is Adapted Material; and
|
| 275 |
+
|
| 276 |
+
c. You must comply with the conditions in Section 3(a) if You Share
|
| 277 |
+
all or a substantial portion of the contents of the database.
|
| 278 |
+
|
| 279 |
+
For the avoidance of doubt, this Section 4 supplements and does not
|
| 280 |
+
replace Your obligations under this Public License where the Licensed
|
| 281 |
+
Rights include other Copyright and Similar Rights.
|
| 282 |
+
|
| 283 |
+
|
| 284 |
+
Section 5 -- Disclaimer of Warranties and Limitation of Liability.
|
| 285 |
+
|
| 286 |
+
a. UNLESS OTHERWISE SEPARATELY UNDERTAKEN BY THE LICENSOR, TO THE
|
| 287 |
+
EXTENT POSSIBLE, THE LICENSOR OFFERS THE LICENSED MATERIAL AS-IS
|
| 288 |
+
AND AS-AVAILABLE, AND MAKES NO REPRESENTATIONS OR WARRANTIES OF
|
| 289 |
+
ANY KIND CONCERNING THE LICENSED MATERIAL, WHETHER EXPRESS,
|
| 290 |
+
IMPLIED, STATUTORY, OR OTHER. THIS INCLUDES, WITHOUT LIMITATION,
|
| 291 |
+
WARRANTIES OF TITLE, MERCHANTABILITY, FITNESS FOR A PARTICULAR
|
| 292 |
+
PURPOSE, NON-INFRINGEMENT, ABSENCE OF LATENT OR OTHER DEFECTS,
|
| 293 |
+
ACCURACY, OR THE PRESENCE OR ABSENCE OF ERRORS, WHETHER OR NOT
|
| 294 |
+
KNOWN OR DISCOVERABLE. WHERE DISCLAIMERS OF WARRANTIES ARE NOT
|
| 295 |
+
ALLOWED IN FULL OR IN PART, THIS DISCLAIMER MAY NOT APPLY TO YOU.
|
| 296 |
+
|
| 297 |
+
b. TO THE EXTENT POSSIBLE, IN NO EVENT WILL THE LICENSOR BE LIABLE
|
| 298 |
+
TO YOU ON ANY LEGAL THEORY (INCLUDING, WITHOUT LIMITATION,
|
| 299 |
+
NEGLIGENCE) OR OTHERWISE FOR ANY DIRECT, SPECIAL, INDIRECT,
|
| 300 |
+
INCIDENTAL, CONSEQUENTIAL, PUNITIVE, EXEMPLARY, OR OTHER LOSSES,
|
| 301 |
+
COSTS, EXPENSES, OR DAMAGES ARISING OUT OF THIS PUBLIC LICENSE OR
|
| 302 |
+
USE OF THE LICENSED MATERIAL, EVEN IF THE LICENSOR HAS BEEN
|
| 303 |
+
ADVISED OF THE POSSIBILITY OF SUCH LOSSES, COSTS, EXPENSES, OR
|
| 304 |
+
DAMAGES. WHERE A LIMITATION OF LIABILITY IS NOT ALLOWED IN FULL OR
|
| 305 |
+
IN PART, THIS LIMITATION MAY NOT APPLY TO YOU.
|
| 306 |
+
|
| 307 |
+
c. The disclaimer of warranties and limitation of liability provided
|
| 308 |
+
above shall be interpreted in a manner that, to the extent
|
| 309 |
+
possible, most closely approximates an absolute disclaimer and
|
| 310 |
+
waiver of all liability.
|
| 311 |
+
|
| 312 |
+
|
| 313 |
+
Section 6 -- Term and Termination.
|
| 314 |
+
|
| 315 |
+
a. This Public License applies for the term of the Copyright and
|
| 316 |
+
Similar Rights licensed here. However, if You fail to comply with
|
| 317 |
+
this Public License, then Your rights under this Public License
|
| 318 |
+
terminate automatically.
|
| 319 |
+
|
| 320 |
+
b. Where Your right to use the Licensed Material has terminated under
|
| 321 |
+
Section 6(a), it reinstates:
|
| 322 |
+
|
| 323 |
+
1. automatically as of the date the violation is cured, provided
|
| 324 |
+
it is cured within 30 days of Your discovery of the
|
| 325 |
+
violation; or
|
| 326 |
+
|
| 327 |
+
2. upon express reinstatement by the Licensor.
|
| 328 |
+
|
| 329 |
+
For the avoidance of doubt, this Section 6(b) does not affect any
|
| 330 |
+
right the Licensor may have to seek remedies for Your violations
|
| 331 |
+
of this Public License.
|
| 332 |
+
|
| 333 |
+
c. For the avoidance of doubt, the Licensor may also offer the
|
| 334 |
+
Licensed Material under separate terms or conditions or stop
|
| 335 |
+
distributing the Licensed Material at any time; however, doing so
|
| 336 |
+
will not terminate this Public License.
|
| 337 |
+
|
| 338 |
+
d. Sections 1, 5, 6, 7, and 8 survive termination of this Public
|
| 339 |
+
License.
|
| 340 |
+
|
| 341 |
+
|
| 342 |
+
Section 7 -- Other Terms and Conditions.
|
| 343 |
+
|
| 344 |
+
a. The Licensor shall not be bound by any additional or different
|
| 345 |
+
terms or conditions communicated by You unless expressly agreed.
|
| 346 |
+
|
| 347 |
+
b. Any arrangements, understandings, or agreements regarding the
|
| 348 |
+
Licensed Material not stated herein are separate from and
|
| 349 |
+
independent of the terms and conditions of this Public License.
|
| 350 |
+
|
| 351 |
+
|
| 352 |
+
Section 8 -- Interpretation.
|
| 353 |
+
|
| 354 |
+
a. For the avoidance of doubt, this Public License does not, and
|
| 355 |
+
shall not be interpreted to, reduce, limit, restrict, or impose
|
| 356 |
+
conditions on any use of the Licensed Material that could lawfully
|
| 357 |
+
be made without permission under this Public License.
|
| 358 |
+
|
| 359 |
+
b. To the extent possible, if any provision of this Public License is
|
| 360 |
+
deemed unenforceable, it shall be automatically reformed to the
|
| 361 |
+
minimum extent necessary to make it enforceable. If the provision
|
| 362 |
+
cannot be reformed, it shall be severed from this Public License
|
| 363 |
+
without affecting the enforceability of the remaining terms and
|
| 364 |
+
conditions.
|
| 365 |
+
|
| 366 |
+
c. No term or condition of this Public License will be waived and no
|
| 367 |
+
failure to comply consented to unless expressly agreed to by the
|
| 368 |
+
Licensor.
|
| 369 |
+
|
| 370 |
+
d. Nothing in this Public License constitutes or may be interpreted
|
| 371 |
+
as a limitation upon, or waiver of, any privileges and immunities
|
| 372 |
+
that apply to the Licensor or You, including from the legal
|
| 373 |
+
processes of any jurisdiction or authority.
|
| 374 |
+
|
| 375 |
+
|
| 376 |
+
=======================================================================
|
| 377 |
+
|
| 378 |
+
Creative Commons is not a party to its public licenses.
|
| 379 |
+
Notwithstanding, Creative Commons may elect to apply one of its public
|
| 380 |
+
licenses to material it publishes and in those instances will be
|
| 381 |
+
considered the “Licensor.” The text of the Creative Commons public
|
| 382 |
+
licenses is dedicated to the public domain under the CC0 Public Domain
|
| 383 |
+
Dedication. Except for the limited purpose of indicating that material
|
| 384 |
+
is shared under a Creative Commons public license or as otherwise
|
| 385 |
+
permitted by the Creative Commons policies published at
|
| 386 |
+
creativecommons.org/policies, Creative Commons does not authorize the
|
| 387 |
+
use of the trademark "Creative Commons" or any other trademark or logo
|
| 388 |
+
of Creative Commons without its prior written consent including,
|
| 389 |
+
without limitation, in connection with any unauthorized modifications
|
| 390 |
+
to any of its public licenses or any other arrangements,
|
| 391 |
+
understandings, or agreements concerning use of licensed material. For
|
| 392 |
+
the avoidance of doubt, this paragraph does not form part of the public
|
| 393 |
+
licenses.
|
| 394 |
+
|
| 395 |
+
Creative Commons may be contacted at creativecommons.org.
|
README.md
ADDED
|
@@ -0,0 +1,97 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
---
|
| 2 |
+
license: cc-by-4.0
|
| 3 |
+
language:
|
| 4 |
+
- en
|
| 5 |
+
- zh
|
| 6 |
+
pretty_name: DECRO (eval)
|
| 7 |
+
task_categories:
|
| 8 |
+
- audio-classification
|
| 9 |
+
size_categories:
|
| 10 |
+
- 10K<n<100K
|
| 11 |
+
configs:
|
| 12 |
+
- config_name: default
|
| 13 |
+
data_files:
|
| 14 |
+
- split: test
|
| 15 |
+
path: "data/test-*.parquet"
|
| 16 |
+
tags:
|
| 17 |
+
- anti-spoofing
|
| 18 |
+
- audio-deepfake-detection
|
| 19 |
+
- speech
|
| 20 |
+
- benchmark
|
| 21 |
+
- arena-ready
|
| 22 |
+
arxiv:
|
| 23 |
+
- "10.1145/3543507.3583222"
|
| 24 |
+
---
|
| 25 |
+
|
| 26 |
+
# DECRO (eval)
|
| 27 |
+
|
| 28 |
+
Benchmark-ready packaging of the **evaluation partition** of the **DECRO** (DEepfake CROss-lingual) dataset — a cross-lingual (English + Chinese) speech anti-spoofing / synthetic-voice detection benchmark from *Transferring Audio Deepfake Detection Capability across Languages* (TheWebConf / WWW 2023).
|
| 29 |
+
|
| 30 |
+
## Overview
|
| 31 |
+
|
| 32 |
+
DECRO pairs an English and a Chinese subset whose spoofed speech is generated with the **same** synthesis algorithms, so it isolates the effect of language on deepfake detection. The task is binary classification: **bonafide** (genuine human speech) vs. **spoof** (TTS / VC synthetic speech). This packaging contains the **eval** split of **both** language subsets, combined into a single test set. The original dataset is at https://github.com/petrichorwq/DECRO-dataset.
|
| 33 |
+
|
| 34 |
+
## License & redistribution
|
| 35 |
+
|
| 36 |
+
Redistributed under the **Creative Commons Attribution 4.0 International (CC BY 4.0)** license — the upstream DECRO license. See `LICENSE.txt`. CC BY 4.0 permits redistribution and derivative works with attribution. Labels and the evaluation protocol are unmodified; the audio was decoded and re-encoded to canonical 16 kHz mono FLAC (the source mixes sampling rates — 16 / 22.05 / 24 / 44.1 kHz — and a few FLOAT-subtype WAVs, so a uniform 16 kHz re-encode is required for evaluation).
|
| 37 |
+
|
| 38 |
+
## Schema
|
| 39 |
+
|
| 40 |
+
| Column | Type | Description |
|
| 41 |
+
|--------|------|-------------|
|
| 42 |
+
| `path` | `string` | `<utterance_id>.flac`, unique |
|
| 43 |
+
| `audio` | `Audio(16000)` | 16 kHz mono FLAC |
|
| 44 |
+
| `label` | `ClassLabel` | `"bonafide"` (0) / `"spoof"` (1) |
|
| 45 |
+
| `notes` | `string` | JSON: `utterance_id`, `language`, `speaker_id`, `system_id` |
|
| 46 |
+
|
| 47 |
+
`utterance_id` is the **language-prefixed** filename stem (`en_<stem>` / `ch_<stem>`); raw stems are not globally unique across the two subsets, so the prefix is the stable join key. `system_id` is the spoof algorithm (e.g. `hifigan`, `vits`, `baidu_en`) or, for bonafide, the source corpus (e.g. `asv19`, `aishell1`).
|
| 48 |
+
|
| 49 |
+
`notes` example:
|
| 50 |
+
```json
|
| 51 |
+
{"utterance_id": "en_1-4993-40677-0048", "language": "en", "speaker_id": "1", "system_id": "baidu_en"}
|
| 52 |
+
```
|
| 53 |
+
|
| 54 |
+
## Quick Start
|
| 55 |
+
|
| 56 |
+
```python
|
| 57 |
+
from datasets import load_dataset
|
| 58 |
+
|
| 59 |
+
ds = load_dataset("SpeechAntiSpoofingBenchmarks/DECRO", split="test")
|
| 60 |
+
print(ds[0])
|
| 61 |
+
```
|
| 62 |
+
|
| 63 |
+
## Stats
|
| 64 |
+
|
| 65 |
+
| Stat | Value |
|
| 66 |
+
|------|-------|
|
| 67 |
+
| Total trials | 37,314 |
|
| 68 |
+
| Bonafide | 10,415 |
|
| 69 |
+
| Spoof | 26,899 |
|
| 70 |
+
| English (en_eval) | 19,190 (4,306 bonafide / 14,884 spoof) |
|
| 71 |
+
| Chinese (ch_eval) | 18,124 (6,109 bonafide / 12,015 spoof) |
|
| 72 |
+
|
| 73 |
+
## Source provenance
|
| 74 |
+
|
| 75 |
+
- Original repository: https://github.com/petrichorwq/DECRO-dataset
|
| 76 |
+
- Protocols: `en_eval.txt`, `ch_eval.txt` (format: `SPEAKER_ID AUDIO_FILE_NAME - SYSTEM_ID KEY`)
|
| 77 |
+
- Bonafide: ASVspoof2019 LA (English); Aidatatang/Aishell/freeST/MagicData (Chinese). Spoof: WaveFake, FAD, and TTS/VC systems (Tacotron, FastSpeech2, VITS, StarGANv2-VC, NVC-Net, HiFiGAN, MB-MelGAN, PWG, Baidu, Xunfei).
|
| 78 |
+
|
| 79 |
+
## Evaluation
|
| 80 |
+
|
| 81 |
+
For evaluation instructions and submission format, see [`submissions/README.md`](submissions/README.md).
|
| 82 |
+
|
| 83 |
+
## Citation
|
| 84 |
+
|
| 85 |
+
```bibtex
|
| 86 |
+
@inproceedings{ba2023transferring,
|
| 87 |
+
title = {Transferring Audio Deepfake Detection Capability across Languages},
|
| 88 |
+
author = {Ba, Zhongjie and Wen, Qing and Cheng, Peng and Wang, Yuwei and Lin, Feng and Lu, Li and Liu, Zhenguang},
|
| 89 |
+
booktitle = {Proceedings of the ACM Web Conference 2023 (WWW '23)},
|
| 90 |
+
year = {2023},
|
| 91 |
+
doi = {10.1145/3543507.3583222},
|
| 92 |
+
}
|
| 93 |
+
```
|
| 94 |
+
|
| 95 |
+
## Maintainer
|
| 96 |
+
|
| 97 |
+
Contact: k.n.borodin@mtuci.ru
|
build_parquet.py
ADDED
|
@@ -0,0 +1,340 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
"""Parquet build for the DECRO (eval) HF dataset repo.
|
| 2 |
+
|
| 3 |
+
Reads the DECRO **eval** partitions of both language subsets -- English
|
| 4 |
+
(``en_eval/`` + ``en_eval.txt``) and Chinese (``ch_eval/`` + ``ch_eval.txt``) --
|
| 5 |
+
and emits the canonical 4-column schema (path / audio / label / notes) sharded
|
| 6 |
+
into NUM_SHARDS parquet files.
|
| 7 |
+
|
| 8 |
+
Always re-encode
|
| 9 |
+
----------------
|
| 10 |
+
The DECRO source audio is single-channel WAV but at *mixed* sampling rates
|
| 11 |
+
(16 k / 22.05 k / 24 k / 44.1 k observed) with a handful of FLOAT-subtype WAVs.
|
| 12 |
+
The arena requires a common 16 kHz SR and the HF ``datasets`` Audio decoder /
|
| 13 |
+
validator / models all decode through soundfile, so we take the re-encode path
|
| 14 |
+
unconditionally: Stage 1 loads EVERY clip with librosa (which also serves as the
|
| 15 |
+
whole-set decodability probe) and writes a clean 16 kHz mono FLAC into a staging
|
| 16 |
+
dir; Stage 2 assembles the shards from those clean files. librosa reads
|
| 17 |
+
FLOAT-subtype WAV correctly (no int16 zero-out).
|
| 18 |
+
|
| 19 |
+
Unique join key
|
| 20 |
+
---------------
|
| 21 |
+
Raw filename stems are NOT globally unique across the two subsets
|
| 22 |
+
(``test_050_102`` / ``test_050_105`` exist in both en and ch). The immutable
|
| 23 |
+
``utterance_id`` is therefore language-prefixed: ``{lang}_{stem}`` (lang in
|
| 24 |
+
{en, ch}). ``path`` = ``{utterance_id}.flac``.
|
| 25 |
+
|
| 26 |
+
Two stages, fully parallel, resumable. Stage 1 skips files already staged, so a
|
| 27 |
+
killed run resumes at file granularity. The staging dir is gitignored.
|
| 28 |
+
|
| 29 |
+
Sample mode (--limit N): first N rows into a single shard, skipping the
|
| 30 |
+
full-count asserts -- used for the fast offline validate-dataset pass.
|
| 31 |
+
"""
|
| 32 |
+
|
| 33 |
+
import argparse
|
| 34 |
+
import io
|
| 35 |
+
import json
|
| 36 |
+
import os
|
| 37 |
+
import tempfile
|
| 38 |
+
import warnings
|
| 39 |
+
from concurrent.futures import ProcessPoolExecutor
|
| 40 |
+
from pathlib import Path
|
| 41 |
+
|
| 42 |
+
# Mixed-rate source: librosa may fall back to audioread for some clips and emit
|
| 43 |
+
# a PySoundFile UserWarning + librosa FutureWarning. Silence so the build log
|
| 44 |
+
# stays readable.
|
| 45 |
+
warnings.filterwarnings("ignore", message="PySoundFile failed")
|
| 46 |
+
warnings.filterwarnings("ignore", category=FutureWarning, module="librosa")
|
| 47 |
+
|
| 48 |
+
import datasets # noqa: E402
|
| 49 |
+
import librosa # noqa: E402
|
| 50 |
+
import pyarrow.parquet as pq # noqa: E402
|
| 51 |
+
import soundfile as sf # noqa: E402
|
| 52 |
+
from datasets import Audio, ClassLabel, Dataset, Features, Value # noqa: E402
|
| 53 |
+
from tqdm.auto import tqdm # noqa: E402
|
| 54 |
+
|
| 55 |
+
try:
|
| 56 |
+
datasets.disable_progress_bars()
|
| 57 |
+
except AttributeError:
|
| 58 |
+
from datasets.utils.logging import disable_progress_bar
|
| 59 |
+
|
| 60 |
+
disable_progress_bar()
|
| 61 |
+
|
| 62 |
+
REPO_ROOT = Path(__file__).resolve().parent
|
| 63 |
+
SRC_ROOT = Path("/home/kirill/mnt/users_4tb/datasets/petrichorwq-DECRO-dataset-6fc9884")
|
| 64 |
+
# (language, eval audio dir, eval protocol file)
|
| 65 |
+
SPLITS = [
|
| 66 |
+
("en", SRC_ROOT / "en_eval", SRC_ROOT / "en_eval.txt"),
|
| 67 |
+
("ch", SRC_ROOT / "ch_eval", SRC_ROOT / "ch_eval.txt"),
|
| 68 |
+
]
|
| 69 |
+
PARQUET_DIR = REPO_ROOT / "data"
|
| 70 |
+
STAGING_DIR = REPO_ROOT / "_clean_flac"
|
| 71 |
+
NUM_SHARDS = 8
|
| 72 |
+
EXPECTED_ROWS = 37314
|
| 73 |
+
EXPECTED_BONAFIDE = 10415
|
| 74 |
+
EXPECTED_SPOOF = 26899
|
| 75 |
+
TARGET_SR = 16000
|
| 76 |
+
WORKERS = int(os.environ.get("DECRO_BUILD_WORKERS", os.cpu_count() or 4))
|
| 77 |
+
|
| 78 |
+
FEATURES = Features(
|
| 79 |
+
{
|
| 80 |
+
"path": Value("string"),
|
| 81 |
+
"audio": Audio(sampling_rate=16000),
|
| 82 |
+
"label": ClassLabel(names=["bonafide", "spoof"]),
|
| 83 |
+
"notes": Value("string"),
|
| 84 |
+
}
|
| 85 |
+
)
|
| 86 |
+
|
| 87 |
+
|
| 88 |
+
def parse_metadata():
|
| 89 |
+
"""Parse both eval protocols.
|
| 90 |
+
|
| 91 |
+
Row format: ``SPEAKER_ID AUDIO_FILE_NAME - SYSTEM_ID KEY`` (col 3 unused).
|
| 92 |
+
Returns records with a language-prefixed unique ``uid``.
|
| 93 |
+
"""
|
| 94 |
+
records = []
|
| 95 |
+
for lang, audio_dir, proto in SPLITS:
|
| 96 |
+
with open(proto, encoding="utf-8") as fh:
|
| 97 |
+
for line in fh:
|
| 98 |
+
line = line.strip()
|
| 99 |
+
if not line:
|
| 100 |
+
continue
|
| 101 |
+
parts = line.split()
|
| 102 |
+
if len(parts) != 5:
|
| 103 |
+
raise ValueError(f"Expected 5 columns, got {len(parts)}: {line!r}")
|
| 104 |
+
speaker, name, _unused, system_id, label = parts
|
| 105 |
+
if label not in ("bonafide", "spoof"):
|
| 106 |
+
raise ValueError(f"Unexpected label {label!r}: {line!r}")
|
| 107 |
+
records.append(
|
| 108 |
+
{
|
| 109 |
+
"lang": lang,
|
| 110 |
+
"name": name,
|
| 111 |
+
"uid": f"{lang}_{name}",
|
| 112 |
+
"src": audio_dir / f"{name}.wav",
|
| 113 |
+
"speaker": speaker,
|
| 114 |
+
"system_id": system_id,
|
| 115 |
+
"label": label,
|
| 116 |
+
}
|
| 117 |
+
)
|
| 118 |
+
return records
|
| 119 |
+
|
| 120 |
+
|
| 121 |
+
def build_notes(rec):
|
| 122 |
+
return json.dumps(
|
| 123 |
+
{
|
| 124 |
+
"utterance_id": rec["uid"],
|
| 125 |
+
"language": rec["lang"],
|
| 126 |
+
"speaker_id": rec["speaker"],
|
| 127 |
+
"system_id": rec["system_id"],
|
| 128 |
+
}
|
| 129 |
+
)
|
| 130 |
+
|
| 131 |
+
|
| 132 |
+
def _clip_duration(rec):
|
| 133 |
+
info = sf.info(str(rec["src"]))
|
| 134 |
+
return info.frames / info.samplerate
|
| 135 |
+
|
| 136 |
+
|
| 137 |
+
def _ensure_long_first_row(records):
|
| 138 |
+
"""Swap a clip with duration >= 1.0s to index 0 (validator D3 checks row 0)."""
|
| 139 |
+
for i in range(len(records)):
|
| 140 |
+
if _clip_duration(records[i]) >= 1.0:
|
| 141 |
+
if i != 0:
|
| 142 |
+
records[0], records[i] = records[i], records[0]
|
| 143 |
+
return
|
| 144 |
+
raise RuntimeError("No clip with duration >= 1.0s found")
|
| 145 |
+
|
| 146 |
+
|
| 147 |
+
def _reencode_worker(task):
|
| 148 |
+
"""Re-encode one source WAV into the staging dir. Resumable + atomic.
|
| 149 |
+
|
| 150 |
+
librosa decodes (handles mixed SR + FLOAT-subtype WAV correctly) and
|
| 151 |
+
resamples to 16 kHz mono; soundfile writes a clean FLAC. Writes to a temp
|
| 152 |
+
name then os.replace so a killed run never leaves a half-written file.
|
| 153 |
+
"""
|
| 154 |
+
uid, src = task
|
| 155 |
+
dst = STAGING_DIR / f"{uid}.flac"
|
| 156 |
+
if dst.exists() and dst.stat().st_size > 0:
|
| 157 |
+
return (uid, None)
|
| 158 |
+
try:
|
| 159 |
+
y, _ = librosa.load(str(src), sr=TARGET_SR, mono=True)
|
| 160 |
+
if y.shape[0] == 0:
|
| 161 |
+
return (uid, "empty after decode")
|
| 162 |
+
tmp = STAGING_DIR / f".{uid}.flac.tmp"
|
| 163 |
+
sf.write(str(tmp), y, TARGET_SR, format="FLAC")
|
| 164 |
+
os.replace(tmp, dst)
|
| 165 |
+
return (uid, None)
|
| 166 |
+
except Exception as e: # noqa: BLE001
|
| 167 |
+
return (uid, str(e).splitlines()[0][:120])
|
| 168 |
+
|
| 169 |
+
|
| 170 |
+
def stage1_reencode(records):
|
| 171 |
+
"""Re-encode all source WAV into STAGING_DIR across all cores (resumable).
|
| 172 |
+
|
| 173 |
+
This is also the whole-set decodability probe: any clip librosa cannot load
|
| 174 |
+
aborts the build.
|
| 175 |
+
"""
|
| 176 |
+
STAGING_DIR.mkdir(parents=True, exist_ok=True)
|
| 177 |
+
tasks = [(r["uid"], r["src"]) for r in records]
|
| 178 |
+
total = len(tasks)
|
| 179 |
+
print(f"Stage 1: re-encoding {total} files with {WORKERS} workers -> {STAGING_DIR}")
|
| 180 |
+
failures = []
|
| 181 |
+
with ProcessPoolExecutor(max_workers=WORKERS) as ex:
|
| 182 |
+
for uid, err in tqdm(
|
| 183 |
+
ex.map(_reencode_worker, tasks, chunksize=64),
|
| 184 |
+
total=total,
|
| 185 |
+
desc="Stage 1 re-encode",
|
| 186 |
+
unit="file",
|
| 187 |
+
):
|
| 188 |
+
if err:
|
| 189 |
+
failures.append((uid, err))
|
| 190 |
+
print(f"Stage 1 done: {total} processed, {len(failures)} failures")
|
| 191 |
+
if failures:
|
| 192 |
+
for uid, err in failures[:10]:
|
| 193 |
+
print(f" FAIL {uid}: {err}")
|
| 194 |
+
raise RuntimeError(f"{len(failures)} files failed to re-encode")
|
| 195 |
+
|
| 196 |
+
|
| 197 |
+
def _build_shard(task):
|
| 198 |
+
"""Worker: build one shard parquet from its row slice. Resumable + atomic."""
|
| 199 |
+
shard_index, rows, num_shards = task
|
| 200 |
+
shard_name = f"test-{shard_index:05d}-of-{num_shards:05d}.parquet"
|
| 201 |
+
final = PARQUET_DIR / shard_name
|
| 202 |
+
if final.exists() and final.stat().st_size > 0:
|
| 203 |
+
return (shard_index, len(rows), "skipped")
|
| 204 |
+
|
| 205 |
+
def row_gen():
|
| 206 |
+
for rec in rows:
|
| 207 |
+
uid = rec["uid"]
|
| 208 |
+
yield {
|
| 209 |
+
"path": f"{uid}.flac",
|
| 210 |
+
"audio": {
|
| 211 |
+
"bytes": (STAGING_DIR / f"{uid}.flac").read_bytes(),
|
| 212 |
+
"path": f"{uid}.flac",
|
| 213 |
+
},
|
| 214 |
+
"label": rec["label"],
|
| 215 |
+
"notes": build_notes(rec),
|
| 216 |
+
}
|
| 217 |
+
|
| 218 |
+
with tempfile.TemporaryDirectory() as cache:
|
| 219 |
+
ds = Dataset.from_generator(row_gen, features=FEATURES, cache_dir=cache)
|
| 220 |
+
tmp = PARQUET_DIR / f".{shard_name}.tmp"
|
| 221 |
+
ds.to_parquet(str(tmp))
|
| 222 |
+
os.replace(tmp, final)
|
| 223 |
+
return (shard_index, len(rows), "built")
|
| 224 |
+
|
| 225 |
+
|
| 226 |
+
def _partition(records, num_shards):
|
| 227 |
+
n = len(records)
|
| 228 |
+
per = (n + num_shards - 1) // num_shards
|
| 229 |
+
out = []
|
| 230 |
+
for i in range(num_shards):
|
| 231 |
+
chunk = records[i * per : (i + 1) * per]
|
| 232 |
+
if chunk:
|
| 233 |
+
out.append(chunk)
|
| 234 |
+
return out
|
| 235 |
+
|
| 236 |
+
|
| 237 |
+
def build():
|
| 238 |
+
parser = argparse.ArgumentParser()
|
| 239 |
+
parser.add_argument("--limit", type=int, default=None)
|
| 240 |
+
args = parser.parse_args()
|
| 241 |
+
limit = args.limit
|
| 242 |
+
sample_mode = limit is not None
|
| 243 |
+
|
| 244 |
+
print("Reading metadata from", ", ".join(str(p) for _, _, p in SPLITS))
|
| 245 |
+
records = parse_metadata()
|
| 246 |
+
print(f"Parsed {len(records)} rows")
|
| 247 |
+
if not sample_mode:
|
| 248 |
+
assert len(records) == EXPECTED_ROWS, f"Expected {EXPECTED_ROWS}, got {len(records)}"
|
| 249 |
+
|
| 250 |
+
check = records if not sample_mode else records[: max(limit * 4, limit)]
|
| 251 |
+
missing = [r["uid"] for r in check if not r["src"].exists()]
|
| 252 |
+
assert not missing, f"{len(missing)} wav files missing, e.g. {missing[:5]}"
|
| 253 |
+
|
| 254 |
+
records.sort(key=lambda r: r["uid"])
|
| 255 |
+
_ensure_long_first_row(records)
|
| 256 |
+
|
| 257 |
+
if sample_mode:
|
| 258 |
+
records = records[:limit]
|
| 259 |
+
num_shards = 1
|
| 260 |
+
print(f"SAMPLE MODE: {len(records)} rows -> 1 shard")
|
| 261 |
+
else:
|
| 262 |
+
num_shards = NUM_SHARDS
|
| 263 |
+
|
| 264 |
+
bona = sum(1 for r in records if r["label"] == "bonafide")
|
| 265 |
+
spoof = sum(1 for r in records if r["label"] == "spoof")
|
| 266 |
+
print(f" bonafide={bona} spoof={spoof} total={len(records)}")
|
| 267 |
+
|
| 268 |
+
# Stage 1: parallel re-encode to the staging dir (resumable + whole-set probe).
|
| 269 |
+
stage1_reencode(records)
|
| 270 |
+
|
| 271 |
+
# Stage 2: assemble parquet shards (one worker per shard).
|
| 272 |
+
PARQUET_DIR.mkdir(parents=True, exist_ok=True)
|
| 273 |
+
keep_suffix = f"-of-{num_shards:05d}.parquet"
|
| 274 |
+
for stale in PARQUET_DIR.glob("test-*.parquet"):
|
| 275 |
+
if not stale.name.endswith(keep_suffix):
|
| 276 |
+
print(f"Removing stale shard {stale.name}")
|
| 277 |
+
stale.unlink()
|
| 278 |
+
shards = _partition(records, num_shards)
|
| 279 |
+
tasks = [(i, rows, num_shards) for i, rows in enumerate(shards)]
|
| 280 |
+
stage2_workers = min(WORKERS, len(tasks))
|
| 281 |
+
print(f"Stage 2: building {len(tasks)} shard(s) with {stage2_workers} workers...")
|
| 282 |
+
built = skipped = 0
|
| 283 |
+
with ProcessPoolExecutor(max_workers=stage2_workers) as ex:
|
| 284 |
+
for idx, n, status in tqdm(
|
| 285 |
+
ex.map(_build_shard, tasks),
|
| 286 |
+
total=len(tasks),
|
| 287 |
+
desc="Stage 2 shards",
|
| 288 |
+
unit="shard",
|
| 289 |
+
):
|
| 290 |
+
if status == "built":
|
| 291 |
+
built += 1
|
| 292 |
+
elif status == "skipped":
|
| 293 |
+
skipped += 1
|
| 294 |
+
print(f"Stage 2 done: {built} built, {skipped} skipped")
|
| 295 |
+
|
| 296 |
+
_verify(num_shards, sample_mode)
|
| 297 |
+
print("All verifications passed!")
|
| 298 |
+
|
| 299 |
+
if not sample_mode:
|
| 300 |
+
from speech_spoof_bench import labels
|
| 301 |
+
|
| 302 |
+
out = labels.emit_labels(REPO_ROOT)
|
| 303 |
+
print(f"Wrote {out}")
|
| 304 |
+
|
| 305 |
+
|
| 306 |
+
def _verify(num_shards, sample_mode):
|
| 307 |
+
shards = sorted(PARQUET_DIR.glob("test-*.parquet"))
|
| 308 |
+
total = sum(pq.read_metadata(str(f)).num_rows for f in shards)
|
| 309 |
+
uid_set, path_set, bona, spoof = set(), set(), 0, 0
|
| 310 |
+
for f in shards:
|
| 311 |
+
t = pq.read_table(str(f), columns=["path", "label", "notes"])
|
| 312 |
+
for p, lab, n in zip(
|
| 313 |
+
t.column("path").to_pylist(),
|
| 314 |
+
t.column("label").to_pylist(),
|
| 315 |
+
t.column("notes").to_pylist(),
|
| 316 |
+
):
|
| 317 |
+
path_set.add(p)
|
| 318 |
+
uid_set.add(json.loads(n)["utterance_id"])
|
| 319 |
+
if lab == 0:
|
| 320 |
+
bona += 1
|
| 321 |
+
elif lab == 1:
|
| 322 |
+
spoof += 1
|
| 323 |
+
assert len(uid_set) == total, "Duplicate utterance_ids"
|
| 324 |
+
assert len(path_set) == total, "Duplicate paths"
|
| 325 |
+
if not sample_mode:
|
| 326 |
+
assert total == EXPECTED_ROWS, f"{total} != {EXPECTED_ROWS}"
|
| 327 |
+
assert bona == EXPECTED_BONAFIDE, f"bonafide {bona} != {EXPECTED_BONAFIDE}"
|
| 328 |
+
assert spoof == EXPECTED_SPOOF, f"spoof {spoof} != {EXPECTED_SPOOF}"
|
| 329 |
+
t0 = pq.read_table(str(shards[0]))
|
| 330 |
+
assert set(t0.column_names) == {"path", "audio", "label", "notes"}, t0.column_names
|
| 331 |
+
audio0 = t0.column("audio")[0].as_py()
|
| 332 |
+
data, sr = sf.read(io.BytesIO(audio0["bytes"]))
|
| 333 |
+
dur = len(data) / sr
|
| 334 |
+
assert sr == 16000, f"row0 sr {sr} != 16000"
|
| 335 |
+
assert dur >= 1.0, f"row0 dur {dur:.2f}s < 1.0s"
|
| 336 |
+
print(f" verify: {total} rows, row0 {sr}Hz {dur:.2f}s decodable OK")
|
| 337 |
+
|
| 338 |
+
|
| 339 |
+
if __name__ == "__main__":
|
| 340 |
+
build()
|
data/labels.parquet
ADDED
|
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
version https://git-lfs.github.com/spec/v1
|
| 2 |
+
oid sha256:696e58af8ad4dda1f6b20d814b1c1191bca8f50c08abf95115d432444b646673
|
| 3 |
+
size 305937
|
data/test-00000-of-00008.parquet
ADDED
|
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
version https://git-lfs.github.com/spec/v1
|
| 2 |
+
oid sha256:7bca1a6ccc778f694272e08d115fd434980e9d05e045d73a3ad830da50f08584
|
| 3 |
+
size 297138971
|
data/test-00001-of-00008.parquet
ADDED
|
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
version https://git-lfs.github.com/spec/v1
|
| 2 |
+
oid sha256:ee31ff9aa2cd4f8f0dcbf059cb0d0a4ee16e65f11d29c5dc57bcab4eceec1d99
|
| 3 |
+
size 274933241
|
data/test-00002-of-00008.parquet
ADDED
|
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
version https://git-lfs.github.com/spec/v1
|
| 2 |
+
oid sha256:83c17607b4792b61c5ded6ab0d993d50df6060c7fbf0c31761d4876ae80271e0
|
| 3 |
+
size 263649867
|
data/test-00003-of-00008.parquet
ADDED
|
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
version https://git-lfs.github.com/spec/v1
|
| 2 |
+
oid sha256:c57363e2c4d137562a06bc4099a5e74ea50a13ed6f76d48dd8261adc5c532bc3
|
| 3 |
+
size 318446826
|
data/test-00004-of-00008.parquet
ADDED
|
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
version https://git-lfs.github.com/spec/v1
|
| 2 |
+
oid sha256:523038acd68abc9e66df9ec0156fa76bcd901031fed14510ad4bf6be4ae81d74
|
| 3 |
+
size 269206865
|
data/test-00005-of-00008.parquet
ADDED
|
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
version https://git-lfs.github.com/spec/v1
|
| 2 |
+
oid sha256:29e615cdf55cdc351c3ac49d307becfce6baa852a434365178eb126314fcce71
|
| 3 |
+
size 368350940
|
data/test-00006-of-00008.parquet
ADDED
|
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
version https://git-lfs.github.com/spec/v1
|
| 2 |
+
oid sha256:cf3f58b3bac805ec8b6d63e443bf17262682fd59d8f89ec1423e620ef5de1dec
|
| 3 |
+
size 619237269
|
data/test-00007-of-00008.parquet
ADDED
|
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
version https://git-lfs.github.com/spec/v1
|
| 2 |
+
oid sha256:11aebf764dfbc479afe837c075e0f5d66ef3200b8f1faf0892033ecc02a4c5d6
|
| 3 |
+
size 329668198
|
eval.yaml
ADDED
|
@@ -0,0 +1,25 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
name: DECRO
|
| 2 |
+
description: >
|
| 3 |
+
Evaluation partition of the DECRO (DEepfake CROss-lingual) dataset, English +
|
| 4 |
+
Chinese subsets combined. Binary classification: bonafide vs. spoof, where the
|
| 5 |
+
two languages share the same set of TTS/VC synthesis algorithms. EER computed
|
| 6 |
+
on the combined eval protocol (37,314 utterances).
|
| 7 |
+
evaluation_framework: inspect-ai
|
| 8 |
+
|
| 9 |
+
tasks:
|
| 10 |
+
- id: antispoofing_eval
|
| 11 |
+
config: default
|
| 12 |
+
split: test
|
| 13 |
+
|
| 14 |
+
field_spec:
|
| 15 |
+
input: audio
|
| 16 |
+
target: label
|
| 17 |
+
|
| 18 |
+
solvers:
|
| 19 |
+
- name: speech_spoof_bench_solver
|
| 20 |
+
|
| 21 |
+
scorers:
|
| 22 |
+
- name: speech_spoof_scorer
|
| 23 |
+
|
| 24 |
+
metrics:
|
| 25 |
+
- eer_percent
|
push.py
ADDED
|
@@ -0,0 +1,38 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
"""Push the built DECRO dataset to the HF Hub (resumable, proxy-free).
|
| 2 |
+
|
| 3 |
+
Run with the network proxy unset for the >1 GB shard upload:
|
| 4 |
+
env -u HTTP_PROXY -u HTTPS_PROXY -u http_proxy -u https_proxy python push.py
|
| 5 |
+
"""
|
| 6 |
+
|
| 7 |
+
from pathlib import Path
|
| 8 |
+
|
| 9 |
+
from huggingface_hub import HfApi
|
| 10 |
+
|
| 11 |
+
REPO_ID = "SpeechAntiSpoofingBenchmarks/DECRO"
|
| 12 |
+
FOLDER = Path(__file__).resolve().parent
|
| 13 |
+
|
| 14 |
+
IGNORE = [
|
| 15 |
+
"_clean_flac/**",
|
| 16 |
+
"__pycache__/**",
|
| 17 |
+
"*.pyc",
|
| 18 |
+
".cache/**",
|
| 19 |
+
".git/**",
|
| 20 |
+
".gitignore",
|
| 21 |
+
]
|
| 22 |
+
|
| 23 |
+
|
| 24 |
+
def main():
|
| 25 |
+
api = HfApi()
|
| 26 |
+
api.create_repo(REPO_ID, repo_type="dataset", exist_ok=True)
|
| 27 |
+
api.upload_large_folder(
|
| 28 |
+
repo_id=REPO_ID,
|
| 29 |
+
repo_type="dataset",
|
| 30 |
+
folder_path=str(FOLDER),
|
| 31 |
+
ignore_patterns=IGNORE,
|
| 32 |
+
)
|
| 33 |
+
info = api.dataset_info(REPO_ID)
|
| 34 |
+
print("Pushed. Latest commit SHA:", info.sha)
|
| 35 |
+
|
| 36 |
+
|
| 37 |
+
if __name__ == "__main__":
|
| 38 |
+
main()
|
submissions/README.md
ADDED
|
@@ -0,0 +1,81 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
# Benchmark Submissions
|
| 2 |
+
|
| 3 |
+
To submit a result, you'll upload two files (no git clone required):
|
| 4 |
+
|
| 5 |
+
1. **`scores.txt`** to **your own HF model repo** under `.eval_results/SpeechAntiSpoofingBenchmarks/ASVspoof2019_LA/scores.txt`.
|
| 6 |
+
2. **`<your-slug>.yaml`** as a pull request to **this dataset repo** under `submissions/<your-slug>.yaml`.
|
| 7 |
+
|
| 8 |
+
The YAML in this repo carries a pinned URL pointing at your `scores.txt`, plus its sha256. Scores files do not live in this repo.
|
| 9 |
+
|
| 10 |
+
## Submitter workflow
|
| 11 |
+
|
| 12 |
+
### 1. Generate `scores.txt` locally
|
| 13 |
+
|
| 14 |
+
```bash
|
| 15 |
+
speech-spoof-bench run \
|
| 16 |
+
--model-module <your_package>:<YourModelClass> \
|
| 17 |
+
--datasets SpeechAntiSpoofingBenchmarks/ASVspoof2019_LA
|
| 18 |
+
```
|
| 19 |
+
|
| 20 |
+
Output: `results/ASVspoof2019_LA/scores.txt` (one line per utterance, `<utterance_id> <score>`, higher = more bonafide).
|
| 21 |
+
|
| 22 |
+
### 2. Upload `scores.txt` to your model repo
|
| 23 |
+
|
| 24 |
+
```bash
|
| 25 |
+
huggingface-cli upload <your-owner>/<your-model-repo> \
|
| 26 |
+
results/ASVspoof2019_LA/scores.txt \
|
| 27 |
+
.eval_results/SpeechAntiSpoofingBenchmarks/ASVspoof2019_LA/scores.txt \
|
| 28 |
+
--repo-type=model \
|
| 29 |
+
--commit-message="Add ASVspoof2019_LA scores"
|
| 30 |
+
```
|
| 31 |
+
|
| 32 |
+
**Note the commit sha** the CLI prints — you'll need it in the next step.
|
| 33 |
+
|
| 34 |
+
### 3. Fill in the submission YAML
|
| 35 |
+
|
| 36 |
+
Copy `results_template.yaml` to `<your-slug>.yaml` and fill in every field. The two most important fields:
|
| 37 |
+
|
| 38 |
+
- `artifact.scores_url`: the **pinned** URL to your uploaded scores file. Use the commit sha from step 2, not `main`:
|
| 39 |
+
```
|
| 40 |
+
https://huggingface.co/<your-owner>/<your-model-repo>/resolve/<commit-sha-from-step-2>/.eval_results/SpeechAntiSpoofingBenchmarks/ASVspoof2019_LA/scores.txt
|
| 41 |
+
```
|
| 42 |
+
URLs with `/resolve/main/` are rejected because they're mutable.
|
| 43 |
+
- `artifact.scores_sha256`: `sha256sum results/ASVspoof2019_LA/scores.txt | awk '{print $1}'`.
|
| 44 |
+
|
| 45 |
+
Leave the `reproduction:` block empty — the maintainer fills it in at merge time.
|
| 46 |
+
|
| 47 |
+
### 4. Open the PR via HF CLI
|
| 48 |
+
|
| 49 |
+
```bash
|
| 50 |
+
huggingface-cli upload \
|
| 51 |
+
SpeechAntiSpoofingBenchmarks/ASVspoof2019_LA \
|
| 52 |
+
<your-slug>.yaml submissions/<your-slug>.yaml \
|
| 53 |
+
--repo-type=dataset \
|
| 54 |
+
--create-pr \
|
| 55 |
+
--commit-message="Add <your-slug> submission"
|
| 56 |
+
```
|
| 57 |
+
|
| 58 |
+
The CLI prints a PR URL. That's it.
|
| 59 |
+
|
| 60 |
+
### 5. Wait for maintainer reproduction
|
| 61 |
+
|
| 62 |
+
A maintainer runs `speech-spoof-bench reproduce --scoring <PR-branch>`, which:
|
| 63 |
+
- Fetches `scores_url`.
|
| 64 |
+
- Verifies the sha256 against `artifact.scores_sha256`.
|
| 65 |
+
- Recomputes EER from the file.
|
| 66 |
+
- Compares to your claimed `scores.eer_percent` (must match within 1e-6).
|
| 67 |
+
|
| 68 |
+
If it passes, the maintainer fills in `reproduction:` and merges. If it fails, you get a comment on the PR explaining why.
|
| 69 |
+
|
| 70 |
+
## Verification levels
|
| 71 |
+
|
| 72 |
+
| Level | What the maintainer checks | Cost |
|
| 73 |
+
|---|---|---|
|
| 74 |
+
| `scoring` (default) | sha + recomputed EER from your `scores.txt`. | Seconds. |
|
| 75 |
+
| `inference` (optional, follow-up) | Re-runs your checkpoint end-to-end and regenerates `scores.txt`. Must match within 0.05% EER. | Expensive. |
|
| 76 |
+
|
| 77 |
+
Submissions without a `reproduction:` block never appear in the arena.
|
| 78 |
+
|
| 79 |
+
## What about git clone + push?
|
| 80 |
+
|
| 81 |
+
You can do it that way too, but for a single 2 KB YAML it's massively heavier. The HF CLI path is the documented one.
|
submissions/results_template.yaml
ADDED
|
@@ -0,0 +1,44 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
schema_version: 4
|
| 2 |
+
|
| 3 |
+
system:
|
| 4 |
+
name: ""
|
| 5 |
+
slug: ""
|
| 6 |
+
description: ""
|
| 7 |
+
code: ""
|
| 8 |
+
checkpoint: ""
|
| 9 |
+
paper:
|
| 10 |
+
arxiv_id: ""
|
| 11 |
+
url: ""
|
| 12 |
+
bibtex: |
|
| 13 |
+
@article{...}
|
| 14 |
+
|
| 15 |
+
dataset:
|
| 16 |
+
id: SpeechAntiSpoofingBenchmarks/ASVspoof2019_LA
|
| 17 |
+
revision: ""
|
| 18 |
+
split: test
|
| 19 |
+
|
| 20 |
+
scores:
|
| 21 |
+
eer_percent: 0.0
|
| 22 |
+
n_trials: 71237
|
| 23 |
+
n_skipped: 0
|
| 24 |
+
|
| 25 |
+
artifact:
|
| 26 |
+
# Must be pinned by commit sha. Pattern:
|
| 27 |
+
# https://huggingface.co/<owner>/<repo>/resolve/<commit-sha>/.eval_results/SpeechAntiSpoofingBenchmarks/ASVspoof2019_LA/scores.txt
|
| 28 |
+
scores_url: ""
|
| 29 |
+
scores_sha256: ""
|
| 30 |
+
bench_version: ""
|
| 31 |
+
|
| 32 |
+
# Leave this block empty — the maintainer fills it in at merge.
|
| 33 |
+
reproduction:
|
| 34 |
+
reproduced_by: ""
|
| 35 |
+
reproduced_at: ""
|
| 36 |
+
reproduced_bench_version: ""
|
| 37 |
+
match: ""
|
| 38 |
+
|
| 39 |
+
submitter:
|
| 40 |
+
hf_username: ""
|
| 41 |
+
contact: ""
|
| 42 |
+
|
| 43 |
+
submitted_at: ""
|
| 44 |
+
notes: ""
|