nltk 3.2__zip → 3.3__zip
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- {nltk-3.2 → nltk-3.3}/INSTALL.txt +6 -6
- {nltk-3.2 → nltk-3.3}/LICENSE.txt +13 -13
- {nltk-3.2 → nltk-3.3}/MANIFEST.in +6 -6
- {nltk-3.2/nltk.egg-info → nltk-3.3}/PKG-INFO +13 -5
- nltk-3.2/README.txt → nltk-3.3/README.md +49 -48
- nltk-3.3/nltk/VERSION +1 -0
- {nltk-3.2 → nltk-3.3}/nltk/__init__.py +185 -185
- {nltk-3.2 → nltk-3.3}/nltk/app/__init__.py +52 -53
- {nltk-3.2 → nltk-3.3}/nltk/app/chartparser_app.py +2276 -2276
- {nltk-3.2 → nltk-3.3}/nltk/app/chunkparser_app.py +1262 -1264
- {nltk-3.2 → nltk-3.3}/nltk/app/collocations_app.py +347 -350
- {nltk-3.2 → nltk-3.3}/nltk/app/concordance_app.py +568 -570
- {nltk-3.2 → nltk-3.3}/nltk/app/nemo_app.py +156 -155
- {nltk-3.2 → nltk-3.3}/nltk/app/rdparser_app.py +892 -894
- {nltk-3.2 → nltk-3.3}/nltk/app/srparser_app.py +809 -809
- {nltk-3.2 → nltk-3.3}/nltk/app/wordfreq_app.py +32 -32
- {nltk-3.2 → nltk-3.3}/nltk/app/wordnet_app.py +968 -968
- {nltk-3.2 → nltk-3.3}/nltk/book.py +91 -90
- {nltk-3.2 → nltk-3.3}/nltk/ccg/__init__.py +22 -22
- {nltk-3.2 → nltk-3.3}/nltk/ccg/api.py +359 -335
- {nltk-3.2 → nltk-3.3}/nltk/ccg/chart.py +394 -361
- {nltk-3.2 → nltk-3.3}/nltk/ccg/combinator.py +343 -312
- {nltk-3.2 → nltk-3.3}/nltk/ccg/lexicon.py +328 -290
- nltk-3.3/nltk/ccg/logic.py +46 -0
- {nltk-3.2 → nltk-3.3}/nltk/chat/__init__.py +49 -49
- {nltk-3.2 → nltk-3.3}/nltk/chat/eliza.py +244 -244
- {nltk-3.2 → nltk-3.3}/nltk/chat/iesha.py +140 -140
- {nltk-3.2 → nltk-3.3}/nltk/chat/rude.py +92 -92
- {nltk-3.2 → nltk-3.3}/nltk/chat/suntsu.py +117 -117
- {nltk-3.2 → nltk-3.3}/nltk/chat/util.py +122 -120
- {nltk-3.2 → nltk-3.3}/nltk/chat/zen.py +282 -282
- {nltk-3.2 → nltk-3.3}/nltk/chunk/__init__.py +190 -190
- {nltk-3.2 → nltk-3.3}/nltk/chunk/api.py +51 -51
- {nltk-3.2 → nltk-3.3}/nltk/chunk/named_entity.py +331 -331
- {nltk-3.2 → nltk-3.3}/nltk/chunk/regexp.py +1390 -1384
- {nltk-3.2 → nltk-3.3}/nltk/chunk/util.py +600 -600
- {nltk-3.2 → nltk-3.3}/nltk/classify/__init__.py +98 -98
- {nltk-3.2 → nltk-3.3}/nltk/classify/api.py +193 -193
- {nltk-3.2 → nltk-3.3}/nltk/classify/decisiontree.py +295 -295
- {nltk-3.2 → nltk-3.3}/nltk/classify/maxent.py +1510 -1492
- {nltk-3.2 → nltk-3.3}/nltk/classify/megam.py +179 -178
- {nltk-3.2 → nltk-3.3}/nltk/classify/naivebayes.py +245 -242
- {nltk-3.2 → nltk-3.3}/nltk/classify/positivenaivebayes.py +170 -170
- {nltk-3.2 → nltk-3.3}/nltk/classify/rte_classify.py +160 -191
- {nltk-3.2 → nltk-3.3}/nltk/classify/scikitlearn.py +153 -151
- {nltk-3.2 → nltk-3.3}/nltk/classify/senna.py +183 -181
- {nltk-3.2 → nltk-3.3}/nltk/classify/svm.py +15 -15
- {nltk-3.2 → nltk-3.3}/nltk/classify/tadm.py +113 -112
- {nltk-3.2 → nltk-3.3}/nltk/classify/textcat.py +193 -193
- {nltk-3.2 → nltk-3.3}/nltk/classify/util.py +324 -312
- {nltk-3.2 → nltk-3.3}/nltk/classify/weka.py +346 -345
- {nltk-3.2 → nltk-3.3}/nltk/cluster/__init__.py +86 -86
- {nltk-3.2 → nltk-3.3}/nltk/cluster/api.py +74 -70
- {nltk-3.2 → nltk-3.3}/nltk/cluster/em.py +247 -247
- {nltk-3.2 → nltk-3.3}/nltk/cluster/gaac.py +168 -168
- {nltk-3.2 → nltk-3.3}/nltk/cluster/kmeans.py +221 -221
- {nltk-3.2 → nltk-3.3}/nltk/cluster/util.py +304 -289
- nltk-3.3/nltk/collections.py +640 -0
- {nltk-3.2 → nltk-3.3}/nltk/collocations.py +388 -388
- nltk-3.3/nltk/compat.py +365 -0
- {nltk-3.2 → nltk-3.3}/nltk/corpus/__init__.py +341 -320
- {nltk-3.2 → nltk-3.3}/nltk/corpus/europarl_raw.py +44 -44
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/__init__.py +147 -145
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/aligned.py +115 -114
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/api.py +448 -446
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/bnc.py +252 -252
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/bracket_parse.py +227 -227
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/categorized_sents.py +179 -178
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/chasen.py +140 -139
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/childes.py +522 -494
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/chunked.py +212 -212
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/cmudict.py +97 -95
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/comparative_sents.py +280 -278
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/conll.py +528 -521
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/crubadan.py +116 -116
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/dependency.py +101 -101
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/framenet.py +3059 -2093
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/ieer.py +112 -111
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/indian.py +85 -86
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/ipipan.py +332 -331
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/knbc.py +187 -187
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/lin.py +156 -156
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/mte.py +311 -310
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/nkjp.py +429 -428
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/nombank.py +421 -421
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/nps_chat.py +73 -73
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/opinion_lexicon.py +115 -115
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/panlex_lite.py +165 -165
- nltk-3.3/nltk/corpus/reader/pl196x.py +292 -0
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/plaintext.py +232 -233
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/ppattach.py +96 -95
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/propbank.py +479 -481
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/pros_cons.py +128 -126
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/reviews.py +330 -328
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/rte.py +144 -146
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/semcor.py +256 -256
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/senseval.py +203 -201
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/sentiwordnet.py +137 -137
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/sinica_treebank.py +75 -75
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/string_category.py +60 -59
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/switchboard.py +119 -119
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/tagged.py +295 -294
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/timit.py +452 -450
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/toolbox.py +68 -68
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/twitter.py +155 -157
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/udhr.py +80 -80
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/util.py +804 -800
- nltk-3.3/nltk/corpus/reader/verbnet.py +595 -0
- nltk-3.3/nltk/corpus/reader/wordlist.py +134 -0
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/wordnet.py +2108 -2036
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/xmldocs.py +392 -387
- {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/ycoe.py +243 -242
- {nltk-3.2 → nltk-3.3}/nltk/corpus/util.py +144 -127
- {nltk-3.2 → nltk-3.3}/nltk/data.py +1487 -1451
- {nltk-3.2 → nltk-3.3}/nltk/decorators.py +219 -215
- {nltk-3.2 → nltk-3.3}/nltk/downloader.py +2278 -2274
- {nltk-3.2 → nltk-3.3}/nltk/draw/__init__.py +27 -27
- {nltk-3.2 → nltk-3.3}/nltk/draw/cfg.py +774 -777
- {nltk-3.2 → nltk-3.3}/nltk/draw/dispersion.py +58 -58
- {nltk-3.2 → nltk-3.3}/nltk/draw/table.py +1098 -1098
- {nltk-3.2 → nltk-3.3}/nltk/draw/tree.py +963 -966
- {nltk-3.2 → nltk-3.3}/nltk/draw/util.py +2356 -2356
- {nltk-3.2 → nltk-3.3}/nltk/featstruct.py +2617 -2500
- {nltk-3.2 → nltk-3.3}/nltk/grammar.py +1559 -1516
- {nltk-3.2 → nltk-3.3}/nltk/help.py +56 -56
- {nltk-3.2 → nltk-3.3}/nltk/inference/__init__.py +20 -20
- {nltk-3.2 → nltk-3.3}/nltk/inference/api.py +597 -589
- {nltk-3.2 → nltk-3.3}/nltk/inference/discourse.py +612 -608
- {nltk-3.2 → nltk-3.3}/nltk/inference/mace.py +311 -311
- {nltk-3.2 → nltk-3.3}/nltk/inference/nonmonotonic.py +509 -509
- {nltk-3.2 → nltk-3.3}/nltk/inference/prover9.py +431 -431
- {nltk-3.2 → nltk-3.3}/nltk/inference/resolution.py +687 -687
- {nltk-3.2 → nltk-3.3}/nltk/inference/tableau.py +607 -607
- {nltk-3.2 → nltk-3.3}/nltk/internals.py +982 -982
- {nltk-3.2 → nltk-3.3}/nltk/jsontags.py +63 -63
- {nltk-3.2 → nltk-3.3}/nltk/lazyimport.py +142 -142
- {nltk-3.2 → nltk-3.3}/nltk/metrics/__init__.py +30 -29
- {nltk-3.2 → nltk-3.3}/nltk/metrics/agreement.py +421 -401
- nltk-3.3/nltk/metrics/aline.py +607 -0
- {nltk-3.2 → nltk-3.3}/nltk/metrics/association.py +414 -410
- {nltk-3.2 → nltk-3.3}/nltk/metrics/confusionmatrix.py +206 -206
- {nltk-3.2 → nltk-3.3}/nltk/metrics/distance.py +207 -202
- {nltk-3.2 → nltk-3.3}/nltk/metrics/paice.py +381 -381
- {nltk-3.2 → nltk-3.3}/nltk/metrics/scores.py +228 -228
- {nltk-3.2 → nltk-3.3}/nltk/metrics/segmentation.py +231 -232
- {nltk-3.2 → nltk-3.3}/nltk/metrics/spearman.py +69 -69
- {nltk-3.2 → nltk-3.3}/nltk/misc/__init__.py +11 -11
- {nltk-3.2 → nltk-3.3}/nltk/misc/babelfish.py +10 -10
- {nltk-3.2 → nltk-3.3}/nltk/misc/chomsky.py +135 -133
- {nltk-3.2 → nltk-3.3}/nltk/misc/minimalset.py +83 -83
- {nltk-3.2 → nltk-3.3}/nltk/misc/sort.py +157 -157
- {nltk-3.2 → nltk-3.3}/nltk/misc/wordfinder.py +129 -129
- {nltk-3.2 → nltk-3.3}/nltk/parse/__init__.py +81 -80
- {nltk-3.2 → nltk-3.3}/nltk/parse/api.py +66 -66
- {nltk-3.2 → nltk-3.3}/nltk/parse/bllip.py +282 -282
- {nltk-3.2 → nltk-3.3}/nltk/parse/chart.py +1682 -1681
- nltk-3.3/nltk/parse/corenlp.py +780 -0
- {nltk-3.2 → nltk-3.3}/nltk/parse/dependencygraph.py +760 -758
- {nltk-3.2 → nltk-3.3}/nltk/parse/earleychart.py +452 -451
- {nltk-3.2 → nltk-3.3}/nltk/parse/evaluate.py +129 -129
- {nltk-3.2 → nltk-3.3}/nltk/parse/featurechart.py +580 -578
- {nltk-3.2 → nltk-3.3}/nltk/parse/generate.py +87 -76
- {nltk-3.2 → nltk-3.3}/nltk/parse/malt.py +356 -356
- {nltk-3.2 → nltk-3.3}/nltk/parse/nonprojectivedependencyparser.py +783 -783
- {nltk-3.2 → nltk-3.3}/nltk/parse/pchart.py +522 -522
- {nltk-3.2 → nltk-3.3}/nltk/parse/projectivedependencyparser.py +579 -578
- {nltk-3.2 → nltk-3.3}/nltk/parse/recursivedescent.py +655 -656
- {nltk-3.2 → nltk-3.3}/nltk/parse/shiftreduce.py +458 -459
- {nltk-3.2 → nltk-3.3}/nltk/parse/stanford.py +431 -406
- {nltk-3.2 → nltk-3.3}/nltk/parse/transitionparser.py +774 -772
- {nltk-3.2 → nltk-3.3}/nltk/parse/util.py +231 -231
- {nltk-3.2 → nltk-3.3}/nltk/parse/viterbi.py +401 -401
- {nltk-3.2 → nltk-3.3}/nltk/probability.py +2410 -2355
- {nltk-3.2 → nltk-3.3}/nltk/sem/__init__.py +61 -61
- {nltk-3.2 → nltk-3.3}/nltk/sem/boxer.py +1261 -1261
- {nltk-3.2 → nltk-3.3}/nltk/sem/chat80.py +782 -782
- {nltk-3.2 → nltk-3.3}/nltk/sem/cooper_storage.py +118 -118
- {nltk-3.2 → nltk-3.3}/nltk/sem/drt.py +1258 -1257
- {nltk-3.2 → nltk-3.3}/nltk/sem/drt_glue_demo.py +485 -489
- {nltk-3.2 → nltk-3.3}/nltk/sem/evaluate.py +790 -784
- {nltk-3.2 → nltk-3.3}/nltk/sem/glue.py +696 -694
- {nltk-3.2 → nltk-3.3}/nltk/sem/hole.py +386 -384
- {nltk-3.2 → nltk-3.3}/nltk/sem/lfg.py +210 -208
- {nltk-3.2 → nltk-3.3}/nltk/sem/linearlogic.py +451 -449
- {nltk-3.2 → nltk-3.3}/nltk/sem/logic.py +1910 -1910
- {nltk-3.2 → nltk-3.3}/nltk/sem/relextract.py +476 -483
- {nltk-3.2 → nltk-3.3}/nltk/sem/skolemize.py +101 -101
- {nltk-3.2 → nltk-3.3}/nltk/sem/util.py +249 -249
- {nltk-3.2 → nltk-3.3}/nltk/sentiment/__init__.py +14 -14
- {nltk-3.2 → nltk-3.3}/nltk/sentiment/sentiment_analyzer.py +229 -229
- {nltk-3.2 → nltk-3.3}/nltk/sentiment/util.py +762 -752
- {nltk-3.2 → nltk-3.3}/nltk/sentiment/vader.py +443 -445
- {nltk-3.2 → nltk-3.3}/nltk/stem/__init__.py +31 -33
- {nltk-3.2 → nltk-3.3}/nltk/stem/api.py +28 -25
- nltk-3.3/nltk/stem/arlstem.py +369 -0
- {nltk-3.2 → nltk-3.3}/nltk/stem/isri.py +345 -345
- {nltk-3.2 → nltk-3.3}/nltk/stem/lancaster.py +337 -310
- nltk-3.3/nltk/stem/porter.py +710 -0
- {nltk-3.2 → nltk-3.3}/nltk/stem/regexp.py +61 -61
- {nltk-3.2 → nltk-3.3}/nltk/stem/rslp.py +142 -142
- {nltk-3.2 → nltk-3.3}/nltk/stem/snowball.py +4236 -3712
- {nltk-3.2 → nltk-3.3}/nltk/stem/util.py +22 -12
- {nltk-3.2 → nltk-3.3}/nltk/stem/wordnet.py +51 -51
- {nltk-3.2 → nltk-3.3}/nltk/tag/__init__.py +152 -127
- {nltk-3.2 → nltk-3.3}/nltk/tag/api.py +86 -81
- {nltk-3.2 → nltk-3.3}/nltk/tag/brill.py +424 -426
- {nltk-3.2 → nltk-3.3}/nltk/tag/brill_trainer.py +608 -608
- {nltk-3.2 → nltk-3.3}/nltk/tag/crf.py +204 -200
- {nltk-3.2 → nltk-3.3}/nltk/tag/hmm.py +1277 -1277
- {nltk-3.2 → nltk-3.3}/nltk/tag/hunpos.py +132 -132
- {nltk-3.2 → nltk-3.3}/nltk/tag/mapping.py +101 -101
- {nltk-3.2 → nltk-3.3}/nltk/tag/perceptron.py +329 -314
- {nltk-3.2 → nltk-3.3}/nltk/tag/senna.py +147 -145
- {nltk-3.2 → nltk-3.3}/nltk/tag/sequential.py +740 -736
- {nltk-3.2 → nltk-3.3}/nltk/tag/stanford.py +219 -196
- {nltk-3.2 → nltk-3.3}/nltk/tag/tnt.py +595 -604
- {nltk-3.2 → nltk-3.3}/nltk/tag/util.py +72 -72
- {nltk-3.2 → nltk-3.3}/nltk/tbl/__init__.py +28 -28
- {nltk-3.2 → nltk-3.3}/nltk/tbl/api.py +1 -1
- {nltk-3.2 → nltk-3.3}/nltk/tbl/demo.py +366 -366
- {nltk-3.2 → nltk-3.3}/nltk/tbl/erroranalysis.py +39 -39
- {nltk-3.2 → nltk-3.3}/nltk/tbl/feature.py +259 -261
- {nltk-3.2 → nltk-3.3}/nltk/tbl/rule.py +321 -321
- {nltk-3.2 → nltk-3.3}/nltk/tbl/template.py +303 -308
- {nltk-3.2 → nltk-3.3}/nltk/test/__init__.py +18 -18
- {nltk-3.2 → nltk-3.3}/nltk/test/all.py +24 -23
- {nltk-3.2 → nltk-3.3}/nltk/test/bleu.doctest +14 -14
- {nltk-3.2 → nltk-3.3}/nltk/test/bnc.doctest +60 -60
- {nltk-3.2 → nltk-3.3}/nltk/test/ccg.doctest +376 -395
- nltk-3.3/nltk/test/ccg_semantics.doctest +553 -0
- {nltk-3.2 → nltk-3.3}/nltk/test/chat80.doctest +234 -234
- {nltk-3.2 → nltk-3.3}/nltk/test/childes.doctest +184 -184
- {nltk-3.2 → nltk-3.3}/nltk/test/childes_fixt.py +14 -13
- {nltk-3.2 → nltk-3.3}/nltk/test/chunk.doctest +373 -373
- {nltk-3.2 → nltk-3.3}/nltk/test/classify.doctest +185 -185
- {nltk-3.2 → nltk-3.3}/nltk/test/classify_fixt.py +11 -10
- nltk-3.3/nltk/test/collections.doctest +20 -0
- {nltk-3.2 → nltk-3.3}/nltk/test/collocations.doctest +276 -276
- {nltk-3.2 → nltk-3.3}/nltk/test/compat.doctest +134 -138
- {nltk-3.2 → nltk-3.3}/nltk/test/compat_fixt.py +9 -8
- nltk-3.3/nltk/test/concordance.doctest +55 -0
- {nltk-3.2 → nltk-3.3}/nltk/test/corpus.doctest +2200 -2212
- {nltk-3.2 → nltk-3.3}/nltk/test/corpus_fixt.py +3 -3
- {nltk-3.2 → nltk-3.3}/nltk/test/crubadan.doctest +65 -65
- {nltk-3.2 → nltk-3.3}/nltk/test/data.doctest +379 -379
- {nltk-3.2 → nltk-3.3}/nltk/test/dependency.doctest +241 -241
- {nltk-3.2 → nltk-3.3}/nltk/test/discourse.doctest +546 -546
- {nltk-3.2 → nltk-3.3}/nltk/test/discourse_fixt.py +14 -13
- {nltk-3.2 → nltk-3.3}/nltk/test/doctest_nose_plugin.py +159 -156
- {nltk-3.2 → nltk-3.3}/nltk/test/drt.doctest +517 -517
- {nltk-3.2 → nltk-3.3}/nltk/test/featgram.doctest +607 -607
- {nltk-3.2 → nltk-3.3}/nltk/test/featstruct.doctest +1229 -1230
- {nltk-3.2 → nltk-3.3}/nltk/test/framenet.doctest +288 -239
- {nltk-3.2 → nltk-3.3}/nltk/test/generate.doctest +67 -67
- {nltk-3.2 → nltk-3.3}/nltk/test/gensim.doctest +140 -141
- {nltk-3.2 → nltk-3.3}/nltk/test/gensim_fixt.py +10 -9
- {nltk-3.2 → nltk-3.3}/nltk/test/gluesemantics.doctest +384 -386
- {nltk-3.2 → nltk-3.3}/nltk/test/gluesemantics_malt.doctest +68 -68
- {nltk-3.2 → nltk-3.3}/nltk/test/gluesemantics_malt_fixt.py +12 -11
- {nltk-3.2 → nltk-3.3}/nltk/test/grammar.doctest +48 -48
- {nltk-3.2 → nltk-3.3}/nltk/test/grammartestsuites.doctest +109 -109
- {nltk-3.2 → nltk-3.3}/nltk/test/index.doctest +100 -100
- {nltk-3.2 → nltk-3.3}/nltk/test/inference.doctest +534 -534
- {nltk-3.2 → nltk-3.3}/nltk/test/inference_fixt.py +12 -11
- {nltk-3.2 → nltk-3.3}/nltk/test/internals.doctest +140 -140
- {nltk-3.2 → nltk-3.3}/nltk/test/japanese.doctest +48 -48
- {nltk-3.2 → nltk-3.3}/nltk/test/logic.doctest +1098 -1098
- {nltk-3.2 → nltk-3.3}/nltk/test/metrics.doctest +270 -270
- {nltk-3.2 → nltk-3.3}/nltk/test/misc.doctest +118 -118
- {nltk-3.2 → nltk-3.3}/nltk/test/nonmonotonic.doctest +286 -286
- {nltk-3.2 → nltk-3.3}/nltk/test/nonmonotonic_fixt.py +12 -11
- {nltk-3.2 → nltk-3.3}/nltk/test/paice.doctest +35 -35
- {nltk-3.2 → nltk-3.3}/nltk/test/parse.doctest +884 -884
- {nltk-3.2 → nltk-3.3}/nltk/test/portuguese_en.doctest +565 -565
- {nltk-3.2 → nltk-3.3}/nltk/test/portuguese_en_fixt.py +16 -16
- {nltk-3.2 → nltk-3.3}/nltk/test/probability.doctest +304 -304
- {nltk-3.2 → nltk-3.3}/nltk/test/probability_fixt.py +13 -12
- {nltk-3.2 → nltk-3.3}/nltk/test/propbank.doctest +176 -176
- {nltk-3.2 → nltk-3.3}/nltk/test/relextract.doctest +263 -263
- {nltk-3.2 → nltk-3.3}/nltk/test/resolution.doctest +221 -221
- {nltk-3.2 → nltk-3.3}/nltk/test/runtests.py +86 -64
- {nltk-3.2 → nltk-3.3}/nltk/test/segmentation_fixt.py +10 -10
- {nltk-3.2 → nltk-3.3}/nltk/test/semantics.doctest +665 -665
- {nltk-3.2 → nltk-3.3}/nltk/test/semantics_fixt.py +7 -7
- {nltk-3.2 → nltk-3.3}/nltk/test/sentiment.doctest +233 -233
- {nltk-3.2 → nltk-3.3}/nltk/test/sentiwordnet.doctest +41 -41
- {nltk-3.2 → nltk-3.3}/nltk/test/simple.doctest +85 -85
- {nltk-3.2 → nltk-3.3}/nltk/test/stem.doctest +78 -78
- {nltk-3.2 → nltk-3.3}/nltk/test/tag.doctest +33 -33
- {nltk-3.2 → nltk-3.3}/nltk/test/tokenize.doctest +273 -166
- {nltk-3.2 → nltk-3.3}/nltk/test/toolbox.doctest +307 -307
- {nltk-3.2 → nltk-3.3}/nltk/test/translate.doctest +242 -242
- {nltk-3.2 → nltk-3.3}/nltk/test/translate_fixt.py +3 -3
- {nltk-3.2 → nltk-3.3}/nltk/test/tree.doctest +1101 -1101
- {nltk-3.2 → nltk-3.3}/nltk/test/treeprettyprinter.doctest +127 -127
- {nltk-3.2 → nltk-3.3}/nltk/test/treetransforms.doctest +156 -156
- nltk-3.3/nltk/test/unit/test_2x_compat.py +63 -0
- nltk-3.3/nltk/test/unit/test_aline.py +52 -0
- nltk-3.3/nltk/test/unit/test_chunk.py +56 -0
- {nltk-3.2 → nltk-3.3}/nltk/test/unit/test_classify.py +55 -53
- {nltk-3.2 → nltk-3.3}/nltk/test/unit/test_collocations.py +88 -79
- nltk-3.3/nltk/test/unit/test_concordance.py +98 -0
- nltk-3.3/nltk/test/unit/test_corenlp.py +1000 -0
- {nltk-3.2 → nltk-3.3}/nltk/test/unit/test_corpora.py +200 -183
- {nltk-3.2 → nltk-3.3}/nltk/test/unit/test_corpus_views.py +45 -45
- {nltk-3.2 → nltk-3.3}/nltk/test/unit/test_hmm.py +88 -88
- {nltk-3.2 → nltk-3.3}/nltk/test/unit/test_json2csv_corpus.py +188 -187
- {nltk-3.2 → nltk-3.3}/nltk/test/unit/test_naivebayes.py +26 -26
- nltk-3.3/nltk/test/unit/test_rte_classify.py +86 -0
- {nltk-3.2 → nltk-3.3}/nltk/test/unit/test_seekable_unicode_stream_reader.py +124 -124
- nltk-3.3/nltk/test/unit/test_senna.py +74 -0
- nltk-3.3/nltk/test/unit/test_stem.py +121 -0
- {nltk-3.2 → nltk-3.3}/nltk/test/unit/test_tag.py +20 -20
- {nltk-3.2 → nltk-3.3}/nltk/test/unit/test_tgrep.py +628 -626
- nltk-3.3/nltk/test/unit/test_tokenize.py +168 -0
- {nltk-3.2 → nltk-3.3}/nltk/test/unit/test_twitter_auth.py +185 -185
- nltk-3.3/nltk/test/unit/test_wordnet.py +134 -0
- nltk-3.3/nltk/test/unit/translate/test_bleu.py +244 -0
- nltk-3.3/nltk/test/unit/translate/test_gdfa.py +57 -0
- {nltk-3.2 → nltk-3.3}/nltk/test/unit/translate/test_ibm1.py +75 -75
- {nltk-3.2 → nltk-3.3}/nltk/test/unit/translate/test_ibm2.py +87 -87
- {nltk-3.2 → nltk-3.3}/nltk/test/unit/translate/test_ibm3.py +105 -105
- {nltk-3.2 → nltk-3.3}/nltk/test/unit/translate/test_ibm4.py +126 -126
- {nltk-3.2 → nltk-3.3}/nltk/test/unit/translate/test_ibm5.py +166 -166
- {nltk-3.2 → nltk-3.3}/nltk/test/unit/translate/test_ibm_model.py +270 -270
- nltk-3.3/nltk/test/unit/translate/test_nist.py +37 -0
- {nltk-3.2 → nltk-3.3}/nltk/test/unit/translate/test_stack_decoder.py +300 -300
- {nltk-3.2 → nltk-3.3}/nltk/test/unit/utils.py +41 -41
- {nltk-3.2 → nltk-3.3}/nltk/test/util.doctest +48 -48
- {nltk-3.2 → nltk-3.3}/nltk/test/wordnet.doctest +595 -581
- {nltk-3.2 → nltk-3.3}/nltk/test/wordnet_fixt.py +7 -6
- {nltk-3.2 → nltk-3.3}/nltk/test/wordnet_lch.doctest +53 -53
- {nltk-3.2 → nltk-3.3}/nltk/test/wsd.doctest +68 -68
- {nltk-3.2 → nltk-3.3}/nltk/text.py +663 -610
- {nltk-3.2 → nltk-3.3}/nltk/tgrep.py +938 -937
- {nltk-3.2 → nltk-3.3}/nltk/tokenize/__init__.py +130 -107
- {nltk-3.2 → nltk-3.3}/nltk/tokenize/api.py +77 -78
- {nltk-3.2 → nltk-3.3}/nltk/tokenize/casual.py +343 -342
- {nltk-3.2 → nltk-3.3}/nltk/tokenize/mwe.py +120 -120
- nltk-3.3/nltk/tokenize/nist.py +173 -0
- {nltk-3.2 → nltk-3.3}/nltk/tokenize/punkt.py +1620 -1601
- {nltk-3.2 → nltk-3.3}/nltk/tokenize/regexp.py +208 -202
- nltk-3.3/nltk/tokenize/repp.py +151 -0
- {nltk-3.2 → nltk-3.3}/nltk/tokenize/sexpr.py +140 -142
- {nltk-3.2 → nltk-3.3}/nltk/tokenize/simple.py +138 -136
- {nltk-3.2 → nltk-3.3}/nltk/tokenize/stanford.py +117 -113
- nltk-3.3/nltk/tokenize/stanford_segmenter.py +246 -0
- {nltk-3.2 → nltk-3.3}/nltk/tokenize/texttiling.py +458 -460
- nltk-3.3/nltk/tokenize/toktok.py +155 -0
- nltk-3.3/nltk/tokenize/treebank.py +363 -0
- nltk-3.3/nltk/tokenize/util.py +261 -0
- {nltk-3.2 → nltk-3.3}/nltk/toolbox.py +499 -497
- {nltk-3.2 → nltk-3.3}/nltk/translate/__init__.py +24 -24
- {nltk-3.2 → nltk-3.3}/nltk/translate/api.py +331 -321
- {nltk-3.2 → nltk-3.3}/nltk/translate/bleu_score.py +615 -556
- nltk-3.3/nltk/translate/chrf_score.py +137 -0
- {nltk-3.2 → nltk-3.3}/nltk/translate/gale_church.py +248 -235
- {nltk-3.2 → nltk-3.3}/nltk/translate/gdfa.py +135 -131
- nltk-3.3/nltk/translate/gleu_score.py +193 -0
- {nltk-3.2 → nltk-3.3}/nltk/translate/ibm1.py +250 -241
- {nltk-3.2 → nltk-3.3}/nltk/translate/ibm2.py +308 -308
- {nltk-3.2 → nltk-3.3}/nltk/translate/ibm3.py +337 -337
- {nltk-3.2 → nltk-3.3}/nltk/translate/ibm4.py +467 -467
- {nltk-3.2 → nltk-3.3}/nltk/translate/ibm5.py +639 -639
- {nltk-3.2 → nltk-3.3}/nltk/translate/ibm_model.py +536 -533
- {nltk-3.2 → nltk-3.3}/nltk/translate/metrics.py +40 -40
- nltk-3.3/nltk/translate/nist_score.py +178 -0
- {nltk-3.2 → nltk-3.3}/nltk/translate/phrase_based.py +175 -175
- {nltk-3.2 → nltk-3.3}/nltk/translate/ribes_score.py +325 -325
- {nltk-3.2 → nltk-3.3}/nltk/translate/stack_decoder.py +499 -495
- {nltk-3.2 → nltk-3.3}/nltk/tree.py +1605 -1603
- {nltk-3.2 → nltk-3.3}/nltk/treeprettyprinter.py +564 -564
- {nltk-3.2 → nltk-3.3}/nltk/treetransforms.py +309 -309
- {nltk-3.2 → nltk-3.3}/nltk/twitter/__init__.py +28 -28
- {nltk-3.2 → nltk-3.3}/nltk/twitter/api.py +141 -136
- {nltk-3.2 → nltk-3.3}/nltk/twitter/common.py +264 -258
- {nltk-3.2 → nltk-3.3}/nltk/twitter/twitter_demo.py +288 -288
- {nltk-3.2 → nltk-3.3}/nltk/twitter/twitterclient.py +530 -530
- {nltk-3.2 → nltk-3.3}/nltk/twitter/util.py +147 -146
- nltk-3.3/nltk/util.py +751 -0
- {nltk-3.2 → nltk-3.3}/nltk/wsd.py +53 -53
- {nltk-3.2 → nltk-3.3/nltk.egg-info}/PKG-INFO +13 -5
- {nltk-3.2 → nltk-3.3}/nltk.egg-info/SOURCES.txt +26 -3
- nltk-3.3/nltk.egg-info/requires.txt +31 -0
- {nltk-3.2 → nltk-3.3}/setup.cfg +0 -1
- {nltk-3.2 → nltk-3.3}/setup.py +102 -75
- nltk-3.2/nltk/VERSION +0 -1
- nltk-3.2/nltk/compat.py +0 -680
- nltk-3.2/nltk/corpus/reader/pl196x.py +0 -278
- nltk-3.2/nltk/corpus/reader/verbnet.py +0 -408
- nltk-3.2/nltk/corpus/reader/wordlist.py +0 -37
- nltk-3.2/nltk/sentiment/vader_lexicon.txt +0 -7517
- nltk-3.2/nltk/six.py +0 -868
- nltk-3.2/nltk/stem/porter.py +0 -692
- nltk-3.2/nltk/test/unit/test_2x_compat.py +0 -26
- nltk-3.2/nltk/test/unit/test_stem.py +0 -36
- nltk-3.2/nltk/test/unit/test_tokenize.py +0 -23
- nltk-3.2/nltk/test/unit/translate/test_bleu.py +0 -84
- nltk-3.2/nltk/tokenize/treebank.py +0 -124
- nltk-3.2/nltk/tokenize/util.py +0 -90
- nltk-3.2/nltk/util.py +0 -1364
- {nltk-3.2 → nltk-3.3}/nltk/test/unit/__init__.py +0 -0
- {nltk-3.2 → nltk-3.3}/nltk/test/unit/translate/__init__.py +0 -0
- {nltk-3.2 → nltk-3.3}/nltk.egg-info/dependency_links.txt +0 -0
- {nltk-3.2 → nltk-3.3}/nltk.egg-info/not-zip-safe +0 -0
- {nltk-3.2 → nltk-3.3}/nltk.egg-info/top_level.txt +0 -0
|
@@ -1,800 +1,804 @@
|
|
|
1
|
-
# Natural Language Toolkit: Corpus Reader Utilities
|
|
2
|
-
#
|
|
3
|
-
# Copyright (C) 2001-
|
|
4
|
-
# Author: Steven Bird <stevenbird1@gmail.com>
|
|
5
|
-
# Edward Loper <edloper@gmail.com>
|
|
6
|
-
# URL: <http://nltk.org/>
|
|
7
|
-
# For license information, see LICENSE.TXT
|
|
8
|
-
|
|
9
|
-
import os
|
|
10
|
-
import bisect
|
|
11
|
-
import re
|
|
12
|
-
import tempfile
|
|
13
|
-
from
|
|
14
|
-
|
|
15
|
-
|
|
16
|
-
|
|
17
|
-
|
|
18
|
-
|
|
19
|
-
|
|
20
|
-
|
|
21
|
-
|
|
22
|
-
|
|
23
|
-
|
|
24
|
-
from nltk.tokenize import wordpunct_tokenize
|
|
25
|
-
from nltk.internals import slice_bounds
|
|
26
|
-
from nltk.data import PathPointer, FileSystemPathPointer, ZipFilePathPointer
|
|
27
|
-
from nltk.data import SeekableUnicodeStreamReader
|
|
28
|
-
from nltk.util import AbstractLazySequence, LazySubsequence, LazyConcatenation, py25
|
|
29
|
-
|
|
30
|
-
######################################################################
|
|
31
|
-
#{ Corpus View
|
|
32
|
-
######################################################################
|
|
33
|
-
|
|
34
|
-
class StreamBackedCorpusView(AbstractLazySequence):
|
|
35
|
-
"""
|
|
36
|
-
A 'view' of a corpus file, which acts like a sequence of tokens:
|
|
37
|
-
it can be accessed by index, iterated over, etc. However, the
|
|
38
|
-
tokens are only constructed as-needed -- the entire corpus is
|
|
39
|
-
never stored in memory at once.
|
|
40
|
-
|
|
41
|
-
The constructor to ``StreamBackedCorpusView`` takes two arguments:
|
|
42
|
-
a corpus fileid (specified as a string or as a ``PathPointer``);
|
|
43
|
-
and a block reader. A "block reader" is a function that reads
|
|
44
|
-
zero or more tokens from a stream, and returns them as a list. A
|
|
45
|
-
very simple example of a block reader is:
|
|
46
|
-
|
|
47
|
-
>>> def simple_block_reader(stream):
|
|
48
|
-
... return stream.readline().split()
|
|
49
|
-
|
|
50
|
-
This simple block reader reads a single line at a time, and
|
|
51
|
-
returns a single token (consisting of a string) for each
|
|
52
|
-
whitespace-separated substring on the line.
|
|
53
|
-
|
|
54
|
-
When deciding how to define the block reader for a given
|
|
55
|
-
corpus, careful consideration should be given to the size of
|
|
56
|
-
blocks handled by the block reader. Smaller block sizes will
|
|
57
|
-
increase the memory requirements of the corpus view's internal
|
|
58
|
-
data structures (by 2 integers per block). On the other hand,
|
|
59
|
-
larger block sizes may decrease performance for random access to
|
|
60
|
-
the corpus. (But note that larger block sizes will *not*
|
|
61
|
-
decrease performance for iteration.)
|
|
62
|
-
|
|
63
|
-
Internally, ``CorpusView`` maintains a partial mapping from token
|
|
64
|
-
index to file position, with one entry per block. When a token
|
|
65
|
-
with a given index *i* is requested, the ``CorpusView`` constructs
|
|
66
|
-
it as follows:
|
|
67
|
-
|
|
68
|
-
1. First, it searches the toknum/filepos mapping for the token
|
|
69
|
-
index closest to (but less than or equal to) *i*.
|
|
70
|
-
|
|
71
|
-
2. Then, starting at the file position corresponding to that
|
|
72
|
-
index, it reads one block at a time using the block reader
|
|
73
|
-
until it reaches the requested token.
|
|
74
|
-
|
|
75
|
-
The toknum/filepos mapping is created lazily: it is initially
|
|
76
|
-
empty, but every time a new block is read, the block's
|
|
77
|
-
initial token is added to the mapping. (Thus, the toknum/filepos
|
|
78
|
-
map has one entry per block.)
|
|
79
|
-
|
|
80
|
-
In order to increase efficiency for random access patterns that
|
|
81
|
-
have high degrees of locality, the corpus view may cache one or
|
|
82
|
-
more blocks.
|
|
83
|
-
|
|
84
|
-
:note: Each ``CorpusView`` object internally maintains an open file
|
|
85
|
-
object for its underlying corpus file. This file should be
|
|
86
|
-
automatically closed when the ``CorpusView`` is garbage collected,
|
|
87
|
-
but if you wish to close it manually, use the ``close()``
|
|
88
|
-
method. If you access a ``CorpusView``'s items after it has been
|
|
89
|
-
closed, the file object will be automatically re-opened.
|
|
90
|
-
|
|
91
|
-
:warning: If the contents of the file are modified during the
|
|
92
|
-
lifetime of the ``CorpusView``, then the ``CorpusView``'s behavior
|
|
93
|
-
is undefined.
|
|
94
|
-
|
|
95
|
-
:warning: If a unicode encoding is specified when constructing a
|
|
96
|
-
``CorpusView``, then the block reader may only call
|
|
97
|
-
``stream.seek()`` with offsets that have been returned by
|
|
98
|
-
``stream.tell()``; in particular, calling ``stream.seek()`` with
|
|
99
|
-
relative offsets, or with offsets based on string lengths, may
|
|
100
|
-
lead to incorrect behavior.
|
|
101
|
-
|
|
102
|
-
:ivar _block_reader: The function used to read
|
|
103
|
-
a single block from the underlying file stream.
|
|
104
|
-
:ivar _toknum: A list containing the token index of each block
|
|
105
|
-
that has been processed. In particular, ``_toknum[i]`` is the
|
|
106
|
-
token index of the first token in block ``i``. Together
|
|
107
|
-
with ``_filepos``, this forms a partial mapping between token
|
|
108
|
-
indices and file positions.
|
|
109
|
-
:ivar _filepos: A list containing the file position of each block
|
|
110
|
-
that has been processed. In particular, ``_toknum[i]`` is the
|
|
111
|
-
file position of the first character in block ``i``. Together
|
|
112
|
-
with ``_toknum``, this forms a partial mapping between token
|
|
113
|
-
indices and file positions.
|
|
114
|
-
:ivar _stream: The stream used to access the underlying corpus file.
|
|
115
|
-
:ivar _len: The total number of tokens in the corpus, if known;
|
|
116
|
-
or None, if the number of tokens is not yet known.
|
|
117
|
-
:ivar _eofpos: The character position of the last character in the
|
|
118
|
-
file. This is calculated when the corpus view is initialized,
|
|
119
|
-
and is used to decide when the end of file has been reached.
|
|
120
|
-
:ivar _cache: A cache of the most recently read block. It
|
|
121
|
-
is encoded as a tuple (start_toknum, end_toknum, tokens), where
|
|
122
|
-
start_toknum is the token index of the first token in the block;
|
|
123
|
-
end_toknum is the token index of the first token not in the
|
|
124
|
-
block; and tokens is a list of the tokens in the block.
|
|
125
|
-
"""
|
|
126
|
-
def __init__(self, fileid, block_reader=None, startpos=0,
|
|
127
|
-
encoding='utf8'):
|
|
128
|
-
"""
|
|
129
|
-
Create a new corpus view, based on the file ``fileid``, and
|
|
130
|
-
read with ``block_reader``. See the class documentation
|
|
131
|
-
for more information.
|
|
132
|
-
|
|
133
|
-
:param fileid: The path to the file that is read by this
|
|
134
|
-
corpus view. ``fileid`` can either be a string or a
|
|
135
|
-
``PathPointer``.
|
|
136
|
-
|
|
137
|
-
:param startpos: The file position at which the view will
|
|
138
|
-
start reading. This can be used to skip over preface
|
|
139
|
-
sections.
|
|
140
|
-
|
|
141
|
-
:param encoding: The unicode encoding that should be used to
|
|
142
|
-
read the file's contents. If no encoding is specified,
|
|
143
|
-
then the file's contents will be read as a non-unicode
|
|
144
|
-
string (i.e., a str).
|
|
145
|
-
"""
|
|
146
|
-
if block_reader:
|
|
147
|
-
self.read_block = block_reader
|
|
148
|
-
# Initialize our toknum/filepos mapping.
|
|
149
|
-
self._toknum = [0]
|
|
150
|
-
self._filepos = [startpos]
|
|
151
|
-
self._encoding = encoding
|
|
152
|
-
# We don't know our length (number of tokens) yet.
|
|
153
|
-
self._len = None
|
|
154
|
-
|
|
155
|
-
self._fileid = fileid
|
|
156
|
-
self._stream = None
|
|
157
|
-
|
|
158
|
-
self._current_toknum = None
|
|
159
|
-
"""This variable is set to the index of the next token that
|
|
160
|
-
will be read, immediately before ``self.read_block()`` is
|
|
161
|
-
called. This is provided for the benefit of the block
|
|
162
|
-
reader, which under rare circumstances may need to know
|
|
163
|
-
the current token number."""
|
|
164
|
-
|
|
165
|
-
self._current_blocknum = None
|
|
166
|
-
"""This variable is set to the index of the next block that
|
|
167
|
-
will be read, immediately before ``self.read_block()`` is
|
|
168
|
-
called. This is provided for the benefit of the block
|
|
169
|
-
reader, which under rare circumstances may need to know
|
|
170
|
-
the current block number."""
|
|
171
|
-
|
|
172
|
-
# Find the length of the file.
|
|
173
|
-
try:
|
|
174
|
-
if isinstance(self._fileid, PathPointer):
|
|
175
|
-
self._eofpos = self._fileid.file_size()
|
|
176
|
-
else:
|
|
177
|
-
self._eofpos = os.stat(self._fileid).st_size
|
|
178
|
-
except Exception as exc:
|
|
179
|
-
raise ValueError('Unable to open or access %r -- %s' %
|
|
180
|
-
(fileid, exc))
|
|
181
|
-
|
|
182
|
-
# Maintain a cache of the most recently read block, to
|
|
183
|
-
# increase efficiency of random access.
|
|
184
|
-
self._cache = (-1, -1, None)
|
|
185
|
-
|
|
186
|
-
fileid = property(lambda self: self._fileid, doc="""
|
|
187
|
-
The fileid of the file that is accessed by this view.
|
|
188
|
-
|
|
189
|
-
:type: str or PathPointer""")
|
|
190
|
-
|
|
191
|
-
def read_block(self, stream):
|
|
192
|
-
"""
|
|
193
|
-
Read a block from the input stream.
|
|
194
|
-
|
|
195
|
-
:return: a block of tokens from the input stream
|
|
196
|
-
:rtype: list(any)
|
|
197
|
-
:param stream: an input stream
|
|
198
|
-
:type stream: stream
|
|
199
|
-
"""
|
|
200
|
-
raise NotImplementedError('Abstract Method')
|
|
201
|
-
|
|
202
|
-
def _open(self):
|
|
203
|
-
"""
|
|
204
|
-
Open the file stream associated with this corpus view. This
|
|
205
|
-
will be called performed if any value is read from the view
|
|
206
|
-
while its file stream is closed.
|
|
207
|
-
"""
|
|
208
|
-
if isinstance(self._fileid, PathPointer):
|
|
209
|
-
self._stream = self._fileid.open(self._encoding)
|
|
210
|
-
elif self._encoding:
|
|
211
|
-
self._stream = SeekableUnicodeStreamReader(
|
|
212
|
-
open(self._fileid, 'rb'), self._encoding)
|
|
213
|
-
else:
|
|
214
|
-
self._stream = open(self._fileid, 'rb')
|
|
215
|
-
|
|
216
|
-
def close(self):
|
|
217
|
-
"""
|
|
218
|
-
Close the file stream associated with this corpus view. This
|
|
219
|
-
can be useful if you are worried about running out of file
|
|
220
|
-
handles (although the stream should automatically be closed
|
|
221
|
-
upon garbage collection of the corpus view). If the corpus
|
|
222
|
-
view is accessed after it is closed, it will be automatically
|
|
223
|
-
re-opened.
|
|
224
|
-
"""
|
|
225
|
-
if self._stream is not None:
|
|
226
|
-
self._stream.close()
|
|
227
|
-
self._stream = None
|
|
228
|
-
|
|
229
|
-
def __len__(self):
|
|
230
|
-
if self._len is None:
|
|
231
|
-
# iterate_from() sets self._len when it reaches the end
|
|
232
|
-
# of the file:
|
|
233
|
-
for tok in self.iterate_from(self._toknum[-1]): pass
|
|
234
|
-
return self._len
|
|
235
|
-
|
|
236
|
-
def __getitem__(self, i):
|
|
237
|
-
if isinstance(i, slice):
|
|
238
|
-
start, stop = slice_bounds(self, i)
|
|
239
|
-
# Check if it's in the cache.
|
|
240
|
-
offset = self._cache[0]
|
|
241
|
-
if offset <= start and stop <= self._cache[1]:
|
|
242
|
-
return self._cache[2][start-offset:stop-offset]
|
|
243
|
-
# Construct & return the result.
|
|
244
|
-
return LazySubsequence(self, start, stop)
|
|
245
|
-
else:
|
|
246
|
-
# Handle negative indices
|
|
247
|
-
if i < 0: i += len(self)
|
|
248
|
-
if i < 0: raise IndexError('index out of range')
|
|
249
|
-
# Check if it's in the cache.
|
|
250
|
-
offset = self._cache[0]
|
|
251
|
-
if offset <= i < self._cache[1]:
|
|
252
|
-
return self._cache[2][i-offset]
|
|
253
|
-
# Use iterate_from to extract it.
|
|
254
|
-
try:
|
|
255
|
-
return next(self.iterate_from(i))
|
|
256
|
-
except StopIteration:
|
|
257
|
-
raise IndexError('index out of range')
|
|
258
|
-
|
|
259
|
-
# If we wanted to be thread-safe, then this method would need to
|
|
260
|
-
# do some locking.
|
|
261
|
-
def iterate_from(self, start_tok):
|
|
262
|
-
# Start by feeding from the cache, if possible.
|
|
263
|
-
if self._cache[0] <= start_tok < self._cache[1]:
|
|
264
|
-
for tok in self._cache[2][start_tok-self._cache[0]:]:
|
|
265
|
-
yield tok
|
|
266
|
-
start_tok += 1
|
|
267
|
-
|
|
268
|
-
# Decide where in the file we should start. If `start` is in
|
|
269
|
-
# our mapping, then we can jump straight to the correct block;
|
|
270
|
-
# otherwise, start at the last block we've processed.
|
|
271
|
-
if start_tok < self._toknum[-1]:
|
|
272
|
-
block_index = bisect.bisect_right(self._toknum, start_tok)-1
|
|
273
|
-
toknum = self._toknum[block_index]
|
|
274
|
-
filepos = self._filepos[block_index]
|
|
275
|
-
else:
|
|
276
|
-
block_index = len(self._toknum)-1
|
|
277
|
-
toknum = self._toknum[-1]
|
|
278
|
-
filepos = self._filepos[-1]
|
|
279
|
-
|
|
280
|
-
# Open the stream, if it's not open already.
|
|
281
|
-
if self._stream is None:
|
|
282
|
-
self._open()
|
|
283
|
-
|
|
284
|
-
#
|
|
285
|
-
#
|
|
286
|
-
|
|
287
|
-
|
|
288
|
-
|
|
289
|
-
|
|
290
|
-
|
|
291
|
-
|
|
292
|
-
|
|
293
|
-
|
|
294
|
-
|
|
295
|
-
|
|
296
|
-
|
|
297
|
-
assert
|
|
298
|
-
'block reader %s() should
|
|
299
|
-
|
|
300
|
-
|
|
301
|
-
|
|
302
|
-
|
|
303
|
-
|
|
304
|
-
|
|
305
|
-
|
|
306
|
-
|
|
307
|
-
|
|
308
|
-
|
|
309
|
-
|
|
310
|
-
|
|
311
|
-
|
|
312
|
-
|
|
313
|
-
|
|
314
|
-
assert new_filepos
|
|
315
|
-
|
|
316
|
-
|
|
317
|
-
|
|
318
|
-
|
|
319
|
-
|
|
320
|
-
|
|
321
|
-
|
|
322
|
-
|
|
323
|
-
|
|
324
|
-
#
|
|
325
|
-
|
|
326
|
-
|
|
327
|
-
#
|
|
328
|
-
|
|
329
|
-
|
|
330
|
-
|
|
331
|
-
|
|
332
|
-
|
|
333
|
-
|
|
334
|
-
|
|
335
|
-
|
|
336
|
-
|
|
337
|
-
|
|
338
|
-
|
|
339
|
-
|
|
340
|
-
|
|
341
|
-
|
|
342
|
-
|
|
343
|
-
|
|
344
|
-
|
|
345
|
-
|
|
346
|
-
|
|
347
|
-
|
|
348
|
-
|
|
349
|
-
|
|
350
|
-
|
|
351
|
-
|
|
352
|
-
|
|
353
|
-
|
|
354
|
-
|
|
355
|
-
|
|
356
|
-
|
|
357
|
-
|
|
358
|
-
|
|
359
|
-
|
|
360
|
-
|
|
361
|
-
|
|
362
|
-
|
|
363
|
-
|
|
364
|
-
|
|
365
|
-
|
|
366
|
-
|
|
367
|
-
|
|
368
|
-
self.
|
|
369
|
-
"""
|
|
370
|
-
|
|
371
|
-
|
|
372
|
-
|
|
373
|
-
|
|
374
|
-
|
|
375
|
-
|
|
376
|
-
|
|
377
|
-
|
|
378
|
-
|
|
379
|
-
|
|
380
|
-
|
|
381
|
-
|
|
382
|
-
|
|
383
|
-
|
|
384
|
-
|
|
385
|
-
|
|
386
|
-
|
|
387
|
-
|
|
388
|
-
|
|
389
|
-
|
|
390
|
-
|
|
391
|
-
|
|
392
|
-
|
|
393
|
-
|
|
394
|
-
|
|
395
|
-
|
|
396
|
-
|
|
397
|
-
|
|
398
|
-
|
|
399
|
-
|
|
400
|
-
|
|
401
|
-
|
|
402
|
-
|
|
403
|
-
|
|
404
|
-
|
|
405
|
-
|
|
406
|
-
|
|
407
|
-
|
|
408
|
-
|
|
409
|
-
|
|
410
|
-
|
|
411
|
-
|
|
412
|
-
|
|
413
|
-
"""
|
|
414
|
-
|
|
415
|
-
|
|
416
|
-
|
|
417
|
-
|
|
418
|
-
|
|
419
|
-
|
|
420
|
-
|
|
421
|
-
|
|
422
|
-
|
|
423
|
-
|
|
424
|
-
|
|
425
|
-
|
|
426
|
-
|
|
427
|
-
|
|
428
|
-
|
|
429
|
-
|
|
430
|
-
|
|
431
|
-
|
|
432
|
-
|
|
433
|
-
|
|
434
|
-
|
|
435
|
-
|
|
436
|
-
|
|
437
|
-
|
|
438
|
-
|
|
439
|
-
|
|
440
|
-
|
|
441
|
-
|
|
442
|
-
|
|
443
|
-
|
|
444
|
-
|
|
445
|
-
|
|
446
|
-
|
|
447
|
-
|
|
448
|
-
|
|
449
|
-
|
|
450
|
-
|
|
451
|
-
|
|
452
|
-
|
|
453
|
-
return
|
|
454
|
-
|
|
455
|
-
|
|
456
|
-
|
|
457
|
-
|
|
458
|
-
|
|
459
|
-
|
|
460
|
-
|
|
461
|
-
|
|
462
|
-
|
|
463
|
-
|
|
464
|
-
|
|
465
|
-
|
|
466
|
-
|
|
467
|
-
|
|
468
|
-
|
|
469
|
-
|
|
470
|
-
|
|
471
|
-
|
|
472
|
-
|
|
473
|
-
|
|
474
|
-
|
|
475
|
-
|
|
476
|
-
|
|
477
|
-
|
|
478
|
-
|
|
479
|
-
|
|
480
|
-
|
|
481
|
-
|
|
482
|
-
|
|
483
|
-
|
|
484
|
-
|
|
485
|
-
|
|
486
|
-
|
|
487
|
-
|
|
488
|
-
|
|
489
|
-
|
|
490
|
-
|
|
491
|
-
|
|
492
|
-
|
|
493
|
-
|
|
494
|
-
|
|
495
|
-
|
|
496
|
-
|
|
497
|
-
|
|
498
|
-
|
|
499
|
-
|
|
500
|
-
|
|
501
|
-
|
|
502
|
-
|
|
503
|
-
|
|
504
|
-
|
|
505
|
-
"""
|
|
506
|
-
|
|
507
|
-
|
|
508
|
-
|
|
509
|
-
|
|
510
|
-
|
|
511
|
-
|
|
512
|
-
|
|
513
|
-
|
|
514
|
-
|
|
515
|
-
|
|
516
|
-
|
|
517
|
-
|
|
518
|
-
|
|
519
|
-
|
|
520
|
-
|
|
521
|
-
|
|
522
|
-
|
|
523
|
-
|
|
524
|
-
|
|
525
|
-
|
|
526
|
-
|
|
527
|
-
|
|
528
|
-
|
|
529
|
-
|
|
530
|
-
|
|
531
|
-
|
|
532
|
-
|
|
533
|
-
|
|
534
|
-
|
|
535
|
-
|
|
536
|
-
|
|
537
|
-
|
|
538
|
-
|
|
539
|
-
|
|
540
|
-
|
|
541
|
-
|
|
542
|
-
|
|
543
|
-
|
|
544
|
-
|
|
545
|
-
|
|
546
|
-
|
|
547
|
-
|
|
548
|
-
|
|
549
|
-
|
|
550
|
-
|
|
551
|
-
|
|
552
|
-
|
|
553
|
-
|
|
554
|
-
|
|
555
|
-
|
|
556
|
-
|
|
557
|
-
|
|
558
|
-
|
|
559
|
-
|
|
560
|
-
|
|
561
|
-
|
|
562
|
-
|
|
563
|
-
|
|
564
|
-
|
|
565
|
-
|
|
566
|
-
|
|
567
|
-
|
|
568
|
-
|
|
569
|
-
|
|
570
|
-
|
|
571
|
-
|
|
572
|
-
|
|
573
|
-
|
|
574
|
-
|
|
575
|
-
|
|
576
|
-
|
|
577
|
-
|
|
578
|
-
|
|
579
|
-
|
|
580
|
-
|
|
581
|
-
|
|
582
|
-
|
|
583
|
-
|
|
584
|
-
|
|
585
|
-
|
|
586
|
-
|
|
587
|
-
|
|
588
|
-
|
|
589
|
-
|
|
590
|
-
|
|
591
|
-
|
|
592
|
-
if
|
|
593
|
-
|
|
594
|
-
|
|
595
|
-
|
|
596
|
-
|
|
597
|
-
|
|
598
|
-
|
|
599
|
-
|
|
600
|
-
|
|
601
|
-
"""
|
|
602
|
-
|
|
603
|
-
|
|
604
|
-
|
|
605
|
-
|
|
606
|
-
|
|
607
|
-
|
|
608
|
-
|
|
609
|
-
|
|
610
|
-
|
|
611
|
-
|
|
612
|
-
|
|
613
|
-
|
|
614
|
-
|
|
615
|
-
|
|
616
|
-
|
|
617
|
-
|
|
618
|
-
|
|
619
|
-
|
|
620
|
-
|
|
621
|
-
|
|
622
|
-
|
|
623
|
-
return [''.join(lines)]
|
|
624
|
-
#
|
|
625
|
-
|
|
626
|
-
|
|
627
|
-
|
|
628
|
-
|
|
629
|
-
|
|
630
|
-
|
|
631
|
-
|
|
632
|
-
|
|
633
|
-
|
|
634
|
-
|
|
635
|
-
|
|
636
|
-
|
|
637
|
-
|
|
638
|
-
|
|
639
|
-
|
|
640
|
-
|
|
641
|
-
|
|
642
|
-
|
|
643
|
-
|
|
644
|
-
|
|
645
|
-
|
|
646
|
-
|
|
647
|
-
|
|
648
|
-
|
|
649
|
-
|
|
650
|
-
|
|
651
|
-
|
|
652
|
-
|
|
653
|
-
|
|
654
|
-
|
|
655
|
-
|
|
656
|
-
|
|
657
|
-
|
|
658
|
-
|
|
659
|
-
|
|
660
|
-
|
|
661
|
-
|
|
662
|
-
|
|
663
|
-
|
|
664
|
-
|
|
665
|
-
|
|
666
|
-
|
|
667
|
-
|
|
668
|
-
#
|
|
669
|
-
|
|
670
|
-
|
|
671
|
-
|
|
672
|
-
|
|
673
|
-
#
|
|
674
|
-
|
|
675
|
-
|
|
676
|
-
|
|
677
|
-
|
|
678
|
-
|
|
679
|
-
|
|
680
|
-
|
|
681
|
-
|
|
682
|
-
|
|
683
|
-
|
|
684
|
-
|
|
685
|
-
|
|
686
|
-
|
|
687
|
-
|
|
688
|
-
|
|
689
|
-
|
|
690
|
-
|
|
691
|
-
|
|
692
|
-
|
|
693
|
-
|
|
694
|
-
|
|
695
|
-
|
|
696
|
-
|
|
697
|
-
def
|
|
698
|
-
|
|
699
|
-
|
|
700
|
-
|
|
701
|
-
|
|
702
|
-
|
|
703
|
-
|
|
704
|
-
|
|
705
|
-
|
|
706
|
-
|
|
707
|
-
|
|
708
|
-
|
|
709
|
-
|
|
710
|
-
|
|
711
|
-
|
|
712
|
-
|
|
713
|
-
|
|
714
|
-
|
|
715
|
-
|
|
716
|
-
|
|
717
|
-
|
|
718
|
-
|
|
719
|
-
|
|
720
|
-
|
|
721
|
-
|
|
722
|
-
|
|
723
|
-
|
|
724
|
-
|
|
725
|
-
|
|
726
|
-
|
|
727
|
-
|
|
728
|
-
|
|
729
|
-
|
|
730
|
-
|
|
731
|
-
|
|
732
|
-
|
|
733
|
-
|
|
734
|
-
|
|
735
|
-
|
|
736
|
-
|
|
737
|
-
|
|
738
|
-
|
|
739
|
-
|
|
740
|
-
|
|
741
|
-
|
|
742
|
-
|
|
743
|
-
|
|
744
|
-
|
|
745
|
-
|
|
746
|
-
|
|
747
|
-
|
|
748
|
-
|
|
749
|
-
|
|
750
|
-
|
|
751
|
-
|
|
752
|
-
|
|
753
|
-
|
|
754
|
-
|
|
755
|
-
items
|
|
756
|
-
|
|
757
|
-
|
|
758
|
-
|
|
759
|
-
|
|
760
|
-
|
|
761
|
-
|
|
762
|
-
|
|
763
|
-
|
|
764
|
-
|
|
765
|
-
|
|
766
|
-
|
|
767
|
-
|
|
768
|
-
|
|
769
|
-
|
|
770
|
-
|
|
771
|
-
|
|
772
|
-
|
|
773
|
-
|
|
774
|
-
|
|
775
|
-
|
|
776
|
-
|
|
777
|
-
|
|
778
|
-
|
|
779
|
-
|
|
780
|
-
|
|
781
|
-
|
|
782
|
-
|
|
783
|
-
|
|
784
|
-
|
|
785
|
-
|
|
786
|
-
|
|
787
|
-
|
|
788
|
-
|
|
789
|
-
|
|
790
|
-
|
|
791
|
-
|
|
792
|
-
|
|
793
|
-
|
|
794
|
-
|
|
795
|
-
|
|
796
|
-
|
|
797
|
-
|
|
798
|
-
|
|
799
|
-
|
|
800
|
-
|
|
1
|
+
# Natural Language Toolkit: Corpus Reader Utilities
|
|
2
|
+
#
|
|
3
|
+
# Copyright (C) 2001-2018 NLTK Project
|
|
4
|
+
# Author: Steven Bird <stevenbird1@gmail.com>
|
|
5
|
+
# Edward Loper <edloper@gmail.com>
|
|
6
|
+
# URL: <http://nltk.org/>
|
|
7
|
+
# For license information, see LICENSE.TXT
|
|
8
|
+
|
|
9
|
+
import os
|
|
10
|
+
import bisect
|
|
11
|
+
import re
|
|
12
|
+
import tempfile
|
|
13
|
+
from six import string_types, text_type
|
|
14
|
+
from functools import reduce
|
|
15
|
+
try:
|
|
16
|
+
import cPickle as pickle
|
|
17
|
+
except ImportError:
|
|
18
|
+
import pickle
|
|
19
|
+
|
|
20
|
+
# Use the c version of ElementTree, which is faster, if possible:
|
|
21
|
+
try: from xml.etree import cElementTree as ElementTree
|
|
22
|
+
except ImportError: from xml.etree import ElementTree
|
|
23
|
+
|
|
24
|
+
from nltk.tokenize import wordpunct_tokenize
|
|
25
|
+
from nltk.internals import slice_bounds
|
|
26
|
+
from nltk.data import PathPointer, FileSystemPathPointer, ZipFilePathPointer
|
|
27
|
+
from nltk.data import SeekableUnicodeStreamReader
|
|
28
|
+
from nltk.util import AbstractLazySequence, LazySubsequence, LazyConcatenation, py25
|
|
29
|
+
|
|
30
|
+
######################################################################
|
|
31
|
+
#{ Corpus View
|
|
32
|
+
######################################################################
|
|
33
|
+
|
|
34
|
+
class StreamBackedCorpusView(AbstractLazySequence):
|
|
35
|
+
"""
|
|
36
|
+
A 'view' of a corpus file, which acts like a sequence of tokens:
|
|
37
|
+
it can be accessed by index, iterated over, etc. However, the
|
|
38
|
+
tokens are only constructed as-needed -- the entire corpus is
|
|
39
|
+
never stored in memory at once.
|
|
40
|
+
|
|
41
|
+
The constructor to ``StreamBackedCorpusView`` takes two arguments:
|
|
42
|
+
a corpus fileid (specified as a string or as a ``PathPointer``);
|
|
43
|
+
and a block reader. A "block reader" is a function that reads
|
|
44
|
+
zero or more tokens from a stream, and returns them as a list. A
|
|
45
|
+
very simple example of a block reader is:
|
|
46
|
+
|
|
47
|
+
>>> def simple_block_reader(stream):
|
|
48
|
+
... return stream.readline().split()
|
|
49
|
+
|
|
50
|
+
This simple block reader reads a single line at a time, and
|
|
51
|
+
returns a single token (consisting of a string) for each
|
|
52
|
+
whitespace-separated substring on the line.
|
|
53
|
+
|
|
54
|
+
When deciding how to define the block reader for a given
|
|
55
|
+
corpus, careful consideration should be given to the size of
|
|
56
|
+
blocks handled by the block reader. Smaller block sizes will
|
|
57
|
+
increase the memory requirements of the corpus view's internal
|
|
58
|
+
data structures (by 2 integers per block). On the other hand,
|
|
59
|
+
larger block sizes may decrease performance for random access to
|
|
60
|
+
the corpus. (But note that larger block sizes will *not*
|
|
61
|
+
decrease performance for iteration.)
|
|
62
|
+
|
|
63
|
+
Internally, ``CorpusView`` maintains a partial mapping from token
|
|
64
|
+
index to file position, with one entry per block. When a token
|
|
65
|
+
with a given index *i* is requested, the ``CorpusView`` constructs
|
|
66
|
+
it as follows:
|
|
67
|
+
|
|
68
|
+
1. First, it searches the toknum/filepos mapping for the token
|
|
69
|
+
index closest to (but less than or equal to) *i*.
|
|
70
|
+
|
|
71
|
+
2. Then, starting at the file position corresponding to that
|
|
72
|
+
index, it reads one block at a time using the block reader
|
|
73
|
+
until it reaches the requested token.
|
|
74
|
+
|
|
75
|
+
The toknum/filepos mapping is created lazily: it is initially
|
|
76
|
+
empty, but every time a new block is read, the block's
|
|
77
|
+
initial token is added to the mapping. (Thus, the toknum/filepos
|
|
78
|
+
map has one entry per block.)
|
|
79
|
+
|
|
80
|
+
In order to increase efficiency for random access patterns that
|
|
81
|
+
have high degrees of locality, the corpus view may cache one or
|
|
82
|
+
more blocks.
|
|
83
|
+
|
|
84
|
+
:note: Each ``CorpusView`` object internally maintains an open file
|
|
85
|
+
object for its underlying corpus file. This file should be
|
|
86
|
+
automatically closed when the ``CorpusView`` is garbage collected,
|
|
87
|
+
but if you wish to close it manually, use the ``close()``
|
|
88
|
+
method. If you access a ``CorpusView``'s items after it has been
|
|
89
|
+
closed, the file object will be automatically re-opened.
|
|
90
|
+
|
|
91
|
+
:warning: If the contents of the file are modified during the
|
|
92
|
+
lifetime of the ``CorpusView``, then the ``CorpusView``'s behavior
|
|
93
|
+
is undefined.
|
|
94
|
+
|
|
95
|
+
:warning: If a unicode encoding is specified when constructing a
|
|
96
|
+
``CorpusView``, then the block reader may only call
|
|
97
|
+
``stream.seek()`` with offsets that have been returned by
|
|
98
|
+
``stream.tell()``; in particular, calling ``stream.seek()`` with
|
|
99
|
+
relative offsets, or with offsets based on string lengths, may
|
|
100
|
+
lead to incorrect behavior.
|
|
101
|
+
|
|
102
|
+
:ivar _block_reader: The function used to read
|
|
103
|
+
a single block from the underlying file stream.
|
|
104
|
+
:ivar _toknum: A list containing the token index of each block
|
|
105
|
+
that has been processed. In particular, ``_toknum[i]`` is the
|
|
106
|
+
token index of the first token in block ``i``. Together
|
|
107
|
+
with ``_filepos``, this forms a partial mapping between token
|
|
108
|
+
indices and file positions.
|
|
109
|
+
:ivar _filepos: A list containing the file position of each block
|
|
110
|
+
that has been processed. In particular, ``_toknum[i]`` is the
|
|
111
|
+
file position of the first character in block ``i``. Together
|
|
112
|
+
with ``_toknum``, this forms a partial mapping between token
|
|
113
|
+
indices and file positions.
|
|
114
|
+
:ivar _stream: The stream used to access the underlying corpus file.
|
|
115
|
+
:ivar _len: The total number of tokens in the corpus, if known;
|
|
116
|
+
or None, if the number of tokens is not yet known.
|
|
117
|
+
:ivar _eofpos: The character position of the last character in the
|
|
118
|
+
file. This is calculated when the corpus view is initialized,
|
|
119
|
+
and is used to decide when the end of file has been reached.
|
|
120
|
+
:ivar _cache: A cache of the most recently read block. It
|
|
121
|
+
is encoded as a tuple (start_toknum, end_toknum, tokens), where
|
|
122
|
+
start_toknum is the token index of the first token in the block;
|
|
123
|
+
end_toknum is the token index of the first token not in the
|
|
124
|
+
block; and tokens is a list of the tokens in the block.
|
|
125
|
+
"""
|
|
126
|
+
def __init__(self, fileid, block_reader=None, startpos=0,
|
|
127
|
+
encoding='utf8'):
|
|
128
|
+
"""
|
|
129
|
+
Create a new corpus view, based on the file ``fileid``, and
|
|
130
|
+
read with ``block_reader``. See the class documentation
|
|
131
|
+
for more information.
|
|
132
|
+
|
|
133
|
+
:param fileid: The path to the file that is read by this
|
|
134
|
+
corpus view. ``fileid`` can either be a string or a
|
|
135
|
+
``PathPointer``.
|
|
136
|
+
|
|
137
|
+
:param startpos: The file position at which the view will
|
|
138
|
+
start reading. This can be used to skip over preface
|
|
139
|
+
sections.
|
|
140
|
+
|
|
141
|
+
:param encoding: The unicode encoding that should be used to
|
|
142
|
+
read the file's contents. If no encoding is specified,
|
|
143
|
+
then the file's contents will be read as a non-unicode
|
|
144
|
+
string (i.e., a str).
|
|
145
|
+
"""
|
|
146
|
+
if block_reader:
|
|
147
|
+
self.read_block = block_reader
|
|
148
|
+
# Initialize our toknum/filepos mapping.
|
|
149
|
+
self._toknum = [0]
|
|
150
|
+
self._filepos = [startpos]
|
|
151
|
+
self._encoding = encoding
|
|
152
|
+
# We don't know our length (number of tokens) yet.
|
|
153
|
+
self._len = None
|
|
154
|
+
|
|
155
|
+
self._fileid = fileid
|
|
156
|
+
self._stream = None
|
|
157
|
+
|
|
158
|
+
self._current_toknum = None
|
|
159
|
+
"""This variable is set to the index of the next token that
|
|
160
|
+
will be read, immediately before ``self.read_block()`` is
|
|
161
|
+
called. This is provided for the benefit of the block
|
|
162
|
+
reader, which under rare circumstances may need to know
|
|
163
|
+
the current token number."""
|
|
164
|
+
|
|
165
|
+
self._current_blocknum = None
|
|
166
|
+
"""This variable is set to the index of the next block that
|
|
167
|
+
will be read, immediately before ``self.read_block()`` is
|
|
168
|
+
called. This is provided for the benefit of the block
|
|
169
|
+
reader, which under rare circumstances may need to know
|
|
170
|
+
the current block number."""
|
|
171
|
+
|
|
172
|
+
# Find the length of the file.
|
|
173
|
+
try:
|
|
174
|
+
if isinstance(self._fileid, PathPointer):
|
|
175
|
+
self._eofpos = self._fileid.file_size()
|
|
176
|
+
else:
|
|
177
|
+
self._eofpos = os.stat(self._fileid).st_size
|
|
178
|
+
except Exception as exc:
|
|
179
|
+
raise ValueError('Unable to open or access %r -- %s' %
|
|
180
|
+
(fileid, exc))
|
|
181
|
+
|
|
182
|
+
# Maintain a cache of the most recently read block, to
|
|
183
|
+
# increase efficiency of random access.
|
|
184
|
+
self._cache = (-1, -1, None)
|
|
185
|
+
|
|
186
|
+
fileid = property(lambda self: self._fileid, doc="""
|
|
187
|
+
The fileid of the file that is accessed by this view.
|
|
188
|
+
|
|
189
|
+
:type: str or PathPointer""")
|
|
190
|
+
|
|
191
|
+
def read_block(self, stream):
|
|
192
|
+
"""
|
|
193
|
+
Read a block from the input stream.
|
|
194
|
+
|
|
195
|
+
:return: a block of tokens from the input stream
|
|
196
|
+
:rtype: list(any)
|
|
197
|
+
:param stream: an input stream
|
|
198
|
+
:type stream: stream
|
|
199
|
+
"""
|
|
200
|
+
raise NotImplementedError('Abstract Method')
|
|
201
|
+
|
|
202
|
+
def _open(self):
|
|
203
|
+
"""
|
|
204
|
+
Open the file stream associated with this corpus view. This
|
|
205
|
+
will be called performed if any value is read from the view
|
|
206
|
+
while its file stream is closed.
|
|
207
|
+
"""
|
|
208
|
+
if isinstance(self._fileid, PathPointer):
|
|
209
|
+
self._stream = self._fileid.open(self._encoding)
|
|
210
|
+
elif self._encoding:
|
|
211
|
+
self._stream = SeekableUnicodeStreamReader(
|
|
212
|
+
open(self._fileid, 'rb'), self._encoding)
|
|
213
|
+
else:
|
|
214
|
+
self._stream = open(self._fileid, 'rb')
|
|
215
|
+
|
|
216
|
+
def close(self):
|
|
217
|
+
"""
|
|
218
|
+
Close the file stream associated with this corpus view. This
|
|
219
|
+
can be useful if you are worried about running out of file
|
|
220
|
+
handles (although the stream should automatically be closed
|
|
221
|
+
upon garbage collection of the corpus view). If the corpus
|
|
222
|
+
view is accessed after it is closed, it will be automatically
|
|
223
|
+
re-opened.
|
|
224
|
+
"""
|
|
225
|
+
if self._stream is not None:
|
|
226
|
+
self._stream.close()
|
|
227
|
+
self._stream = None
|
|
228
|
+
|
|
229
|
+
def __len__(self):
|
|
230
|
+
if self._len is None:
|
|
231
|
+
# iterate_from() sets self._len when it reaches the end
|
|
232
|
+
# of the file:
|
|
233
|
+
for tok in self.iterate_from(self._toknum[-1]): pass
|
|
234
|
+
return self._len
|
|
235
|
+
|
|
236
|
+
def __getitem__(self, i):
|
|
237
|
+
if isinstance(i, slice):
|
|
238
|
+
start, stop = slice_bounds(self, i)
|
|
239
|
+
# Check if it's in the cache.
|
|
240
|
+
offset = self._cache[0]
|
|
241
|
+
if offset <= start and stop <= self._cache[1]:
|
|
242
|
+
return self._cache[2][start-offset:stop-offset]
|
|
243
|
+
# Construct & return the result.
|
|
244
|
+
return LazySubsequence(self, start, stop)
|
|
245
|
+
else:
|
|
246
|
+
# Handle negative indices
|
|
247
|
+
if i < 0: i += len(self)
|
|
248
|
+
if i < 0: raise IndexError('index out of range')
|
|
249
|
+
# Check if it's in the cache.
|
|
250
|
+
offset = self._cache[0]
|
|
251
|
+
if offset <= i < self._cache[1]:
|
|
252
|
+
return self._cache[2][i-offset]
|
|
253
|
+
# Use iterate_from to extract it.
|
|
254
|
+
try:
|
|
255
|
+
return next(self.iterate_from(i))
|
|
256
|
+
except StopIteration:
|
|
257
|
+
raise IndexError('index out of range')
|
|
258
|
+
|
|
259
|
+
# If we wanted to be thread-safe, then this method would need to
|
|
260
|
+
# do some locking.
|
|
261
|
+
def iterate_from(self, start_tok):
|
|
262
|
+
# Start by feeding from the cache, if possible.
|
|
263
|
+
if self._cache[0] <= start_tok < self._cache[1]:
|
|
264
|
+
for tok in self._cache[2][start_tok-self._cache[0]:]:
|
|
265
|
+
yield tok
|
|
266
|
+
start_tok += 1
|
|
267
|
+
|
|
268
|
+
# Decide where in the file we should start. If `start` is in
|
|
269
|
+
# our mapping, then we can jump straight to the correct block;
|
|
270
|
+
# otherwise, start at the last block we've processed.
|
|
271
|
+
if start_tok < self._toknum[-1]:
|
|
272
|
+
block_index = bisect.bisect_right(self._toknum, start_tok)-1
|
|
273
|
+
toknum = self._toknum[block_index]
|
|
274
|
+
filepos = self._filepos[block_index]
|
|
275
|
+
else:
|
|
276
|
+
block_index = len(self._toknum)-1
|
|
277
|
+
toknum = self._toknum[-1]
|
|
278
|
+
filepos = self._filepos[-1]
|
|
279
|
+
|
|
280
|
+
# Open the stream, if it's not open already.
|
|
281
|
+
if self._stream is None:
|
|
282
|
+
self._open()
|
|
283
|
+
|
|
284
|
+
# If the file is empty, the while loop will never run.
|
|
285
|
+
# This *seems* to be all the state we need to set:
|
|
286
|
+
if self._eofpos == 0:
|
|
287
|
+
self._len = 0
|
|
288
|
+
|
|
289
|
+
# Each iteration through this loop, we read a single block
|
|
290
|
+
# from the stream.
|
|
291
|
+
while filepos < self._eofpos:
|
|
292
|
+
# Read the next block.
|
|
293
|
+
self._stream.seek(filepos)
|
|
294
|
+
self._current_toknum = toknum
|
|
295
|
+
self._current_blocknum = block_index
|
|
296
|
+
tokens = self.read_block(self._stream)
|
|
297
|
+
assert isinstance(tokens, (tuple, list, AbstractLazySequence)), (
|
|
298
|
+
'block reader %s() should return list or tuple.' %
|
|
299
|
+
self.read_block.__name__)
|
|
300
|
+
num_toks = len(tokens)
|
|
301
|
+
new_filepos = self._stream.tell()
|
|
302
|
+
assert new_filepos > filepos, (
|
|
303
|
+
'block reader %s() should consume at least 1 byte (filepos=%d)' %
|
|
304
|
+
(self.read_block.__name__, filepos))
|
|
305
|
+
|
|
306
|
+
# Update our cache.
|
|
307
|
+
self._cache = (toknum, toknum+num_toks, list(tokens))
|
|
308
|
+
|
|
309
|
+
# Update our mapping.
|
|
310
|
+
assert toknum <= self._toknum[-1]
|
|
311
|
+
if num_toks > 0:
|
|
312
|
+
block_index += 1
|
|
313
|
+
if toknum == self._toknum[-1]:
|
|
314
|
+
assert new_filepos > self._filepos[-1] # monotonic!
|
|
315
|
+
self._filepos.append(new_filepos)
|
|
316
|
+
self._toknum.append(toknum+num_toks)
|
|
317
|
+
else:
|
|
318
|
+
# Check for consistency:
|
|
319
|
+
assert new_filepos == self._filepos[block_index], (
|
|
320
|
+
'inconsistent block reader (num chars read)')
|
|
321
|
+
assert toknum+num_toks == self._toknum[block_index], (
|
|
322
|
+
'inconsistent block reader (num tokens returned)')
|
|
323
|
+
|
|
324
|
+
# If we reached the end of the file, then update self._len
|
|
325
|
+
if new_filepos == self._eofpos:
|
|
326
|
+
self._len = toknum + num_toks
|
|
327
|
+
# Generate the tokens in this block (but skip any tokens
|
|
328
|
+
# before start_tok). Note that between yields, our state
|
|
329
|
+
# may be modified.
|
|
330
|
+
for tok in tokens[max(0, start_tok-toknum):]:
|
|
331
|
+
yield tok
|
|
332
|
+
# If we're at the end of the file, then we're done.
|
|
333
|
+
assert new_filepos <= self._eofpos
|
|
334
|
+
if new_filepos == self._eofpos:
|
|
335
|
+
break
|
|
336
|
+
# Update our indices
|
|
337
|
+
toknum += num_toks
|
|
338
|
+
filepos = new_filepos
|
|
339
|
+
|
|
340
|
+
# If we reach this point, then we should know our length.
|
|
341
|
+
assert self._len is not None
|
|
342
|
+
# Enforce closing of stream once we reached end of file
|
|
343
|
+
# We should have reached EOF once we're out of the while loop.
|
|
344
|
+
self.close()
|
|
345
|
+
|
|
346
|
+
# Use concat for these, so we can use a ConcatenatedCorpusView
|
|
347
|
+
# when possible.
|
|
348
|
+
def __add__(self, other):
|
|
349
|
+
return concat([self, other])
|
|
350
|
+
def __radd__(self, other):
|
|
351
|
+
return concat([other, self])
|
|
352
|
+
def __mul__(self, count):
|
|
353
|
+
return concat([self] * count)
|
|
354
|
+
def __rmul__(self, count):
|
|
355
|
+
return concat([self] * count)
|
|
356
|
+
|
|
357
|
+
class ConcatenatedCorpusView(AbstractLazySequence):
|
|
358
|
+
"""
|
|
359
|
+
A 'view' of a corpus file that joins together one or more
|
|
360
|
+
``StreamBackedCorpusViews<StreamBackedCorpusView>``. At most
|
|
361
|
+
one file handle is left open at any time.
|
|
362
|
+
"""
|
|
363
|
+
def __init__(self, corpus_views):
|
|
364
|
+
self._pieces = corpus_views
|
|
365
|
+
"""A list of the corpus subviews that make up this
|
|
366
|
+
concatenation."""
|
|
367
|
+
|
|
368
|
+
self._offsets = [0]
|
|
369
|
+
"""A list of offsets, indicating the index at which each
|
|
370
|
+
subview begins. In particular::
|
|
371
|
+
offsets[i] = sum([len(p) for p in pieces[:i]])"""
|
|
372
|
+
|
|
373
|
+
self._open_piece = None
|
|
374
|
+
"""The most recently accessed corpus subview (or None).
|
|
375
|
+
Before a new subview is accessed, this subview will be closed."""
|
|
376
|
+
|
|
377
|
+
def __len__(self):
|
|
378
|
+
if len(self._offsets) <= len(self._pieces):
|
|
379
|
+
# Iterate to the end of the corpus.
|
|
380
|
+
for tok in self.iterate_from(self._offsets[-1]): pass
|
|
381
|
+
|
|
382
|
+
return self._offsets[-1]
|
|
383
|
+
|
|
384
|
+
def close(self):
|
|
385
|
+
for piece in self._pieces:
|
|
386
|
+
piece.close()
|
|
387
|
+
|
|
388
|
+
def iterate_from(self, start_tok):
|
|
389
|
+
piecenum = bisect.bisect_right(self._offsets, start_tok)-1
|
|
390
|
+
|
|
391
|
+
while piecenum < len(self._pieces):
|
|
392
|
+
offset = self._offsets[piecenum]
|
|
393
|
+
piece = self._pieces[piecenum]
|
|
394
|
+
|
|
395
|
+
# If we've got another piece open, close it first.
|
|
396
|
+
if self._open_piece is not piece:
|
|
397
|
+
if self._open_piece is not None:
|
|
398
|
+
self._open_piece.close()
|
|
399
|
+
self._open_piece = piece
|
|
400
|
+
|
|
401
|
+
# Get everything we can from this piece.
|
|
402
|
+
for tok in piece.iterate_from(max(0, start_tok-offset)):
|
|
403
|
+
yield tok
|
|
404
|
+
|
|
405
|
+
# Update the offset table.
|
|
406
|
+
if piecenum+1 == len(self._offsets):
|
|
407
|
+
self._offsets.append(self._offsets[-1] + len(piece))
|
|
408
|
+
|
|
409
|
+
# Move on to the next piece.
|
|
410
|
+
piecenum += 1
|
|
411
|
+
|
|
412
|
+
def concat(docs):
|
|
413
|
+
"""
|
|
414
|
+
Concatenate together the contents of multiple documents from a
|
|
415
|
+
single corpus, using an appropriate concatenation function. This
|
|
416
|
+
utility function is used by corpus readers when the user requests
|
|
417
|
+
more than one document at a time.
|
|
418
|
+
"""
|
|
419
|
+
if len(docs) == 1:
|
|
420
|
+
return docs[0]
|
|
421
|
+
if len(docs) == 0:
|
|
422
|
+
raise ValueError('concat() expects at least one object!')
|
|
423
|
+
|
|
424
|
+
types = set(d.__class__ for d in docs)
|
|
425
|
+
|
|
426
|
+
# If they're all strings, use string concatenation.
|
|
427
|
+
if all(isinstance(doc, string_types) for doc in docs):
|
|
428
|
+
return ''.join(docs)
|
|
429
|
+
|
|
430
|
+
# If they're all corpus views, then use ConcatenatedCorpusView.
|
|
431
|
+
for typ in types:
|
|
432
|
+
if not issubclass(typ, (StreamBackedCorpusView,
|
|
433
|
+
ConcatenatedCorpusView)):
|
|
434
|
+
break
|
|
435
|
+
else:
|
|
436
|
+
return ConcatenatedCorpusView(docs)
|
|
437
|
+
|
|
438
|
+
# If they're all lazy sequences, use a lazy concatenation
|
|
439
|
+
for typ in types:
|
|
440
|
+
if not issubclass(typ, AbstractLazySequence):
|
|
441
|
+
break
|
|
442
|
+
else:
|
|
443
|
+
return LazyConcatenation(docs)
|
|
444
|
+
|
|
445
|
+
# Otherwise, see what we can do:
|
|
446
|
+
if len(types) == 1:
|
|
447
|
+
typ = list(types)[0]
|
|
448
|
+
|
|
449
|
+
if issubclass(typ, list):
|
|
450
|
+
return reduce((lambda a,b:a+b), docs, [])
|
|
451
|
+
|
|
452
|
+
if issubclass(typ, tuple):
|
|
453
|
+
return reduce((lambda a,b:a+b), docs, ())
|
|
454
|
+
|
|
455
|
+
if ElementTree.iselement(typ):
|
|
456
|
+
xmltree = ElementTree.Element('documents')
|
|
457
|
+
for doc in docs: xmltree.append(doc)
|
|
458
|
+
return xmltree
|
|
459
|
+
|
|
460
|
+
# No method found!
|
|
461
|
+
raise ValueError("Don't know how to concatenate types: %r" % types)
|
|
462
|
+
|
|
463
|
+
######################################################################
|
|
464
|
+
#{ Corpus View for Pickled Sequences
|
|
465
|
+
######################################################################
|
|
466
|
+
|
|
467
|
+
class PickleCorpusView(StreamBackedCorpusView):
|
|
468
|
+
"""
|
|
469
|
+
A stream backed corpus view for corpus files that consist of
|
|
470
|
+
sequences of serialized Python objects (serialized using
|
|
471
|
+
``pickle.dump``). One use case for this class is to store the
|
|
472
|
+
result of running feature detection on a corpus to disk. This can
|
|
473
|
+
be useful when performing feature detection is expensive (so we
|
|
474
|
+
don't want to repeat it); but the corpus is too large to store in
|
|
475
|
+
memory. The following example illustrates this technique:
|
|
476
|
+
|
|
477
|
+
>>> from nltk.corpus.reader.util import PickleCorpusView
|
|
478
|
+
>>> from nltk.util import LazyMap
|
|
479
|
+
>>> feature_corpus = LazyMap(detect_features, corpus) # doctest: +SKIP
|
|
480
|
+
>>> PickleCorpusView.write(feature_corpus, some_fileid) # doctest: +SKIP
|
|
481
|
+
>>> pcv = PickleCorpusView(some_fileid) # doctest: +SKIP
|
|
482
|
+
"""
|
|
483
|
+
BLOCK_SIZE = 100
|
|
484
|
+
PROTOCOL = -1
|
|
485
|
+
|
|
486
|
+
def __init__(self, fileid, delete_on_gc=False):
|
|
487
|
+
"""
|
|
488
|
+
Create a new corpus view that reads the pickle corpus
|
|
489
|
+
``fileid``.
|
|
490
|
+
|
|
491
|
+
:param delete_on_gc: If true, then ``fileid`` will be deleted
|
|
492
|
+
whenever this object gets garbage-collected.
|
|
493
|
+
"""
|
|
494
|
+
self._delete_on_gc = delete_on_gc
|
|
495
|
+
StreamBackedCorpusView.__init__(self, fileid)
|
|
496
|
+
|
|
497
|
+
def read_block(self, stream):
|
|
498
|
+
result = []
|
|
499
|
+
for i in range(self.BLOCK_SIZE):
|
|
500
|
+
try: result.append(pickle.load(stream))
|
|
501
|
+
except EOFError: break
|
|
502
|
+
return result
|
|
503
|
+
|
|
504
|
+
def __del__(self):
|
|
505
|
+
"""
|
|
506
|
+
If ``delete_on_gc`` was set to true when this
|
|
507
|
+
``PickleCorpusView`` was created, then delete the corpus view's
|
|
508
|
+
fileid. (This method is called whenever a
|
|
509
|
+
``PickledCorpusView`` is garbage-collected.
|
|
510
|
+
"""
|
|
511
|
+
if getattr(self, '_delete_on_gc'):
|
|
512
|
+
if os.path.exists(self._fileid):
|
|
513
|
+
try: os.remove(self._fileid)
|
|
514
|
+
except (OSError, IOError): pass
|
|
515
|
+
self.__dict__.clear() # make the garbage collector's job easier
|
|
516
|
+
|
|
517
|
+
@classmethod
|
|
518
|
+
def write(cls, sequence, output_file):
|
|
519
|
+
if isinstance(output_file, string_types):
|
|
520
|
+
output_file = open(output_file, 'wb')
|
|
521
|
+
for item in sequence:
|
|
522
|
+
pickle.dump(item, output_file, cls.PROTOCOL)
|
|
523
|
+
|
|
524
|
+
@classmethod
|
|
525
|
+
def cache_to_tempfile(cls, sequence, delete_on_gc=True):
|
|
526
|
+
"""
|
|
527
|
+
Write the given sequence to a temporary file as a pickle
|
|
528
|
+
corpus; and then return a ``PickleCorpusView`` view for that
|
|
529
|
+
temporary corpus file.
|
|
530
|
+
|
|
531
|
+
:param delete_on_gc: If true, then the temporary file will be
|
|
532
|
+
deleted whenever this object gets garbage-collected.
|
|
533
|
+
"""
|
|
534
|
+
try:
|
|
535
|
+
fd, output_file_name = tempfile.mkstemp('.pcv', 'nltk-')
|
|
536
|
+
output_file = os.fdopen(fd, 'wb')
|
|
537
|
+
cls.write(sequence, output_file)
|
|
538
|
+
output_file.close()
|
|
539
|
+
return PickleCorpusView(output_file_name, delete_on_gc)
|
|
540
|
+
except (OSError, IOError) as e:
|
|
541
|
+
raise ValueError('Error while creating temp file: %s' % e)
|
|
542
|
+
|
|
543
|
+
|
|
544
|
+
|
|
545
|
+
######################################################################
|
|
546
|
+
#{ Block Readers
|
|
547
|
+
######################################################################
|
|
548
|
+
|
|
549
|
+
def read_whitespace_block(stream):
|
|
550
|
+
toks = []
|
|
551
|
+
for i in range(20): # Read 20 lines at a time.
|
|
552
|
+
toks.extend(stream.readline().split())
|
|
553
|
+
return toks
|
|
554
|
+
|
|
555
|
+
def read_wordpunct_block(stream):
|
|
556
|
+
toks = []
|
|
557
|
+
for i in range(20): # Read 20 lines at a time.
|
|
558
|
+
toks.extend(wordpunct_tokenize(stream.readline()))
|
|
559
|
+
return toks
|
|
560
|
+
|
|
561
|
+
def read_line_block(stream):
|
|
562
|
+
toks = []
|
|
563
|
+
for i in range(20):
|
|
564
|
+
line = stream.readline()
|
|
565
|
+
if not line: return toks
|
|
566
|
+
toks.append(line.rstrip('\n'))
|
|
567
|
+
return toks
|
|
568
|
+
|
|
569
|
+
def read_blankline_block(stream):
|
|
570
|
+
s = ''
|
|
571
|
+
while True:
|
|
572
|
+
line = stream.readline()
|
|
573
|
+
# End of file:
|
|
574
|
+
if not line:
|
|
575
|
+
if s: return [s]
|
|
576
|
+
else: return []
|
|
577
|
+
# Blank line:
|
|
578
|
+
elif line and not line.strip():
|
|
579
|
+
if s: return [s]
|
|
580
|
+
# Other line:
|
|
581
|
+
else:
|
|
582
|
+
s += line
|
|
583
|
+
|
|
584
|
+
def read_alignedsent_block(stream):
|
|
585
|
+
s = ''
|
|
586
|
+
while True:
|
|
587
|
+
line = stream.readline()
|
|
588
|
+
if line[0] == '=' or line[0] == '\n' or line[:2] == '\r\n':
|
|
589
|
+
continue
|
|
590
|
+
# End of file:
|
|
591
|
+
if not line:
|
|
592
|
+
if s: return [s]
|
|
593
|
+
else: return []
|
|
594
|
+
# Other line:
|
|
595
|
+
else:
|
|
596
|
+
s += line
|
|
597
|
+
if re.match('^\d+-\d+', line) is not None:
|
|
598
|
+
return [s]
|
|
599
|
+
|
|
600
|
+
def read_regexp_block(stream, start_re, end_re=None):
|
|
601
|
+
"""
|
|
602
|
+
Read a sequence of tokens from a stream, where tokens begin with
|
|
603
|
+
lines that match ``start_re``. If ``end_re`` is specified, then
|
|
604
|
+
tokens end with lines that match ``end_re``; otherwise, tokens end
|
|
605
|
+
whenever the next line matching ``start_re`` or EOF is found.
|
|
606
|
+
"""
|
|
607
|
+
# Scan until we find a line matching the start regexp.
|
|
608
|
+
while True:
|
|
609
|
+
line = stream.readline()
|
|
610
|
+
if not line: return [] # end of file.
|
|
611
|
+
if re.match(start_re, line): break
|
|
612
|
+
|
|
613
|
+
# Scan until we find another line matching the regexp, or EOF.
|
|
614
|
+
lines = [line]
|
|
615
|
+
while True:
|
|
616
|
+
oldpos = stream.tell()
|
|
617
|
+
line = stream.readline()
|
|
618
|
+
# End of file:
|
|
619
|
+
if not line:
|
|
620
|
+
return [''.join(lines)]
|
|
621
|
+
# End of token:
|
|
622
|
+
if end_re is not None and re.match(end_re, line):
|
|
623
|
+
return [''.join(lines)]
|
|
624
|
+
# Start of new token: backup to just before it starts, and
|
|
625
|
+
# return the token we've already collected.
|
|
626
|
+
if end_re is None and re.match(start_re, line):
|
|
627
|
+
stream.seek(oldpos)
|
|
628
|
+
return [''.join(lines)]
|
|
629
|
+
# Anything else is part of the token.
|
|
630
|
+
lines.append(line)
|
|
631
|
+
|
|
632
|
+
def read_sexpr_block(stream, block_size=16384, comment_char=None):
|
|
633
|
+
"""
|
|
634
|
+
Read a sequence of s-expressions from the stream, and leave the
|
|
635
|
+
stream's file position at the end the last complete s-expression
|
|
636
|
+
read. This function will always return at least one s-expression,
|
|
637
|
+
unless there are no more s-expressions in the file.
|
|
638
|
+
|
|
639
|
+
If the file ends in in the middle of an s-expression, then that
|
|
640
|
+
incomplete s-expression is returned when the end of the file is
|
|
641
|
+
reached.
|
|
642
|
+
|
|
643
|
+
:param block_size: The default block size for reading. If an
|
|
644
|
+
s-expression is longer than one block, then more than one
|
|
645
|
+
block will be read.
|
|
646
|
+
:param comment_char: A character that marks comments. Any lines
|
|
647
|
+
that begin with this character will be stripped out.
|
|
648
|
+
(If spaces or tabs precede the comment character, then the
|
|
649
|
+
line will not be stripped.)
|
|
650
|
+
"""
|
|
651
|
+
start = stream.tell()
|
|
652
|
+
block = stream.read(block_size)
|
|
653
|
+
encoding = getattr(stream, 'encoding', None)
|
|
654
|
+
assert encoding is not None or isinstance(block, text_type)
|
|
655
|
+
if encoding not in (None, 'utf-8'):
|
|
656
|
+
import warnings
|
|
657
|
+
warnings.warn('Parsing may fail, depending on the properties '
|
|
658
|
+
'of the %s encoding!' % encoding)
|
|
659
|
+
# (e.g., the utf-16 encoding does not work because it insists
|
|
660
|
+
# on adding BOMs to the beginning of encoded strings.)
|
|
661
|
+
|
|
662
|
+
if comment_char:
|
|
663
|
+
COMMENT = re.compile('(?m)^%s.*$' % re.escape(comment_char))
|
|
664
|
+
while True:
|
|
665
|
+
try:
|
|
666
|
+
# If we're stripping comments, then make sure our block ends
|
|
667
|
+
# on a line boundary; and then replace any comments with
|
|
668
|
+
# space characters. (We can't just strip them out -- that
|
|
669
|
+
# would make our offset wrong.)
|
|
670
|
+
if comment_char:
|
|
671
|
+
block += stream.readline()
|
|
672
|
+
block = re.sub(COMMENT, _sub_space, block)
|
|
673
|
+
# Read the block.
|
|
674
|
+
tokens, offset = _parse_sexpr_block(block)
|
|
675
|
+
# Skip whitespace
|
|
676
|
+
offset = re.compile(r'\s*').search(block, offset).end()
|
|
677
|
+
|
|
678
|
+
# Move to the end position.
|
|
679
|
+
if encoding is None:
|
|
680
|
+
stream.seek(start+offset)
|
|
681
|
+
else:
|
|
682
|
+
stream.seek(start+len(block[:offset].encode(encoding)))
|
|
683
|
+
|
|
684
|
+
# Return the list of tokens we processed
|
|
685
|
+
return tokens
|
|
686
|
+
except ValueError as e:
|
|
687
|
+
if e.args[0] == 'Block too small':
|
|
688
|
+
next_block = stream.read(block_size)
|
|
689
|
+
if next_block:
|
|
690
|
+
block += next_block
|
|
691
|
+
continue
|
|
692
|
+
else:
|
|
693
|
+
# The file ended mid-sexpr -- return what we got.
|
|
694
|
+
return [block.strip()]
|
|
695
|
+
else: raise
|
|
696
|
+
|
|
697
|
+
def _sub_space(m):
|
|
698
|
+
"""Helper function: given a regexp match, return a string of
|
|
699
|
+
spaces that's the same length as the matched string."""
|
|
700
|
+
return ' '*(m.end()-m.start())
|
|
701
|
+
|
|
702
|
+
def _parse_sexpr_block(block):
|
|
703
|
+
tokens = []
|
|
704
|
+
start = end = 0
|
|
705
|
+
|
|
706
|
+
while end < len(block):
|
|
707
|
+
m = re.compile(r'\S').search(block, end)
|
|
708
|
+
if not m:
|
|
709
|
+
return tokens, end
|
|
710
|
+
|
|
711
|
+
start = m.start()
|
|
712
|
+
|
|
713
|
+
# Case 1: sexpr is not parenthesized.
|
|
714
|
+
if m.group() != '(':
|
|
715
|
+
m2 = re.compile(r'[\s(]').search(block, start)
|
|
716
|
+
if m2:
|
|
717
|
+
end = m2.start()
|
|
718
|
+
else:
|
|
719
|
+
if tokens: return tokens, end
|
|
720
|
+
raise ValueError('Block too small')
|
|
721
|
+
|
|
722
|
+
# Case 2: parenthesized sexpr.
|
|
723
|
+
else:
|
|
724
|
+
nesting = 0
|
|
725
|
+
for m in re.compile(r'[()]').finditer(block, start):
|
|
726
|
+
if m.group()=='(': nesting += 1
|
|
727
|
+
else: nesting -= 1
|
|
728
|
+
if nesting == 0:
|
|
729
|
+
end = m.end()
|
|
730
|
+
break
|
|
731
|
+
else:
|
|
732
|
+
if tokens: return tokens, end
|
|
733
|
+
raise ValueError('Block too small')
|
|
734
|
+
|
|
735
|
+
tokens.append(block[start:end])
|
|
736
|
+
|
|
737
|
+
return tokens, end
|
|
738
|
+
|
|
739
|
+
|
|
740
|
+
######################################################################
|
|
741
|
+
#{ Finding Corpus Items
|
|
742
|
+
######################################################################
|
|
743
|
+
|
|
744
|
+
def find_corpus_fileids(root, regexp):
|
|
745
|
+
if not isinstance(root, PathPointer):
|
|
746
|
+
raise TypeError('find_corpus_fileids: expected a PathPointer')
|
|
747
|
+
regexp += '$'
|
|
748
|
+
|
|
749
|
+
# Find fileids in a zipfile: scan the zipfile's namelist. Filter
|
|
750
|
+
# out entries that end in '/' -- they're directories.
|
|
751
|
+
if isinstance(root, ZipFilePathPointer):
|
|
752
|
+
fileids = [name[len(root.entry):] for name in root.zipfile.namelist()
|
|
753
|
+
if not name.endswith('/')]
|
|
754
|
+
items = [name for name in fileids if re.match(regexp, name)]
|
|
755
|
+
return sorted(items)
|
|
756
|
+
|
|
757
|
+
# Find fileids in a directory: use os.walk to search all (proper
|
|
758
|
+
# or symlinked) subdirectories, and match paths against the regexp.
|
|
759
|
+
elif isinstance(root, FileSystemPathPointer):
|
|
760
|
+
items = []
|
|
761
|
+
# workaround for py25 which doesn't support followlinks
|
|
762
|
+
kwargs = {}
|
|
763
|
+
if not py25():
|
|
764
|
+
kwargs = {'followlinks': True}
|
|
765
|
+
for dirname, subdirs, fileids in os.walk(root.path, **kwargs):
|
|
766
|
+
prefix = ''.join('%s/' % p for p in _path_from(root.path, dirname))
|
|
767
|
+
items += [prefix+fileid for fileid in fileids
|
|
768
|
+
if re.match(regexp, prefix+fileid)]
|
|
769
|
+
# Don't visit svn directories:
|
|
770
|
+
if '.svn' in subdirs: subdirs.remove('.svn')
|
|
771
|
+
return sorted(items)
|
|
772
|
+
|
|
773
|
+
else:
|
|
774
|
+
raise AssertionError("Don't know how to handle %r" % root)
|
|
775
|
+
|
|
776
|
+
def _path_from(parent, child):
|
|
777
|
+
if os.path.split(parent)[1] == '':
|
|
778
|
+
parent = os.path.split(parent)[0]
|
|
779
|
+
path = []
|
|
780
|
+
while parent != child:
|
|
781
|
+
child, dirname = os.path.split(child)
|
|
782
|
+
path.insert(0, dirname)
|
|
783
|
+
assert os.path.split(child)[0] != child
|
|
784
|
+
return path
|
|
785
|
+
|
|
786
|
+
######################################################################
|
|
787
|
+
#{ Paragraph structure in Treebank files
|
|
788
|
+
######################################################################
|
|
789
|
+
|
|
790
|
+
def tagged_treebank_para_block_reader(stream):
|
|
791
|
+
# Read the next paragraph.
|
|
792
|
+
para = ''
|
|
793
|
+
while True:
|
|
794
|
+
line = stream.readline()
|
|
795
|
+
# End of paragraph:
|
|
796
|
+
if re.match('======+\s*$', line):
|
|
797
|
+
if para.strip(): return [para]
|
|
798
|
+
# End of file:
|
|
799
|
+
elif line == '':
|
|
800
|
+
if para.strip(): return [para]
|
|
801
|
+
else: return []
|
|
802
|
+
# Content line:
|
|
803
|
+
else:
|
|
804
|
+
para += line
|