B >?ð[xQã @s ddlmZmZmZddlZddlmZddlmZddl m Z ddl m Z ddl mZdd „ZGd d „d eƒZd d „Zd0dd„Ze d¡Zd1dd„Zdd„Zd2dd„Zdd„Ze dej¡Ze d¡Zd d!„Zd"d#d$d%d&d'd(d)d*g dfd+d,„Zd-d.„Ze d/kreƒdS)3é)Úprint_functionÚunicode_literalsÚdivisionN)ÚTree)Úmap_tag)Ú str2tuple)Úpython_2_unicode_compatible)ÚaccuracycCsFg}g}x2|D]*}| | ¡¡}|t|ƒ7}|t|ƒ7}qWt||ƒS)a| 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 )ÚparseZflattenÚtree2conlltagsÚ _accuracy)ZchunkerZgoldZ gold_tagsZ test_tagsZ gold_treeZ test_tree©r ú.lib/python3.7/site-packages/nltk/chunk/util.pyr s   r c@s‚eZdZdZdd„Zdd„Zdd„Zdd „Zd d „Zd d „Z d dd„Z dd„Z dd„Z dd„Z dd„Zdd„Zdd„Zdd„ZdS)!Ú ChunkScorea; 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. cKsŽtƒ|_tƒ|_tƒ|_tƒ|_tƒ|_| dd¡|_| dd¡|_| dd¡|_ | dd¡|_ d|_ d|_ d|_ d|_d|_d|_d |_dS) NZmax_tp_examplesédZmax_fp_examplesZmax_fn_examplesÚ chunk_labelz.*rgF)ÚsetÚ_correctÚ_guessedÚ_tpÚ_fpÚ_fnÚgetZ_max_tpZ_max_fpZ_max_fnÚ _chunk_labelÚ_tp_numÚ_fp_numÚ_fn_numÚ_countÚ _tags_correctÚ _tags_totalÚ_measuresNeedUpdate)ÚselfÚkwargsr r rÚ__init__us zChunkScore.__init__cCs^|jrZ|j|j@|_|j|j|_|j|j|_t|jƒ|_t|jƒ|_t|jƒ|_ d|_dS)NF) r rrrrrÚlenrrr)r!r r rÚ_updateMeasuresˆs   zChunkScore._updateMeasurescCs²|jt||j|jƒO_|jt||j|jƒO_|jd7_d|_yt|ƒ}t|ƒ}Wntk rxd}}YnX|jt |ƒ7_|j t dd„t ||ƒDƒƒ7_ dS)aU 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. éTr css|]\}}||krdVqdS)r&Nr )Ú.0ÚtÚgr r rú ¬sz#ChunkScore.score..N) rÚ _chunksetsrrrr r Ú ValueErrorrr$rÚsumÚzip)r!ÚcorrectÚguessedZ correct_tagsZ guessed_tagsr r rÚscore’s  zChunkScore.scorecCs|jdkrdS|j|jS)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 rr&)rr)r!r r rr ¯s zChunkScore.accuracycCs.| ¡|j|j}|dkr dS|j|SdS)z‰ Return the overall precision for all texts that have been scored by this ``ChunkScore``. :rtype: float rN)r%rr)r!Údivr r rÚ precision»s  zChunkScore.precisioncCs.| ¡|j|j}|dkr dS|j|SdS)z† Return the overall recall for all texts that have been scored by this ``ChunkScore``. :rtype: float rN)r%rr)r!r2r r rÚrecallÉs  zChunkScore.recallçà?cCsD| ¡| ¡}| ¡}|dks(|dkr,dSd||d||S)a» 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 rr&)r%r3r4)r!ZalphaÚpÚrr r rÚ f_measure×s zChunkScore.f_measurecCs | ¡t|jƒ}dd„|DƒS)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 cSsg|] }|d‘qS)r&r )r'Úcr r rú ôsz%ChunkScore.missed..)r%Úlistr)r!Úchunksr r rÚmissedês zChunkScore.missedcCs | ¡t|jƒ}dd„|DƒS)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 cSsg|] }|d‘qS)r&r )r'r9r r rr:ÿsz(ChunkScore.incorrect..)r%r;r)r!r<r r rÚ incorrectös zChunkScore.incorrectcCst|jƒ}dd„|DƒS)z— Return the chunks which were included in the correct chunk structures, listed in input order. :rtype: list of chunks cSsg|] }|d‘qS)r&r )r'r9r r rr: sz&ChunkScore.correct..)r;r)r!r<r r rr/s zChunkScore.correctcCst|jƒ}dd„|DƒS)z— Return the chunks which were included in the guessed chunk structures, listed in input order. :rtype: list of chunks cSsg|] }|d‘qS)r&r )r'r9r r rr:sz&ChunkScore.guessed..)r;r)r!r<r r rr0 s zChunkScore.guessedcCs| ¡|j|jS)N)r%rr)r!r r rÚ__len__szChunkScore.__len__cCsdtt|ƒƒdS)z` Return a concise representation of this ``ChunkScoring``. :rtype: str z)Úreprr$)r!r r rÚ__repr__szChunkScore.__repr__cCsLdd | ¡d¡d | ¡d¡d | ¡d¡d | ¡d¡S)a- 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: {:5.1f}%% rz Precision: {:5.1f}%% z Recall: {:5.1f}%% z F-Measure: {:5.1f}%%)Úformatr r3r4r8)r!r r rÚ__str__!szChunkScore.__str__N)r5)Ú__name__Ú __module__Ú __qualname__Ú__doc__r#r%r1r r3r4r8r=r>r/r0r?rArCr r r rr6s=       rcCshd}g}xV|D]N}t|tƒrTt || ¡¡rB| ||f| ¡f¡|t| ¡ƒ7}q|d7}qWt |ƒS)Nrr&) Ú isinstancerÚreÚmatchÚlabelÚappendZfreezer$Zleavesr)r(ÚcountrÚposr<Úchildr r rr+5s   r+ÚNPÚSú/c Cs(t d¡}t|gƒg}xè| |¡D]Ú}| ¡} | ddkr|t|ƒdkrXtd | ¡¡ƒ‚t|gƒ} |d  | ¡|  | ¡q"| ddkr°t|ƒdkr¦td  | ¡¡ƒ‚|  ¡q"|d krÈ|d  | ¡q"t | |ƒ\} } |rê|rêt ||| ƒ} |d  | | f¡q"Wt|ƒdkr td  t|ƒ¡ƒ‚|dS) aB 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ú[r&zUnexpected [ at char {:d}éÿÿÿÿú]ézUnexpected ] at char {:d}NzExpected ] at char {:d}) rIÚcompilerÚfinditerÚgroupr$r,rBÚstartrLÚpoprr) ÚsrÚ root_labelÚsepZ source_tagsetZ target_tagsetZWORD_OR_BRACKETÚstackrJÚtextÚchunkÚwordÚtagr r rÚ tagstr2treeBs.          rdz(\S+)\s+(\S+)\s+([IOB])-?(\S+)?©rPÚPPZVPc Csöt|gƒg}xàt| d¡ƒD]Î\}}| ¡s.qt |¡}|dkrNtd |¡ƒ‚| ¡\}}} } |dk rr| |krrd} | dkoˆ| |d  ¡k} | dks–| rªt |ƒdkrª|  ¡| d ks¶| rØt| gƒ} |d  | ¡|  | ¡|d  ||f¡qW|d S) 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 Ú NzError on line {:d}ÚOÚIrTZBOrVÚBr) rÚ enumerateÚsplitÚstripÚ_LINE_RErJr,rBÚgroupsrKr$r[rL) r\Ú chunk_typesr]r_ÚlinenoÚlinerJrbrcÚstateZ chunk_typeZ mismatch_Irar r rÚ conllstr2treexs(       rtc Cs”g}xŠ|D]‚}yP| ¡}d}x>|D]6}t|tƒr8tdƒ‚| |d|d||f¡d}q"WWq tk rŠ| |d|ddf¡Yq Xq W|S)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) zB-z7Tree is too deeply nested to be printed in CoNLL formatrr&zI-rh)rKrHrr,rLÚAttributeError)r(ZtagsrOÚcategoryÚprefixÚcontentsr r rr ­s     "r FcCst|gƒ}x |D]\}}}|dkrD|r4tdƒ‚n| ||f¡q| d¡rn| t|dd…||fgƒ¡q| d¡rìt|ƒdksªt|dtƒrª|d ¡|dd…krØ|r¸tdƒ‚qê| t|dd…||fgƒ¡n|d ||f¡q|dkr| ||f¡qtd  |¡ƒ‚qW|S) z1 Convert the CoNLL IOB format to a tree. NzBad conll tag sequencezB-rVzI-rrTrhzBad conll tag {0!r})rr,rLÚ startswithr$rHrKrB)Zsentencerpr]ÚstrictZtreerbZpostagZchunktagr r rÚconlltags2treeÈs(         r{cCsdd„t|ƒDƒ}d |¡S)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 cSsg|]}d |¡‘qS)ú )Újoin)r'Útokenr r rr:õsz!tree2conllstr..rg)r r})r(Úlinesr r rÚ tree2conllstrìs r€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 Csôt|gƒg}|dkrgSx¾t d|¡D]®}| ¡}yv| d¡r„t |¡}|dkrZtd|ƒt| d¡gƒ}|d |¡| |¡n"| d¡r˜|  ¡n|d |¡Wq&t t fk rÒt d  |  ¡¡ƒ‚Yq&Xq&Wt|ƒdkrìt d ƒ‚|d S) Nz<[^>]+>|[^\s<]+zsF      2  5 # # 0