+ hI^RIt^RIt^RIt^RIHt^RIHtHtHtH t H t ^RI H t ^RI Ht^RIHtRt!RR ] 4t!R R ]4t!R R ]4t!RR]4tR#)N)PIPE) _java_options config_java find_jar_iterfind_jars_within_pathjava)ParserIDependencyGraph)Treez2https://nlp.stanford.edu/software/lex-parser.shtmlca]tRt^toRtRtRtRtRtRt RRlt Rt RR lt RR lt RR ltRR ltRR ltRRltRtVtR#)GenericStanfordParserz Interface to the Stanford Parserz+stanford-parser-(\d+)(\.(\d+))+-models\.jarzstanford-parser\.jarz3edu.stanford.nlp.parser.lexparser.LexicalizedParserFNc t\\VPVRR\VRR7RR7p\\VPVR R\VRR7RR7p \ P PV4^,p \V .\V 4,4Vn W0n W@n Wpn W`nR#) STANFORD_PARSERT)env_vars searchpathurlverboseis_regexc@\PPV4#Nospathdirname model_paths&5/usr/lib/python3/dist-packages/nltk/parse/stanford.py0GenericStanfordParser.__init__..;277??:#>)keyc@\PPV4#rrrs&rrr Hr!r"N)rSTANFORD_CORENLP)STANFORD_MODELSr%)maxr_JAR _stanford_url_MODEL_JAR_PATTERNrrsplittupler _classpathr _encodingcorenlp_options java_options) self path_to_jarpath_to_models_jarrencodingrr1r0 stanford_jar model_jar stanford_dirs &&&&&&&& r__init__GenericStanfordParser.__init__&s  @! ?   ''"@! ?  ww}}\215  .CL.Q QR$!.(r"c .p.p.pRpVPR4FpVR8XdV'd!VP\V44.pRpK2VP'd6VPVP RP V444.pRpKyVP\VP RP V44.44.pKVPV4RpK \V4#)F T) splitlinesappenditer_DOUBLE_SPACED_OUTPUT _make_treejoin)r2output_res cur_lines cur_treesblanklines&& r_parse_trees_output)GenericStanfordParser._parse_trees_outputVs  &&u-DrzJJtI/ "I!E///$$T__TYYy5I%JK "I EJJtT__TYYy5I%J$KLM "I  &. Cyr"c  VPRVPRRRVPRRR. pVPVP VRP R V44V44#) a Use StanfordParser to parse multiple sentences. Takes multiple sentences as a list where each sentence is a list of words. Each sentence will be automatically tagged with this StanfordParser instance's tagger. If whitespaces exists inside a token, then the token will be treated as separate tokens. :param sentences: Input sentences to parse :type sentences: list(list(str)) :rtype: iter(iter(Tree)) -model -sentencesnewline -outputFormat -tokenizedz-escaperz-edu.stanford.nlp.process.PTBEscapingProcessorr=c3D"TFpRPV4xK R#5i) NrC).0sentences& r 4GenericStanfordParser.parse_sents..sL)hsxx11)s  _MAIN_CLASSr_OUTPUT_FORMATrJ_executerCr2 sentencesrcmds&&& r parse_sents!GenericStanfordParser.parse_sentsmsp     OO         ;  '' MMTYYL)LLg   r"c :\VPV.V44#)z Use StanfordParser to parse a sentence. Takes a sentence as a string; before parsing, it will be automatically tokenized and tagged by the Stanford Parser. :param sentence: Input sentence to parse :type sentence: str :rtype: iter(Tree) )nextraw_parse_sentsr2rVrs&&&r raw_parseGenericStanfordParser.raw_parsesD(((W=>>r"c VPRVPRRRVP.pVPVP VRP V4V44#)a Use StanfordParser to parse multiple sentences. Takes multiple sentences as a list of strings. Each sentence will be automatically tokenized and tagged by the Stanford Parser. :param sentences: Input sentences to parse :type sentences: list(str) :rtype: iter(iter(Tree)) rMrNrOrPr=rYr]s&&& rrd%GenericStanfordParser.raw_parse_sentss^     OO       '' MM#tyy3W =  r"c :\VPV.V44#)z Use StanfordParser to parse a sentence. Takes a sentence as a list of (word, tag) tuples; the sentence must have already been tokenized and tagged. :param sentence: Input sentence to parse :type sentence: list(tuple(str, str)) :rtype: iter(Tree) )rctagged_parse_sentsres&&&r tagged_parse"GenericStanfordParser.tagged_parsesD++XJ@AAr"c aRoVPRVPRRRVPRRSRR R R .pVPVP VR P V3R lV44V44#)a, Use StanfordParser to parse multiple sentences. Takes multiple sentences where each sentence is a list of (word, tag) tuples. The sentences must have already been tokenized and tagged. :param sentences: Input sentences to parse :type sentences: list(list(tuple(str, str))) :rtype: iter(iter(Tree)) /rMrNrOrPrQz -tagSeparatorz-tokenizerFactoryz,edu.stanford.nlp.process.WhitespaceTokenizerz-tokenizerMethodnewCoreLabelTokenizerFactoryr=c3Z<"TF pRPV3RlV44xK" R#5i)rSc3F<"TFpSPV4xK R#5irrT)rUtagged tag_separators& rrWEGenericStanfordParser.tagged_parse_sents...sOhF]//77hs!NrT)rUrVrts& rrW;GenericStanfordParser.tagged_parse_sents..s*$-HHOhOOO$-s(+rY)r2r^rr_rts&&& @rrk(GenericStanfordParser.tagged_parse_sentss     OO           :  * "'' MM $-    r"c VPpVPRV.4VP'd*VPVPP44RP \ 4p\ VPVR7\P!RRR7;_uu_4p\V\4'dV'dVPV4pVPV4VP4VP'd7VP!^4\#VVP$V\&\&R7wrxM=VP)VP*4\#WP$\&\&R7wrxVP-RR 4pVP-R R 4pVP/V4pR R R 4\0P2!XP*4\ VRR7X# +'giL?;i) z -encodingrS)optionsrwbF)modedelete) classpathstdinstdoutstderr)r}rrs  sN)r/extendr0r,rCrrr1tempfileNamedTemporaryFile isinstancestrencodewriteflush _USE_STDINseekrr.rr?namereplacedecoderunlink) r2r_input_rr5default_options input_filerrs &&&& rr\GenericStanfordParser._executesv>> K*+     JJt++113 4((=1 D--w? ( (d5 A AZ&#&&8x0   V $    "!%"oo$ " :??+!%??4"^^K6F^^K6F]]8,F3B6 *//" OU; AB As'G)AG) B(G)) G9 )r.r/r0r1r)NNz4edu/stanford/nlp/models/lexparser/englishPCFG.ser.gzutf8Fz-mx4gr<F)__name__ __module__ __qualname____firstlineno____doc__r+r)rZrrAr9rJr`rfrdrlrkr\__static_attributes____classdictcell__) __classdict__s@rrrsS*G "DGKJ!.)`. > ? . B% N,,r"rc@aa]tRtRtoRtRtV3RltRtRtVt V;t #)StanfordParseria >>> parser=StanfordParser( ... model_path="edu/stanford/nlp/models/lexparser/englishPCFG.ser.gz" ... ) # doctest: +SKIP >>> list(parser.raw_parse("the quick brown fox jumps over the lazy dog")) # doctest: +NORMALIZE_WHITESPACE +SKIP [Tree('ROOT', [Tree('NP', [Tree('NP', [Tree('DT', ['the']), Tree('JJ', ['quick']), Tree('JJ', ['brown']), Tree('NN', ['fox'])]), Tree('NP', [Tree('NP', [Tree('NNS', ['jumps'])]), Tree('PP', [Tree('IN', ['over']), Tree('NP', [Tree('DT', ['the']), Tree('JJ', ['lazy']), Tree('NN', ['dog'])])])])])])] >>> sum([list(dep_graphs) for dep_graphs in parser.raw_parse_sents(( ... "the quick brown fox jumps over the lazy dog", ... "the quick grey wolf jumps over the lazy fox" ... ))], []) # doctest: +NORMALIZE_WHITESPACE +SKIP [Tree('ROOT', [Tree('NP', [Tree('NP', [Tree('DT', ['the']), Tree('JJ', ['quick']), Tree('JJ', ['brown']), Tree('NN', ['fox'])]), Tree('NP', [Tree('NP', [Tree('NNS', ['jumps'])]), Tree('PP', [Tree('IN', ['over']), Tree('NP', [Tree('DT', ['the']), Tree('JJ', ['lazy']), Tree('NN', ['dog'])])])])])]), Tree('ROOT', [Tree('NP', [Tree('NP', [Tree('DT', ['the']), Tree('JJ', ['quick']), Tree('JJ', ['grey']), Tree('NN', ['wolf'])]), Tree('NP', [Tree('NP', [Tree('NNS', ['jumps'])]), Tree('PP', [Tree('IN', ['over']), Tree('NP', [Tree('DT', ['the']), Tree('JJ', ['lazy']), Tree('NN', ['fox'])])])])])])] >>> sum([list(dep_graphs) for dep_graphs in parser.parse_sents(( ... "I 'm a dog".split(), ... "This is my friends ' cat ( the tabby )".split(), ... ))], []) # doctest: +NORMALIZE_WHITESPACE +SKIP [Tree('ROOT', [Tree('S', [Tree('NP', [Tree('PRP', ['I'])]), Tree('VP', [Tree('VBP', ["'m"]), Tree('NP', [Tree('DT', ['a']), Tree('NN', ['dog'])])])])]), Tree('ROOT', [Tree('S', [Tree('NP', [Tree('DT', ['This'])]), Tree('VP', [Tree('VBZ', ['is']), Tree('NP', [Tree('NP', [Tree('NP', [Tree('PRP$', ['my']), Tree('NNS', ['friends']), Tree('POS', ["'"])]), Tree('NN', ['cat'])]), Tree('PRN', [Tree('-LRB-', [Tree('', []), Tree('NP', [Tree('DT', ['the']), Tree('NN', ['tabby'])]), Tree('-RRB-', [])])])])])])])] >>> sum([list(dep_graphs) for dep_graphs in parser.tagged_parse_sents(( ... ( ... ("The", "DT"), ... ("quick", "JJ"), ... ("brown", "JJ"), ... ("fox", "NN"), ... ("jumped", "VBD"), ... ("over", "IN"), ... ("the", "DT"), ... ("lazy", "JJ"), ... ("dog", "NN"), ... (".", "."), ... ), ... ))],[]) # doctest: +NORMALIZE_WHITESPACE +SKIP [Tree('ROOT', [Tree('S', [Tree('NP', [Tree('DT', ['The']), Tree('JJ', ['quick']), Tree('JJ', ['brown']), Tree('NN', ['fox'])]), Tree('VP', [Tree('VBD', ['jumped']), Tree('PP', [Tree('IN', ['over']), Tree('NP', [Tree('DT', ['the']), Tree('JJ', ['lazy']), Tree('NN', ['dog'])])])]), Tree('.', ['.'])])])] penncb<\P!R\^R7\SV`!V/VBR#)zcThe StanfordParser will be deprecated Please use nltk.parse.corenlp.CoreNLPParser instead. stacklevelNwarningswarnDeprecationWarningsuperr9r2argskwargs __class__s&*,rr9StanfordParser.__init__Fs/  R    $)&)r"c.\P!V4#r)r fromstringr2results&&rrBStanfordParser._make_treePsv&&r"r& rrrrrr[r9rBrr __classcell__rrs@@rrrs!0dN*''r"rc@aa]tRtRtoRtRtV3RltRtRtVt V;t #)StanfordDependencyParseriTa >>> dep_parser=StanfordDependencyParser( ... model_path="edu/stanford/nlp/models/lexparser/englishPCFG.ser.gz" ... ) # doctest: +SKIP >>> [parse.tree() for parse in dep_parser.raw_parse("The quick brown fox jumps over the lazy dog.")] # doctest: +NORMALIZE_WHITESPACE +SKIP [Tree('jumps', [Tree('fox', ['The', 'quick', 'brown']), Tree('dog', ['over', 'the', 'lazy'])])] >>> [list(parse.triples()) for parse in dep_parser.raw_parse("The quick brown fox jumps over the lazy dog.")] # doctest: +NORMALIZE_WHITESPACE +SKIP [[((u'jumps', u'VBZ'), u'nsubj', (u'fox', u'NN')), ((u'fox', u'NN'), u'det', (u'The', u'DT')), ((u'fox', u'NN'), u'amod', (u'quick', u'JJ')), ((u'fox', u'NN'), u'amod', (u'brown', u'JJ')), ((u'jumps', u'VBZ'), u'nmod', (u'dog', u'NN')), ((u'dog', u'NN'), u'case', (u'over', u'IN')), ((u'dog', u'NN'), u'det', (u'the', u'DT')), ((u'dog', u'NN'), u'amod', (u'lazy', u'JJ'))]] >>> sum([[parse.tree() for parse in dep_graphs] for dep_graphs in dep_parser.raw_parse_sents(( ... "The quick brown fox jumps over the lazy dog.", ... "The quick grey wolf jumps over the lazy fox." ... ))], []) # doctest: +NORMALIZE_WHITESPACE +SKIP [Tree('jumps', [Tree('fox', ['The', 'quick', 'brown']), Tree('dog', ['over', 'the', 'lazy'])]), Tree('jumps', [Tree('wolf', ['The', 'quick', 'grey']), Tree('fox', ['over', 'the', 'lazy'])])] >>> sum([[parse.tree() for parse in dep_graphs] for dep_graphs in dep_parser.parse_sents(( ... "I 'm a dog".split(), ... "This is my friends ' cat ( the tabby )".split(), ... ))], []) # doctest: +NORMALIZE_WHITESPACE +SKIP [Tree('dog', ['I', "'m", 'a']), Tree('cat', ['This', 'is', Tree('friends', ['my', "'"]), Tree('tabby', ['the'])])] >>> sum([[list(parse.triples()) for parse in dep_graphs] for dep_graphs in dep_parser.tagged_parse_sents(( ... ( ... ("The", "DT"), ... ("quick", "JJ"), ... ("brown", "JJ"), ... ("fox", "NN"), ... ("jumped", "VBD"), ... ("over", "IN"), ... ("the", "DT"), ... ("lazy", "JJ"), ... ("dog", "NN"), ... (".", "."), ... ), ... ))],[]) # doctest: +NORMALIZE_WHITESPACE +SKIP [[((u'jumped', u'VBD'), u'nsubj', (u'fox', u'NN')), ((u'fox', u'NN'), u'det', (u'The', u'DT')), ((u'fox', u'NN'), u'amod', (u'quick', u'JJ')), ((u'fox', u'NN'), u'amod', (u'brown', u'JJ')), ((u'jumped', u'VBD'), u'nmod', (u'dog', u'NN')), ((u'dog', u'NN'), u'case', (u'over', u'IN')), ((u'dog', u'NN'), u'det', (u'the', u'DT')), ((u'dog', u'NN'), u'amod', (u'lazy', u'JJ'))]] conll2007cb<\P!R\^R7\SV`!V/VBR#)zwThe StanfordDependencyParser will be deprecated Please use nltk.parse.corenlp.CoreNLPDependencyParser instead.rNrrs&*,rr9!StanfordDependencyParser.__init__s/  \    $)&)r"c\VRR7#)roottop_relation_labelr rs&&rrB#StanfordDependencyParser._make_treev&AAr"r&rrs@@rrrTs#.`!N*BBr"rc^aa]tRtRtoRtRtRtRtRtRt Rt V3Rlt R R lt R t R tVtV;t#) StanfordNeuralDependencyParseria >>> from nltk.parse.stanford import StanfordNeuralDependencyParser # doctest: +SKIP >>> dep_parser=StanfordNeuralDependencyParser(java_options='-mx4g')# doctest: +SKIP >>> [parse.tree() for parse in dep_parser.raw_parse("The quick brown fox jumps over the lazy dog.")] # doctest: +NORMALIZE_WHITESPACE +SKIP [Tree('jumps', [Tree('fox', ['The', 'quick', 'brown']), Tree('dog', ['over', 'the', 'lazy']), '.'])] >>> [list(parse.triples()) for parse in dep_parser.raw_parse("The quick brown fox jumps over the lazy dog.")] # doctest: +NORMALIZE_WHITESPACE +SKIP [[((u'jumps', u'VBZ'), u'nsubj', (u'fox', u'NN')), ((u'fox', u'NN'), u'det', (u'The', u'DT')), ((u'fox', u'NN'), u'amod', (u'quick', u'JJ')), ((u'fox', u'NN'), u'amod', (u'brown', u'JJ')), ((u'jumps', u'VBZ'), u'nmod', (u'dog', u'NN')), ((u'dog', u'NN'), u'case', (u'over', u'IN')), ((u'dog', u'NN'), u'det', (u'the', u'DT')), ((u'dog', u'NN'), u'amod', (u'lazy', u'JJ')), ((u'jumps', u'VBZ'), u'punct', (u'.', u'.'))]] >>> sum([[parse.tree() for parse in dep_graphs] for dep_graphs in dep_parser.raw_parse_sents(( ... "The quick brown fox jumps over the lazy dog.", ... "The quick grey wolf jumps over the lazy fox." ... ))], []) # doctest: +NORMALIZE_WHITESPACE +SKIP [Tree('jumps', [Tree('fox', ['The', 'quick', 'brown']), Tree('dog', ['over', 'the', 'lazy']), '.']), Tree('jumps', [Tree('wolf', ['The', 'quick', 'grey']), Tree('fox', ['over', 'the', 'lazy']), '.'])] >>> sum([[parse.tree() for parse in dep_graphs] for dep_graphs in dep_parser.parse_sents(( ... "I 'm a dog".split(), ... "This is my friends ' cat ( the tabby )".split(), ... ))], []) # doctest: +NORMALIZE_WHITESPACE +SKIP [Tree('dog', ['I', "'m", 'a']), Tree('cat', ['This', 'is', Tree('friends', ['my', "'"]), Tree('tabby', ['-LRB-', 'the', '-RRB-'])])] conllz)edu.stanford.nlp.pipeline.StanfordCoreNLPz%stanford-corenlp-(\d+)(\.(\d+))+\.jarz,stanford-corenlp-(\d+)(\.(\d+))+-models\.jarTc<\P!R\^R7\SV`!V/VBV;P R, unR#)z}The StanfordNeuralDependencyParser will be deprecated Please use nltk.parse.corenlp.CoreNLPDependencyParser instead.rz(-annotators tokenize,ssplit,pos,depparseN)rrrrr9r0rs&*,rr9'StanfordNeuralDependencyParser.__init__sA  \    $)&)  JJr"c \R4h)z Currently unimplemented because the neural dependency parser (and the StanfordCoreNLP pipeline class) doesn't support passing in pre- tagged tokens. zxtagged_parse[_sents] is not supported by StanfordNeuralDependencyParser; use parse[_sents] or raw_parse[_sents] instead.)NotImplementedError)r2r^rs&&&rrk1StanfordNeuralDependencyParser.tagged_parse_sentss " :  r"c\VRR7#)ROOTrr rs&&rrB)StanfordNeuralDependencyParser._make_treerr"r&r)rrrrrr[rZr)r+rrAr9rkrBrrrrs@@rrrsC>N=K 3DHJ  K  BBr"r)rrr subprocessrnltk.internalsrrrrrnltk.parse.apir nltk.parse.dependencygraphr nltk.treer r*rrrrr&r"rrsk #6D rGrj@'*@'F>B4>BB?B%:?Br"