Upload 37 files

.gitattributes

@@ -57,3 +57,9 @@ saved_model/**/* filter=lfs diff=lfs merge=lfs -text
 # Video files - compressed
 *.mp4 filter=lfs diff=lfs merge=lfs -text
 *.webm filter=lfs diff=lfs merge=lfs -text
+training/as_training.b5 filter=lfs diff=lfs merge=lfs -text
+training/as_training.utf8 filter=lfs diff=lfs merge=lfs -text
+training/cityu_training.txt filter=lfs diff=lfs merge=lfs -text
+training/msr_training.txt filter=lfs diff=lfs merge=lfs -text
+training/msr_training.utf8 filter=lfs diff=lfs merge=lfs -text
+training/pku_training.txt filter=lfs diff=lfs merge=lfs -text

README

@@ -0,0 +1,68 @@
+2nd International Chinese Word Segmentation Bakeoff - Data Release
+Release 1, 2005-11-18
+
+* Introduction
+
+This directory contains the training, test, and gold-standard data
+used in the 2nd International Chinese Word Segmentation Bakeoff. Also
+included is the script used to score the results submitted by the
+bakeoff participants and the simple segmenter used to generate the
+baseline and topline data.
+
+* File List
+
+gold/       Contains the gold standard segmentation of the test data
+            along with the training data word lists.
+
+scripts/    Contains the scoring script and simple segmenter.
+
+testing/    Contains the unsegmented test data.
+
+training/   Contains the segmented training data.
+
+doc/        Contains the instructions used in the bakeoff.
+
+* Encoding Issues
+
+Files with the extension ".utf8" are encoded in UTF-8 Unicode.
+
+Files with the extension ".txt" are encoded as follows:
+
+as_    Big Five (CP950)
+hk_    Big Five/HKSCS
+msr_   EUC-CN (CP936)
+pku_   EUC-CN (CP936)
+
+EUC-CN is often called "GB" or "GB2312" encoding, though technically
+GB2312 is a character set, not a character encoding.
+
+* Scoring
+
+The script 'score' is used to generate compare two segmentations. The
+script takes three arguments:
+
+1. The training set word list
+2. The gold standard segmentation
+3. The segmented test file
+
+You must not mix character encodings when invoking the scoring
+script. For example:
+
+% perl scripts/score gold/cityu_training_words.utf8 \
+    gold/cityu_test_gold.utf8 test_segmentation.utf8 > score.ut8
+
+* Licensing
+
+The corpora have been made available by the providers for the purposes
+of this competition only. By downloading the training and testing
+corpora, you agree that you will not use these corpora for any other
+purpose than as material for this competition. Petitions to use the
+data for any other purpose MUST be directed to the original providers
+of the data. Neither SIGHAN nor the ACL will assume any liability for
+a participant's misuse of the data.
+
+* Questions?
+
+Questions or comments about these data can be sent to Tom Emerson,
+[email protected].
+

doc/instructions.txt

