OfPFSSKrSSKJr SSKJr SSKJr SSKJ r Sr"SS5r S r SS jr \R"S 5rSS jrSrSSjrSr\R"S\R&5r\R"S5rSr/SQS 4SjrSr\S:Xa\"5 gg)N)accuracy)map_tag) str2tuple)Treec/n/nUH>nURUR55nU[U5- nU[U5- nM@ [X#5$)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 **cp\rSrSrSrSrSrSrSrSr Sr SS jr S r S r S rS rSrSrSrSrg) ChunkScore3ao 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 [5Ul[5Ul[5Ul[5Ul[5UlUR SS5UlUR SS5UlUR SS5Ul UR SS5Ul SUl SUl SUl SUlSUlSUlS Ulg) Nmax_tp_examplesdmax_fp_examplesmax_fn_examples chunk_labelz.*rgF)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;     #( rcUR(aURUR-UlURUR- UlURUR- Ul[ UR5Ul[ UR 5Ul[ UR5Ul SUlgg)NF) r.rrr r"r!lenr(r)r*r/s r_updateMeasuresChunkScore._updateMeasuress  # #}}t}}4DH}}t}}4DH}}t}}4DHtxx=DLtxx=DLtxx=DL',D $ $rc U=R[XRUR5-slU=R[X RUR5-slU=RS- slSUl[ U5n[ U5nU=R[U5- slU=R[S[XC555- sl g![a S=p4N\f=f)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. Tc38# UHupX:XdM Sv M g7f)r9Nr:).0tgs r #ChunkScore.score..s" ;&1qvAA;s  N) r _chunksetsr+r'rr.r ValueErrorr-r4r,sumzip)r/correctguessed correct_tags guessed_tagss rscoreChunkScore.scores G[[$:K:KLL  G[[$:K:KLL  q #'  -)'2L)'2L C -- c"  ;"     -+- ,L<  -sC'' C76C7cVURS:XagURUR- $)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 rr9)r-r,r5s rrChunkScore.accuracys,   q !!D$4$444rcUR5 URUR-nUS:XagURU- $)zi Return the overall precision for all texts that have been scored by this ``ChunkScore``. :rtype: float r)r6r(r)r/divs r precisionChunkScore.precision; llT\\) !8<<#% %rcUR5 URUR-nUS:XagURU- $)zf Return the overall recall for all texts that have been scored by this ``ChunkScore``. :rtype: float rr6r(r*rNs rrecallChunkScore.recallrRrcUR5 UR5nUR5nUS:XdUS:XagSX- SU- U- -- $)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 rr9)r6rPrU)r/alphaprs r f_measureChunkScore.f_measuresQ  NN  KKM 6Q!VEIUa/00rcUR5 [UR5nUVs/sHo"SPM sn$s snf)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 r9)r6listr"r/chunkscs rmissedChunkScore.misseds7 dhh$%f!f%%%;cUR5 [UR5nUVs/sHo"SPM sn$s snf)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 r9)r6r^r!r_s r incorrectChunkScore.incorrects7 dhh$%f!f%%%rdc`[UR5nUVs/sHo"SPM sn$s snf)zw Return the chunks which were included in the correct chunk structures, listed in input order. :rtype: list of chunks r9)r^rr_s rrEChunkScore.correct,dmm$$%f!f%%%+c`[UR5nUVs/sHo"SPM sn$s snf)zw Return the chunks which were included in the guessed chunk structures, listed in input order. :rtype: list of chunks r9)r^rr_s rrFChunkScore.guessedrjrkcTUR5 URUR-$)NrTr5s r__len__ChunkScore.__len__s! ||dll**rc6S[[U55-S-$)zH Return a concise representation of this ``ChunkScoring``. :rtype: str z)reprr4r5s r__repr__ChunkScore.__repr__s #T#d)_4zAArcSSUR5S-SS3-SUR5S-SS3-SUR5S-SS3-SUR5S-SS 3-$) 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: rz5.1fz%% z Precision: z Recall: z F-Measure: z%%)rrPrUr[r5s r__str__ChunkScore.__str__s "#DMMOc$9$#?tD F#DNN$4s$:4#@E G$DKKMC$7#=TB D$DNN$4s$:4#@C  E r)r'rr+r"r*r!r)rr&r%r$r.r,r-r r(N)g?)__name__ __module__ __qualname____firstlineno____doc__r1r6rIrrPrUr[rbrfrErFrorsrv__static_attributes__r:rrrr3sO<|)&- : 5 & &1& & &&&+B rrc8Sn/nUHn[U[5(ai[R"X%R 55(a"UR X4UR 545 U[UR55- nMUS- nM [U5$)Nrr9) isinstancerrematchlabelappendfreezer4leavesr)r=countrposr`childs rrArA2s{ C F eT " "xx [[]33 |U\\^<= 3u||~& &C 1HC  v;rSc[R"S5n[U/5/nURU5GHnUR 5n U SS:Xa_[ U5S:wa[ SUR5S35e[U/5n USRU 5 URU 5 M|U SS:Xa>[ U5S :wa[ S UR5S35eUR5 MUcUSRU 5 M[X5upU(aU(a [XEU 5n USRX45 GM [ U5S:wa[ S [ U5S35eUS$) 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]+r[r9zUnexpected [ at char d]zUnexpected ] at char zExpected ] at char ) rcompilerfinditergroupr4rBstartrpoprr) 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+)?cf[U/5/n[URS55GHupEUR5(dM[R U5nUc[ SUS35eUR5upxpUbX;aSn U S:H=(a XSR5:gn U S;dU (a[U5S:XaUR5 U S :XdU (a1[U /5n USRU 5 URU 5 USRXx45 GM US $) 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 rOIrBOrBr) r enumeratesplitstrip_LINE_RErrBgroupsrr4rr) r chunk_typesrrlinenolinerrrstate chunk_type mismatch_Irs r conllstr2treerus$*b ! "E!!''$-0 zz|| t$ =~fQZ89 9).&E  "z'DEc\Ej"IOO4E&E D=J5zQ  C<:R(E "I  U # LL  b $%91< 8Orc&/nUH]nUR5nSnUHAn[U[5(a [S5eUR USUSXC-45 SnMC M_ U$![ a UR USUSS45 Mf=f)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 formatrr9I-r)rrrrBrAttributeError)r=tagsrcategoryprefixcontentss rr r s D 3{{}HF!h--$Q Xa[(1+v7HIJ "  K 3 KKq58S1 2 3sAA(($BBc[U/5nUGH2upVnUc&U(a [S5eURXV45 M0URS5(a"UR[USSXV4/55 MhURS5(a[ U5S:Xd2[ US[5(aUSR 5USS:wa4U(a [S5eUR[USSXV4/55 MUSRXV45 GM US:XaURXV45 GM&[S U<35e U$) z) Convert the CoNLL IOB format to a tree. NzBad conll tag sequencerrrrrrzBad conll tag )rrBr startswithr4rr)sentencerrstricttreerpostagchunktags rconlltags2treers(  B D"*h   !9:: TN+   & & KKXab\TN+;< =   & &D Q!$r(D118>>#x|3$%=>>KKXab\TN3C DER/ _ KK '~h\:; ;3#+4 Krc[U5Vs/sHnSRU5PM nnSRU5$s snf)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[U/5/nUc/$[R"SU5HnUR5nUR S5(af[ R U5nUc [SU5 [URS5/5nUSRU5 URU5 MUR S5(aUR5 MUSRU5 M [U5S :wa [S 5eUS $![[4a$n[SUR5SS 35UeSnAff=f) Nz<[^>]+>|[^\s<]+zrs .$#+