o rZhP@sddlZddlmZddlmZddlmZddlm Z ddZGdd d Z d d Z d&ddZ e dZd'ddZddZ d(ddZddZe dejZe dZddZgd d fd!d"Zd#d$Zed%kroedSdS))N)accuracy)map_tag) str2tuple)TreecCsBg}g}|D]}||}|t|7}|t|7}qt||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 )parseflattentree2conlltags _accuracy)ZchunkerZgoldZ gold_tagsZ test_tagsZ gold_treeZ test_treer >/var/www/auris/lib/python3.10/site-packages/nltk/chunk/util.pyrs   rc@seZdZdZddZddZddZdd Zd d Zd d Z d ddZ ddZ ddZ ddZ ddZddZddZddZdS)! 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. cKst|_t|_t|_t|_t|_|dd|_|dd|_|dd|_ |dd|_ d|_ d|_ d|_ d|_d|_d|_d |_dS) NZmax_tp_examplesdZmax_fp_examplesZmax_fn_examples chunk_labelz.*rgF)set_correct_guessed_tp_fp_fngetZ_max_tpZ_max_fpZ_max_fn _chunk_label_tp_num_fp_num_fn_num_count _tags_correct _tags_total_measuresNeedUpdate)selfkwargsr r r __init__rs  zChunkScore.__init__cCsb|jr/|j|j@|_|j|j|_|j|j|_t|j|_t|j|_t|j|_ d|_dSdS)NF) rrrrrrlenrrrrr r r _updateMeasuress    zChunkScore._updateMeasurescCs|jt||j|jO_|jt||j|jO_|jd7_d|_z t|}t|}Wn ty;d}}Ynw|jt |7_|j t ddt ||D7_ 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 ).0tgr r r sz#ChunkScore.score..N) r _chunksetsrrrrr ValueErrorrr!rsumzip)rcorrectguessedZ correct_tagsZ guessed_tagsr r r scores    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$)rrr"r r r rs  zChunkScore.accuracycC*||j|j}|dkrdS|j|S)z Return the overall precision for all texts that have been scored by this ``ChunkScore``. :rtype: float r)r#rrrdivr r r precision   zChunkScore.precisioncCr0)z Return the overall recall for all texts that have been scored by this ``ChunkScore``. :rtype: float rr#rrr1r r r recallr4zChunkScore.recall?cCsD||}|}|dks|dkrdSd||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#r3r6)ralphaprr r r f_measures  zChunkScore.f_measurecC |t|j}dd|DS)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 cSg|]}|dqSr$r r%cr r r z%ChunkScore.missed..)r#listrrchunksr r r misseds zChunkScore.missedcCr<)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 cSr=r>r r?r r r rArBz(ChunkScore.incorrect..)r#rCrrDr r r incorrects zChunkScore.incorrectcCt|j}dd|DS)z Return the chunks which were included in the correct chunk structures, listed in input order. :rtype: list of chunks cSr=r>r r?r r r rArBz&ChunkScore.correct..)rCrrDr r r r- zChunkScore.correctcCrH)z Return the chunks which were included in the guessed chunk structures, listed in input order. :rtype: list of chunks cSr=r>r r?r r r rArBz&ChunkScore.guessed..)rCrrDr r r r.rIzChunkScore.guessedcCs||j|jS)Nr5r"r r r __len__s zChunkScore.__len__cCsdtt|dS)z` Return a concise representation of this ``ChunkScoring``. :rtype: str z)reprr!r"r r r __repr__szChunkScore.__repr__cCs\dd|dddd|dddd|dddd|ddd 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: r z5.1fz%% z Precision: z Recall: z F-Measure: z%%)rr3r6r;r"r r r __str__s zChunkScore.__str__N)r7)__name__ __module__ __qualname____doc__r r#r/rr3r6r;rFrGr-r.rJrLrMr r r r r 3s >        r cCsdd}g}|D]'}t|tr)t||r |||f|f|t|7}q|d7}qt |S)Nrr$) isinstancerrematchlabelappendfreezer!leavesr)r&countrposrEchildr r r r)2s  r)NPS/c Cs(td}t|gg}||D]o}|} | ddkr>t|dkr,td|dt|g} |d| || q| ddkrYt|d krTtd |d| q|d ure|d| qt | |\} } |rv|rvt ||| } |d| | fqt|dkrtd t|d|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 NzExpected ] at char ) rScompilerfinditergroupr!r*startrVpoprr) sr root_labelsepZ source_tagsetZ target_tagsetZWORD_OR_BRACKETstackrTtextchunkwordtagr r r tagstr2tree?s.           rqz(\S+)\s+(\S+)\s+([IOB])-?(\S+)?r\PPZVPc Cst|gg}t|dD]h\}}|sq t|}|dur'td|d|\}}} } |dur9| |vr9d} | dkoD| |dk} | dvsK| rUt |d krU| | d ks[| rlt| g} |d | | | |d ||fq |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 r`OIraZBOrcBr) r enumeratesplitstrip_LINE_RErTr*groupsrUr!rhrV) ri chunk_typesrjrllinenolinerTrorpstateZ chunk_typeZ mismatch_Irnr r r conllstr2treeus(       rc Csg}|D]=}z&|}d}|D]}t|trtd||d|d||fd}qWqtyA||d|ddfYqw|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) B-z7Tree is too deeply nested to be printed in CoNLL formatrr$I-ru)rUrRrr*rVAttributeError)r&tagsr[categoryprefixcontentsr r r rs"   rFcCs t|g}|D]|\}}}|dur|rtd|||fq|dr3|t|dd||fgq|drqt|dksQt|dtrQ|d|ddkrg|rWtd|t|dd||fgq|d||fq|dkr}|||fqtd ||S) z1 Convert the CoNLL IOB format to a tree. NzBad conll tag sequencerrcrrraruzBad conll tag )rr*rV startswithr!rRrU)Zsentencer}rjstricttreeroZpostagZchunktagr r r conlltags2trees*       rcCsddt|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 r rAsz!tree2conllstr..rt)rr)r&linesr r r tree2conllstrs ra\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 Cst|gg}|dur gStd|D][}|}z;|drAt|}|dur,td|t|dg}|d|||n|drK| n|d|Wqt t fym}z t d| dd |d}~wwt |d krxt d |d S) Nz<[^>]+>|[^\s<]+zs>     3 5 $ " +/