@@ -0,0 +1,165 @@
+{55Second International Chinese Word Segmentation Bakeoff
+Detailed Instructions
+
+[Note: these were converted from HTML to text for this post-bakeoff
+data release. No other changes were made.]
+
+The following comprises the complete description of the training and
+testing for the Second International Chinese Word Segmentation
+Bakeoff. By participating in this competition, you are declaring that
+you understand these descriptions, and that you agree to abide by the
+specific terms as laid out below.
+
+* Training: Description of Tracks
+
+** Dimension 1: Corpora
+
+Four corpora are available for this bakeoff:
+
+--------------------------------------------------------------------------------
+Corpus             Encoding         Word        Words     Character   Characters
+                                    Types                   Types
+--------------------------------------------------------------------------------
+Academia Sinica    Big Five Plus   141,340    5,449,698     6,117      8,368,050
+CityU              HKSCS Big Five   69,085    1,455,629     4,923      2,403,355
+Peking University  CP936            55,303    1,109,947     4,698      1,826,448
+Microsoft Research CP936            88,119    2,368,391     5,167      4,050,469
+--------------------------------------------------------------------------------
+
+You may declare that you will return results on any subset of these
+corpora. For example, you may decide that you will test on the Sinica
+Corpus and the Beijing University corpus. The only constraint is that
+you must not select a corpus where you have knowingly had previous
+access to the testing portion of the corpus. A corollary of this is
+that a team may not test on the data from their own institution.
+
+** Dimension 2: Open or Closed Test
+
+You may decide to participate in either an open test or a closed test, or both. 
+
+In the open test you will be allowed to train on the training set for
+a particular corpus, and in addition you may use *any* other material
+including material from other training corpora, proprietary
+dictionaries, material from the WWW and so forth.
+
+If you elect the open test, you will be required, in the
+two-page writeup of your results, to explain what percentage of your
+correct/incorrect results came from which sources. For example, if you
+score an F measure of 0.7 on words in the testing corpus that are
+out-of-vocabulary with respect to the training corpus, you must
+explain how you got that result: was it just because you have a good
+coverage dictionary, do you have a good unknown word detection
+algorithm, etc?
+
+In the closed test you may *only* use training
+material from the training data for the particular corpus you are
+testing on. No other material or knowledge is allowed, including
+(but not limited to):
+
+1. Part-of-speech information
+2. Externally generated word-frequency counts
+3. Arabic and Chinese Numbers
+4. Feature characters for place ames
+5. Common Chinese surnames
+
+** Declaration
+
+When you download the training corpora, you will be asked to register
+and provide various information about your site, including the contact
+person, and you will be asked to declare which tracks you will
+participating in.
+
+** Format of the data
+
+Both training and testing data will be published in the original
+coding schemes used by the data sources. Additionally it will be
+transcoded by the organizers into Unicode UTF-8 (or, if provided in
+Unicode, into the defacto encoding for the locale.) The training data
+will be formatted as follows.
+
+1. There will be one sentence per line.
+2. Words and punctuation symbols will be separated by spaces.
+3. There will be no further annotations, such as part-of-speech tags:
+   if the original corpus includes those, those will be removed.
+
+
+** Licensing
+
+The corpora have been made available by the providers for the purposes
+of this competition only. By downloading the training and testing
+corpora, you agree that you will not use these corpora for any other
+purpose than as material for this competition. Petitions to use the
+data for any other purpose MUST be directed to the original providers
+of the data. Neither SIGHAN nor the ACL will assume any liability for
+a participant's misuse of the data.
+
+* Testing
+
+The test data will be available for each corpus at the website at
+12:00 GMT, July 27, 2005. The test data will be in the same format as
+described for the training data, but of course spaces will be removed.
+
+You will have roughly two days to process the data, format the
+results and return them to the SIGHAN website. The final due
+date/time is:
+
+July 29, 2005, 12:00, GMT
+
+Late submissions will not be scored.
+
+The format of the result must adhere to the format
+described for the training data. In particular, there must be one line
+per sentence, and there must be the same number of lines in the
+returned data as in the data available from the site. Segmented words
+and punctuation must be separated by spaces, and there should be
+no further annotations (e.g. part of speech tags) on
+the segmented words. The data must be returned in the same
+coding scheme as they were published in. (For example, If you
+utilize the UTF-8 encoded version of the testing data, then the
+results must be returned in UTF-8.) Participants are reminded that
+ASCII character codes may occur in Chinese text to represent Latin
+letters, numbers and so forth: such codes should be left in their
+original coding scheme. Do not convert them to their GB/Big5
+equivalents. Similarly GB/Big5 codings of Latin letters or Arabic
+numerals should be left in their original coding, and not converted to
+ASCII.
+
+The results will be scored completely automatically. The scripts that
+were used to score will be made publicly available. The measures that
+will be reported are precision, recall, and an evenly-weighted
+F-measure. We will also report scores for in-vocabulary and
+out-of-vocabulary words.
+
+Note: by downloading the test material and submitting results on this
+material you are thereby declaring that you have not previously seen
+the test material for the given corpus.
+
+You are also declaring that your testing will be fully automatic. This
+means that any kind of manual intervention is disallowed, including,
+but not limited to:
+
+1. Manual correction of the output of your segmentation.
+2. Prepopulating the dictionary with words derived by a manual
+   inspection of the test corpus.
+
+* Results
+
+Results will be provided in two phases. Privately to individual
+participants by August 5, 2005, then publicly to all participants and
+to the community at large at the SIGHAN Workshop. By participating in
+this contest, you are agreeing that the results of the test may be
+published, including the names of the participants.
+
+* Writeup
+
+By electing to participate in any part of this contest, you are
+agreeing to provide, by August 19, 2005, a two-page writeup that
+briefly describes your segmentation system, and a summary of your
+results. In the closed tests you may describe the technical details of
+how you came by the particular results. In the open test you must
+describe the technical details of how you came by the particular
+results.
+
+The format of the two-page paper must adhere to the style guidelines
+for IJCNLP-05, except for the two page limit and the submission via
+the SIGHAN site.

doc/result_instructions.txt

@@ -0,0 +1,97 @@
+Bakeoff 2005 Result Submission Instructions
+
+Thank you for participating in the 2nd International Chinese Word
+Segmentation Bakeoff. Please read this message completely: it
+contains very important information on result submission.
+
+This message contains the instructions for submitting your
+results so that they can be scored. I originally planned to
+update the website to allow you to upload your results, but I
+decided against this for two reasons:
+
+1) Many participants are running tracks that are different from
+   what they signed up for, or wish to submit alternate runs
+   within a track. Writing a web application to handle this
+   correctly and reliably is difficult, and errors cannot be
+   tolerated.
+
+2) Connectivity to the SIGHAN site has been problematic for some
+   participants, especially in China. I do not want cause undue
+   stress on them if there are problems.
+
+Therefore you should submit your results _by_email_ to me at this
+address:
+
+                           [email protected]
+
+The subject of the message should be
+
+                    Bakeoff 2005 Result Submission
+
+The message should be sent by the primary investigator, i.e., the
+one who registered for participation. This is how I will match
+your submission to your registration.
+
+Please use the following conventions:
+
+1) Submit a single archive file (.zip, .rar, .tar.gz, or
+   .tar.bz2) containing your output file(s). Do this even if you
+   are submitting a single result file.
+
+2) The archive should be named with the email user id of the
+   submitter. For example, "[email protected]" would
+   submit "tree.zip".
+
+3) Each test file should be named X_test_result_[OC]_Y.Z where
+
+   X    is the name of the corpus: pku, cityu, as, msr
+   [OC] is whether the result is for the Open or Closed track
+   Y    is an optional identifier (a lower-case letter) for
+          multiple runs of the system
+   Z    is the file suffix, .txt or .utf8
+
+   For example, the results of running the UTF-8 encoded PKU
+   corpus in the closed track in a single run would be
+
+                        pku_test_result_C.utf8
+
+   Running the CP950 version of the Academia Sinica corpus in the
+   open track with two alternate systems would be
+
+                        as_test_result_O_a.txt
+                        as_test_result_O_b.txt
+
+   Note that 'a' and 'b' is used to distinguish two separate runs
+   on this corpus.
+
+4) The deadline for which I will accept result submissions is
+   14:00 GMT on Friday, July 29. Results received after this time
+   will not be scored unless the team can provide me with a
+   *very* good reason to allow the extension (e.g., the building
+   burned down, the national computer network went down, etc.)
+
+   To minimize confusion, 14:00 GMT on 2005/07/29 is:
+
+   07:00 2005/07/29 in San Francisco
+   10:00 2005/07/29 in New York
+   22:00 2005/07/29 in Hong Kong
+   22:00 2005/07/29 in Beijing
+   22:00 2005/07/29 in Taipei
+   22:00 2005/07/29 in Singapore
+   23:00 2005/07/29 in Seoul
+   23:00 2005/07/29 in Tokyo
+
+Answers to Some Common Questions
+
+The AS testing data had the spaces between English words
+inadvertantly removed. You will *not* be penalized for not
+segmenting English text.
+
+The AS training data used full-width space (U+3000, Big Five
+0xA140) to separate tokens. You can use either the full-width
+space or the normal ASCII space (0x20) in your result submission:
+these are scored equally. PLEASE NOTE: this is the *only*
+full-width/half-width normalization that is allowed! Do not
+convert full-width punctuation or Latin characters to half-width,
+these will *not* be scored correctly.
+

