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.
Files changed (406) hide show
  1. {nltk-3.2 → nltk-3.3}/INSTALL.txt +6 -6
  2. {nltk-3.2 → nltk-3.3}/LICENSE.txt +13 -13
  3. {nltk-3.2 → nltk-3.3}/MANIFEST.in +6 -6
  4. {nltk-3.2/nltk.egg-info → nltk-3.3}/PKG-INFO +13 -5
  5. nltk-3.2/README.txt → nltk-3.3/README.md +49 -48
  6. nltk-3.3/nltk/VERSION +1 -0
  7. {nltk-3.2 → nltk-3.3}/nltk/__init__.py +185 -185
  8. {nltk-3.2 → nltk-3.3}/nltk/app/__init__.py +52 -53
  9. {nltk-3.2 → nltk-3.3}/nltk/app/chartparser_app.py +2276 -2276
  10. {nltk-3.2 → nltk-3.3}/nltk/app/chunkparser_app.py +1262 -1264
  11. {nltk-3.2 → nltk-3.3}/nltk/app/collocations_app.py +347 -350
  12. {nltk-3.2 → nltk-3.3}/nltk/app/concordance_app.py +568 -570
  13. {nltk-3.2 → nltk-3.3}/nltk/app/nemo_app.py +156 -155
  14. {nltk-3.2 → nltk-3.3}/nltk/app/rdparser_app.py +892 -894
  15. {nltk-3.2 → nltk-3.3}/nltk/app/srparser_app.py +809 -809
  16. {nltk-3.2 → nltk-3.3}/nltk/app/wordfreq_app.py +32 -32
  17. {nltk-3.2 → nltk-3.3}/nltk/app/wordnet_app.py +968 -968
  18. {nltk-3.2 → nltk-3.3}/nltk/book.py +91 -90
  19. {nltk-3.2 → nltk-3.3}/nltk/ccg/__init__.py +22 -22
  20. {nltk-3.2 → nltk-3.3}/nltk/ccg/api.py +359 -335
  21. {nltk-3.2 → nltk-3.3}/nltk/ccg/chart.py +394 -361
  22. {nltk-3.2 → nltk-3.3}/nltk/ccg/combinator.py +343 -312
  23. {nltk-3.2 → nltk-3.3}/nltk/ccg/lexicon.py +328 -290
  24. nltk-3.3/nltk/ccg/logic.py +46 -0
  25. {nltk-3.2 → nltk-3.3}/nltk/chat/__init__.py +49 -49
  26. {nltk-3.2 → nltk-3.3}/nltk/chat/eliza.py +244 -244
  27. {nltk-3.2 → nltk-3.3}/nltk/chat/iesha.py +140 -140
  28. {nltk-3.2 → nltk-3.3}/nltk/chat/rude.py +92 -92
  29. {nltk-3.2 → nltk-3.3}/nltk/chat/suntsu.py +117 -117
  30. {nltk-3.2 → nltk-3.3}/nltk/chat/util.py +122 -120
  31. {nltk-3.2 → nltk-3.3}/nltk/chat/zen.py +282 -282
  32. {nltk-3.2 → nltk-3.3}/nltk/chunk/__init__.py +190 -190
  33. {nltk-3.2 → nltk-3.3}/nltk/chunk/api.py +51 -51
  34. {nltk-3.2 → nltk-3.3}/nltk/chunk/named_entity.py +331 -331
  35. {nltk-3.2 → nltk-3.3}/nltk/chunk/regexp.py +1390 -1384
  36. {nltk-3.2 → nltk-3.3}/nltk/chunk/util.py +600 -600
  37. {nltk-3.2 → nltk-3.3}/nltk/classify/__init__.py +98 -98
  38. {nltk-3.2 → nltk-3.3}/nltk/classify/api.py +193 -193
  39. {nltk-3.2 → nltk-3.3}/nltk/classify/decisiontree.py +295 -295
  40. {nltk-3.2 → nltk-3.3}/nltk/classify/maxent.py +1510 -1492
  41. {nltk-3.2 → nltk-3.3}/nltk/classify/megam.py +179 -178
  42. {nltk-3.2 → nltk-3.3}/nltk/classify/naivebayes.py +245 -242
  43. {nltk-3.2 → nltk-3.3}/nltk/classify/positivenaivebayes.py +170 -170
  44. {nltk-3.2 → nltk-3.3}/nltk/classify/rte_classify.py +160 -191
  45. {nltk-3.2 → nltk-3.3}/nltk/classify/scikitlearn.py +153 -151
  46. {nltk-3.2 → nltk-3.3}/nltk/classify/senna.py +183 -181
  47. {nltk-3.2 → nltk-3.3}/nltk/classify/svm.py +15 -15
  48. {nltk-3.2 → nltk-3.3}/nltk/classify/tadm.py +113 -112
  49. {nltk-3.2 → nltk-3.3}/nltk/classify/textcat.py +193 -193
  50. {nltk-3.2 → nltk-3.3}/nltk/classify/util.py +324 -312
  51. {nltk-3.2 → nltk-3.3}/nltk/classify/weka.py +346 -345
  52. {nltk-3.2 → nltk-3.3}/nltk/cluster/__init__.py +86 -86
  53. {nltk-3.2 → nltk-3.3}/nltk/cluster/api.py +74 -70
  54. {nltk-3.2 → nltk-3.3}/nltk/cluster/em.py +247 -247
  55. {nltk-3.2 → nltk-3.3}/nltk/cluster/gaac.py +168 -168
  56. {nltk-3.2 → nltk-3.3}/nltk/cluster/kmeans.py +221 -221
  57. {nltk-3.2 → nltk-3.3}/nltk/cluster/util.py +304 -289
  58. nltk-3.3/nltk/collections.py +640 -0
  59. {nltk-3.2 → nltk-3.3}/nltk/collocations.py +388 -388
  60. nltk-3.3/nltk/compat.py +365 -0
  61. {nltk-3.2 → nltk-3.3}/nltk/corpus/__init__.py +341 -320
  62. {nltk-3.2 → nltk-3.3}/nltk/corpus/europarl_raw.py +44 -44
  63. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/__init__.py +147 -145
  64. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/aligned.py +115 -114
  65. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/api.py +448 -446
  66. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/bnc.py +252 -252
  67. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/bracket_parse.py +227 -227
  68. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/categorized_sents.py +179 -178
  69. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/chasen.py +140 -139
  70. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/childes.py +522 -494
  71. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/chunked.py +212 -212
  72. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/cmudict.py +97 -95
  73. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/comparative_sents.py +280 -278
  74. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/conll.py +528 -521
  75. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/crubadan.py +116 -116
  76. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/dependency.py +101 -101
  77. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/framenet.py +3059 -2093
  78. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/ieer.py +112 -111
  79. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/indian.py +85 -86
  80. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/ipipan.py +332 -331
  81. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/knbc.py +187 -187
  82. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/lin.py +156 -156
  83. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/mte.py +311 -310
  84. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/nkjp.py +429 -428
  85. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/nombank.py +421 -421
  86. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/nps_chat.py +73 -73
  87. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/opinion_lexicon.py +115 -115
  88. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/panlex_lite.py +165 -165
  89. nltk-3.3/nltk/corpus/reader/pl196x.py +292 -0
  90. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/plaintext.py +232 -233
  91. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/ppattach.py +96 -95
  92. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/propbank.py +479 -481
  93. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/pros_cons.py +128 -126
  94. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/reviews.py +330 -328
  95. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/rte.py +144 -146
  96. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/semcor.py +256 -256
  97. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/senseval.py +203 -201
  98. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/sentiwordnet.py +137 -137
  99. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/sinica_treebank.py +75 -75
  100. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/string_category.py +60 -59
  101. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/switchboard.py +119 -119
  102. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/tagged.py +295 -294
  103. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/timit.py +452 -450
  104. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/toolbox.py +68 -68
  105. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/twitter.py +155 -157
  106. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/udhr.py +80 -80
  107. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/util.py +804 -800
  108. nltk-3.3/nltk/corpus/reader/verbnet.py +595 -0
  109. nltk-3.3/nltk/corpus/reader/wordlist.py +134 -0
  110. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/wordnet.py +2108 -2036
  111. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/xmldocs.py +392 -387
  112. {nltk-3.2 → nltk-3.3}/nltk/corpus/reader/ycoe.py +243 -242
  113. {nltk-3.2 → nltk-3.3}/nltk/corpus/util.py +144 -127
  114. {nltk-3.2 → nltk-3.3}/nltk/data.py +1487 -1451
  115. {nltk-3.2 → nltk-3.3}/nltk/decorators.py +219 -215
  116. {nltk-3.2 → nltk-3.3}/nltk/downloader.py +2278 -2274
  117. {nltk-3.2 → nltk-3.3}/nltk/draw/__init__.py +27 -27
  118. {nltk-3.2 → nltk-3.3}/nltk/draw/cfg.py +774 -777
  119. {nltk-3.2 → nltk-3.3}/nltk/draw/dispersion.py +58 -58
  120. {nltk-3.2 → nltk-3.3}/nltk/draw/table.py +1098 -1098
  121. {nltk-3.2 → nltk-3.3}/nltk/draw/tree.py +963 -966
  122. {nltk-3.2 → nltk-3.3}/nltk/draw/util.py +2356 -2356
  123. {nltk-3.2 → nltk-3.3}/nltk/featstruct.py +2617 -2500
  124. {nltk-3.2 → nltk-3.3}/nltk/grammar.py +1559 -1516
  125. {nltk-3.2 → nltk-3.3}/nltk/help.py +56 -56
  126. {nltk-3.2 → nltk-3.3}/nltk/inference/__init__.py +20 -20
  127. {nltk-3.2 → nltk-3.3}/nltk/inference/api.py +597 -589
  128. {nltk-3.2 → nltk-3.3}/nltk/inference/discourse.py +612 -608
  129. {nltk-3.2 → nltk-3.3}/nltk/inference/mace.py +311 -311
  130. {nltk-3.2 → nltk-3.3}/nltk/inference/nonmonotonic.py +509 -509
  131. {nltk-3.2 → nltk-3.3}/nltk/inference/prover9.py +431 -431
  132. {nltk-3.2 → nltk-3.3}/nltk/inference/resolution.py +687 -687
  133. {nltk-3.2 → nltk-3.3}/nltk/inference/tableau.py +607 -607
  134. {nltk-3.2 → nltk-3.3}/nltk/internals.py +982 -982
  135. {nltk-3.2 → nltk-3.3}/nltk/jsontags.py +63 -63
  136. {nltk-3.2 → nltk-3.3}/nltk/lazyimport.py +142 -142
  137. {nltk-3.2 → nltk-3.3}/nltk/metrics/__init__.py +30 -29
  138. {nltk-3.2 → nltk-3.3}/nltk/metrics/agreement.py +421 -401
  139. nltk-3.3/nltk/metrics/aline.py +607 -0
  140. {nltk-3.2 → nltk-3.3}/nltk/metrics/association.py +414 -410
  141. {nltk-3.2 → nltk-3.3}/nltk/metrics/confusionmatrix.py +206 -206
  142. {nltk-3.2 → nltk-3.3}/nltk/metrics/distance.py +207 -202
  143. {nltk-3.2 → nltk-3.3}/nltk/metrics/paice.py +381 -381
  144. {nltk-3.2 → nltk-3.3}/nltk/metrics/scores.py +228 -228
  145. {nltk-3.2 → nltk-3.3}/nltk/metrics/segmentation.py +231 -232
  146. {nltk-3.2 → nltk-3.3}/nltk/metrics/spearman.py +69 -69
  147. {nltk-3.2 → nltk-3.3}/nltk/misc/__init__.py +11 -11
  148. {nltk-3.2 → nltk-3.3}/nltk/misc/babelfish.py +10 -10
  149. {nltk-3.2 → nltk-3.3}/nltk/misc/chomsky.py +135 -133
  150. {nltk-3.2 → nltk-3.3}/nltk/misc/minimalset.py +83 -83
  151. {nltk-3.2 → nltk-3.3}/nltk/misc/sort.py +157 -157
  152. {nltk-3.2 → nltk-3.3}/nltk/misc/wordfinder.py +129 -129
  153. {nltk-3.2 → nltk-3.3}/nltk/parse/__init__.py +81 -80
  154. {nltk-3.2 → nltk-3.3}/nltk/parse/api.py +66 -66
  155. {nltk-3.2 → nltk-3.3}/nltk/parse/bllip.py +282 -282
  156. {nltk-3.2 → nltk-3.3}/nltk/parse/chart.py +1682 -1681
  157. nltk-3.3/nltk/parse/corenlp.py +780 -0
  158. {nltk-3.2 → nltk-3.3}/nltk/parse/dependencygraph.py +760 -758
  159. {nltk-3.2 → nltk-3.3}/nltk/parse/earleychart.py +452 -451
  160. {nltk-3.2 → nltk-3.3}/nltk/parse/evaluate.py +129 -129
  161. {nltk-3.2 → nltk-3.3}/nltk/parse/featurechart.py +580 -578
  162. {nltk-3.2 → nltk-3.3}/nltk/parse/generate.py +87 -76
  163. {nltk-3.2 → nltk-3.3}/nltk/parse/malt.py +356 -356
  164. {nltk-3.2 → nltk-3.3}/nltk/parse/nonprojectivedependencyparser.py +783 -783
  165. {nltk-3.2 → nltk-3.3}/nltk/parse/pchart.py +522 -522
  166. {nltk-3.2 → nltk-3.3}/nltk/parse/projectivedependencyparser.py +579 -578
  167. {nltk-3.2 → nltk-3.3}/nltk/parse/recursivedescent.py +655 -656
  168. {nltk-3.2 → nltk-3.3}/nltk/parse/shiftreduce.py +458 -459
  169. {nltk-3.2 → nltk-3.3}/nltk/parse/stanford.py +431 -406
  170. {nltk-3.2 → nltk-3.3}/nltk/parse/transitionparser.py +774 -772
  171. {nltk-3.2 → nltk-3.3}/nltk/parse/util.py +231 -231
  172. {nltk-3.2 → nltk-3.3}/nltk/parse/viterbi.py +401 -401
  173. {nltk-3.2 → nltk-3.3}/nltk/probability.py +2410 -2355
  174. {nltk-3.2 → nltk-3.3}/nltk/sem/__init__.py +61 -61
  175. {nltk-3.2 → nltk-3.3}/nltk/sem/boxer.py +1261 -1261
  176. {nltk-3.2 → nltk-3.3}/nltk/sem/chat80.py +782 -782
  177. {nltk-3.2 → nltk-3.3}/nltk/sem/cooper_storage.py +118 -118
  178. {nltk-3.2 → nltk-3.3}/nltk/sem/drt.py +1258 -1257
  179. {nltk-3.2 → nltk-3.3}/nltk/sem/drt_glue_demo.py +485 -489
  180. {nltk-3.2 → nltk-3.3}/nltk/sem/evaluate.py +790 -784
  181. {nltk-3.2 → nltk-3.3}/nltk/sem/glue.py +696 -694
  182. {nltk-3.2 → nltk-3.3}/nltk/sem/hole.py +386 -384
  183. {nltk-3.2 → nltk-3.3}/nltk/sem/lfg.py +210 -208
  184. {nltk-3.2 → nltk-3.3}/nltk/sem/linearlogic.py +451 -449
  185. {nltk-3.2 → nltk-3.3}/nltk/sem/logic.py +1910 -1910
  186. {nltk-3.2 → nltk-3.3}/nltk/sem/relextract.py +476 -483
  187. {nltk-3.2 → nltk-3.3}/nltk/sem/skolemize.py +101 -101
  188. {nltk-3.2 → nltk-3.3}/nltk/sem/util.py +249 -249
  189. {nltk-3.2 → nltk-3.3}/nltk/sentiment/__init__.py +14 -14
  190. {nltk-3.2 → nltk-3.3}/nltk/sentiment/sentiment_analyzer.py +229 -229
  191. {nltk-3.2 → nltk-3.3}/nltk/sentiment/util.py +762 -752
  192. {nltk-3.2 → nltk-3.3}/nltk/sentiment/vader.py +443 -445
  193. {nltk-3.2 → nltk-3.3}/nltk/stem/__init__.py +31 -33
  194. {nltk-3.2 → nltk-3.3}/nltk/stem/api.py +28 -25
  195. nltk-3.3/nltk/stem/arlstem.py +369 -0
  196. {nltk-3.2 → nltk-3.3}/nltk/stem/isri.py +345 -345
  197. {nltk-3.2 → nltk-3.3}/nltk/stem/lancaster.py +337 -310
  198. nltk-3.3/nltk/stem/porter.py +710 -0
  199. {nltk-3.2 → nltk-3.3}/nltk/stem/regexp.py +61 -61
  200. {nltk-3.2 → nltk-3.3}/nltk/stem/rslp.py +142 -142
  201. {nltk-3.2 → nltk-3.3}/nltk/stem/snowball.py +4236 -3712
  202. {nltk-3.2 → nltk-3.3}/nltk/stem/util.py +22 -12
  203. {nltk-3.2 → nltk-3.3}/nltk/stem/wordnet.py +51 -51
  204. {nltk-3.2 → nltk-3.3}/nltk/tag/__init__.py +152 -127
  205. {nltk-3.2 → nltk-3.3}/nltk/tag/api.py +86 -81
  206. {nltk-3.2 → nltk-3.3}/nltk/tag/brill.py +424 -426
  207. {nltk-3.2 → nltk-3.3}/nltk/tag/brill_trainer.py +608 -608
  208. {nltk-3.2 → nltk-3.3}/nltk/tag/crf.py +204 -200
  209. {nltk-3.2 → nltk-3.3}/nltk/tag/hmm.py +1277 -1277
  210. {nltk-3.2 → nltk-3.3}/nltk/tag/hunpos.py +132 -132
  211. {nltk-3.2 → nltk-3.3}/nltk/tag/mapping.py +101 -101
  212. {nltk-3.2 → nltk-3.3}/nltk/tag/perceptron.py +329 -314
  213. {nltk-3.2 → nltk-3.3}/nltk/tag/senna.py +147 -145
  214. {nltk-3.2 → nltk-3.3}/nltk/tag/sequential.py +740 -736
  215. {nltk-3.2 → nltk-3.3}/nltk/tag/stanford.py +219 -196
  216. {nltk-3.2 → nltk-3.3}/nltk/tag/tnt.py +595 -604
  217. {nltk-3.2 → nltk-3.3}/nltk/tag/util.py +72 -72
  218. {nltk-3.2 → nltk-3.3}/nltk/tbl/__init__.py +28 -28
  219. {nltk-3.2 → nltk-3.3}/nltk/tbl/api.py +1 -1
  220. {nltk-3.2 → nltk-3.3}/nltk/tbl/demo.py +366 -366
  221. {nltk-3.2 → nltk-3.3}/nltk/tbl/erroranalysis.py +39 -39
  222. {nltk-3.2 → nltk-3.3}/nltk/tbl/feature.py +259 -261
  223. {nltk-3.2 → nltk-3.3}/nltk/tbl/rule.py +321 -321
  224. {nltk-3.2 → nltk-3.3}/nltk/tbl/template.py +303 -308
  225. {nltk-3.2 → nltk-3.3}/nltk/test/__init__.py +18 -18
  226. {nltk-3.2 → nltk-3.3}/nltk/test/all.py +24 -23
  227. {nltk-3.2 → nltk-3.3}/nltk/test/bleu.doctest +14 -14
  228. {nltk-3.2 → nltk-3.3}/nltk/test/bnc.doctest +60 -60
  229. {nltk-3.2 → nltk-3.3}/nltk/test/ccg.doctest +376 -395
  230. nltk-3.3/nltk/test/ccg_semantics.doctest +553 -0
  231. {nltk-3.2 → nltk-3.3}/nltk/test/chat80.doctest +234 -234
  232. {nltk-3.2 → nltk-3.3}/nltk/test/childes.doctest +184 -184
  233. {nltk-3.2 → nltk-3.3}/nltk/test/childes_fixt.py +14 -13
  234. {nltk-3.2 → nltk-3.3}/nltk/test/chunk.doctest +373 -373
  235. {nltk-3.2 → nltk-3.3}/nltk/test/classify.doctest +185 -185
  236. {nltk-3.2 → nltk-3.3}/nltk/test/classify_fixt.py +11 -10
  237. nltk-3.3/nltk/test/collections.doctest +20 -0
  238. {nltk-3.2 → nltk-3.3}/nltk/test/collocations.doctest +276 -276
  239. {nltk-3.2 → nltk-3.3}/nltk/test/compat.doctest +134 -138
  240. {nltk-3.2 → nltk-3.3}/nltk/test/compat_fixt.py +9 -8
  241. nltk-3.3/nltk/test/concordance.doctest +55 -0
  242. {nltk-3.2 → nltk-3.3}/nltk/test/corpus.doctest +2200 -2212
  243. {nltk-3.2 → nltk-3.3}/nltk/test/corpus_fixt.py +3 -3
  244. {nltk-3.2 → nltk-3.3}/nltk/test/crubadan.doctest +65 -65
  245. {nltk-3.2 → nltk-3.3}/nltk/test/data.doctest +379 -379
  246. {nltk-3.2 → nltk-3.3}/nltk/test/dependency.doctest +241 -241
  247. {nltk-3.2 → nltk-3.3}/nltk/test/discourse.doctest +546 -546
  248. {nltk-3.2 → nltk-3.3}/nltk/test/discourse_fixt.py +14 -13
  249. {nltk-3.2 → nltk-3.3}/nltk/test/doctest_nose_plugin.py +159 -156
  250. {nltk-3.2 → nltk-3.3}/nltk/test/drt.doctest +517 -517
  251. {nltk-3.2 → nltk-3.3}/nltk/test/featgram.doctest +607 -607
  252. {nltk-3.2 → nltk-3.3}/nltk/test/featstruct.doctest +1229 -1230
  253. {nltk-3.2 → nltk-3.3}/nltk/test/framenet.doctest +288 -239
  254. {nltk-3.2 → nltk-3.3}/nltk/test/generate.doctest +67 -67
  255. {nltk-3.2 → nltk-3.3}/nltk/test/gensim.doctest +140 -141
  256. {nltk-3.2 → nltk-3.3}/nltk/test/gensim_fixt.py +10 -9
  257. {nltk-3.2 → nltk-3.3}/nltk/test/gluesemantics.doctest +384 -386
  258. {nltk-3.2 → nltk-3.3}/nltk/test/gluesemantics_malt.doctest +68 -68
  259. {nltk-3.2 → nltk-3.3}/nltk/test/gluesemantics_malt_fixt.py +12 -11
  260. {nltk-3.2 → nltk-3.3}/nltk/test/grammar.doctest +48 -48
  261. {nltk-3.2 → nltk-3.3}/nltk/test/grammartestsuites.doctest +109 -109
  262. {nltk-3.2 → nltk-3.3}/nltk/test/index.doctest +100 -100
  263. {nltk-3.2 → nltk-3.3}/nltk/test/inference.doctest +534 -534
  264. {nltk-3.2 → nltk-3.3}/nltk/test/inference_fixt.py +12 -11
  265. {nltk-3.2 → nltk-3.3}/nltk/test/internals.doctest +140 -140
  266. {nltk-3.2 → nltk-3.3}/nltk/test/japanese.doctest +48 -48
  267. {nltk-3.2 → nltk-3.3}/nltk/test/logic.doctest +1098 -1098
  268. {nltk-3.2 → nltk-3.3}/nltk/test/metrics.doctest +270 -270
  269. {nltk-3.2 → nltk-3.3}/nltk/test/misc.doctest +118 -118
  270. {nltk-3.2 → nltk-3.3}/nltk/test/nonmonotonic.doctest +286 -286
  271. {nltk-3.2 → nltk-3.3}/nltk/test/nonmonotonic_fixt.py +12 -11
  272. {nltk-3.2 → nltk-3.3}/nltk/test/paice.doctest +35 -35
  273. {nltk-3.2 → nltk-3.3}/nltk/test/parse.doctest +884 -884
  274. {nltk-3.2 → nltk-3.3}/nltk/test/portuguese_en.doctest +565 -565
  275. {nltk-3.2 → nltk-3.3}/nltk/test/portuguese_en_fixt.py +16 -16
  276. {nltk-3.2 → nltk-3.3}/nltk/test/probability.doctest +304 -304
  277. {nltk-3.2 → nltk-3.3}/nltk/test/probability_fixt.py +13 -12
  278. {nltk-3.2 → nltk-3.3}/nltk/test/propbank.doctest +176 -176
  279. {nltk-3.2 → nltk-3.3}/nltk/test/relextract.doctest +263 -263
  280. {nltk-3.2 → nltk-3.3}/nltk/test/resolution.doctest +221 -221
  281. {nltk-3.2 → nltk-3.3}/nltk/test/runtests.py +86 -64
  282. {nltk-3.2 → nltk-3.3}/nltk/test/segmentation_fixt.py +10 -10
  283. {nltk-3.2 → nltk-3.3}/nltk/test/semantics.doctest +665 -665
  284. {nltk-3.2 → nltk-3.3}/nltk/test/semantics_fixt.py +7 -7
  285. {nltk-3.2 → nltk-3.3}/nltk/test/sentiment.doctest +233 -233
  286. {nltk-3.2 → nltk-3.3}/nltk/test/sentiwordnet.doctest +41 -41
  287. {nltk-3.2 → nltk-3.3}/nltk/test/simple.doctest +85 -85
  288. {nltk-3.2 → nltk-3.3}/nltk/test/stem.doctest +78 -78
  289. {nltk-3.2 → nltk-3.3}/nltk/test/tag.doctest +33 -33
  290. {nltk-3.2 → nltk-3.3}/nltk/test/tokenize.doctest +273 -166
  291. {nltk-3.2 → nltk-3.3}/nltk/test/toolbox.doctest +307 -307
  292. {nltk-3.2 → nltk-3.3}/nltk/test/translate.doctest +242 -242
  293. {nltk-3.2 → nltk-3.3}/nltk/test/translate_fixt.py +3 -3
  294. {nltk-3.2 → nltk-3.3}/nltk/test/tree.doctest +1101 -1101
  295. {nltk-3.2 → nltk-3.3}/nltk/test/treeprettyprinter.doctest +127 -127
  296. {nltk-3.2 → nltk-3.3}/nltk/test/treetransforms.doctest +156 -156
  297. nltk-3.3/nltk/test/unit/test_2x_compat.py +63 -0
  298. nltk-3.3/nltk/test/unit/test_aline.py +52 -0
  299. nltk-3.3/nltk/test/unit/test_chunk.py +56 -0
  300. {nltk-3.2 → nltk-3.3}/nltk/test/unit/test_classify.py +55 -53
  301. {nltk-3.2 → nltk-3.3}/nltk/test/unit/test_collocations.py +88 -79
  302. nltk-3.3/nltk/test/unit/test_concordance.py +98 -0
  303. nltk-3.3/nltk/test/unit/test_corenlp.py +1000 -0
  304. {nltk-3.2 → nltk-3.3}/nltk/test/unit/test_corpora.py +200 -183
  305. {nltk-3.2 → nltk-3.3}/nltk/test/unit/test_corpus_views.py +45 -45
  306. {nltk-3.2 → nltk-3.3}/nltk/test/unit/test_hmm.py +88 -88
  307. {nltk-3.2 → nltk-3.3}/nltk/test/unit/test_json2csv_corpus.py +188 -187
  308. {nltk-3.2 → nltk-3.3}/nltk/test/unit/test_naivebayes.py +26 -26
  309. nltk-3.3/nltk/test/unit/test_rte_classify.py +86 -0
  310. {nltk-3.2 → nltk-3.3}/nltk/test/unit/test_seekable_unicode_stream_reader.py +124 -124
  311. nltk-3.3/nltk/test/unit/test_senna.py +74 -0
  312. nltk-3.3/nltk/test/unit/test_stem.py +121 -0
  313. {nltk-3.2 → nltk-3.3}/nltk/test/unit/test_tag.py +20 -20
  314. {nltk-3.2 → nltk-3.3}/nltk/test/unit/test_tgrep.py +628 -626
  315. nltk-3.3/nltk/test/unit/test_tokenize.py +168 -0
  316. {nltk-3.2 → nltk-3.3}/nltk/test/unit/test_twitter_auth.py +185 -185
  317. nltk-3.3/nltk/test/unit/test_wordnet.py +134 -0
  318. nltk-3.3/nltk/test/unit/translate/test_bleu.py +244 -0
  319. nltk-3.3/nltk/test/unit/translate/test_gdfa.py +57 -0
  320. {nltk-3.2 → nltk-3.3}/nltk/test/unit/translate/test_ibm1.py +75 -75
  321. {nltk-3.2 → nltk-3.3}/nltk/test/unit/translate/test_ibm2.py +87 -87
  322. {nltk-3.2 → nltk-3.3}/nltk/test/unit/translate/test_ibm3.py +105 -105
  323. {nltk-3.2 → nltk-3.3}/nltk/test/unit/translate/test_ibm4.py +126 -126
  324. {nltk-3.2 → nltk-3.3}/nltk/test/unit/translate/test_ibm5.py +166 -166
  325. {nltk-3.2 → nltk-3.3}/nltk/test/unit/translate/test_ibm_model.py +270 -270
  326. nltk-3.3/nltk/test/unit/translate/test_nist.py +37 -0
  327. {nltk-3.2 → nltk-3.3}/nltk/test/unit/translate/test_stack_decoder.py +300 -300
  328. {nltk-3.2 → nltk-3.3}/nltk/test/unit/utils.py +41 -41
  329. {nltk-3.2 → nltk-3.3}/nltk/test/util.doctest +48 -48
  330. {nltk-3.2 → nltk-3.3}/nltk/test/wordnet.doctest +595 -581
  331. {nltk-3.2 → nltk-3.3}/nltk/test/wordnet_fixt.py +7 -6
  332. {nltk-3.2 → nltk-3.3}/nltk/test/wordnet_lch.doctest +53 -53
  333. {nltk-3.2 → nltk-3.3}/nltk/test/wsd.doctest +68 -68
  334. {nltk-3.2 → nltk-3.3}/nltk/text.py +663 -610
  335. {nltk-3.2 → nltk-3.3}/nltk/tgrep.py +938 -937
  336. {nltk-3.2 → nltk-3.3}/nltk/tokenize/__init__.py +130 -107
  337. {nltk-3.2 → nltk-3.3}/nltk/tokenize/api.py +77 -78
  338. {nltk-3.2 → nltk-3.3}/nltk/tokenize/casual.py +343 -342
  339. {nltk-3.2 → nltk-3.3}/nltk/tokenize/mwe.py +120 -120
  340. nltk-3.3/nltk/tokenize/nist.py +173 -0
  341. {nltk-3.2 → nltk-3.3}/nltk/tokenize/punkt.py +1620 -1601
  342. {nltk-3.2 → nltk-3.3}/nltk/tokenize/regexp.py +208 -202
  343. nltk-3.3/nltk/tokenize/repp.py +151 -0
  344. {nltk-3.2 → nltk-3.3}/nltk/tokenize/sexpr.py +140 -142
  345. {nltk-3.2 → nltk-3.3}/nltk/tokenize/simple.py +138 -136
  346. {nltk-3.2 → nltk-3.3}/nltk/tokenize/stanford.py +117 -113
  347. nltk-3.3/nltk/tokenize/stanford_segmenter.py +246 -0
  348. {nltk-3.2 → nltk-3.3}/nltk/tokenize/texttiling.py +458 -460
  349. nltk-3.3/nltk/tokenize/toktok.py +155 -0
  350. nltk-3.3/nltk/tokenize/treebank.py +363 -0
  351. nltk-3.3/nltk/tokenize/util.py +261 -0
  352. {nltk-3.2 → nltk-3.3}/nltk/toolbox.py +499 -497
  353. {nltk-3.2 → nltk-3.3}/nltk/translate/__init__.py +24 -24
  354. {nltk-3.2 → nltk-3.3}/nltk/translate/api.py +331 -321
  355. {nltk-3.2 → nltk-3.3}/nltk/translate/bleu_score.py +615 -556
  356. nltk-3.3/nltk/translate/chrf_score.py +137 -0
  357. {nltk-3.2 → nltk-3.3}/nltk/translate/gale_church.py +248 -235
  358. {nltk-3.2 → nltk-3.3}/nltk/translate/gdfa.py +135 -131
  359. nltk-3.3/nltk/translate/gleu_score.py +193 -0
  360. {nltk-3.2 → nltk-3.3}/nltk/translate/ibm1.py +250 -241
  361. {nltk-3.2 → nltk-3.3}/nltk/translate/ibm2.py +308 -308
  362. {nltk-3.2 → nltk-3.3}/nltk/translate/ibm3.py +337 -337
  363. {nltk-3.2 → nltk-3.3}/nltk/translate/ibm4.py +467 -467
  364. {nltk-3.2 → nltk-3.3}/nltk/translate/ibm5.py +639 -639
  365. {nltk-3.2 → nltk-3.3}/nltk/translate/ibm_model.py +536 -533
  366. {nltk-3.2 → nltk-3.3}/nltk/translate/metrics.py +40 -40
  367. nltk-3.3/nltk/translate/nist_score.py +178 -0
  368. {nltk-3.2 → nltk-3.3}/nltk/translate/phrase_based.py +175 -175
  369. {nltk-3.2 → nltk-3.3}/nltk/translate/ribes_score.py +325 -325
  370. {nltk-3.2 → nltk-3.3}/nltk/translate/stack_decoder.py +499 -495
  371. {nltk-3.2 → nltk-3.3}/nltk/tree.py +1605 -1603
  372. {nltk-3.2 → nltk-3.3}/nltk/treeprettyprinter.py +564 -564
  373. {nltk-3.2 → nltk-3.3}/nltk/treetransforms.py +309 -309
  374. {nltk-3.2 → nltk-3.3}/nltk/twitter/__init__.py +28 -28
  375. {nltk-3.2 → nltk-3.3}/nltk/twitter/api.py +141 -136
  376. {nltk-3.2 → nltk-3.3}/nltk/twitter/common.py +264 -258
  377. {nltk-3.2 → nltk-3.3}/nltk/twitter/twitter_demo.py +288 -288
  378. {nltk-3.2 → nltk-3.3}/nltk/twitter/twitterclient.py +530 -530
  379. {nltk-3.2 → nltk-3.3}/nltk/twitter/util.py +147 -146
  380. nltk-3.3/nltk/util.py +751 -0
  381. {nltk-3.2 → nltk-3.3}/nltk/wsd.py +53 -53
  382. {nltk-3.2 → nltk-3.3/nltk.egg-info}/PKG-INFO +13 -5
  383. {nltk-3.2 → nltk-3.3}/nltk.egg-info/SOURCES.txt +26 -3
  384. nltk-3.3/nltk.egg-info/requires.txt +31 -0
  385. {nltk-3.2 → nltk-3.3}/setup.cfg +0 -1
  386. {nltk-3.2 → nltk-3.3}/setup.py +102 -75
  387. nltk-3.2/nltk/VERSION +0 -1
  388. nltk-3.2/nltk/compat.py +0 -680
  389. nltk-3.2/nltk/corpus/reader/pl196x.py +0 -278
  390. nltk-3.2/nltk/corpus/reader/verbnet.py +0 -408
  391. nltk-3.2/nltk/corpus/reader/wordlist.py +0 -37
  392. nltk-3.2/nltk/sentiment/vader_lexicon.txt +0 -7517
  393. nltk-3.2/nltk/six.py +0 -868
  394. nltk-3.2/nltk/stem/porter.py +0 -692
  395. nltk-3.2/nltk/test/unit/test_2x_compat.py +0 -26
  396. nltk-3.2/nltk/test/unit/test_stem.py +0 -36
  397. nltk-3.2/nltk/test/unit/test_tokenize.py +0 -23
  398. nltk-3.2/nltk/test/unit/translate/test_bleu.py +0 -84
  399. nltk-3.2/nltk/tokenize/treebank.py +0 -124
  400. nltk-3.2/nltk/tokenize/util.py +0 -90
  401. nltk-3.2/nltk/util.py +0 -1364
  402. {nltk-3.2 → nltk-3.3}/nltk/test/unit/__init__.py +0 -0
  403. {nltk-3.2 → nltk-3.3}/nltk/test/unit/translate/__init__.py +0 -0
  404. {nltk-3.2 → nltk-3.3}/nltk.egg-info/dependency_links.txt +0 -0
  405. {nltk-3.2 → nltk-3.3}/nltk.egg-info/not-zip-safe +0 -0
  406. {nltk-3.2 → nltk-3.3}/nltk.egg-info/top_level.txt +0 -0
