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,406 +1,431 @@
1
- # -*- coding: utf-8 -*-
2
- # Natural Language Toolkit: Interface to the Stanford Parser
3
- #
4
- # Copyright (C) 2001-2015 NLTK Project
5
- # Author: Steven Xu <xxu@student.unimelb.edu.au>
6
- #
7
- # URL: <http://nltk.org/>
8
- # For license information, see LICENSE.TXT
9
-
10
- from __future__ import unicode_literals
11
-
12
- import tempfile
13
- import os
14
- import re
15
- import warnings
16
- from subprocess import PIPE
17
- from io import StringIO
18
-
19
- from nltk import compat
20
- from nltk.internals import find_jar, find_jar_iter, config_java, java, _java_options, find_jars_within_path
21
-
22
- from nltk.parse.api import ParserI
23
- from nltk.parse.dependencygraph import DependencyGraph
24
- from nltk.tree import Tree
25
-
26
- _stanford_url = 'http://nlp.stanford.edu/software/lex-parser.shtml'
27
-
28
- class GenericStanfordParser(ParserI):
29
- """Interface to the Stanford Parser"""
30
-
31
- _MODEL_JAR_PATTERN = r'stanford-parser-(\d+)(\.(\d+))+-models\.jar'
32
- _JAR = r'stanford-parser\.jar'
33
- _MAIN_CLASS = 'edu.stanford.nlp.parser.lexparser.LexicalizedParser'
34
-
35
- _USE_STDIN = False
36
- _DOUBLE_SPACED_OUTPUT = False
37
-
38
- def __init__(self, path_to_jar=None, path_to_models_jar=None,
39
- model_path='edu/stanford/nlp/models/lexparser/englishPCFG.ser.gz',
40
- encoding='utf8', verbose=False,
41
- java_options='-mx1000m', corenlp_options=''):
42
-
43
- # find the most recent code and model jar
44
- stanford_jar = max(
45
- find_jar_iter(
46
- self._JAR, path_to_jar,
47
- env_vars=('STANFORD_PARSER', 'STANFORD_CORENLP'),
48
- searchpath=(), url=_stanford_url,
49
- verbose=verbose, is_regex=True
50
- ),
51
- key=lambda model_name: re.match(self._JAR, model_name)
52
- )
53
-
54
- model_jar=max(
55
- find_jar_iter(
56
- self._MODEL_JAR_PATTERN, path_to_models_jar,
57
- env_vars=('STANFORD_MODELS', 'STANFORD_CORENLP'),
58
- searchpath=(), url=_stanford_url,
59
- verbose=verbose, is_regex=True
60
- ),
61
- key=lambda model_name: re.match(self._MODEL_JAR_PATTERN, model_name)
62
- )
63
-
64
- #self._classpath = (stanford_jar, model_jar)
65
-
66
- # Adding logging jar files to classpath
67
- stanford_dir = os.path.split(stanford_jar)[0]
68
- self._classpath = tuple([model_jar] + find_jars_within_path(stanford_dir))
69
-
70
- self.model_path = model_path
71
- self._encoding = encoding
72
- self.corenlp_options = corenlp_options
73
- self.java_options = java_options
74
-
75
- def _parse_trees_output(self, output_):
76
- res = []
77
- cur_lines = []
78
- cur_trees = []
79
- blank = False
80
- for line in output_.splitlines(False):
81
- if line == '':
82
- if blank:
83
- res.append(iter(cur_trees))
84
- cur_trees = []
85
- blank = False
86
- elif self._DOUBLE_SPACED_OUTPUT:
87
- cur_trees.append(self._make_tree('\n'.join(cur_lines)))
88
- cur_lines = []
89
- blank = True
90
- else:
91
- res.append(iter([self._make_tree('\n'.join(cur_lines))]))
92
- cur_lines = []
93
- else:
94
- cur_lines.append(line)
95
- blank = False
96
- return iter(res)
97
-
98
- def parse_sents(self, sentences, verbose=False):
99
- """
100
- Use StanfordParser to parse multiple sentences. Takes multiple sentences as a
101
- list where each sentence is a list of words.
102
- Each sentence will be automatically tagged with this StanfordParser instance's
103
- tagger.
104
- If whitespaces exists inside a token, then the token will be treated as
105
- separate tokens.
106
-
107
- :param sentences: Input sentences to parse
108
- :type sentences: list(list(str))
109
- :rtype: iter(iter(Tree))
110
- """
111
- cmd = [
112
- self._MAIN_CLASS,
113
- '-model', self.model_path,
114
- '-sentences', 'newline',
115
- '-outputFormat', self._OUTPUT_FORMAT,
116
- '-tokenized',
117
- '-escaper', 'edu.stanford.nlp.process.PTBEscapingProcessor',
118
- ]
119
- return self._parse_trees_output(self._execute(
120
- cmd, '\n'.join(' '.join(sentence) for sentence in sentences), verbose))
121
-
122
- def raw_parse(self, sentence, verbose=False):
123
- """
124
- Use StanfordParser to parse a sentence. Takes a sentence as a string;
125
- before parsing, it will be automatically tokenized and tagged by
126
- the Stanford Parser.
127
-
128
- :param sentence: Input sentence to parse
129
- :type sentence: str
130
- :rtype: iter(Tree)
131
- """
132
- return next(self.raw_parse_sents([sentence], verbose))
133
-
134
- def raw_parse_sents(self, sentences, verbose=False):
135
- """
136
- Use StanfordParser to parse multiple sentences. Takes multiple sentences as a
137
- list of strings.
138
- Each sentence will be automatically tokenized and tagged by the Stanford Parser.
139
-
140
- :param sentences: Input sentences to parse
141
- :type sentences: list(str)
142
- :rtype: iter(iter(Tree))
143
- """
144
- cmd = [
145
- self._MAIN_CLASS,
146
- '-model', self.model_path,
147
- '-sentences', 'newline',
148
- '-outputFormat', self._OUTPUT_FORMAT,
149
- ]
150
- return self._parse_trees_output(self._execute(cmd, '\n'.join(sentences), verbose))
151
-
152
- def tagged_parse(self, sentence, verbose=False):
153
- """
154
- Use StanfordParser to parse a sentence. Takes a sentence as a list of
155
- (word, tag) tuples; the sentence must have already been tokenized and
156
- tagged.
157
-
158
- :param sentence: Input sentence to parse
159
- :type sentence: list(tuple(str, str))
160
- :rtype: iter(Tree)
161
- """
162
- return next(self.tagged_parse_sents([sentence], verbose))
163
-
164
- def tagged_parse_sents(self, sentences, verbose=False):
165
- """
166
- Use StanfordParser to parse multiple sentences. Takes multiple sentences
167
- where each sentence is a list of (word, tag) tuples.
168
- The sentences must have already been tokenized and tagged.
169
-
170
- :param sentences: Input sentences to parse
171
- :type sentences: list(list(tuple(str, str)))
172
- :rtype: iter(iter(Tree))
173
- """
174
- tag_separator = '/'
175
- cmd = [
176
- self._MAIN_CLASS,
177
- '-model', self.model_path,
178
- '-sentences', 'newline',
179
- '-outputFormat', self._OUTPUT_FORMAT,
180
- '-tokenized',
181
- '-tagSeparator', tag_separator,
182
- '-tokenizerFactory', 'edu.stanford.nlp.process.WhitespaceTokenizer',
183
- '-tokenizerMethod', 'newCoreLabelTokenizerFactory',
184
- ]
185
- # We don't need to escape slashes as "splitting is done on the last instance of the character in the token"
186
- return self._parse_trees_output(self._execute(
187
- cmd, '\n'.join(' '.join(tag_separator.join(tagged) for tagged in sentence) for sentence in sentences), verbose))
188
-
189
- def _execute(self, cmd, input_, verbose=False):
190
- encoding = self._encoding
191
- cmd.extend(['-encoding', encoding])
192
- if self.corenlp_options:
193
- cmd.append(self.corenlp_options)
194
-
195
- default_options = ' '.join(_java_options)
196
-
197
- # Configure java.
198
- config_java(options=self.java_options, verbose=verbose)
199
-
200
- # Windows is incompatible with NamedTemporaryFile() without passing in delete=False.
201
- with tempfile.NamedTemporaryFile(mode='wb', delete=False) as input_file:
202
- # Write the actual sentences to the temporary input file
203
- if isinstance(input_, compat.text_type) and encoding:
204
- input_ = input_.encode(encoding)
205
- input_file.write(input_)
206
- input_file.flush()
207
-
208
- # Run the tagger and get the output.
209
- if self._USE_STDIN:
210
- input_file.seek(0)
211
- stdout, stderr = java(cmd, classpath=self._classpath,
212
- stdin=input_file, stdout=PIPE, stderr=PIPE)
213
- else:
214
- cmd.append(input_file.name)
215
- stdout, stderr = java(cmd, classpath=self._classpath,
216
- stdout=PIPE, stderr=PIPE)
217
-
218
- stdout = stdout.replace(b'\xc2\xa0',b' ')
219
- stdout = stdout.replace(b'\xa0',b' ')
220
- stdout = stdout.decode(encoding)
221
-
222
- os.unlink(input_file.name)
223
-
224
- # Return java configurations to their default values.
225
- config_java(options=default_options, verbose=False)
226
-
227
- return stdout
228
-
229
- class StanfordParser(GenericStanfordParser):
230
- """
231
- >>> parser=StanfordParser(
232
- ... model_path="edu/stanford/nlp/models/lexparser/englishPCFG.ser.gz"
233
- ... )
234
-
235
- >>> list(parser.raw_parse("the quick brown fox jumps over the lazy dog")) # doctest: +NORMALIZE_WHITESPACE
236
- [Tree('ROOT', [Tree('NP', [Tree('NP', [Tree('DT', ['the']), Tree('JJ', ['quick']), Tree('JJ', ['brown']),
237
- Tree('NN', ['fox'])]), Tree('NP', [Tree('NP', [Tree('NNS', ['jumps'])]), Tree('PP', [Tree('IN', ['over']),
238
- Tree('NP', [Tree('DT', ['the']), Tree('JJ', ['lazy']), Tree('NN', ['dog'])])])])])])]
239
-
240
- >>> sum([list(dep_graphs) for dep_graphs in parser.raw_parse_sents((
241
- ... "the quick brown fox jumps over the lazy dog",
242
- ... "the quick grey wolf jumps over the lazy fox"
243
- ... ))], []) # doctest: +NORMALIZE_WHITESPACE
244
- [Tree('ROOT', [Tree('NP', [Tree('NP', [Tree('DT', ['the']), Tree('JJ', ['quick']), Tree('JJ', ['brown']),
245
- Tree('NN', ['fox'])]), Tree('NP', [Tree('NP', [Tree('NNS', ['jumps'])]), Tree('PP', [Tree('IN', ['over']),
246
- Tree('NP', [Tree('DT', ['the']), Tree('JJ', ['lazy']), Tree('NN', ['dog'])])])])])]), Tree('ROOT', [Tree('NP',
247
- [Tree('NP', [Tree('DT', ['the']), Tree('JJ', ['quick']), Tree('JJ', ['grey']), Tree('NN', ['wolf'])]), Tree('NP',
248
- [Tree('NP', [Tree('NNS', ['jumps'])]), Tree('PP', [Tree('IN', ['over']), Tree('NP', [Tree('DT', ['the']),
249
- Tree('JJ', ['lazy']), Tree('NN', ['fox'])])])])])])]
250
-
251
- >>> sum([list(dep_graphs) for dep_graphs in parser.parse_sents((
252
- ... "I 'm a dog".split(),
253
- ... "This is my friends ' cat ( the tabby )".split(),
254
- ... ))], []) # doctest: +NORMALIZE_WHITESPACE
255
- [Tree('ROOT', [Tree('S', [Tree('NP', [Tree('PRP', ['I'])]), Tree('VP', [Tree('VBP', ["'m"]),
256
- Tree('NP', [Tree('DT', ['a']), Tree('NN', ['dog'])])])])]), Tree('ROOT', [Tree('S', [Tree('NP',
257
- [Tree('DT', ['This'])]), Tree('VP', [Tree('VBZ', ['is']), Tree('NP', [Tree('NP', [Tree('NP', [Tree('PRP$', ['my']),
258
- Tree('NNS', ['friends']), Tree('POS', ["'"])]), Tree('NN', ['cat'])]), Tree('PRN', [Tree('-LRB-', ['-LRB-']),
259
- Tree('NP', [Tree('DT', ['the']), Tree('NN', ['tabby'])]), Tree('-RRB-', ['-RRB-'])])])])])])]
260
-
261
- >>> sum([list(dep_graphs) for dep_graphs in parser.tagged_parse_sents((
262
- ... (
263
- ... ("The", "DT"),
264
- ... ("quick", "JJ"),
265
- ... ("brown", "JJ"),
266
- ... ("fox", "NN"),
267
- ... ("jumped", "VBD"),
268
- ... ("over", "IN"),
269
- ... ("the", "DT"),
270
- ... ("lazy", "JJ"),
271
- ... ("dog", "NN"),
272
- ... (".", "."),
273
- ... ),
274
- ... ))],[]) # doctest: +NORMALIZE_WHITESPACE
275
- [Tree('ROOT', [Tree('S', [Tree('NP', [Tree('DT', ['The']), Tree('JJ', ['quick']), Tree('JJ', ['brown']),
276
- Tree('NN', ['fox'])]), Tree('VP', [Tree('VBD', ['jumped']), Tree('PP', [Tree('IN', ['over']), Tree('NP',
277
- [Tree('DT', ['the']), Tree('JJ', ['lazy']), Tree('NN', ['dog'])])])]), Tree('.', ['.'])])])]
278
- """
279
-
280
- _OUTPUT_FORMAT = 'penn'
281
-
282
- def _make_tree(self, result):
283
- return Tree.fromstring(result)
284
-
285
-
286
- class StanfordDependencyParser(GenericStanfordParser):
287
-
288
- """
289
- >>> dep_parser=StanfordDependencyParser(
290
- ... model_path="edu/stanford/nlp/models/lexparser/englishPCFG.ser.gz"
291
- ... )
292
-
293
- >>> [parse.tree() for parse in dep_parser.raw_parse("The quick brown fox jumps over the lazy dog.")] # doctest: +NORMALIZE_WHITESPACE
294
- [Tree('jumps', [Tree('fox', ['The', 'quick', 'brown']), Tree('dog', ['over', 'the', 'lazy'])])]
295
-
296
- >>> [list(parse.triples()) for parse in dep_parser.raw_parse("The quick brown fox jumps over the lazy dog.")] # doctest: +NORMALIZE_WHITESPACE
297
- [[((u'jumps', u'VBZ'), u'nsubj', (u'fox', u'NN')), ((u'fox', u'NN'), u'det', (u'The', u'DT')),
298
- ((u'fox', u'NN'), u'amod', (u'quick', u'JJ')), ((u'fox', u'NN'), u'amod', (u'brown', u'JJ')),
299
- ((u'jumps', u'VBZ'), u'nmod', (u'dog', u'NN')), ((u'dog', u'NN'), u'case', (u'over', u'IN')),
300
- ((u'dog', u'NN'), u'det', (u'the', u'DT')), ((u'dog', u'NN'), u'amod', (u'lazy', u'JJ'))]]
301
-
302
- >>> sum([[parse.tree() for parse in dep_graphs] for dep_graphs in dep_parser.raw_parse_sents((
303
- ... "The quick brown fox jumps over the lazy dog.",
304
- ... "The quick grey wolf jumps over the lazy fox."
305
- ... ))], []) # doctest: +NORMALIZE_WHITESPACE
306
- [Tree('jumps', [Tree('fox', ['The', 'quick', 'brown']), Tree('dog', ['over', 'the', 'lazy'])]),
307
- Tree('jumps', [Tree('wolf', ['The', 'quick', 'grey']), Tree('fox', ['over', 'the', 'lazy'])])]
308
-
309
- >>> sum([[parse.tree() for parse in dep_graphs] for dep_graphs in dep_parser.parse_sents((
310
- ... "I 'm a dog".split(),
311
- ... "This is my friends ' cat ( the tabby )".split(),
312
- ... ))], []) # doctest: +NORMALIZE_WHITESPACE
313
- [Tree('dog', ['I', "'m", 'a']), Tree('cat', ['This', 'is', Tree('friends', ['my', "'"]), Tree('tabby', ['the'])])]
314
-
315
- >>> sum([[list(parse.triples()) for parse in dep_graphs] for dep_graphs in dep_parser.tagged_parse_sents((
316
- ... (
317
- ... ("The", "DT"),
318
- ... ("quick", "JJ"),
319
- ... ("brown", "JJ"),
320
- ... ("fox", "NN"),
321
- ... ("jumped", "VBD"),
322
- ... ("over", "IN"),
323
- ... ("the", "DT"),
324
- ... ("lazy", "JJ"),
325
- ... ("dog", "NN"),
326
- ... (".", "."),
327
- ... ),
328
- ... ))],[]) # doctest: +NORMALIZE_WHITESPACE
329
- [[((u'jumped', u'VBD'), u'nsubj', (u'fox', u'NN')), ((u'fox', u'NN'), u'det', (u'The', u'DT')),
330
- ((u'fox', u'NN'), u'amod', (u'quick', u'JJ')), ((u'fox', u'NN'), u'amod', (u'brown', u'JJ')),
331
- ((u'jumped', u'VBD'), u'nmod', (u'dog', u'NN')), ((u'dog', u'NN'), u'case', (u'over', u'IN')),
332
- ((u'dog', u'NN'), u'det', (u'the', u'DT')), ((u'dog', u'NN'), u'amod', (u'lazy', u'JJ'))]]
333
-
334
- """
335
-
336
- _OUTPUT_FORMAT = 'conll2007'
337
-
338
- def _make_tree(self, result):
339
- return DependencyGraph(result, top_relation_label='root')
340
-
341
-
342
- class StanfordNeuralDependencyParser(GenericStanfordParser):
343
- '''
344
- >>> from nltk.parse.stanford import StanfordNeuralDependencyParser
345
- >>> dep_parser=StanfordNeuralDependencyParser()
346
-
347
- >>> [parse.tree() for parse in dep_parser.raw_parse("The quick brown fox jumps over the lazy dog.")] # doctest: +NORMALIZE_WHITESPACE
348
- [Tree('jumps', [Tree('fox', ['The', 'quick', 'brown']), Tree('dog', ['over', 'the', 'lazy'])])]
349
-
350
- >>> [list(parse.triples()) for parse in dep_parser.raw_parse("The quick brown fox jumps over the lazy dog.")] # doctest: +NORMALIZE_WHITESPACE
351
- [[((u'jumps', u'VBZ'), u'nsubj', (u'fox', u'NN')), ((u'fox', u'NN'), u'det', (u'The', u'DT')),
352
- ((u'fox', u'NN'), u'amod', (u'quick', u'JJ')), ((u'fox', u'NN'), u'amod', (u'brown', u'JJ')),
353
- ((u'jumps', u'VBZ'), u'nmod', (u'dog', u'NN')), ((u'dog', u'NN'), u'case', (u'over', u'IN')),
354
- ((u'dog', u'NN'), u'det', (u'the', u'DT')), ((u'dog', u'NN'), u'amod', (u'lazy', u'JJ'))]]
355
-
356
- >>> sum([[parse.tree() for parse in dep_graphs] for dep_graphs in dep_parser.raw_parse_sents((
357
- ... "The quick brown fox jumps over the lazy dog.",
358
- ... "The quick grey wolf jumps over the lazy fox."
359
- ... ))], []) # doctest: +NORMALIZE_WHITESPACE
360
- [Tree('jumps', [Tree('fox', ['The', 'quick', 'brown']), Tree('dog', ['over', 'the', 'lazy'])]),
361
- Tree('jumps', [Tree('wolf', ['The', 'quick', 'grey']), Tree('fox', ['over', 'the', 'lazy'])])]
362
-
363
- >>> sum([[parse.tree() for parse in dep_graphs] for dep_graphs in dep_parser.parse_sents((
364
- ... "I 'm a dog".split(),
365
- ... "This is my friends ' cat ( the tabby )".split(),
366
- ... ))], []) # doctest: +NORMALIZE_WHITESPACE
367
- [Tree('dog', ['I', "'m", 'a']), Tree('cat', ['This', 'is', Tree('friends', ['my', "'"]), Tree('tabby', ['the'])])]
368
- '''
369
-
370
- _OUTPUT_FORMAT = 'conll'
371
- _MAIN_CLASS = 'edu.stanford.nlp.pipeline.StanfordCoreNLP'
372
- _JAR = r'stanford-corenlp-(\d+)(\.(\d+))+\.jar'
373
- _MODEL_JAR_PATTERN = r'stanford-corenlp-(\d+)(\.(\d+))+-models\.jar'
374
- _USE_STDIN = True
375
- _DOUBLE_SPACED_OUTPUT = True
376
-
377
- def __init__(self, *args, **kwargs):
378
- super(StanfordNeuralDependencyParser, self).__init__(*args, **kwargs)
379
- self.corenlp_options += '-annotators tokenize,ssplit,pos,depparse'
380
-
381
- def tagged_parse_sents(self, sentences, verbose=False):
382
- '''
383
- Currently unimplemented because the neural dependency parser (and
384
- the StanfordCoreNLP pipeline class) doesn't support passing in pre-
385
- tagged tokens.
386
- '''
387
- raise NotImplementedError(
388
- 'tagged_parse[_sents] is not supported by '
389
- 'StanfordNeuralDependencyParser; use '
390
- 'parse[_sents] or raw_parse[_sents] instead.'
391
- )
392
-
393
- def _make_tree(self, result):
394
- return DependencyGraph(result, top_relation_label='ROOT')
395
-
396
-
397
- def setup_module(module):
398
- from nose import SkipTest
399
-
400
- try:
401
- StanfordParser(
402
- model_path='edu/stanford/nlp/models/lexparser/englishPCFG.ser.gz'
403
- )
404
- StanfordNeuralDependencyParser()
405
- except LookupError:
406
- raise SkipTest('doctests from nltk.parse.stanford are skipped because one of the stanford parser or CoreNLP jars doesn\'t exist')
1
+ # -*- coding: utf-8 -*-
2
+ # Natural Language Toolkit: Interface to the Stanford Parser
3
+ #
4
+ # Copyright (C) 2001-2018 NLTK Project
5
+ # Author: Steven Xu <xxu@student.unimelb.edu.au>
6
+ #
7
+ # URL: <http://nltk.org/>
8
+ # For license information, see LICENSE.TXT
9
+
10
+ from __future__ import unicode_literals
11
+
12
+ import tempfile
13
+ import os
14
+ import re
15
+ import warnings
16
+ from subprocess import PIPE
17
+ from io import StringIO
18
+
19
+ from six import text_type
20
+
21
+ from nltk.internals import find_jar, find_jar_iter, config_java, java, _java_options, find_jars_within_path
22
+
23
+ from nltk.parse.api import ParserI
24
+ from nltk.parse.dependencygraph import DependencyGraph
25
+ from nltk.tree import Tree
26
+
27
+ _stanford_url = 'https://nlp.stanford.edu/software/lex-parser.shtml'
28
+
29
+
30
+ class GenericStanfordParser(ParserI):
31
+ """Interface to the Stanford Parser"""
32
+
33
+ _MODEL_JAR_PATTERN = r'stanford-parser-(\d+)(\.(\d+))+-models\.jar'
34
+ _JAR = r'stanford-parser\.jar'
35
+ _MAIN_CLASS = 'edu.stanford.nlp.parser.lexparser.LexicalizedParser'
36
+
37
+ _USE_STDIN = False
38
+ _DOUBLE_SPACED_OUTPUT = False
39
+
40
+ def __init__(self, path_to_jar=None, path_to_models_jar=None,
41
+ model_path='edu/stanford/nlp/models/lexparser/englishPCFG.ser.gz',
42
+ encoding='utf8', verbose=False,
43
+ java_options='-mx1000m', corenlp_options=''):
44
+
45
+ # find the most recent code and model jar
46
+ stanford_jar = max(
47
+ find_jar_iter(
48
+ self._JAR, path_to_jar,
49
+ env_vars=('STANFORD_PARSER', 'STANFORD_CORENLP'),
50
+ searchpath=(), url=_stanford_url,
51
+ verbose=verbose, is_regex=True
52
+ ),
53
+ key=lambda model_path: os.path.dirname(model_path)
54
+ )
55
+
56
+ model_jar = max(
57
+ find_jar_iter(
58
+ self._MODEL_JAR_PATTERN, path_to_models_jar,
59
+ env_vars=('STANFORD_MODELS', 'STANFORD_CORENLP'),
60
+ searchpath=(), url=_stanford_url,
61
+ verbose=verbose, is_regex=True
62
+ ),
63
+ key=lambda model_path: os.path.dirname(model_path)
64
+ )
65
+
66
+ #self._classpath = (stanford_jar, model_jar)
67
+
68
+ # Adding logging jar files to classpath
69
+ stanford_dir = os.path.split(stanford_jar)[0]
70
+ self._classpath = tuple([model_jar] + find_jars_within_path(stanford_dir))
71
+
72
+ self.model_path = model_path
73
+ self._encoding = encoding
74
+ self.corenlp_options = corenlp_options
75
+ self.java_options = java_options
76
+
77
+ def _parse_trees_output(self, output_):
78
+ res = []
79
+ cur_lines = []
80
+ cur_trees = []
81
+ blank = False
82
+ for line in output_.splitlines(False):
83
+ if line == '':
84
+ if blank:
85
+ res.append(iter(cur_trees))
86
+ cur_trees = []
87
+ blank = False
88
+ elif self._DOUBLE_SPACED_OUTPUT:
89
+ cur_trees.append(self._make_tree('\n'.join(cur_lines)))
90
+ cur_lines = []
91
+ blank = True
92
+ else:
93
+ res.append(iter([self._make_tree('\n'.join(cur_lines))]))
94
+ cur_lines = []
95
+ else:
96
+ cur_lines.append(line)
97
+ blank = False
98
+ return iter(res)
99
+
100
+ def parse_sents(self, sentences, verbose=False):
101
+ """
102
+ Use StanfordParser to parse multiple sentences. Takes multiple sentences as a
103
+ list where each sentence is a list of words.
104
+ Each sentence will be automatically tagged with this StanfordParser instance's
105
+ tagger.
106
+ If whitespaces exists inside a token, then the token will be treated as
107
+ separate tokens.
108
+
109
+ :param sentences: Input sentences to parse
110
+ :type sentences: list(list(str))
111
+ :rtype: iter(iter(Tree))
112
+ """
113
+ cmd = [
114
+ self._MAIN_CLASS,
115
+ '-model', self.model_path,
116
+ '-sentences', 'newline',
117
+ '-outputFormat', self._OUTPUT_FORMAT,
118
+ '-tokenized',
119
+ '-escaper', 'edu.stanford.nlp.process.PTBEscapingProcessor',
120
+ ]
121
+ return self._parse_trees_output(self._execute(
122
+ cmd, '\n'.join(' '.join(sentence) for sentence in sentences), verbose))
123
+
124
+ def raw_parse(self, sentence, verbose=False):
125
+ """
126
+ Use StanfordParser to parse a sentence. Takes a sentence as a string;
127
+ before parsing, it will be automatically tokenized and tagged by
128
+ the Stanford Parser.
129
+
130
+ :param sentence: Input sentence to parse
131
+ :type sentence: str
132
+ :rtype: iter(Tree)
133
+ """
134
+ return next(self.raw_parse_sents([sentence], verbose))
135
+
136
+ def raw_parse_sents(self, sentences, verbose=False):
137
+ """
138
+ Use StanfordParser to parse multiple sentences. Takes multiple sentences as a
139
+ list of strings.
140
+ Each sentence will be automatically tokenized and tagged by the Stanford Parser.
141
+
142
+ :param sentences: Input sentences to parse
143
+ :type sentences: list(str)
144
+ :rtype: iter(iter(Tree))
145
+ """
146
+ cmd = [
147
+ self._MAIN_CLASS,
148
+ '-model', self.model_path,
149
+ '-sentences', 'newline',
150
+ '-outputFormat', self._OUTPUT_FORMAT,
151
+ ]
152
+ return self._parse_trees_output(self._execute(cmd, '\n'.join(sentences), verbose))
153
+
154
+ def tagged_parse(self, sentence, verbose=False):
155
+ """
156
+ Use StanfordParser to parse a sentence. Takes a sentence as a list of
157
+ (word, tag) tuples; the sentence must have already been tokenized and
158
+ tagged.
159
+
160
+ :param sentence: Input sentence to parse
161
+ :type sentence: list(tuple(str, str))
162
+ :rtype: iter(Tree)
163
+ """
164
+ return next(self.tagged_parse_sents([sentence], verbose))
165
+
166
+ def tagged_parse_sents(self, sentences, verbose=False):
167
+ """
168
+ Use StanfordParser to parse multiple sentences. Takes multiple sentences
169
+ where each sentence is a list of (word, tag) tuples.
170
+ The sentences must have already been tokenized and tagged.
171
+
172
+ :param sentences: Input sentences to parse
173
+ :type sentences: list(list(tuple(str, str)))
174
+ :rtype: iter(iter(Tree))
175
+ """
176
+ tag_separator = '/'
177
+ cmd = [
178
+ self._MAIN_CLASS,
179
+ '-model', self.model_path,
180
+ '-sentences', 'newline',
181
+ '-outputFormat', self._OUTPUT_FORMAT,
182
+ '-tokenized',
183
+ '-tagSeparator', tag_separator,
184
+ '-tokenizerFactory', 'edu.stanford.nlp.process.WhitespaceTokenizer',
185
+ '-tokenizerMethod', 'newCoreLabelTokenizerFactory',
186
+ ]
187
+ # We don't need to escape slashes as "splitting is done on the last instance of the character in the token"
188
+ return self._parse_trees_output(self._execute(
189
+ cmd, '\n'.join(' '.join(tag_separator.join(tagged) for tagged in sentence) for sentence in sentences), verbose))
190
+
191
+ def _execute(self, cmd, input_, verbose=False):
192
+ encoding = self._encoding
193
+ cmd.extend(['-encoding', encoding])
194
+ if self.corenlp_options:
195
+ cmd.append(self.corenlp_options)
196
+
197
+ default_options = ' '.join(_java_options)
198
+
199
+ # Configure java.
200
+ config_java(options=self.java_options, verbose=verbose)
201
+
202
+ # Windows is incompatible with NamedTemporaryFile() without passing in delete=False.
203
+ with tempfile.NamedTemporaryFile(mode='wb', delete=False) as input_file:
204
+ # Write the actual sentences to the temporary input file
205
+ if isinstance(input_, text_type) and encoding:
206
+ input_ = input_.encode(encoding)
207
+ input_file.write(input_)
208
+ input_file.flush()
209
+
210
+ # Run the tagger and get the output.
211
+ if self._USE_STDIN:
212
+ input_file.seek(0)
213
+ stdout, stderr = java(cmd, classpath=self._classpath,
214
+ stdin=input_file, stdout=PIPE, stderr=PIPE)
215
+ else:
216
+ cmd.append(input_file.name)
217
+ stdout, stderr = java(cmd, classpath=self._classpath,
218
+ stdout=PIPE, stderr=PIPE)
219
+
220
+ stdout = stdout.replace(b'\xc2\xa0', b' ')
221
+ stdout = stdout.replace(b'\x00\xa0', b' ')
222
+ stdout = stdout.decode(encoding)
223
+
224
+ os.unlink(input_file.name)
225
+
226
+ # Return java configurations to their default values.
227
+ config_java(options=default_options, verbose=False)
228
+
229
+ return stdout
230
+
231
+
232
+ class StanfordParser(GenericStanfordParser):
233
+ """
234
+ >>> parser=StanfordParser(
235
+ ... model_path="edu/stanford/nlp/models/lexparser/englishPCFG.ser.gz"
236
+ ... )
237
+
238
+ >>> list(parser.raw_parse("the quick brown fox jumps over the lazy dog")) # doctest: +NORMALIZE_WHITESPACE
239
+ [Tree('ROOT', [Tree('NP', [Tree('NP', [Tree('DT', ['the']), Tree('JJ', ['quick']), Tree('JJ', ['brown']),
240
+ Tree('NN', ['fox'])]), Tree('NP', [Tree('NP', [Tree('NNS', ['jumps'])]), Tree('PP', [Tree('IN', ['over']),
241
+ Tree('NP', [Tree('DT', ['the']), Tree('JJ', ['lazy']), Tree('NN', ['dog'])])])])])])]
242
+
243
+ >>> sum([list(dep_graphs) for dep_graphs in parser.raw_parse_sents((
244
+ ... "the quick brown fox jumps over the lazy dog",
245
+ ... "the quick grey wolf jumps over the lazy fox"
246
+ ... ))], []) # doctest: +NORMALIZE_WHITESPACE
247
+ [Tree('ROOT', [Tree('NP', [Tree('NP', [Tree('DT', ['the']), Tree('JJ', ['quick']), Tree('JJ', ['brown']),
248
+ Tree('NN', ['fox'])]), Tree('NP', [Tree('NP', [Tree('NNS', ['jumps'])]), Tree('PP', [Tree('IN', ['over']),
249
+ Tree('NP', [Tree('DT', ['the']), Tree('JJ', ['lazy']), Tree('NN', ['dog'])])])])])]), Tree('ROOT', [Tree('NP',
250
+ [Tree('NP', [Tree('DT', ['the']), Tree('JJ', ['quick']), Tree('JJ', ['grey']), Tree('NN', ['wolf'])]), Tree('NP',
251
+ [Tree('NP', [Tree('NNS', ['jumps'])]), Tree('PP', [Tree('IN', ['over']), Tree('NP', [Tree('DT', ['the']),
252
+ Tree('JJ', ['lazy']), Tree('NN', ['fox'])])])])])])]
253
+
254
+ >>> sum([list(dep_graphs) for dep_graphs in parser.parse_sents((
255
+ ... "I 'm a dog".split(),
256
+ ... "This is my friends ' cat ( the tabby )".split(),
257
+ ... ))], []) # doctest: +NORMALIZE_WHITESPACE
258
+ [Tree('ROOT', [Tree('S', [Tree('NP', [Tree('PRP', ['I'])]), Tree('VP', [Tree('VBP', ["'m"]),
259
+ Tree('NP', [Tree('DT', ['a']), Tree('NN', ['dog'])])])])]), Tree('ROOT', [Tree('S', [Tree('NP',
260
+ [Tree('DT', ['This'])]), Tree('VP', [Tree('VBZ', ['is']), Tree('NP', [Tree('NP', [Tree('NP', [Tree('PRP$', ['my']),
261
+ Tree('NNS', ['friends']), Tree('POS', ["'"])]), Tree('NN', ['cat'])]), Tree('PRN', [Tree('-LRB-', [Tree('', []),
262
+ Tree('NP', [Tree('DT', ['the']), Tree('NN', ['tabby'])]), Tree('-RRB-', [])])])])])])])]
263
+
264
+ >>> sum([list(dep_graphs) for dep_graphs in parser.tagged_parse_sents((
265
+ ... (
266
+ ... ("The", "DT"),
267
+ ... ("quick", "JJ"),
268
+ ... ("brown", "JJ"),
269
+ ... ("fox", "NN"),
270
+ ... ("jumped", "VBD"),
271
+ ... ("over", "IN"),
272
+ ... ("the", "DT"),
273
+ ... ("lazy", "JJ"),
274
+ ... ("dog", "NN"),
275
+ ... (".", "."),
276
+ ... ),
277
+ ... ))],[]) # doctest: +NORMALIZE_WHITESPACE
278
+ [Tree('ROOT', [Tree('S', [Tree('NP', [Tree('DT', ['The']), Tree('JJ', ['quick']), Tree('JJ', ['brown']),
279
+ Tree('NN', ['fox'])]), Tree('VP', [Tree('VBD', ['jumped']), Tree('PP', [Tree('IN', ['over']), Tree('NP',
280
+ [Tree('DT', ['the']), Tree('JJ', ['lazy']), Tree('NN', ['dog'])])])]), Tree('.', ['.'])])])]
281
+ """
282
+
283
+ _OUTPUT_FORMAT = 'penn'
284
+
285
+ def __init__(self, *args, **kwargs):
286
+ warnings.warn("The StanfordParser will be deprecated\n"
287
+ "Please use \033[91mnltk.parse.corenlp.StanforCoreNLPParser\033[0m instead.",
288
+ DeprecationWarning, stacklevel=2)
289
+
290
+ super(StanfordParser, self).__init__(*args, **kwargs)
291
+
292
+ def _make_tree(self, result):
293
+ return Tree.fromstring(result)
294
+
295
+
296
+ class StanfordDependencyParser(GenericStanfordParser):
297
+
298
+ """
299
+ >>> dep_parser=StanfordDependencyParser(
300
+ ... model_path="edu/stanford/nlp/models/lexparser/englishPCFG.ser.gz"
301
+ ... )
302
+
303
+ >>> [parse.tree() for parse in dep_parser.raw_parse("The quick brown fox jumps over the lazy dog.")] # doctest: +NORMALIZE_WHITESPACE
304
+ [Tree('jumps', [Tree('fox', ['The', 'quick', 'brown']), Tree('dog', ['over', 'the', 'lazy'])])]
305
+
306
+ >>> [list(parse.triples()) for parse in dep_parser.raw_parse("The quick brown fox jumps over the lazy dog.")] # doctest: +NORMALIZE_WHITESPACE
307
+ [[((u'jumps', u'VBZ'), u'nsubj', (u'fox', u'NN')), ((u'fox', u'NN'), u'det', (u'The', u'DT')),
308
+ ((u'fox', u'NN'), u'amod', (u'quick', u'JJ')), ((u'fox', u'NN'), u'amod', (u'brown', u'JJ')),
309
+ ((u'jumps', u'VBZ'), u'nmod', (u'dog', u'NN')), ((u'dog', u'NN'), u'case', (u'over', u'IN')),
310
+ ((u'dog', u'NN'), u'det', (u'the', u'DT')), ((u'dog', u'NN'), u'amod', (u'lazy', u'JJ'))]]
311
+
312
+ >>> sum([[parse.tree() for parse in dep_graphs] for dep_graphs in dep_parser.raw_parse_sents((
313
+ ... "The quick brown fox jumps over the lazy dog.",
314
+ ... "The quick grey wolf jumps over the lazy fox."
315
+ ... ))], []) # doctest: +NORMALIZE_WHITESPACE
316
+ [Tree('jumps', [Tree('fox', ['The', 'quick', 'brown']), Tree('dog', ['over', 'the', 'lazy'])]),
317
+ Tree('jumps', [Tree('wolf', ['The', 'quick', 'grey']), Tree('fox', ['over', 'the', 'lazy'])])]
318
+
319
+ >>> sum([[parse.tree() for parse in dep_graphs] for dep_graphs in dep_parser.parse_sents((
320
+ ... "I 'm a dog".split(),
321
+ ... "This is my friends ' cat ( the tabby )".split(),
322
+ ... ))], []) # doctest: +NORMALIZE_WHITESPACE
323
+ [Tree('dog', ['I', "'m", 'a']), Tree('cat', ['This', 'is', Tree('friends', ['my', "'"]), Tree('tabby', ['the'])])]
324
+
325
+ >>> sum([[list(parse.triples()) for parse in dep_graphs] for dep_graphs in dep_parser.tagged_parse_sents((
326
+ ... (
327
+ ... ("The", "DT"),
328
+ ... ("quick", "JJ"),
329
+ ... ("brown", "JJ"),
330
+ ... ("fox", "NN"),
331
+ ... ("jumped", "VBD"),
332
+ ... ("over", "IN"),
333
+ ... ("the", "DT"),
334
+ ... ("lazy", "JJ"),
335
+ ... ("dog", "NN"),
336
+ ... (".", "."),
337
+ ... ),
338
+ ... ))],[]) # doctest: +NORMALIZE_WHITESPACE
339
+ [[((u'jumped', u'VBD'), u'nsubj', (u'fox', u'NN')), ((u'fox', u'NN'), u'det', (u'The', u'DT')),
340
+ ((u'fox', u'NN'), u'amod', (u'quick', u'JJ')), ((u'fox', u'NN'), u'amod', (u'brown', u'JJ')),
341
+ ((u'jumped', u'VBD'), u'nmod', (u'dog', u'NN')), ((u'dog', u'NN'), u'case', (u'over', u'IN')),
342
+ ((u'dog', u'NN'), u'det', (u'the', u'DT')), ((u'dog', u'NN'), u'amod', (u'lazy', u'JJ'))]]
343
+
344
+ """
345
+
346
+ _OUTPUT_FORMAT = 'conll2007'
347
+
348
+ def __init__(self, *args, **kwargs):
349
+ warnings.warn("The StanfordDependencyParser will be deprecated\n"
350
+ "Please use \033[91mnltk.parse.corenlp.StanforCoreNLPDependencyParser\033[0m instead.",
351
+ DeprecationWarning, stacklevel=2)
352
+
353
+ super(StanfordDependencyParser, self).__init__(*args, **kwargs)
354
+
355
+ def _make_tree(self, result):
356
+ return DependencyGraph(result, top_relation_label='root')
357
+
358
+
359
+ class StanfordNeuralDependencyParser(GenericStanfordParser):
360
+ '''
361
+ >>> from nltk.parse.stanford import StanfordNeuralDependencyParser
362
+ >>> dep_parser=StanfordNeuralDependencyParser(java_options='-mx4g')
363
+
364
+ >>> [parse.tree() for parse in dep_parser.raw_parse("The quick brown fox jumps over the lazy dog.")] # doctest: +NORMALIZE_WHITESPACE
365
+ [Tree('jumps', [Tree('fox', ['The', 'quick', 'brown']), Tree('dog', ['over', 'the', 'lazy']), '.'])]
366
+
367
+ >>> [list(parse.triples()) for parse in dep_parser.raw_parse("The quick brown fox jumps over the lazy dog.")] # doctest: +NORMALIZE_WHITESPACE
368
+ [[((u'jumps', u'VBZ'), u'nsubj', (u'fox', u'NN')), ((u'fox', u'NN'), u'det',
369
+ (u'The', u'DT')), ((u'fox', u'NN'), u'amod', (u'quick', u'JJ')), ((u'fox', u'NN'),
370
+ u'amod', (u'brown', u'JJ')), ((u'jumps', u'VBZ'), u'nmod', (u'dog', u'NN')),
371
+ ((u'dog', u'NN'), u'case', (u'over', u'IN')), ((u'dog', u'NN'), u'det',
372
+ (u'the', u'DT')), ((u'dog', u'NN'), u'amod', (u'lazy', u'JJ')), ((u'jumps', u'VBZ'),
373
+ u'punct', (u'.', u'.'))]]
374
+
375
+ >>> sum([[parse.tree() for parse in dep_graphs] for dep_graphs in dep_parser.raw_parse_sents((
376
+ ... "The quick brown fox jumps over the lazy dog.",
377
+ ... "The quick grey wolf jumps over the lazy fox."
378
+ ... ))], []) # doctest: +NORMALIZE_WHITESPACE
379
+ [Tree('jumps', [Tree('fox', ['The', 'quick', 'brown']), Tree('dog', ['over',
380
+ 'the', 'lazy']), '.']), Tree('jumps', [Tree('wolf', ['The', 'quick', 'grey']),
381
+ Tree('fox', ['over', 'the', 'lazy']), '.'])]
382
+
383
+ >>> sum([[parse.tree() for parse in dep_graphs] for dep_graphs in dep_parser.parse_sents((
384
+ ... "I 'm a dog".split(),
385
+ ... "This is my friends ' cat ( the tabby )".split(),
386
+ ... ))], []) # doctest: +NORMALIZE_WHITESPACE
387
+ [Tree('dog', ['I', "'m", 'a']), Tree('cat', ['This', 'is', Tree('friends',
388
+ ['my', "'"]), Tree('tabby', ['-LRB-', 'the', '-RRB-'])])]
389
+ '''
390
+
391
+ _OUTPUT_FORMAT = 'conll'
392
+ _MAIN_CLASS = 'edu.stanford.nlp.pipeline.StanfordCoreNLP'
393
+ _JAR = r'stanford-corenlp-(\d+)(\.(\d+))+\.jar'
394
+ _MODEL_JAR_PATTERN = r'stanford-corenlp-(\d+)(\.(\d+))+-models\.jar'
395
+ _USE_STDIN = True
396
+ _DOUBLE_SPACED_OUTPUT = True
397
+
398
+ def __init__(self, *args, **kwargs):
399
+ warnings.warn("The StanfordNeuralDependencyParser will be deprecated\n"
400
+ "Please use \033[91mnltk.parse.corenlp.StanforCoreNLPNeuralDependencyParser\033[0m instead.",
401
+ DeprecationWarning, stacklevel=2)
402
+
403
+ super(StanfordNeuralDependencyParser, self).__init__(*args, **kwargs)
404
+ self.corenlp_options += '-annotators tokenize,ssplit,pos,depparse'
405
+
406
+ def tagged_parse_sents(self, sentences, verbose=False):
407
+ '''
408
+ Currently unimplemented because the neural dependency parser (and
409
+ the StanfordCoreNLP pipeline class) doesn't support passing in pre-
410
+ tagged tokens.
411
+ '''
412
+ raise NotImplementedError(
413
+ 'tagged_parse[_sents] is not supported by '
414
+ 'StanfordNeuralDependencyParser; use '
415
+ 'parse[_sents] or raw_parse[_sents] instead.'
416
+ )
417
+
418
+ def _make_tree(self, result):
419
+ return DependencyGraph(result, top_relation_label='ROOT')
420
+
421
+
422
+ def setup_module(module):
423
+ from nose import SkipTest
424
+
425
+ try:
426
+ StanfordParser(
427
+ model_path='edu/stanford/nlp/models/lexparser/englishPCFG.ser.gz'
428
+ )
429
+ StanfordNeuralDependencyParser()
430
+ except LookupError:
431
+ raise SkipTest('doctests from nltk.parse.stanford are skipped because one of the stanford parser or CoreNLP jars doesn\'t exist')