scripts/mwseg.pl

@@ -0,0 +1,93 @@
+#!/usr/bin/perl -w
+
+###########################################################################
+#                                                                         #
+#                               SIGHAN                                    #
+#                         Copyright (c) 2003                              #
+#                        All Rights Reserved.                             #
+#                                                                         #
+#  Permission is hereby granted, free of charge, to use and distribute    #
+#  this software and its documentation without restriction, including     #
+#  without limitation the rights to use, copy, modify, merge, publish,    #
+#  distribute, sublicense, and/or sell copies of this work, and to        #
+#  permit persons to whom this work is furnished to do so, subject to     #
+#  the following conditions:                                              #
+#   1. The code must retain the above copyright notice, this list of      #
+#      conditions and the following disclaimer.                           #
+#   2. Any modifications must be clearly marked as such.                  #
+#   3. Original authors' names are not deleted.                           #
+#   4. The authors' names are not used to endorse or promote products     #
+#      derived from this software without specific prior written          #
+#      permission.                                                        #
+#                                                                         #
+#  SIGHAN AND THE CONTRIBUTORS TO THIS WORK DISCLAIM ALL WARRANTIES       #
+#  WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF      #
+#  MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL SIGHAN NOR THE          #
+#  CONTRIBUTORS BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL      #
+#  DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA     #
+#  OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER      #
+#  TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR       #
+#  PERFORMANCE OF THIS SOFTWARE.                                          #
+#                                                                         #
+###########################################################################
+#                                                                         #
+# Author: Richard Sproat ([email protected])                           #
+#                                                                         #
+###########################################################################
+
+$USAGE = "Usage:\t$0 dictionary\n\t";
+
+if (@ARGV < 1) {print "$USAGE\n"; exit;}
+
+%dict = ();
+$maxwlen = 0;
+
+open (S, $ARGV[0]) or die "$ARGV[0]: $!\n";
+while (<S>) { 
+    chop; 
+    $dict{$_} = 1; 
+    my $l = length($_);
+    $maxwlen = $l if $l > $maxwlen;
+}
+close (S);
+
+shift @ARGV;
+
+$n = 0;
+while (<>) {
+    chop;
+    s/\s*//g;
+    my $text = $_;
+    while ($text ne "") {
+	$sub = substr($text, 0, $maxwlen);
+	while ($sub ne "") {
+	    if ($dict{$sub}) {
+		print "$sub ";
+		for (my $i = 0; $i < length($sub); ++$i) {
+		    $text =~ s/^.//;
+		}
+		last;
+	    }
+	    $sub =~ s/.$//;
+	}
+	if ($sub eq "")  {
+	    if ($text =~ /^([\x21-\x7e])/) {
+		print "$1 ";
+		$text =~ s/^.//;
+	    }
+	    elsif ($text =~ /^([^\x21-\x7e].)/) {
+		print "$1 ";
+		$text =~ s/^..//;
+	    }
+	    else { ## shouldn't happen
+		print STDERR "Oops: shouldn't be here: $n\n";
+		print "$1 ";
+		$text =~ s/^.//;
+	    }
+	}
+    }
+    print "\n";
+    ++$n;
+}
+
+exit(0);