@@ -1,736 +1,740 @@
1
- # Natural Language Toolkit: Sequential Backoff Taggers
2
- #
3
- # Copyright (C) 2001-2015 NLTK Project
4
- # Author: Edward Loper <edloper@gmail.com>
5
- # Steven Bird <stevenbird1@gmail.com> (minor additions)
6
- # Tiago Tresoldi <tresoldi@users.sf.net> (original affix tagger)
7
- # URL: <http://nltk.org/>
8
- # For license information, see LICENSE.TXT
9
-
10
- """
11
- Classes for tagging sentences sequentially, left to right. The
12
- abstract base class SequentialBackoffTagger serves as the base
13
- class for all the taggers in this module. Tagging of individual words
14
- is performed by the method ``choose_tag()``, which is defined by
15
- subclasses of SequentialBackoffTagger. If a tagger is unable to
16
- determine a tag for the specified token, then its backoff tagger is
17
- consulted instead. Any SequentialBackoffTagger may serve as a
18
- backoff tagger for any other SequentialBackoffTagger.
19
- """
20
- from __future__ import print_function, unicode_literals
21
-
22
- import re
23
-
24
- from nltk.probability import ConditionalFreqDist
25
- from nltk.classify import NaiveBayesClassifier
26
- from nltk.compat import python_2_unicode_compatible
27
-
28
- from nltk.tag.api import TaggerI, FeaturesetTaggerI
29
-
30
- from nltk import jsontags
31
-
32
- ######################################################################
33
- #{ Abstract Base Classes
34
- ######################################################################
35
- class SequentialBackoffTagger(TaggerI):
36
- """
37
- An abstract base class for taggers that tags words sequentially,
38
- left to right. Tagging of individual words is performed by the
39
- ``choose_tag()`` method, which should be defined by subclasses. If
40
- a tagger is unable to determine a tag for the specified token,
41
- then its backoff tagger is consulted.
42
-
43
- :ivar _taggers: A list of all the taggers that should be tried to
44
- tag a token (i.e., self and its backoff taggers).
45
- """
46
- def __init__(self, backoff=None):
47
- if backoff is None:
48
- self._taggers = [self]
49
- else:
50
- self._taggers = [self] + backoff._taggers
51
-
52
- @property
53
- def backoff(self):
54
- """The backoff tagger for this tagger."""
55
- return self._taggers[1] if len(self._taggers) > 1 else None
56
-
57
- def tag(self, tokens):
58
- # docs inherited from TaggerI
59
- tags = []
60
- for i in range(len(tokens)):
61
- tags.append(self.tag_one(tokens, i, tags))
62
- return list(zip(tokens, tags))
63
-
64
- def tag_one(self, tokens, index, history):
65
- """
66
- Determine an appropriate tag for the specified token, and
67
- return that tag. If this tagger is unable to determine a tag
68
- for the specified token, then its backoff tagger is consulted.
69
-
70
- :rtype: str
71
- :type tokens: list
72
- :param tokens: The list of words that are being tagged.
73
- :type index: int
74
- :param index: The index of the word whose tag should be
75
- returned.
76
- :type history: list(str)
77
- :param history: A list of the tags for all words before *index*.
78
- """
79
- tag = None
80
- for tagger in self._taggers:
81
- tag = tagger.choose_tag(tokens, index, history)
82
- if tag is not None: break
83
- return tag
84
-
85
- def choose_tag(self, tokens, index, history):
86
- """
87
- Decide which tag should be used for the specified token, and
88
- return that tag. If this tagger is unable to determine a tag
89
- for the specified token, return None -- do not consult
90
- the backoff tagger. This method should be overridden by
91
- subclasses of SequentialBackoffTagger.
92
-
93
- :rtype: str
94
- :type tokens: list
95
- :param tokens: The list of words that are being tagged.
96
- :type index: int
97
- :param index: The index of the word whose tag should be
98
- returned.
99
- :type history: list(str)
100
- :param history: A list of the tags for all words before *index*.
101
- """
102
- raise NotImplementedError()
103
-
104
-
105
- @python_2_unicode_compatible
106
- class ContextTagger(SequentialBackoffTagger):
107
- """
108
- An abstract base class for sequential backoff taggers that choose
109
- a tag for a token based on the value of its "context". Different
110
- subclasses are used to define different contexts.
111
-
112
- A ContextTagger chooses the tag for a token by calculating the
113
- token's context, and looking up the corresponding tag in a table.
114
- This table can be constructed manually; or it can be automatically
115
- constructed based on a training corpus, using the ``_train()``
116
- factory method.
117
-
118
- :ivar _context_to_tag: Dictionary mapping contexts to tags.
119
- """
120
- def __init__(self, context_to_tag, backoff=None):
121
- """
122
- :param context_to_tag: A dictionary mapping contexts to tags.
123
- :param backoff: The backoff tagger that should be used for this tagger.
124
- """
125
- SequentialBackoffTagger.__init__(self, backoff)
126
- self._context_to_tag = (context_to_tag if context_to_tag else {})
127
-
128
- def context(self, tokens, index, history):
129
- """
130
- :return: the context that should be used to look up the tag
131
- for the specified token; or None if the specified token
132
- should not be handled by this tagger.
133
- :rtype: (hashable)
134
- """
135
- raise NotImplementedError()
136
-
137
- def choose_tag(self, tokens, index, history):
138
- context = self.context(tokens, index, history)
139
- return self._context_to_tag.get(context)
140
-
141
- def size(self):
142
- """
143
- :return: The number of entries in the table used by this
144
- tagger to map from contexts to tags.
145
- """
146
- return len(self._context_to_tag)
147
-
148
- def __repr__(self):
149
- return '<%s: size=%d>' % (self.__class__.__name__, self.size())
150
-
151
- def _train(self, tagged_corpus, cutoff=0, verbose=False):
152
- """
153
- Initialize this ContextTagger's ``_context_to_tag`` table
154
- based on the given training data. In particular, for each
155
- context ``c`` in the training data, set
156
- ``_context_to_tag[c]`` to the most frequent tag for that
157
- context. However, exclude any contexts that are already
158
- tagged perfectly by the backoff tagger(s).
159
-
160
- The old value of ``self._context_to_tag`` (if any) is discarded.
161
-
162
- :param tagged_corpus: A tagged corpus. Each item should be
163
- a list of (word, tag tuples.
164
- :param cutoff: If the most likely tag for a context occurs
165
- fewer than cutoff times, then exclude it from the
166
- context-to-tag table for the new tagger.
167
- """
168
-
169
- token_count = hit_count = 0
170
-
171
- # A context is considered 'useful' if it's not already tagged
172
- # perfectly by the backoff tagger.
173
- useful_contexts = set()
174
-
175
- # Count how many times each tag occurs in each context.
176
- fd = ConditionalFreqDist()
177
- for sentence in tagged_corpus:
178
- tokens, tags = zip(*sentence)
179
- for index, (token, tag) in enumerate(sentence):
180
- # Record the event.
181
- token_count += 1
182
- context = self.context(tokens, index, tags[:index])
183
- if context is None: continue
184
- fd[context][tag] += 1
185
- # If the backoff got it wrong, this context is useful:
186
- if (self.backoff is None or
187
- tag != self.backoff.tag_one(tokens, index, tags[:index])):
188
- useful_contexts.add(context)
189
-
190
- # Build the context_to_tag table -- for each context, figure
191
- # out what the most likely tag is. Only include contexts that
192
- # we've seen at least `cutoff` times.
193
- for context in useful_contexts:
194
- best_tag = fd[context].max()
195
- hits = fd[context][best_tag]
196
- if hits > cutoff:
197
- self._context_to_tag[context] = best_tag
198
- hit_count += hits
199
-
200
- # Display some stats, if requested.
201
- if verbose:
202
- size = len(self._context_to_tag)
203
- backoff = 100 - (hit_count * 100.0)/ token_count
204
- pruning = 100 - (size * 100.0) / len(fd.conditions())
205
- print("[Trained Unigram tagger:", end=' ')
206
- print("size=%d, backoff=%.2f%%, pruning=%.2f%%]" % (
207
- size, backoff, pruning))
208
-
209
- ######################################################################
210
- #{ Tagger Classes
211
- ######################################################################
212
-
213
- @python_2_unicode_compatible
214
- @jsontags.register_tag
215
- class DefaultTagger(SequentialBackoffTagger):
216
- """
217
- A tagger that assigns the same tag to every token.
218
-
219
- >>> from nltk.tag import DefaultTagger
220
- >>> default_tagger = DefaultTagger('NN')
221
- >>> list(default_tagger.tag('This is a test'.split()))
222
- [('This', 'NN'), ('is', 'NN'), ('a', 'NN'), ('test', 'NN')]
223
-
224
- This tagger is recommended as a backoff tagger, in cases where
225
- a more powerful tagger is unable to assign a tag to the word
226
- (e.g. because the word was not seen during training).
227
-
228
- :param tag: The tag to assign to each token
229
- :type tag: str
230
- """
231
-
232
- json_tag = 'nltk.tag.sequential.DefaultTagger'
233
-
234
- def __init__(self, tag):
235
- self._tag = tag
236
- SequentialBackoffTagger.__init__(self, None)
237
-
238
- def encode_json_obj(self):
239
- return self._tag
240
-
241
- @classmethod
242
- def decode_json_obj(cls, obj):
243
- tag = obj
244
- return cls(tag)
245
-
246
- def choose_tag(self, tokens, index, history):
247
- return self._tag # ignore token and history
248
-
249
- def __repr__(self):
250
- return '<DefaultTagger: tag=%s>' % self._tag
251
-
252
-
253
- @jsontags.register_tag
254
- class NgramTagger(ContextTagger):
255
- """
256
- A tagger that chooses a token's tag based on its word string and
257
- on the preceding n word's tags. In particular, a tuple
258
- (tags[i-n:i-1], words[i]) is looked up in a table, and the
259
- corresponding tag is returned. N-gram taggers are typically
260
- trained on a tagged corpus.
261
-
262
- Train a new NgramTagger using the given training data or
263
- the supplied model. In particular, construct a new tagger
264
- whose table maps from each context (tag[i-n:i-1], word[i])
265
- to the most frequent tag for that context. But exclude any
266
- contexts that are already tagged perfectly by the backoff
267
- tagger.
268
-
269
- :param train: A tagged corpus consisting of a list of tagged
270
- sentences, where each sentence is a list of (word, tag) tuples.
271
- :param backoff: A backoff tagger, to be used by the new
272
- tagger if it encounters an unknown context.
273
- :param cutoff: If the most likely tag for a context occurs
274
- fewer than *cutoff* times, then exclude it from the
275
- context-to-tag table for the new tagger.
276
- """
277
- json_tag = 'nltk.tag.sequential.NgramTagger'
278
-
279
- def __init__(self, n, train=None, model=None,
280
- backoff=None, cutoff=0, verbose=False):
281
- self._n = n
282
- self._check_params(train, model)
283
-
284
- ContextTagger.__init__(self, model, backoff)
285
-
286
- if train:
287
- self._train(train, cutoff, verbose)
288
-
289
- def encode_json_obj(self):
290
- return self._n, self._context_to_tag, self.backoff
291
-
292
- @classmethod
293
- def decode_json_obj(cls, obj):
294
- _n, _context_to_tag, backoff = obj
295
- return cls(_n, model=_context_to_tag, backoff=backoff)
296
-
297
- def context(self, tokens, index, history):
298
- tag_context = tuple(history[max(0,index-self._n+1):index])
299
- return tag_context, tokens[index]
300
-
301
-
302
- @jsontags.register_tag
303
- class UnigramTagger(NgramTagger):
304
- """
305
- Unigram Tagger
306
-
307
- The UnigramTagger finds the most likely tag for each word in a training
308
- corpus, and then uses that information to assign tags to new tokens.
309
-
310
- >>> from nltk.corpus import brown
311
- >>> from nltk.tag import UnigramTagger
312
- >>> test_sent = brown.sents(categories='news')[0]
313
- >>> unigram_tagger = UnigramTagger(brown.tagged_sents(categories='news')[:500])
314
- >>> for tok, tag in unigram_tagger.tag(test_sent):
315
- ... print("(%s, %s), " % (tok, tag))
316
- (The, AT), (Fulton, NP-TL), (County, NN-TL), (Grand, JJ-TL),
317
- (Jury, NN-TL), (said, VBD), (Friday, NR), (an, AT),
318
- (investigation, NN), (of, IN), (Atlanta's, NP$), (recent, JJ),
319
- (primary, NN), (election, NN), (produced, VBD), (``, ``),
320
- (no, AT), (evidence, NN), ('', ''), (that, CS), (any, DTI),
321
- (irregularities, NNS), (took, VBD), (place, NN), (., .),
322
-
323
- :param train: The corpus of training data, a list of tagged sentences
324
- :type train: list(list(tuple(str, str)))
325
- :param model: The tagger model
326
- :type model: dict
327
- :param backoff: Another tagger which this tagger will consult when it is
328
- unable to tag a word
329
- :type backoff: TaggerI
330
- :param cutoff: The number of instances of training data the tagger must see
331
- in order not to use the backoff tagger
332
- :type cutoff: int
333
- """
334
-
335
- json_tag = 'nltk.tag.sequential.UnigramTagger'
336
-
337
- def __init__(self, train=None, model=None,
338
- backoff=None, cutoff=0, verbose=False):
339
- NgramTagger.__init__(self, 1, train, model,
340
- backoff, cutoff, verbose)
341
-
342
- def encode_json_obj(self):
343
- return self._context_to_tag, self.backoff
344
-
345
- @classmethod
346
- def decode_json_obj(cls, obj):
347
- _context_to_tag, backoff = obj
348
- return cls(model=_context_to_tag, backoff=backoff)
349
-
350
- def context(self, tokens, index, history):
351
- return tokens[index]
352
-
353
-
354
- @jsontags.register_tag
355
- class BigramTagger(NgramTagger):
356
- """
357
- A tagger that chooses a token's tag based its word string and on
358
- the preceding words' tag. In particular, a tuple consisting
359
- of the previous tag and the word is looked up in a table, and
360
- the corresponding tag is returned.
361
-
362
- :param train: The corpus of training data, a list of tagged sentences
363
- :type train: list(list(tuple(str, str)))
364
- :param model: The tagger model
365
- :type model: dict
366
- :param backoff: Another tagger which this tagger will consult when it is
367
- unable to tag a word
368
- :type backoff: TaggerI
369
- :param cutoff: The number of instances of training data the tagger must see
370
- in order not to use the backoff tagger
371
- :type cutoff: int
372
- """
373
- json_tag = 'nltk.tag.sequential.BigramTagger'
374
-
375
- def __init__(self, train=None, model=None,
376
- backoff=None, cutoff=0, verbose=False):
377
- NgramTagger.__init__(self, 2, train, model,
378
- backoff, cutoff, verbose)
379
-
380
- def encode_json_obj(self):
381
- return self._context_to_tag, self.backoff
382
-
383
- @classmethod
384
- def decode_json_obj(cls, obj):
385
- _context_to_tag, backoff = obj
386
- return cls(model=_context_to_tag, backoff=backoff)
387
-
388
-
389
- @jsontags.register_tag
390
- class TrigramTagger(NgramTagger):
391
- """
392
- A tagger that chooses a token's tag based its word string and on
393
- the preceding two words' tags. In particular, a tuple consisting
394
- of the previous two tags and the word is looked up in a table, and
395
- the corresponding tag is returned.
396
-
397
- :param train: The corpus of training data, a list of tagged sentences
398
- :type train: list(list(tuple(str, str)))
399
- :param model: The tagger model
400
- :type model: dict
401
- :param backoff: Another tagger which this tagger will consult when it is
402
- unable to tag a word
403
- :type backoff: TaggerI
404
- :param cutoff: The number of instances of training data the tagger must see
405
- in order not to use the backoff tagger
406
- :type cutoff: int
407
- """
408
- json_tag = 'nltk.tag.sequential.TrigramTagger'
409
-
410
- def __init__(self, train=None, model=None,
411
- backoff=None, cutoff=0, verbose=False):
412
- NgramTagger.__init__(self, 3, train, model,
413
- backoff, cutoff, verbose)
414
-
415
- def encode_json_obj(self):
416
- return self._context_to_tag, self.backoff
417
-
418
- @classmethod
419
- def decode_json_obj(cls, obj):
420
- _context_to_tag, backoff = obj
421
- return cls(model=_context_to_tag, backoff=backoff)
422
-
423
-
424
- @jsontags.register_tag
425
- class AffixTagger(ContextTagger):
426
- """
427
- A tagger that chooses a token's tag based on a leading or trailing
428
- substring of its word string. (It is important to note that these
429
- substrings are not necessarily "true" morphological affixes). In
430
- particular, a fixed-length substring of the word is looked up in a
431
- table, and the corresponding tag is returned. Affix taggers are
432
- typically constructed by training them on a tagged corpus.
433
-
434
- Construct a new affix tagger.
435
-
436
- :param affix_length: The length of the affixes that should be
437
- considered during training and tagging. Use negative
438
- numbers for suffixes.
439
- :param min_stem_length: Any words whose length is less than
440
- min_stem_length+abs(affix_length) will be assigned a
441
- tag of None by this tagger.
442
- """
443
-
444
- json_tag = 'nltk.tag.sequential.AffixTagger'
445
-
446
- def __init__(self, train=None, model=None, affix_length=-3,
447
- min_stem_length=2, backoff=None, cutoff=0, verbose=False):
448
-
449
- self._check_params(train, model)
450
-
451
- ContextTagger.__init__(self, model, backoff)
452
-
453
- self._affix_length = affix_length
454
- self._min_word_length = min_stem_length + abs(affix_length)
455
-
456
- if train:
457
- self._train(train, cutoff, verbose)
458
-
459
- def encode_json_obj(self):
460
- return self._affix_length, self._min_word_length, self._context_to_tag, self.backoff
461
-
462
- @classmethod
463
- def decode_json_obj(cls, obj):
464
- _affix_length, _min_word_length, _context_to_tag, backoff = obj
465
- return cls(
466
- affix_length=_affix_length,
467
- min_stem_length=_min_word_length - abs(_affix_length),
468
- model=_context_to_tag,
469
- backoff=backoff
470
- )
471
-
472
- def context(self, tokens, index, history):
473
- token = tokens[index]
474
- if len(token) < self._min_word_length:
475
- return None
476
- elif self._affix_length > 0:
477
- return token[:self._affix_length]
478
- else:
479
- return token[self._affix_length:]
480
-
481
-
482
- @python_2_unicode_compatible
483
- @jsontags.register_tag
484
- class RegexpTagger(SequentialBackoffTagger):
485
- """
486
- Regular Expression Tagger
487
-
488
- The RegexpTagger assigns tags to tokens by comparing their
489
- word strings to a series of regular expressions. The following tagger
490
- uses word suffixes to make guesses about the correct Brown Corpus part
491
- of speech tag:
492
-
493
- >>> from nltk.corpus import brown
494
- >>> from nltk.tag import RegexpTagger
495
- >>> test_sent = brown.sents(categories='news')[0]
496
- >>> regexp_tagger = RegexpTagger(
497
- ... [(r'^-?[0-9]+(.[0-9]+)?$', 'CD'), # cardinal numbers
498
- ... (r'(The|the|A|a|An|an)$', 'AT'), # articles
499
- ... (r'.*able$', 'JJ'), # adjectives
500
- ... (r'.*ness$', 'NN'), # nouns formed from adjectives
501
- ... (r'.*ly$', 'RB'), # adverbs
502
- ... (r'.*s$', 'NNS'), # plural nouns
503
- ... (r'.*ing$', 'VBG'), # gerunds
504
- ... (r'.*ed$', 'VBD'), # past tense verbs
505
- ... (r'.*', 'NN') # nouns (default)
506
- ... ])
507
- >>> regexp_tagger
508
- <Regexp Tagger: size=9>
509
- >>> regexp_tagger.tag(test_sent)
510
- [('The', 'AT'), ('Fulton', 'NN'), ('County', 'NN'), ('Grand', 'NN'), ('Jury', 'NN'),
511
- ('said', 'NN'), ('Friday', 'NN'), ('an', 'AT'), ('investigation', 'NN'), ('of', 'NN'),
512
- ("Atlanta's", 'NNS'), ('recent', 'NN'), ('primary', 'NN'), ('election', 'NN'),
513
- ('produced', 'VBD'), ('``', 'NN'), ('no', 'NN'), ('evidence', 'NN'), ("''", 'NN'),
514
- ('that', 'NN'), ('any', 'NN'), ('irregularities', 'NNS'), ('took', 'NN'),
515
- ('place', 'NN'), ('.', 'NN')]
516
-
517
- :type regexps: list(tuple(str, str))
518
- :param regexps: A list of ``(regexp, tag)`` pairs, each of
519
- which indicates that a word matching ``regexp`` should
520
- be tagged with ``tag``. The pairs will be evalutated in
521
- order. If none of the regexps match a word, then the
522
- optional backoff tagger is invoked, else it is
523
- assigned the tag None.
524
- """
525
-
526
- json_tag = 'nltk.tag.sequential.RegexpTagger'
527
-
528
- def __init__(self, regexps, backoff=None):
529
- """
530
- """
531
- SequentialBackoffTagger.__init__(self, backoff)
532
- self._regexs = [(re.compile(regexp), tag,) for regexp, tag in regexps]
533
-
534
- def encode_json_obj(self):
535
- return [(regexp.patten, tag,) for regexp, tag in self._regexs], self.backoff
536
-
537
- @classmethod
538
- def decode_json_obj(cls, obj):
539
- regexps, backoff = obj
540
- self = cls(())
541
- self._regexs = [(re.compile(regexp), tag,) for regexp, tag in regexps]
542
- SequentialBackoffTagger.__init__(self, backoff)
543
- return self
544
-
545
- def choose_tag(self, tokens, index, history):
546
- for regexp, tag in self._regexs:
547
- if re.match(regexp, tokens[index]):
548
- return tag
549
- return None
550
-
551
- def __repr__(self):
552
- return '<Regexp Tagger: size=%d>' % len(self._regexs)
553
-
554
-
555
- @python_2_unicode_compatible
556
- class ClassifierBasedTagger(SequentialBackoffTagger, FeaturesetTaggerI):
557
- """
558
- A sequential tagger that uses a classifier to choose the tag for
559
- each token in a sentence. The featureset input for the classifier
560
- is generated by a feature detector function::
561
-
562
- feature_detector(tokens, index, history) -> featureset
563
-
564
- Where tokens is the list of unlabeled tokens in the sentence;
565
- index is the index of the token for which feature detection
566
- should be performed; and history is list of the tags for all
567
- tokens before index.
568
-
569
- Construct a new classifier-based sequential tagger.
570
-
571
- :param feature_detector: A function used to generate the
572
- featureset input for the classifier::
573
- feature_detector(tokens, index, history) -> featureset
574
-
575
- :param train: A tagged corpus consisting of a list of tagged
576
- sentences, where each sentence is a list of (word, tag) tuples.
577
-
578
- :param backoff: A backoff tagger, to be used by the new tagger
579
- if it encounters an unknown context.
580
-
581
- :param classifier_builder: A function used to train a new
582
- classifier based on the data in *train*. It should take
583
- one argument, a list of labeled featuresets (i.e.,
584
- (featureset, label) tuples).
585
-
586
- :param classifier: The classifier that should be used by the
587
- tagger. This is only useful if you want to manually
588
- construct the classifier; normally, you would use *train*
589
- instead.
590
-
591
- :param backoff: A backoff tagger, used if this tagger is
592
- unable to determine a tag for a given token.
593
-
594
- :param cutoff_prob: If specified, then this tagger will fall
595
- back on its backoff tagger if the probability of the most
596
- likely tag is less than *cutoff_prob*.
597
- """
598
- def __init__(self, feature_detector=None, train=None,
599
- classifier_builder=NaiveBayesClassifier.train,
600
- classifier=None, backoff=None,
601
- cutoff_prob=None, verbose=False):
602
- self._check_params(train, classifier)
603
-
604
- SequentialBackoffTagger.__init__(self, backoff)
605
-
606
- if (train and classifier) or (not train and not classifier):
607
- raise ValueError('Must specify either training data or '
608
- 'trained classifier.')
609
-
610
- if feature_detector is not None:
611
- self._feature_detector = feature_detector
612
- # The feature detector function, used to generate a featureset
613
- # or each token: feature_detector(tokens, index, history) -> featureset
614
-
615
- self._cutoff_prob = cutoff_prob
616
- """Cutoff probability for tagging -- if the probability of the
617
- most likely tag is less than this, then use backoff."""
618
-
619
- self._classifier = classifier
620
- """The classifier used to choose a tag for each token."""
621
-
622
- if train:
623
- self._train(train, classifier_builder, verbose)
624
-
625
- def choose_tag(self, tokens, index, history):
626
- # Use our feature detector to get the featureset.
627
- featureset = self.feature_detector(tokens, index, history)
628
-
629
- # Use the classifier to pick a tag. If a cutoff probability
630
- # was specified, then check that the tag's probability is
631
- # higher than that cutoff first; otherwise, return None.
632
- if self._cutoff_prob is None:
633
- return self._classifier.classify(featureset)
634
-
635
- pdist = self._classifier.prob_classify(featureset)
636
- tag = pdist.max()
637
- return tag if pdist.prob(tag) >= self._cutoff_prob else None
638
-
639
- def _train(self, tagged_corpus, classifier_builder, verbose):
640
- """
641
- Build a new classifier, based on the given training data
642
- *tagged_corpus*.
643
- """
644
-
645
- classifier_corpus = []
646
- if verbose:
647
- print('Constructing training corpus for classifier.')
648
-
649
- for sentence in tagged_corpus:
650
- history = []
651
- untagged_sentence, tags = zip(*sentence)
652
- for index in range(len(sentence)):
653
- featureset = self.feature_detector(untagged_sentence,
654
- index, history)
655
- classifier_corpus.append( (featureset, tags[index]) )
656
- history.append(tags[index])
657
-
658
- if verbose:
659
- print('Training classifier (%d instances)' % len(classifier_corpus))
660
- self._classifier = classifier_builder(classifier_corpus)
661
-
662
- def __repr__(self):
663
- return '<ClassifierBasedTagger: %r>' % self._classifier
664
-
665
- def feature_detector(self, tokens, index, history):
666
- """
667
- Return the feature detector that this tagger uses to generate
668
- featuresets for its classifier. The feature detector is a
669
- function with the signature::
670
-
671
- feature_detector(tokens, index, history) -> featureset
672
-
673
- See ``classifier()``
674
- """
675
- return self._feature_detector(tokens, index, history)
676
-
677
- def classifier(self):
678
- """
679
- Return the classifier that this tagger uses to choose a tag
680
- for each word in a sentence. The input for this classifier is
681
- generated using this tagger's feature detector.
682
- See ``feature_detector()``
683
- """
684
- return self._classifier
685
-
686
- class ClassifierBasedPOSTagger(ClassifierBasedTagger):
687
- """
688
- A classifier based part of speech tagger.
689
- """
690
- def feature_detector(self, tokens, index, history):
691
- word = tokens[index]
692
- if index == 0:
693
- prevword = prevprevword = None
694
- prevtag = prevprevtag = None
695
- elif index == 1:
696
- prevword = tokens[index-1].lower()
697
- prevprevword = None
698
- prevtag = history[index-1]
699
- prevprevtag = None
700
- else:
701
- prevword = tokens[index-1].lower()
702
- prevprevword = tokens[index-2].lower()
703
- prevtag = history[index-1]
704
- prevprevtag = history[index-2]
705
-
706
- if re.match('[0-9]+(\.[0-9]*)?|[0-9]*\.[0-9]+$', word):
707
- shape = 'number'
708
- elif re.match('\W+$', word):
709
- shape = 'punct'
710
- elif re.match('[A-Z][a-z]+$', word):
711
- shape = 'upcase'
712
- elif re.match('[a-z]+$', word):
713
- shape = 'downcase'
714
- elif re.match('\w+$', word):
715
- shape = 'mixedcase'
716
- else:
717
- shape = 'other'
718
-
719
- features = {
720
- 'prevtag': prevtag,
721
- 'prevprevtag': prevprevtag,
722
- 'word': word,
723
- 'word.lower': word.lower(),
724
- 'suffix3': word.lower()[-3:],
725
- 'suffix2': word.lower()[-2:],
726
- 'suffix1': word.lower()[-1:],
727
- 'prevprevword': prevprevword,
728
- 'prevword': prevword,
729
- 'prevtag+word': '%s+%s' % (prevtag, word.lower()),
730
- 'prevprevtag+word': '%s+%s' % (prevprevtag, word.lower()),
731
- 'prevword+word': '%s+%s' % (prevword, word.lower()),
732
- 'shape': shape,
733
- }
734
- return features
735
-
736
-
1
+ # Natural Language Toolkit: Sequential Backoff Taggers
2
+ #
3
+ # Copyright (C) 2001-2018 NLTK Project
4
+ # Author: Edward Loper <edloper@gmail.com>
5
+ # Steven Bird <stevenbird1@gmail.com> (minor additions)
6
+ # Tiago Tresoldi <tresoldi@users.sf.net> (original affix tagger)
7
+ # URL: <http://nltk.org/>
8
+ # For license information, see LICENSE.TXT
9
+
10
+ """
11
+ Classes for tagging sentences sequentially, left to right. The
12
+ abstract base class SequentialBackoffTagger serves as the base
13
+ class for all the taggers in this module. Tagging of individual words
14
+ is performed by the method ``choose_tag()``, which is defined by
15
+ subclasses of SequentialBackoffTagger. If a tagger is unable to
16
+ determine a tag for the specified token, then its backoff tagger is
17
+ consulted instead. Any SequentialBackoffTagger may serve as a
18
+ backoff tagger for any other SequentialBackoffTagger.
19
+ """
20
+ from __future__ import print_function, unicode_literals
21
+ from abc import abstractmethod
22
+
23
+ import re
24
+
25
+ from nltk.probability import ConditionalFreqDist
26
+ from nltk.classify import NaiveBayesClassifier
27
+ from nltk.compat import python_2_unicode_compatible
28
+
29
+ from nltk.tag.api import TaggerI, FeaturesetTaggerI
30
+
31
+ from nltk import jsontags
32
+
33
+
34
+ ######################################################################
35
+ # Abstract Base Classes
36
+ ######################################################################
37
+ class SequentialBackoffTagger(TaggerI):
38
+ """
39
+ An abstract base class for taggers that tags words sequentially,
40
+ left to right. Tagging of individual words is performed by the
41
+ ``choose_tag()`` method, which should be defined by subclasses. If
42
+ a tagger is unable to determine a tag for the specified token,
43
+ then its backoff tagger is consulted.
44
+
45
+ :ivar _taggers: A list of all the taggers that should be tried to
46
+ tag a token (i.e., self and its backoff taggers).
47
+ """
48
+ def __init__(self, backoff=None):
49
+ if backoff is None:
50
+ self._taggers = [self]
51
+ else:
52
+ self._taggers = [self] + backoff._taggers
53
+
54
+ @property
55
+ def backoff(self):
56
+ """The backoff tagger for this tagger."""
57
+ return self._taggers[1] if len(self._taggers) > 1 else None
58
+
59
+ def tag(self, tokens):
60
+ # docs inherited from TaggerI
61
+ tags = []
62
+ for i in range(len(tokens)):
63
+ tags.append(self.tag_one(tokens, i, tags))
64
+ return list(zip(tokens, tags))
65
+
66
+ def tag_one(self, tokens, index, history):
67
+ """
68
+ Determine an appropriate tag for the specified token, and
69
+ return that tag. If this tagger is unable to determine a tag
70
+ for the specified token, then its backoff tagger is consulted.
71
+
72
+ :rtype: str
73
+ :type tokens: list
74
+ :param tokens: The list of words that are being tagged.
75
+ :type index: int
76
+ :param index: The index of the word whose tag should be
77
+ returned.
78
+ :type history: list(str)
79
+ :param history: A list of the tags for all words before *index*.
80
+ """
81
+ tag = None
82
+ for tagger in self._taggers:
83
+ tag = tagger.choose_tag(tokens, index, history)
84
+ if tag is not None:
85
+ break
86
+ return tag
87
+
88
+ @abstractmethod
89
+ def choose_tag(self, tokens, index, history):
90
+ """
91
+ Decide which tag should be used for the specified token, and
92
+ return that tag. If this tagger is unable to determine a tag
93
+ for the specified token, return None -- do not consult
94
+ the backoff tagger. This method should be overridden by
95
+ subclasses of SequentialBackoffTagger.
96
+
97
+ :rtype: str
98
+ :type tokens: list
99
+ :param tokens: The list of words that are being tagged.
100
+ :type index: int
101
+ :param index: The index of the word whose tag should be
102
+ returned.
103
+ :type history: list(str)
104
+ :param history: A list of the tags for all words before *index*.
105
+ """
106
+
107
+
108
+ @python_2_unicode_compatible
109
+ class ContextTagger(SequentialBackoffTagger):
110
+ """
111
+ An abstract base class for sequential backoff taggers that choose
112
+ a tag for a token based on the value of its "context". Different
113
+ subclasses are used to define different contexts.
114
+
115
+ A ContextTagger chooses the tag for a token by calculating the
116
+ token's context, and looking up the corresponding tag in a table.
117
+ This table can be constructed manually; or it can be automatically
118
+ constructed based on a training corpus, using the ``_train()``
119
+ factory method.
120
+
121
+ :ivar _context_to_tag: Dictionary mapping contexts to tags.
122
+ """
123
+ def __init__(self, context_to_tag, backoff=None):
124
+ """
125
+ :param context_to_tag: A dictionary mapping contexts to tags.
126
+ :param backoff: The backoff tagger that should be used for this tagger.
127
+ """
128
+ SequentialBackoffTagger.__init__(self, backoff)
129
+ self._context_to_tag = (context_to_tag if context_to_tag else {})
130
+
131
+ @abstractmethod
132
+ def context(self, tokens, index, history):
133
+ """
134
+ :return: the context that should be used to look up the tag
135
+ for the specified token; or None if the specified token
136
+ should not be handled by this tagger.
137
+ :rtype: (hashable)
138
+ """
139
+
140
+ def choose_tag(self, tokens, index, history):
141
+ context = self.context(tokens, index, history)
142
+ return self._context_to_tag.get(context)
143
+
144
+ def size(self):
145
+ """
146
+ :return: The number of entries in the table used by this
147
+ tagger to map from contexts to tags.
148
+ """
149
+ return len(self._context_to_tag)
150
+
151
+ def __repr__(self):
152
+ return '<%s: size=%d>' % (self.__class__.__name__, self.size())
153
+
154
+ def _train(self, tagged_corpus, cutoff=0, verbose=False):
155
+ """
156
+ Initialize this ContextTagger's ``_context_to_tag`` table
157
+ based on the given training data. In particular, for each
158
+ context ``c`` in the training data, set
159
+ ``_context_to_tag[c]`` to the most frequent tag for that
160
+ context. However, exclude any contexts that are already
161
+ tagged perfectly by the backoff tagger(s).
162
+
163
+ The old value of ``self._context_to_tag`` (if any) is discarded.
164
+
165
+ :param tagged_corpus: A tagged corpus. Each item should be
166
+ a list of (word, tag tuples.
167
+ :param cutoff: If the most likely tag for a context occurs
168
+ fewer than cutoff times, then exclude it from the
169
+ context-to-tag table for the new tagger.
170
+ """
171
+
172
+ token_count = hit_count = 0
173
+
174
+ # A context is considered 'useful' if it's not already tagged
175
+ # perfectly by the backoff tagger.
176
+ useful_contexts = set()
177
+
178
+ # Count how many times each tag occurs in each context.
179
+ fd = ConditionalFreqDist()
180
+ for sentence in tagged_corpus:
181
+ tokens, tags = zip(*sentence)
182
+ for index, (token, tag) in enumerate(sentence):
183
+ # Record the event.
184
+ token_count += 1
185
+ context = self.context(tokens, index, tags[:index])
186
+ if context is None:
187
+ continue
188
+ fd[context][tag] += 1
189
+ # If the backoff got it wrong, this context is useful:
190
+ if (self.backoff is None or
191
+ tag != self.backoff.tag_one(
192
+ tokens, index, tags[:index])):
193
+ useful_contexts.add(context)
194
+
195
+ # Build the context_to_tag table -- for each context, figure
196
+ # out what the most likely tag is. Only include contexts that
197
+ # we've seen at least `cutoff` times.
198
+ for context in useful_contexts:
199
+ best_tag = fd[context].max()
200
+ hits = fd[context][best_tag]
201
+ if hits > cutoff:
202
+ self._context_to_tag[context] = best_tag
203
+ hit_count += hits
204
+
205
+ # Display some stats, if requested.
206
+ if verbose:
207
+ size = len(self._context_to_tag)
208
+ backoff = 100 - (hit_count * 100.0) / token_count
209
+ pruning = 100 - (size * 100.0) / len(fd.conditions())
210
+ print("[Trained Unigram tagger:", end=' ')
211
+ print("size=%d, backoff=%.2f%%, pruning=%.2f%%]" % (
212
+ size, backoff, pruning))
213
+
214
+
215
+ ######################################################################
216
+ # Tagger Classes
217
+ ######################################################################
218
+ @python_2_unicode_compatible
219
+ @jsontags.register_tag
220
+ class DefaultTagger(SequentialBackoffTagger):
221
+ """
222
+ A tagger that assigns the same tag to every token.
223
+
224
+ >>> from nltk.tag import DefaultTagger
225
+ >>> default_tagger = DefaultTagger('NN')
226
+ >>> list(default_tagger.tag('This is a test'.split()))
227
+ [('This', 'NN'), ('is', 'NN'), ('a', 'NN'), ('test', 'NN')]
228
+
229
+ This tagger is recommended as a backoff tagger, in cases where
230
+ a more powerful tagger is unable to assign a tag to the word
231
+ (e.g. because the word was not seen during training).
232
+
233
+ :param tag: The tag to assign to each token
234
+ :type tag: str
235
+ """
236
+
237
+ json_tag = 'nltk.tag.sequential.DefaultTagger'
238
+
239
+ def __init__(self, tag):
240
+ self._tag = tag
241
+ SequentialBackoffTagger.__init__(self, None)
242
+
243
+ def encode_json_obj(self):
244
+ return self._tag
245
+
246
+ @classmethod
247
+ def decode_json_obj(cls, obj):
248
+ tag = obj
249
+ return cls(tag)
250
+
251
+ def choose_tag(self, tokens, index, history):
252
+ return self._tag # ignore token and history
253
+
254
+ def __repr__(self):
255
+ return '<DefaultTagger: tag=%s>' % self._tag
256
+
257
+
258
+ @jsontags.register_tag
259
+ class NgramTagger(ContextTagger):
260
+ """
261
+ A tagger that chooses a token's tag based on its word string and
262
+ on the preceding n word's tags. In particular, a tuple
263
+ (tags[i-n:i-1], words[i]) is looked up in a table, and the
264
+ corresponding tag is returned. N-gram taggers are typically
265
+ trained on a tagged corpus.
266
+
267
+ Train a new NgramTagger using the given training data or
268
+ the supplied model. In particular, construct a new tagger
269
+ whose table maps from each context (tag[i-n:i-1], word[i])
270
+ to the most frequent tag for that context. But exclude any
271
+ contexts that are already tagged perfectly by the backoff
272
+ tagger.
273
+
274
+ :param train: A tagged corpus consisting of a list of tagged
275
+ sentences, where each sentence is a list of (word, tag) tuples.
276
+ :param backoff: A backoff tagger, to be used by the new
277
+ tagger if it encounters an unknown context.
278
+ :param cutoff: If the most likely tag for a context occurs
279
+ fewer than *cutoff* times, then exclude it from the
280
+ context-to-tag table for the new tagger.
281
+ """
282
+ json_tag = 'nltk.tag.sequential.NgramTagger'
283
+
284
+ def __init__(self, n, train=None, model=None,
285
+ backoff=None, cutoff=0, verbose=False):
286
+ self._n = n
287
+ self._check_params(train, model)
288
+
289
+ ContextTagger.__init__(self, model, backoff)
290
+
291
+ if train:
292
+ self._train(train, cutoff, verbose)
293
+
294
+ def encode_json_obj(self):
295
+ return self._n, self._context_to_tag, self.backoff
296
+
297
+ @classmethod
298
+ def decode_json_obj(cls, obj):
299
+ _n, _context_to_tag, backoff = obj
300
+ return cls(_n, model=_context_to_tag, backoff=backoff)
301
+
302
+ def context(self, tokens, index, history):
303
+ tag_context = tuple(history[max(0, index-self._n+1):index])
304
+ return tag_context, tokens[index]
305
+
306
+
307
+ @jsontags.register_tag
308
+ class UnigramTagger(NgramTagger):
309
+ """
310
+ Unigram Tagger
311
+
312
+ The UnigramTagger finds the most likely tag for each word in a training
313
+ corpus, and then uses that information to assign tags to new tokens.
314
+
315
+ >>> from nltk.corpus import brown
316
+ >>> from nltk.tag import UnigramTagger
317
+ >>> test_sent = brown.sents(categories='news')[0]
318
+ >>> unigram_tagger = UnigramTagger(brown.tagged_sents(categories='news')[:500])
319
+ >>> for tok, tag in unigram_tagger.tag(test_sent):
320
+ ... print("(%s, %s), " % (tok, tag))
321
+ (The, AT), (Fulton, NP-TL), (County, NN-TL), (Grand, JJ-TL),
322
+ (Jury, NN-TL), (said, VBD), (Friday, NR), (an, AT),
323
+ (investigation, NN), (of, IN), (Atlanta's, NP$), (recent, JJ),
324
+ (primary, NN), (election, NN), (produced, VBD), (``, ``),
325
+ (no, AT), (evidence, NN), ('', ''), (that, CS), (any, DTI),
326
+ (irregularities, NNS), (took, VBD), (place, NN), (., .),
327
+
328
+ :param train: The corpus of training data, a list of tagged sentences
329
+ :type train: list(list(tuple(str, str)))
330
+ :param model: The tagger model
331
+ :type model: dict
332
+ :param backoff: Another tagger which this tagger will consult when it is
333
+ unable to tag a word
334
+ :type backoff: TaggerI
335
+ :param cutoff: The number of instances of training data the tagger must see
336
+ in order not to use the backoff tagger
337
+ :type cutoff: int
338
+ """
339
+
340
+ json_tag = 'nltk.tag.sequential.UnigramTagger'
341
+
342
+ def __init__(self, train=None, model=None,
343
+ backoff=None, cutoff=0, verbose=False):
344
+ NgramTagger.__init__(self, 1, train, model,
345
+ backoff, cutoff, verbose)
346
+
347
+ def encode_json_obj(self):
348
+ return self._context_to_tag, self.backoff
349
+
350
+ @classmethod
351
+ def decode_json_obj(cls, obj):
352
+ _context_to_tag, backoff = obj
353
+ return cls(model=_context_to_tag, backoff=backoff)
354
+
355
+ def context(self, tokens, index, history):
356
+ return tokens[index]
357
+
358
+
359
+ @jsontags.register_tag
360
+ class BigramTagger(NgramTagger):
361
+ """
362
+ A tagger that chooses a token's tag based its word string and on
363
+ the preceding words' tag. In particular, a tuple consisting
364
+ of the previous tag and the word is looked up in a table, and
365
+ the corresponding tag is returned.
366
+
367
+ :param train: The corpus of training data, a list of tagged sentences
368
+ :type train: list(list(tuple(str, str)))
369
+ :param model: The tagger model
370
+ :type model: dict
371
+ :param backoff: Another tagger which this tagger will consult when it is
372
+ unable to tag a word
373
+ :type backoff: TaggerI
374
+ :param cutoff: The number of instances of training data the tagger must see
375
+ in order not to use the backoff tagger
376
+ :type cutoff: int
377
+ """
378
+ json_tag = 'nltk.tag.sequential.BigramTagger'
379
+
380
+ def __init__(self, train=None, model=None,
381
+ backoff=None, cutoff=0, verbose=False):
382
+ NgramTagger.__init__(self, 2, train, model,
383
+ backoff, cutoff, verbose)
384
+
385
+ def encode_json_obj(self):
386
+ return self._context_to_tag, self.backoff
387
+
388
+ @classmethod
389
+ def decode_json_obj(cls, obj):
390
+ _context_to_tag, backoff = obj
391
+ return cls(model=_context_to_tag, backoff=backoff)
392
+
393
+
394
+ @jsontags.register_tag
395
+ class TrigramTagger(NgramTagger):
396
+ """
397
+ A tagger that chooses a token's tag based its word string and on
398
+ the preceding two words' tags. In particular, a tuple consisting
399
+ of the previous two tags and the word is looked up in a table, and
400
+ the corresponding tag is returned.
401
+
402
+ :param train: The corpus of training data, a list of tagged sentences
403
+ :type train: list(list(tuple(str, str)))
404
+ :param model: The tagger model
405
+ :type model: dict
406
+ :param backoff: Another tagger which this tagger will consult when it is
407
+ unable to tag a word
408
+ :type backoff: TaggerI
409
+ :param cutoff: The number of instances of training data the tagger must see
410
+ in order not to use the backoff tagger
411
+ :type cutoff: int
412
+ """
413
+ json_tag = 'nltk.tag.sequential.TrigramTagger'
414
+
415
+ def __init__(self, train=None, model=None,
416
+ backoff=None, cutoff=0, verbose=False):
417
+ NgramTagger.__init__(self, 3, train, model,
418
+ backoff, cutoff, verbose)
419
+
420
+ def encode_json_obj(self):
421
+ return self._context_to_tag, self.backoff
422
+
423
+ @classmethod
424
+ def decode_json_obj(cls, obj):
425
+ _context_to_tag, backoff = obj
426
+ return cls(model=_context_to_tag, backoff=backoff)
427
+
428
+
429
+ @jsontags.register_tag
430
+ class AffixTagger(ContextTagger):
431
+ """
432
+ A tagger that chooses a token's tag based on a leading or trailing
433
+ substring of its word string. (It is important to note that these
434
+ substrings are not necessarily "true" morphological affixes). In
435
+ particular, a fixed-length substring of the word is looked up in a
436
+ table, and the corresponding tag is returned. Affix taggers are
437
+ typically constructed by training them on a tagged corpus.
438
+
439
+ Construct a new affix tagger.
440
+
441
+ :param affix_length: The length of the affixes that should be
442
+ considered during training and tagging. Use negative
443
+ numbers for suffixes.
444
+ :param min_stem_length: Any words whose length is less than
445
+ min_stem_length+abs(affix_length) will be assigned a
446
+ tag of None by this tagger.
447
+ """
448
+
449
+ json_tag = 'nltk.tag.sequential.AffixTagger'
450
+
451
+ def __init__(self, train=None, model=None, affix_length=-3,
452
+ min_stem_length=2, backoff=None, cutoff=0, verbose=False):
453
+
454
+ self._check_params(train, model)
455
+
456
+ ContextTagger.__init__(self, model, backoff)
457
+
458
+ self._affix_length = affix_length
459
+ self._min_word_length = min_stem_length + abs(affix_length)
460
+
461
+ if train:
462
+ self._train(train, cutoff, verbose)
463
+
464
+ def encode_json_obj(self):
465
+ return self._affix_length, self._min_word_length, self._context_to_tag, self.backoff
466
+
467
+ @classmethod
468
+ def decode_json_obj(cls, obj):
469
+ _affix_length, _min_word_length, _context_to_tag, backoff = obj
470
+ return cls(
471
+ affix_length=_affix_length,
472
+ min_stem_length=_min_word_length - abs(_affix_length),
473
+ model=_context_to_tag,
474
+ backoff=backoff
475
+ )
476
+
477
+ def context(self, tokens, index, history):
478
+ token = tokens[index]
479
+ if len(token) < self._min_word_length:
480
+ return None
481
+ elif self._affix_length > 0:
482
+ return token[:self._affix_length]
483
+ else:
484
+ return token[self._affix_length:]
485
+
486
+
487
+ @python_2_unicode_compatible
488
+ @jsontags.register_tag
489
+ class RegexpTagger(SequentialBackoffTagger):
490
+ """
491
+ Regular Expression Tagger
492
+
493
+ The RegexpTagger assigns tags to tokens by comparing their
494
+ word strings to a series of regular expressions. The following tagger
495
+ uses word suffixes to make guesses about the correct Brown Corpus part
496
+ of speech tag:
497
+
498
+ >>> from nltk.corpus import brown
499
+ >>> from nltk.tag import RegexpTagger
500
+ >>> test_sent = brown.sents(categories='news')[0]
501
+ >>> regexp_tagger = RegexpTagger(
502
+ ... [(r'^-?[0-9]+(.[0-9]+)?$', 'CD'), # cardinal numbers
503
+ ... (r'(The|the|A|a|An|an)$', 'AT'), # articles
504
+ ... (r'.*able$', 'JJ'), # adjectives
505
+ ... (r'.*ness$', 'NN'), # nouns formed from adjectives
506
+ ... (r'.*ly$', 'RB'), # adverbs
507
+ ... (r'.*s$', 'NNS'), # plural nouns
508
+ ... (r'.*ing$', 'VBG'), # gerunds
509
+ ... (r'.*ed$', 'VBD'), # past tense verbs
510
+ ... (r'.*', 'NN') # nouns (default)
511
+ ... ])
512
+ >>> regexp_tagger
513
+ <Regexp Tagger: size=9>
514
+ >>> regexp_tagger.tag(test_sent)
515
+ [('The', 'AT'), ('Fulton', 'NN'), ('County', 'NN'), ('Grand', 'NN'), ('Jury', 'NN'),
516
+ ('said', 'NN'), ('Friday', 'NN'), ('an', 'AT'), ('investigation', 'NN'), ('of', 'NN'),
517
+ ("Atlanta's", 'NNS'), ('recent', 'NN'), ('primary', 'NN'), ('election', 'NN'),
518
+ ('produced', 'VBD'), ('``', 'NN'), ('no', 'NN'), ('evidence', 'NN'), ("''", 'NN'),
519
+ ('that', 'NN'), ('any', 'NN'), ('irregularities', 'NNS'), ('took', 'NN'),
520
+ ('place', 'NN'), ('.', 'NN')]
521
+
522
+ :type regexps: list(tuple(str, str))
523
+ :param regexps: A list of ``(regexp, tag)`` pairs, each of
524
+ which indicates that a word matching ``regexp`` should
525
+ be tagged with ``tag``. The pairs will be evalutated in
526
+ order. If none of the regexps match a word, then the
527
+ optional backoff tagger is invoked, else it is
528
+ assigned the tag None.
529
+ """
530
+
531
+ json_tag = 'nltk.tag.sequential.RegexpTagger'
532
+
533
+ def __init__(self, regexps, backoff=None):
534
+ """
535
+ """
536
+ SequentialBackoffTagger.__init__(self, backoff)
537
+ self._regexs = [(re.compile(regexp), tag,) for regexp, tag in regexps]
538
+
539
+ def encode_json_obj(self):
540
+ return [(regexp.patten, tag,) for regexp, tag in self._regexs], self.backoff
541
+
542
+ @classmethod
543
+ def decode_json_obj(cls, obj):
544
+ regexps, backoff = obj
545
+ self = cls(())
546
+ self._regexs = [(re.compile(regexp), tag,) for regexp, tag in regexps]
547
+ SequentialBackoffTagger.__init__(self, backoff)
548
+ return self
549
+
550
+ def choose_tag(self, tokens, index, history):
551
+ for regexp, tag in self._regexs:
552
+ if re.match(regexp, tokens[index]):
553
+ return tag
554
+ return None
555
+
556
+ def __repr__(self):
557
+ return '<Regexp Tagger: size=%d>' % len(self._regexs)
558
+
559
+
560
+ @python_2_unicode_compatible
561
+ class ClassifierBasedTagger(SequentialBackoffTagger, FeaturesetTaggerI):
562
+ """
563
+ A sequential tagger that uses a classifier to choose the tag for
564
+ each token in a sentence. The featureset input for the classifier
565
+ is generated by a feature detector function::
566
+
567
+ feature_detector(tokens, index, history) -> featureset
568
+
569
+ Where tokens is the list of unlabeled tokens in the sentence;
570
+ index is the index of the token for which feature detection
571
+ should be performed; and history is list of the tags for all
572
+ tokens before index.
573
+
574
+ Construct a new classifier-based sequential tagger.
575
+
576
+ :param feature_detector: A function used to generate the
577
+ featureset input for the classifier::
578
+ feature_detector(tokens, index, history) -> featureset
579
+
580
+ :param train: A tagged corpus consisting of a list of tagged
581
+ sentences, where each sentence is a list of (word, tag) tuples.
582
+
583
+ :param backoff: A backoff tagger, to be used by the new tagger
584
+ if it encounters an unknown context.
585
+
586
+ :param classifier_builder: A function used to train a new
587
+ classifier based on the data in *train*. It should take
588
+ one argument, a list of labeled featuresets (i.e.,
589
+ (featureset, label) tuples).
590
+
591
+ :param classifier: The classifier that should be used by the
592
+ tagger. This is only useful if you want to manually
593
+ construct the classifier; normally, you would use *train*
594
+ instead.
595
+
596
+ :param backoff: A backoff tagger, used if this tagger is
597
+ unable to determine a tag for a given token.
598
+
599
+ :param cutoff_prob: If specified, then this tagger will fall
600
+ back on its backoff tagger if the probability of the most
601
+ likely tag is less than *cutoff_prob*.
602
+ """
603
+ def __init__(self, feature_detector=None, train=None,
604
+ classifier_builder=NaiveBayesClassifier.train,
605
+ classifier=None, backoff=None,
606
+ cutoff_prob=None, verbose=False):
607
+ self._check_params(train, classifier)
608
+
609
+ SequentialBackoffTagger.__init__(self, backoff)
610
+
611
+ if (train and classifier) or (not train and not classifier):
612
+ raise ValueError('Must specify either training data or '
613
+ 'trained classifier.')
614
+
615
+ if feature_detector is not None:
616
+ self._feature_detector = feature_detector
617
+ # The feature detector function, used to generate a featureset
618
+ # or each token: feature_detector(tokens, index, history) -> featureset
619
+
620
+ self._cutoff_prob = cutoff_prob
621
+ """Cutoff probability for tagging -- if the probability of the
622
+ most likely tag is less than this, then use backoff."""
623
+
624
+ self._classifier = classifier
625
+ """The classifier used to choose a tag for each token."""
626
+
627
+ if train:
628
+ self._train(train, classifier_builder, verbose)
629
+
630
+ def choose_tag(self, tokens, index, history):
631
+ # Use our feature detector to get the featureset.
632
+ featureset = self.feature_detector(tokens, index, history)
633
+
634
+ # Use the classifier to pick a tag. If a cutoff probability
635
+ # was specified, then check that the tag's probability is
636
+ # higher than that cutoff first; otherwise, return None.
637
+ if self._cutoff_prob is None:
638
+ return self._classifier.classify(featureset)
639
+
640
+ pdist = self._classifier.prob_classify(featureset)
641
+ tag = pdist.max()
642
+ return tag if pdist.prob(tag) >= self._cutoff_prob else None
643
+
644
+ def _train(self, tagged_corpus, classifier_builder, verbose):
645
+ """
646
+ Build a new classifier, based on the given training data
647
+ *tagged_corpus*.
648
+ """
649
+
650
+ classifier_corpus = []
651
+ if verbose:
652
+ print('Constructing training corpus for classifier.')
653
+
654
+ for sentence in tagged_corpus:
655
+ history = []
656
+ untagged_sentence, tags = zip(*sentence)
657
+ for index in range(len(sentence)):
658
+ featureset = self.feature_detector(untagged_sentence,
659
+ index, history)
660
+ classifier_corpus.append((featureset, tags[index]))
661
+ history.append(tags[index])
662
+
663
+ if verbose:
664
+ print('Training classifier (%d instances)' % len(classifier_corpus))
665
+ self._classifier = classifier_builder(classifier_corpus)
666
+
667
+ def __repr__(self):
668
+ return '<ClassifierBasedTagger: %r>' % self._classifier
669
+
670
+ def feature_detector(self, tokens, index, history):
671
+ """
672
+ Return the feature detector that this tagger uses to generate
673
+ featuresets for its classifier. The feature detector is a
674
+ function with the signature::
675
+
676
+ feature_detector(tokens, index, history) -> featureset
677
+
678
+ See ``classifier()``
679
+ """
680
+ return self._feature_detector(tokens, index, history)
681
+
682
+ def classifier(self):
683
+ """
684
+ Return the classifier that this tagger uses to choose a tag
685
+ for each word in a sentence. The input for this classifier is
686
+ generated using this tagger's feature detector.
687
+ See ``feature_detector()``
688
+ """
689
+ return self._classifier
690
+
691
+
692
+ class ClassifierBasedPOSTagger(ClassifierBasedTagger):
693
+ """
694
+ A classifier based part of speech tagger.
695
+ """
696
+ def feature_detector(self, tokens, index, history):
697
+ word = tokens[index]
698
+ if index == 0:
699
+ prevword = prevprevword = None
700
+ prevtag = prevprevtag = None
701
+ elif index == 1:
702
+ prevword = tokens[index-1].lower()
703
+ prevprevword = None
704
+ prevtag = history[index-1]
705
+ prevprevtag = None
706
+ else:
707
+ prevword = tokens[index-1].lower()
708
+ prevprevword = tokens[index-2].lower()
709
+ prevtag = history[index-1]
710
+ prevprevtag = history[index-2]
711
+
712
+ if re.match('[0-9]+(\.[0-9]*)?|[0-9]*\.[0-9]+$', word):
713
+ shape = 'number'
714
+ elif re.match('\W+$', word):
715
+ shape = 'punct'
716
+ elif re.match('[A-Z][a-z]+$', word):
717
+ shape = 'upcase'
718
+ elif re.match('[a-z]+$', word):
719
+ shape = 'downcase'
720
+ elif re.match('\w+$', word):
721
+ shape = 'mixedcase'
722
+ else:
723
+ shape = 'other'
724
+
725
+ features = {
726
+ 'prevtag': prevtag,
727
+ 'prevprevtag': prevprevtag,
728
+ 'word': word,
729
+ 'word.lower': word.lower(),
730
+ 'suffix3': word.lower()[-3:],
731
+ 'suffix2': word.lower()[-2:],
732
+ 'suffix1': word.lower()[-1:],
733
+ 'prevprevword': prevprevword,
734
+ 'prevword': prevword,
735
+ 'prevtag+word': '%s+%s' % (prevtag, word.lower()),
736
+ 'prevprevtag+word': '%s+%s' % (prevprevtag, word.lower()),
737
+ 'prevword+word': '%s+%s' % (prevword, word.lower()),
738
+ 'shape': shape,
739
+ }
740
+ return features