+ hPH^RIt^RIHt^RIHt^RIHt^RIH t Rt!RR4t R t RR lt ]P!R 4tRR ltRtRRltRt]P!R]P&4t]P!R4tRt.ROR 3RltRt]R8Xd ]!4R#R#)N)accuracy)map_tag) str2tuple)Treec.p.pVFFpVPVP44pV\V4, pV\V4, pKH \W#4#)aX Score the accuracy of the chunker against the gold standard. Strip the chunk information from the gold standard and rechunk it using the chunker, then compute the accuracy score. :type chunker: ChunkParserI :param chunker: The chunker being evaluated. :type gold: tree :param gold: The chunk structures to score the chunker on. :rtype: float )parseflattentree2conlltags _accuracy)chunkergold gold_tags test_tags gold_tree test_trees&& 1/usr/lib/python3/dist-packages/nltk/chunk/util.pyrrsZII MM)"3"3"56 ^I.. ^I..  Y **c|a]tRt^3toRtRtRtRtRtRt Rt RRlt R t R t R tR tR tRtRtRtVtR#) ChunkScoreao A utility class for scoring chunk parsers. ``ChunkScore`` can evaluate a chunk parser's output, based on a number of statistics (precision, recall, f-measure, misssed chunks, incorrect chunks). It can also combine the scores from the parsing of multiple texts; this makes it significantly easier to evaluate a chunk parser that operates one sentence at a time. Texts are evaluated with the ``score`` method. The results of evaluation can be accessed via a number of accessor methods, such as ``precision`` and ``f_measure``. A typical use of the ``ChunkScore`` class is:: >>> chunkscore = ChunkScore() # doctest: +SKIP >>> for correct in correct_sentences: # doctest: +SKIP ... guess = chunkparser.parse(correct.leaves()) # doctest: +SKIP ... chunkscore.score(correct, guess) # doctest: +SKIP >>> print('F Measure:', chunkscore.f_measure()) # doctest: +SKIP F Measure: 0.823 :ivar kwargs: Keyword arguments: - max_tp_examples: The maximum number actual examples of true positives to record. This affects the ``correct`` member function: ``correct`` will not return more than this number of true positive examples. This does *not* affect any of the numerical metrics (precision, recall, or f-measure) - max_fp_examples: The maximum number actual examples of false positives to record. This affects the ``incorrect`` member function and the ``guessed`` member function: ``incorrect`` will not return more than this number of examples, and ``guessed`` will not return more than this number of true positive examples. This does *not* affect any of the numerical metrics (precision, recall, or f-measure) - max_fn_examples: The maximum number actual examples of false negatives to record. This affects the ``missed`` member function and the ``correct`` member function: ``missed`` will not return more than this number of examples, and ``correct`` will not return more than this number of true negative examples. This does *not* affect any of the numerical metrics (precision, recall, or f-measure) - chunk_label: A regular expression indicating which chunks should be compared. Defaults to ``'.*'`` (i.e., all chunks). :type _tp: list(Token) :ivar _tp: List of true positives :type _fp: list(Token) :ivar _fp: List of false positives :type _fn: list(Token) :ivar _fn: List of false negatives :type _tp_num: int :ivar _tp_num: Number of true positives :type _fp_num: int :ivar _fp_num: Number of false positives :type _fn_num: int :ivar _fn_num: Number of false negatives. c \4Vn\4Vn\4Vn\4Vn\4VnVP R^d4VnVP R^d4VnVP R^d4Vn VP RR4Vn ^Vn ^Vn ^Vn ^VnRVnRVnRVnR#)max_tp_examplesmax_fp_examplesmax_fn_examples chunk_labelz.*gFN)set_correct_guessed_tp_fp_fnget_max_tp_max_fp_max_fn _chunk_label_tp_num_fp_num_fn_num_count _tags_correct _tags_total_measuresNeedUpdate)selfkwargss&,r__init__ChunkScore.__init__rs  555zz"3S9 zz"3S9 zz"3S9 "JJ}d;     #( rcVP'dVPVP,VnVPVP, VnVPVP, Vn\ VP4Vn\ VP 4Vn\ VP4Vn RVnR#R#)FN) r,rrrr rlenr&r'r(r-s&r_updateMeasuresChunkScore._updateMeasuress  # # #}}t}}4DH}}t}}4DH}}t}}4DHtxx=DLtxx=DLtxx=DL',D $ $rc  V;P\WPVP4,unV;P\W PVP4,unV;P^, unRVn\ V4p\ V4pV;P\V4, unV;P\R\WC444, un R# \dR;r4Lfi;i)a Given a correctly chunked sentence, score another chunked version of the same sentence. :type correct: chunk structure :param correct: The known-correct ("gold standard") chunked sentence. :type guessed: chunk structure :param guessed: The chunked sentence to be scored. Tc3:"TFwrW8XgK ^xK R#5i)N).0tgs& r #ChunkScore.score..s" ;&1qvAA;s  Nr9) r _chunksetsr)r%rr,r ValueErrorr+r2r*sumzip)r-correctguessed correct_tags guessed_tagss&&& rscoreChunkScore.scores G[[$:K:KLL  G[[$:K:KLL  q #'  -)'2L)'2L C -- c"  ;"     -+- ,L<  -sC<<D  D c bVP^8Xd^#VPVP, #)z Return the overall tag-based accuracy for all text that have been scored by this ``ChunkScore``, using the IOB (conll2000) tag encoding. :rtype: float )r+r*r3s&rrChunkScore.accuracys,   q !!D$4$444rc VP4VPVP,pV^8Xd^#VPV, #)zi Return the overall precision for all texts that have been scored by this ``ChunkScore``. :rtype: float )r4r&r'r-divs& r precisionChunkScore.precision; llT\\) !8<<#% %rc VP4VPVP,pV^8Xd^#VPV, #)zf Return the overall recall for all texts that have been scored by this ``ChunkScore``. :rtype: float r4r&r(rLs& rrecallChunkScore.recallrPrc VP4VP4pVP4pV^8XgV^8Xd^#^W, ^V, V, ,, #)as Return the overall F measure for all texts that have been scored by this ``ChunkScore``. :param alpha: the relative weighting of precision and recall. Larger alpha biases the score towards the precision value, while smaller alpha biases the score towards the recall value. ``alpha`` should have a value in the range [0,1]. :type alpha: float :rtype: float )r4rNrS)r-alphaprs&& r f_measureChunkScore.f_measuresQ  NN  KKM 6Q!VEIUa/00rc VP4\VP4pVUu.uF q"^,NK up#uupi)z Return the chunks which were included in the correct chunk structures, but not in the guessed chunk structures, listed in input order. :rtype: list of chunks )r4listr r-chunkscs& rmissedChunkScore.misseds9 dhh$%f!f%%%>c VP4\VP4pVUu.uF q"^,NK up#uupi)z Return the chunks which were included in the guessed chunk structures, but not in the correct chunk structures, listed in input order. :rtype: list of chunks )r4r\rr]s& r incorrectChunkScore.incorrects9 dhh$%f!f%%%rbc f\VP4pVUu.uF q"^,NK up#uupi)zw Return the chunks which were included in the correct chunk structures, listed in input order. :rtype: list of chunks )r\rr]s& rrCChunkScore.correct.dmm$$%f!f%%%.c f\VP4pVUu.uF q"^,NK up#uupi)zw Return the chunks which were included in the guessed chunk structures, listed in input order. :rtype: list of chunks )r\rr]s& rrDChunkScore.guessedrhric\VP4VPVP,#)NrRr3s&r__len__ChunkScore.__len__s! ||dll**rc FR\\V44,R,#)zH Return a concise representation of this ``ChunkScoring``. :rtype: str z)reprr2r3s&r__repr__ChunkScore.__repr__s #T#d)_4zAArc RRVP4^d,R R2,RVP4^d,R R2,RVP4^d,R R2,RVP4^d,R R2,#) z Return a verbose representation of this ``ChunkScoring``. This representation includes the precision, recall, and f-measure scores. For other information about the score, use the accessor methods (e.g., ``missed()`` and ``incorrect()``). :rtype: str zChunkParse score: z IOB Accuracy: z5.1fz% z Precision: z Recall: z F-Measure: %)rrNrSrYr3s&r__str__ChunkScore.__str__s ""4==?S#8">cB C"4>>#3c#9$"?sC D#4;;=3#6t">#3c#9$"?qA  B r)r%rr)r r(rr'rr$r#r"r,r*r+rr&N)g?)__name__ __module__ __qualname____firstlineno____doc__r/r4rGrrNrSrYr`rdrCrDrmrqru__static_attributes____classdictcell__) __classdict__s@rrr3sW<|)&- : 5 & &1& & &&&+B  rrcL^p.pVFp\V\4'do\P!W%P 44'd#VP W3VP 434V\VP44, pKV^, pK \V4#)r) isinstancerrematchlabelappendfreezer2leavesr)r;countrposr^childs&&& rr?r?2s{ C F eT " "xx [[]33 |U\\^<= 3u||~& &C 1HC  v;rSc<\P!R4p\V.4.pVPV4EF3pVP 4p V ^,R8Xde\ V4^8wd\ RVP4R 24h\V.4p VR,PV 4VPV 4KV ^,R8Xd@\ V4^8wd\ RVP4R 24hVP4KVfVR,PV 4K\W4wrV'dV'd \WEV 4p VR,PW34EK6 \ V4^8wd\ R\ V4R 24hV^,#) a  Divide a string of bracketted tagged text into chunks and unchunked tokens, and produce a Tree. Chunks are marked by square brackets (``[...]``). Words are delimited by whitespace, and each word should have the form ``text/tag``. Words that do not contain a slash are assigned a ``tag`` of None. :param s: The string to be converted :type s: str :param chunk_label: The label to use for chunk nodes :type chunk_label: str :param root_label: The label to use for the root of the tree :type root_label: str :rtype: Tree z\[|\]|[^\[\]\s]+[zUnexpected [ at char d]zUnexpected ] at char zExpected ] at char ) rcompilerfinditergroupr2r@startrpoprr) sr root_labelsep source_tagset target_tagsetWORD_OR_BRACKETstackrtextchunkwordtags &&&&&& r tagstr2treer?sP(jj!45O *b ! "E ))!,{{} 7c>5zQ #8q8I!JKKb)E "I  U # LL  !W^5zQ #8q8I!JKK IIK{b   &%d0  ]!-DCb   $-'-* 5zQ.s1vaj9:: 8Orz(\S+)\s+(\S+)\s+([IOB])-?(\S+)?c\V.4.p\VPR44EFwrEVP4'gK\P V4pVf\ RVR 24hVP4wrxrVe W9dRp V R8H;'dWR,P48gp V R9g V 'd!\V4^8XdVP4V R8Xg V 'd6\V .4p VR,PV 4VPV 4VR,PWx34EK V^,#) a Return a chunk structure for a single sentence encoded in the given CONLL 2000 style string. This function converts a CoNLL IOB string into a tree. It uses the specified chunk types (defaults to NP, PP and VP), and creates a tree rooted at a node labeled S (by default). :param s: The CoNLL string to be converted. :type s: str :param chunk_types: The chunk types to be converted. :type chunk_types: tuple :param root_label: The node label to use for the root. :type root_label: str :rtype: Tree  zError on line rOIBOBr) r enumeratesplitstrip_LINE_RErr@groupsrr2rr) r chunk_typesrrlinenolinerrrstate chunk_type mismatch_Irs &&& r conllstr2treerus$*b ! "E!!''$-0 zz|| t$ =~fQZ89 9).&E  "z'DEc\EEj"IOO4E&E D=J5zQ  C<:R(E "I  U # LL  b $%91< 8OrcR.pVFjpVP4pRpVFNp\V\4'd \R4hVP V^,V^,WC,34RpKP Kl V# \ d'TP T^,T^,R34Ki;i)z Return a list of 3-tuples containing ``(word, tag, IOB-tag)``. Convert a tree to the CoNLL IOB tag format. :param t: The tree to be converted. :type t: Tree :rtype: list(tuple) B-z7Tree is too deeply nested to be printed in CoNLL formatI-r)rrrr@rAttributeError)r;tagsrcategoryprefixcontentss& rr r s D 3{{}HF!h--$Q Xa[(1+v7HIJ "  K 3 KKq58S1 2 3sA&A55-B&%B&c\V.4pVEFTwrVpVf(V'd \R4hVPWV34K2VPR4'd'VP\VR,WV3.44KoVPR4'd\ V4^8XgA\ VR,\4'd$VR,P 4VR,8wd;V'd \R4hVP\VR,WV3.44EKVR,PWV34EK,VR8XdVPWV34EKH\RV: 24h V#)z) Convert the CoNLL IOB format to a tree. zBad conll tag sequencer:NNrrzBad conll tag r)rr@r startswithr2rr)sentencerrstricttreerpostagchunktags&&&& rconlltags2treers"  B D"*h   !9:: TN+   & & KKXb\TN+;< =   & &D Q!$r(D118>>#x|3$%=>>KKXb\TN3C DER/ _ KK '~h\:; ;3#+4 Krc\V4Uu.uFpRPV4NK ppRPV4#uupi)z Return a multiline string where each line contains a word, tag and IOB tag. Convert a tree to the CoNLL IOB string format :param t: The tree to be converted. :type t: Tree :rtype: str  r)r join)r;tokenliness& r tree2conllstrrs;+9*; <*;SXXe_*;E < 99U  =s;a\s*(\s*(?P.+?)\s*\s*)?(\s*(?P.+?)\s*\s*)?(\s*(?P.+?)\s*\s*)?\s*(\s*(?P.+?)\s*\s*)?(?P.*?)\s*\s*\s*z#]*?type="(?P\w+)"c\V.4.pVf.#\P!RV4FpVP4pVP R4'dl\ P V4pVf \RV4\VPR4.4pVR ,PV4VPV4KVP R4'dVP4KVR ,PV4K \V4^8wd \R 4hV^,# \\3d%p\RTP4R R24ThRp?ii;i) Nz<[^>]+>|[^\s<]+zrs .$#+