scripts/score

@@ -0,0 +1,205 @@
+#!/usr/bin/perl -w
+
+###########################################################################
+#                                                                         #
+#                               SIGHAN                                    #
+#                      Copyright (c) 2003,2005                            #
+#                        All Rights Reserved.                             #
+#                                                                         #
+#  Permission is hereby granted, free of charge, to use and distribute    #
+#  this software and its documentation without restriction, including     #
+#  without limitation the rights to use, copy, modify, merge, publish,    #
+#  distribute, sublicense, and/or sell copies of this work, and to        #
+#  permit persons to whom this work is furnished to do so, subject to     #
+#  the following conditions:                                              #
+#   1. The code must retain the above copyright notice, this list of      #
+#      conditions and the following disclaimer.                           #
+#   2. Any modifications must be clearly marked as such.                  #
+#   3. Original authors' names are not deleted.                           #
+#   4. The authors' names are not used to endorse or promote products     #
+#      derived from this software without specific prior written          #
+#      permission.                                                        #
+#                                                                         #
+#  SIGHAN AND THE CONTRIBUTORS TO THIS WORK DISCLAIM ALL WARRANTIES       #
+#  WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF      #
+#  MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL SIGHAN NOR THE          #
+#  CONTRIBUTORS BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL      #
+#  DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA     #
+#  OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER      #
+#  TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR       #
+#  PERFORMANCE OF THIS SOFTWARE.                                          #
+#                                                                         #
+###########################################################################
+#                                                                         #
+# Author: Richard Sproat ([email protected])                                   #
+#         Tom Emerson ([email protected])                                #
+#                                                                         #
+###########################################################################
+
+## This code depends upon a version of diff (e.g. GNU diffutils 2.7.2)
+## that supports the -y flag:
+##
+## -y     Use the side by side output format.
+##
+## change the following per your installation:
+
+$diff = "/usr/bin/diff";
+
+$USAGE = "Usage:\t$0 dictionary truth test\n\t";
+
+if (@ARGV != 3) {print "$USAGE\n"; exit;}
+
+$tmp1 = "/tmp/comp01$$";
+$tmp2 = "/tmp/comp02$$";
+
+%dict = ();
+
+open (S, $ARGV[0]) or  die "$ARGV[0]: $!\n";
+
+while (<S>) {
+    chop;
+    s/^\s*//;
+    s/\s*$//;
+    $dict{$_} = 1;
+}
+
+close(S);
+
+open (TRUTH, $ARGV[1]) or die "$ARGV[1]: $!\n";
+open (TEST, $ARGV[2]) or die "$ARGV[2]: $!\n";
+
+$Tot = $Del = $Ins = $Subst = $Truecount = $Testcount = 0;
+$RawRecall = $RawPrecision = 0;
+
+$linenum = 0;
+
+
+$IVMISSED = $OOVMISSED = $OOV = $IV = 0;
+
+$file1 = $ARGV[1];
+$file2 = $ARGV[2];
+$file1 =~ s=^/.*/==;
+$file2 =~ s=^/.*/==;
+
+while (defined($truth = <TRUTH>) && defined($test = <TEST>)) {
+    $truth =~ s/^\s*//;
+    $test =~ s/^\s*//;
+    $truth =~ s/\s*$//;
+    $test =~ s/\s*$//;
+    $truth =~ s/(\xe3\x80\x80)|(\xa1\x40)/ /g;
+    $test =~ s/(\xe3\x80\x80)|(\xa1\x40)/ /g;
+    $truth =~ s/
+    $test =~ s/
+    @truthwords = split /\s+/, $truth;
+    @testwords = split /\s+/, $test;
+    $truecount = scalar(@truthwords);
+    $testcount = scalar(@testwords);
+    ++$linenum;
+    if ($truecount == 0) { 
+	if ($testcount > 0) {
+	    print STDERR "Warning: training is 0 but test is nonzero, possible misalignment at line $linenum.\n";
+	}
+	next; 
+    }
+    if ($testcount == 0) { 
+	print STDERR "Warning: No output in test data where there is in training data, line $linenum\n";
+    }
+    open (T1, ">$tmp1") or die "Can't open $tmp1";
+    open (T2, ">$tmp2") or die "Can't open $tmp2";
+    foreach my $w (@truthwords) { print T1 "$w\n"; }
+    foreach my $w (@testwords) {print T2 "$w\n";}
+    close (T1);
+    close (T2);
+    open (P, "$diff -y $tmp1 $tmp2 |") 
+	or die "Can't open pipe.\n";
+    print "--$file1-------$file2----$linenum\n";
+    my $del = 0;
+    my $ins = 0;
+    my $subst = 0;
+    my $rawrecall = 0;
+    my $rawprecision = 0;
+    while (<P>) {
+	my $err = 0;
+	if (/\s\|\s/) {$subst++ ; $err++; }
+	elsif (/\s\>\s/) {$ins++ ; $err++; }
+	elsif (/\s\<\s/) {$del++ ; $err++; }
+	if (/^([^\s]+)\s/) { 
+	    my $w = $1;
+	    if (!$dict{$w}) {++$OOV;}	    
+	    else {++$IV;}
+	    if (/^[^\s]+\s.*\s[\|\>\<]\s/) {
+		if (!$dict{$w}) {++$OOVMISSED;}
+		else {++$IVMISSED;}
+		++$rawrecall; 
+	    }
+	}
+	if (/\s[\|\>\<]\s.*[^\s]$/) { ++$rawprecision; }
+	print "$_";
+    }
+    close (P);
+    my $tot = $del + $ins + $subst;
+    $Tot += $tot;
+    $Del += $del;
+    $Ins += $ins;
+    $Subst += $subst;
+    $Truecount += $truecount;
+    $Testcount += $testcount;
+    $rawrecall = $truecount - $rawrecall;
+    $rawprecision = $testcount - $rawprecision;
+    $RawRecall += $rawrecall;
+    $RawPrecision += $rawprecision;
+    $rawrecall = sprintf("%2.3f", $rawrecall/$truecount);
+    $rawprecision = sprintf("%2.3f", $rawprecision/$testcount);
+    print "INSERTIONS:\t$ins\n";
+    print "DELETIONS:\t$del\n";
+    print "SUBSTITUTIONS:\t$subst\n";
+    print "NCHANGE:\t$tot\n";
+    print "NTRUTH:\t$truecount\n";
+    print "NTEST:\t$testcount\n";
+    print "TRUE WORDS RECALL:\t$rawrecall\n";
+    print "TEST WORDS PRECISION:\t$rawprecision\n";
+}
+
+close(TRUTH);
+close(TEST);
+unlink($tmp1);
+unlink($tmp2);
+
+print "=== SUMMARY:\n";
+print "=== TOTAL INSERTIONS:\t$Ins\n";
+print "=== TOTAL DELETIONS:\t$Del\n";
+print "=== TOTAL SUBSTITUTIONS:\t$Subst\n";
+print "=== TOTAL NCHANGE:\t$Tot\n";
+print "=== TOTAL TRUE WORD COUNT:\t$Truecount\n";
+print "=== TOTAL TEST WORD COUNT:\t$Testcount\n";
+$RawRecall =  $RawRecall/$Truecount;
+$RawPrecision = $RawPrecision/$Testcount;
+$beta = 1;
+$R = $RawRecall;
+$P = $RawPrecision;
+$F = (1 + $beta)*$P*$R/($beta * $P + $R);
+$F = sprintf("%2.3f", $F);
+$RawRecall = sprintf("%2.3f", $RawRecall);
+$RawPrecision = sprintf("%2.3f", $RawPrecision);
+print "=== TOTAL TRUE WORDS RECALL:\t$RawRecall\n";
+print "=== TOTAL TEST WORDS PRECISION:\t$RawPrecision\n";
+print "=== F MEASURE:\t$F\n";
+if ($OOV > 0) {
+    $OOVMISSED = sprintf("%2.3f", 1 - $OOVMISSED / $OOV);
+}
+else {
+    $OOVMISSED = "--";
+}
+$OOV = sprintf("%2.3f", $OOV / $Truecount);
+if ($IV > 0) {
+    $IVMISSED = sprintf("%2.3f", 1 - $IVMISSED / $IV);
+}
+else {
+    $IVMISSED = "--";
+}
+print "=== OOV Rate:\t$OOV\n";
+print "=== OOV Recall Rate:\t$OOVMISSED\n";
+print "=== IV Recall Rate:\t$IVMISSED\n";
+
+print "###\t$file2\t$Ins\t$Del\t$Subst\t$Tot\t$Truecount\t$Testcount\t$RawRecall\t$RawPrecision\t$F\t$OOV\t$OOVMISSED\t$IVMISSED\n";
+exit(0);

training/as_training.b5

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:19b05266bc1a8a020f51153ecceb38d5d3c517f5a468a085963bfe465d2ae882
+size 27635392

training/as_training.utf8

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:7169e008e88a434a1c21212d5e379a85a5d3a136679eabe3ae0dd677edfb26f0
+size 40743877

training/cityu_training.txt

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:774c5ee7cfcb8d01348bb65622fd635df8ed910b65d0eee4742b41e9e5bf9d72
+size 6230851

training/msr_training.txt

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3ab2390aad4c28934c282eb49a25ff7b210540fb6d70ec23f0b7af15926c3cd7
+size 12842947

training/msr_training.utf8

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:872a24b0aa827fe5334370c5d9bf090902a948cc103c4775a3f61285c052e6ee
+size 16891510

training/pku_training.txt

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:cfc95e1e1313b914ce3d4e7fcaca2ee918381c04546f85c50b67200579c1e807
+size 5906861