


from __future__ import annotations

class 		__a				:
		def __init__(      self      ,   _SCREAMING_SNAKE_CASE						)			->	Any:




									"""simple docstring"""





									_UpperCAmelCase					=      TypeError(
									    'Matrices must be formed from a list of zero or more lists containing at '
									    'least one and the same number of values, each of which must be of type '
									    'int or float.'						)
									if len(_SCREAMING_SNAKE_CASE						) != 0:
																_UpperCAmelCase					=      len(rows[0]						)
																if cols == 0:
																							raise error
																for row in rows:
																							if len(_SCREAMING_SNAKE_CASE						) != cols:
																														raise error
																							for value in row:
																														if not isinstance(_SCREAMING_SNAKE_CASE      ,   (int, float)						):
																																					raise error
																_UpperCAmelCase					=      rows
									else:
																_UpperCAmelCase					=      []
		def      UpperCAmelCase__    (      self						)			->	list[list[int]]:




									"""simple docstring"""





									return [[row[i] for row in self.rows] for i in range(len(self.rows[0]						)						)]
		@property
		def      UpperCAmelCase__    (      self						)			->	int:




									"""simple docstring"""





									return len(self.rows						)
		@property
		def      UpperCAmelCase__    (      self						)			->	int:




									"""simple docstring"""





									return len(self.rows[0]						)
		@property
		def      UpperCAmelCase__    (      self						)			->	tuple[int, int]:




									"""simple docstring"""





									return (self.num_rows, self.num_columns)
		@property
		def      UpperCAmelCase__    (      self						)			->	bool:




									"""simple docstring"""





									return self.order[0] == self.order[1]
		def      UpperCAmelCase__    (      self						)			->	Matrix:




									"""simple docstring"""





									_UpperCAmelCase					=      [
									    [0 if column_num != row_num else 1 for column_num in range(self.num_rows						)]
									    for row_num in range(self.num_rows						)
									]
									return Matrix(_SCREAMING_SNAKE_CASE						)
		def      UpperCAmelCase__    (      self						)			->	int:




									"""simple docstring"""





									if not self.is_square:
																return 0
									if self.order == (0, 0):
																return 1
									if self.order == (1, 1):
																return int(self.rows[0][0]						)
									if self.order == (2, 2):
																return int(
																    (self.rows[0][0] * self.rows[1][1])
																    - (self.rows[0][1] * self.rows[1][0])						)
									else:
																return sum(
																    self.rows[0][column] * self.cofactors().rows[0][column]
																    for column in range(self.num_columns						)						)
		def      UpperCAmelCase__    (      self						)			->	bool:




									"""simple docstring"""





									return bool(self.determinant()						)
		def      UpperCAmelCase__    (      self      ,   _SCREAMING_SNAKE_CASE      ,   _SCREAMING_SNAKE_CASE						)			->	int:




									"""simple docstring"""





									_UpperCAmelCase					=      [
									    [
									        self.rows[other_row][other_column]
									        for other_column in range(self.num_columns						)
									        if other_column != column
									    ]
									    for other_row in range(self.num_rows						)
									    if other_row != row
									]
									return Matrix(_SCREAMING_SNAKE_CASE						).determinant()
		def      UpperCAmelCase__    (      self      ,   _SCREAMING_SNAKE_CASE      ,   _SCREAMING_SNAKE_CASE						)			->	int:




									"""simple docstring"""





									if (row + column) % 2 == 0:
																return self.get_minor(_SCREAMING_SNAKE_CASE      ,   _SCREAMING_SNAKE_CASE						)
									return -1 * self.get_minor(_SCREAMING_SNAKE_CASE      ,   _SCREAMING_SNAKE_CASE						)
		def      UpperCAmelCase__    (      self						)			->	Matrix:




									"""simple docstring"""





									return Matrix(
									    [
									        [self.get_minor(_SCREAMING_SNAKE_CASE      ,   _SCREAMING_SNAKE_CASE						) for column in range(self.num_columns						)]
									        for row in range(self.num_rows						)
									    ]						)
		def      UpperCAmelCase__    (      self						)			->	Matrix:




									"""simple docstring"""





									return Matrix(
									    [
									        [
									            self.minors().rows[row][column]
									            if (row + column) % 2 == 0
									            else self.minors().rows[row][column] * -1
									            for column in range(self.minors().num_columns						)
									        ]
									        for row in range(self.minors().num_rows						)
									    ]						)
		def      UpperCAmelCase__    (      self						)			->	Matrix:




									"""simple docstring"""





									_UpperCAmelCase					=      [
									    [self.cofactors().rows[column][row] for column in range(self.num_columns						)]
									    for row in range(self.num_rows						)
									]
									return Matrix(_SCREAMING_SNAKE_CASE						)
		def      UpperCAmelCase__    (      self						)			->	Matrix:




									"""simple docstring"""





									_UpperCAmelCase					=      self.determinant()
									if not determinant:
																raise TypeError('Only matrices with a non-zero determinant have an inverse'						)
									return self.adjugate() * (1 / determinant)
		def __repr__(      self						)			->	str:




									"""simple docstring"""





									return str(self.rows						)
		def __str__(      self						)			->	str:




									"""simple docstring"""





									if self.num_rows == 0:
																return "[]"
									if self.num_rows == 1:
																return "[[" + ". ".join(str(self.rows[0]						)						) + "]]"
									return (
									    "["
									    + "\n ".join(
									        [
									            '[' + '. '.join([str(_SCREAMING_SNAKE_CASE						) for value in row]						) + '.]'
									            for row in self.rows
									        ]						)
									    + "]"
									)
		def      UpperCAmelCase__    (      self      ,   _SCREAMING_SNAKE_CASE      ,   _SCREAMING_SNAKE_CASE = None						)			->	None:




									"""simple docstring"""





									_UpperCAmelCase					=      TypeError('Row must be a list containing all ints and/or floats'						)
									if not isinstance(_SCREAMING_SNAKE_CASE      ,   _SCREAMING_SNAKE_CASE						):
																raise type_error
									for value in row:
																if not isinstance(_SCREAMING_SNAKE_CASE      ,   (int, float)						):
																							raise type_error
									if len(_SCREAMING_SNAKE_CASE						) != self.num_columns:
																raise ValueError(
																    'Row must be equal in length to the other rows in the matrix'						)
									if position is None:
																self.rows.append(_SCREAMING_SNAKE_CASE						)
									else:
																_UpperCAmelCase					=      self.rows[0:position] + [row] + self.rows[position:]
		def      UpperCAmelCase__    (      self      ,   _SCREAMING_SNAKE_CASE      ,   _SCREAMING_SNAKE_CASE = None						)			->	None:




									"""simple docstring"""





									_UpperCAmelCase					=      TypeError(
									    'Column must be a list containing all ints and/or floats'						)
									if not isinstance(_SCREAMING_SNAKE_CASE      ,   _SCREAMING_SNAKE_CASE						):
																raise type_error
									for value in column:
																if not isinstance(_SCREAMING_SNAKE_CASE      ,   (int, float)						):
																							raise type_error
									if len(_SCREAMING_SNAKE_CASE						) != self.num_rows:
																raise ValueError(
																    'Column must be equal in length to the other columns in the matrix'						)
									if position is None:
																_UpperCAmelCase					=      [self.rows[i] + [column[i]] for i in range(self.num_rows						)]
									else:
																_UpperCAmelCase					=      [
																    self.rows[i][0:position] + [column[i]] + self.rows[i][position:]
																    for i in range(self.num_rows						)
																]
		def __eq__(      self      ,   _SCREAMING_SNAKE_CASE						)			->	bool:




									"""simple docstring"""





									if not isinstance(_SCREAMING_SNAKE_CASE      ,   _SCREAMING_SNAKE_CASE						):
																return NotImplemented
									return self.rows == other.rows
		def __ne__(      self      ,   _SCREAMING_SNAKE_CASE						)			->	bool:




									"""simple docstring"""





									return not self == other
		def __neg__(      self						)			->	Matrix:




									"""simple docstring"""





									return self * -1
		def __add__(      self      ,   _SCREAMING_SNAKE_CASE						)			->	Matrix:




									"""simple docstring"""





									if self.order != other.order:
																raise ValueError('Addition requires matrices of the same order'						)
									return Matrix(
									    [
									        [self.rows[i][j] + other.rows[i][j] for j in range(self.num_columns						)]
									        for i in range(self.num_rows						)
									    ]						)
		def __sub__(      self      ,   _SCREAMING_SNAKE_CASE						)			->	Matrix:




									"""simple docstring"""





									if self.order != other.order:
																raise ValueError('Subtraction requires matrices of the same order'						)
									return Matrix(
									    [
									        [self.rows[i][j] - other.rows[i][j] for j in range(self.num_columns						)]
									        for i in range(self.num_rows						)
									    ]						)
		def __mul__(      self      ,   _SCREAMING_SNAKE_CASE						)			->	Matrix:




									"""simple docstring"""





									if isinstance(_SCREAMING_SNAKE_CASE      ,   (int, float)						):
																return Matrix(
																    [[int(element * other						) for element in row] for row in self.rows]						)
									elif isinstance(_SCREAMING_SNAKE_CASE      ,   _SCREAMING_SNAKE_CASE						):
																if self.num_columns != other.num_rows:
																							raise ValueError(
																							    'The number of columns in the first matrix must '
																							    'be equal to the number of rows in the second'						)
																return Matrix(
																    [
																        [Matrix.dot_product(_SCREAMING_SNAKE_CASE      ,   _SCREAMING_SNAKE_CASE						) for column in other.columns()]
																        for row in self.rows
																    ]						)
									else:
																raise TypeError(
																    'A Matrix can only be multiplied by an int, float, or another matrix'						)
		def __pow__(      self      ,   _SCREAMING_SNAKE_CASE						)			->	Matrix:




									"""simple docstring"""





									if not isinstance(_SCREAMING_SNAKE_CASE      ,   _SCREAMING_SNAKE_CASE						):
																raise TypeError('A Matrix can only be raised to the power of an int'						)
									if not self.is_square:
																raise ValueError('Only square matrices can be raised to a power'						)
									if other == 0:
																return self.identity()
									if other < 0:
																if self.is_invertable():
																							return self.inverse() ** (-other)
																raise ValueError(
																    'Only invertable matrices can be raised to a negative power'						)
									_UpperCAmelCase					=      self
									for _ in range(other - 1						):
																result *= self
									return result






		@classmethod
		def      UpperCAmelCase__    (      cls      ,   _SCREAMING_SNAKE_CASE      ,   _SCREAMING_SNAKE_CASE						)			->	int:




									"""simple docstring"""





									return sum(row[i] * column[i] for i in range(len(_SCREAMING_SNAKE_CASE						)						)						)


if __name__ == "__main__":
		import doctest

		doctest.testmod()




import coval  # From: git+https://github.com/ns-moosavi/coval.git # noqa: F401
from coval.conll import reader, util
from coval.eval import evaluator

import datasets


lowerCAmelCase__  :Optional[Any]             =							datasets.logging.get_logger(__name__)


lowerCAmelCase__  :str             =							'''\
@InProceedings{moosavi2019minimum,
    author = { Nafise Sadat Moosavi, Leo Born, Massimo Poesio and Michael Strube},
    title = {Using Automatically Extracted Minimum Spans to Disentangle Coreference Evaluation from Boundary Detection},
    year = {2019},
    booktitle = {Proceedings of the 57th Annual Meeting of
        the Association for Computational Linguistics (Volume 1: Long Papers)},
    publisher = {Association for Computational Linguistics},
    address = {Florence, Italy},
}

@inproceedings{10.3115/1072399.1072405,
author = {Vilain, Marc and Burger, John and Aberdeen, John and Connolly, Dennis and Hirschman, Lynette},
title = {A Model-Theoretic Coreference Scoring Scheme},
year = {1995},
isbn = {1558604022},
publisher = {Association for Computational Linguistics},
address = {USA},
url = {https://doi.org/10.3115/1072399.1072405},
doi = {10.3115/1072399.1072405},
booktitle = {Proceedings of the 6th Conference on Message Understanding},
pages = {45–52},
numpages = {8},
location = {Columbia, Maryland},
series = {MUC6 ’95}
}

@INPROCEEDINGS{Bagga98algorithmsfor,
    author = {Amit Bagga and Breck Baldwin},
    title = {Algorithms for Scoring Coreference Chains},
    booktitle = {In The First International Conference on Language Resources and Evaluation Workshop on Linguistics Coreference},
    year = {1998},
    pages = {563--566}
}

@INPROCEEDINGS{Luo05oncoreference,
    author = {Xiaoqiang Luo},
    title = {On coreference resolution performance metrics},
    booktitle = {In Proc. of HLT/EMNLP},
    year = {2005},
    pages = {25--32},
    publisher = {URL}
}

@inproceedings{moosavi-strube-2016-coreference,
    title = "Which Coreference Evaluation Metric Do You Trust? A Proposal for a Link-based Entity Aware Metric",
    author = "Moosavi, Nafise Sadat  and
      Strube, Michael",
    booktitle = "Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)",
    month = aug,
    year = "2016",
    address = "Berlin, Germany",
    publisher = "Association for Computational Linguistics",
    url = "https://www.aclweb.org/anthology/P16-1060",
    doi = "10.18653/v1/P16-1060",
    pages = "632--642",
}

'''

lowerCAmelCase__  :List[Any]             =							'''\
CoVal is a coreference evaluation tool for the CoNLL and ARRAU datasets which
implements of the common evaluation metrics including MUC [Vilain et al, 1995],
B-cubed [Bagga and Baldwin, 1998], CEAFe [Luo et al., 2005],
LEA [Moosavi and Strube, 2016] and the averaged CoNLL score
(the average of the F1 values of MUC, B-cubed and CEAFe)
[Denis and Baldridge, 2009a; Pradhan et al., 2011].

This wrapper of CoVal currently only work with CoNLL line format:
The CoNLL format has one word per line with all the annotation for this word in column separated by spaces:
Column	Type	Description
1	Document ID	This is a variation on the document filename
2	Part number	Some files are divided into multiple parts numbered as 000, 001, 002, ... etc.
3	Word number
4	Word itself	This is the token as segmented/tokenized in the Treebank. Initially the *_skel file contain the placeholder [WORD] which gets replaced by the actual token from the Treebank which is part of the OntoNotes release.
5	Part-of-Speech
6	Parse bit	This is the bracketed structure broken before the first open parenthesis in the parse, and the word/part-of-speech leaf replaced with a *. The full parse can be created by substituting the asterix with the "([pos] [word])" string (or leaf) and concatenating the items in the rows of that column.
7	Predicate lemma	The predicate lemma is mentioned for the rows for which we have semantic role information. All other rows are marked with a "-"
8	Predicate Frameset ID	This is the PropBank frameset ID of the predicate in Column 7.
9	Word sense	This is the word sense of the word in Column 3.
10	Speaker/Author	This is the speaker or author name where available. Mostly in Broadcast Conversation and Web Log data.
11	Named Entities	These columns identifies the spans representing various named entities.
12:N	Predicate Arguments	There is one column each of predicate argument structure information for the predicate mentioned in Column 7.
N	Coreference	Coreference chain information encoded in a parenthesis structure.
More informations on the format can be found here (section "*_conll File Format"): http://www.conll.cemantix.org/2012/data.html

Details on the evaluation on CoNLL can be found here: https://github.com/ns-moosavi/coval/blob/master/conll/README.md

CoVal code was written by @ns-moosavi.
Some parts are borrowed from https://github.com/clarkkev/deep-coref/blob/master/evaluation.py
The test suite is taken from https://github.com/conll/reference-coreference-scorers/
Mention evaluation and the test suite are added by @andreasvc.
Parsing CoNLL files is developed by Leo Born.
'''

lowerCAmelCase__  :Optional[int]             =							'''
Calculates coreference evaluation metrics.
Args:
    predictions: list of sentences. Each sentence is a list of word predictions to score in the CoNLL format.
        Each prediction is a word with its annotations as a string made of columns joined with spaces.
        Only columns 4, 5, 6 and the last column are used (word, POS, Pars and coreference annotation)
        See the details on the format in the description of the metric.
    references: list of sentences. Each sentence is a list of word reference to score in the CoNLL format.
        Each reference is a word with its annotations as a string made of columns joined with spaces.
        Only columns 4, 5, 6 and the last column are used (word, POS, Pars and coreference annotation)
        See the details on the format in the description of the metric.
    keep_singletons: After extracting all mentions of key or system files,
        mentions whose corresponding coreference chain is of size one,
        are considered as singletons. The default evaluation mode will include
        singletons in evaluations if they are included in the key or the system files.
        By setting \'keep_singletons=False\', all singletons in the key and system files
        will be excluded from the evaluation.
    NP_only: Most of the recent coreference resolvers only resolve NP mentions and
        leave out the resolution of VPs. By setting the \'NP_only\' option, the scorer will only evaluate the resolution of NPs.
    min_span: By setting \'min_span\', the scorer reports the results based on automatically detected minimum spans.
        Minimum spans are determined using the MINA algorithm.

Returns:
    \'mentions\': mentions
    \'muc\': MUC metric [Vilain et al, 1995]
    \'bcub\': B-cubed [Bagga and Baldwin, 1998]
    \'ceafe\': CEAFe [Luo et al., 2005]
    \'lea\': LEA [Moosavi and Strube, 2016]
    \'conll_score\': averaged CoNLL score (the average of the F1 values of MUC, B-cubed and CEAFe)

Examples:

    >>> coval = datasets.load_metric(\'coval\')
    >>> words = [\'bc/cctv/00/cctv_0005   0   0       Thank   VBP  (TOP(S(VP*    thank  01   1    Xu_li  *           (V*)        *       -\',
    ... \'bc/cctv/00/cctv_0005   0   1         you   PRP        (NP*)      -    -   -    Xu_li  *        (ARG1*)   (ARG0*)   (116)\',
    ... \'bc/cctv/00/cctv_0005   0   2    everyone    NN        (NP*)      -    -   -    Xu_li  *    (ARGM-DIS*)        *    (116)\',
    ... \'bc/cctv/00/cctv_0005   0   3         for    IN        (PP*       -    -   -    Xu_li  *        (ARG2*         *       -\',
    ... \'bc/cctv/00/cctv_0005   0   4    watching   VBG   (S(VP*))))   watch  01   1    Xu_li  *             *)      (V*)      -\',
    ... \'bc/cctv/00/cctv_0005   0   5           .     .          *))      -    -   -    Xu_li  *             *         *       -\']
    >>> references = [words]
    >>> predictions = [words]
    >>> results = coval.compute(predictions=predictions, references=references)
    >>> print(results) # doctest:+ELLIPSIS
    {\'mentions/recall\': 1.0,[...] \'conll_score\': 100.0}
'''

def 	lowerCAmelCase__			(      a__:		int      ,  a__:		int      ,  a__:		Dict=False      ,  a__:		str=False      ,  a__:		Optional[int]=True      ,  a__:		Any=False      ,  a__:		str="dummy_doc"	)  ->		Optional[Any]:


							'''simple docstring'''





							_UpperCAmelCase					=      {doc: key_lines}
							_UpperCAmelCase					=      {doc: sys_lines}

							_UpperCAmelCase					=      {}

							_UpperCAmelCase					=      0
							_UpperCAmelCase					=      0
							_UpperCAmelCase					=      0
							_UpperCAmelCase					=      0
							_UpperCAmelCase					=      0
							_UpperCAmelCase					=      0

							_UpperCAmelCase		,	_UpperCAmelCase					=      reader.get_doc_mentions(a__      ,  key_doc_lines[doc]      ,  a__	)
							key_singletons_num += singletons_num

							if NP_only or min_span:
														_UpperCAmelCase					=      reader.set_annotated_parse_trees(a__      ,  key_doc_lines[doc]      ,  a__      ,  a__	)

							_UpperCAmelCase		,	_UpperCAmelCase					=      reader.get_doc_mentions(a__      ,  sys_doc_lines[doc]      ,  a__	)
							sys_singletons_num += singletons_num

							if NP_only or min_span:
														_UpperCAmelCase					=      reader.set_annotated_parse_trees(a__      ,  key_doc_lines[doc]      ,  a__      ,  a__	)

							if remove_nested:
														_UpperCAmelCase		,	_UpperCAmelCase					=      reader.remove_nested_coref_mentions(a__      ,  a__	)
														key_nested_coref_num += nested_mentions
														key_removed_nested_clusters += removed_clusters

														_UpperCAmelCase		,	_UpperCAmelCase					=      reader.remove_nested_coref_mentions(a__      ,  a__	)
														sys_nested_coref_num += nested_mentions
														sys_removed_nested_clusters += removed_clusters

							_UpperCAmelCase					=      reader.get_mention_assignments(a__      ,  a__	)
							_UpperCAmelCase					=      reader.get_mention_assignments(a__      ,  a__	)

							_UpperCAmelCase					=      (key_clusters, sys_clusters, key_mention_sys_cluster, sys_mention_key_cluster)

							if remove_nested:
														logger.info(
														    'Number of removed nested coreferring mentions in the key '
														    F'''annotation: {key_nested_coref_num}; and system annotation: {sys_nested_coref_num}'''	)
														logger.info(
														    'Number of resulting singleton clusters in the key '
														    F'''annotation: {key_removed_nested_clusters}; and system annotation: {sys_removed_nested_clusters}'''	)

							if not keep_singletons:
														logger.info(
														    F'''{key_singletons_num:d} and {sys_singletons_num:d} singletons are removed from the key and system '''
														    'files, respectively'	)

							return doc_coref_infos

def 	lowerCAmelCase__			(      a__:		Any      ,  a__:		List[str]      ,  a__:		List[str]      ,  a__:		Optional[int]      ,  a__:		Optional[Any]      ,  a__:		Any      ,  a__:		Any	)  ->		Union[str, Any]:


							'''simple docstring'''





							_UpperCAmelCase					=      get_coref_infos(a__      ,  a__      ,  a__      ,  a__      ,  a__      ,  a__	)

							_UpperCAmelCase					=      {}
							_UpperCAmelCase					=      0
							_UpperCAmelCase					=      0

							for name, metric in metrics:
														_UpperCAmelCase		,	_UpperCAmelCase		,	_UpperCAmelCase					=      evaluator.evaluate_documents(a__      ,  a__      ,  beta=1	)
														if name in ["muc", "bcub", "ceafe"]:
																					conll += fa
																					conll_subparts_num += 1
														output_scores.update({F'''{name}/recall''': recall, F'''{name}/precision''': precision, F'''{name}/f1''': fa}	)

														logger.info(
														    name.ljust(1_0	)      ,  F'''Recall: {recall * 1_0_0:.2f}'''      ,  F''' Precision: {precision * 1_0_0:.2f}'''      ,  F''' F1: {fa * 1_0_0:.2f}'''      ,  )

							if conll_subparts_num == 3:
														_UpperCAmelCase					=      (conll / 3) * 1_0_0
														logger.info(F'''CoNLL score: {conll:.2f}'''	)
														output_scores.update({'conll_score': conll}	)

							return output_scores

def 	lowerCAmelCase__			(      a__:		Union[str, Any]	)  ->		Dict:


							'''simple docstring'''





							_UpperCAmelCase					=      False
							for line in key_lines:
														if not line.startswith('#'	):
																					if len(line.split()	) > 6:
																												_UpperCAmelCase					=      line.split()[5]
																												if not parse_col == "-":
																																			_UpperCAmelCase					=      True
																																			break
																												else:
																																			break
							return has_gold_parse







@datasets.utils.file_utils.add_start_docstrings(_DESCRIPTION   ,				_KWARGS_DESCRIPTION      )
class 		__a				(    datasets.Metric      ):
		def      UpperCAmelCase__    (      self						)			->	List[Any]:




									"""simple docstring"""





									return datasets.MetricInfo(
									    description=_DESCRIPTION      ,   citation=_CITATION      ,   inputs_description=_KWARGS_DESCRIPTION      ,   features=datasets.Features(
									        {
									            'predictions': datasets.Sequence(datasets.Value('string'						)						),
									            'references': datasets.Sequence(datasets.Value('string'						)						),
									        }						)      ,   codebase_urls=['https://github.com/ns-moosavi/coval']      ,   reference_urls=[
									        'https://github.com/ns-moosavi/coval',
									        'https://www.aclweb.org/anthology/P16-1060',
									        'http://www.conll.cemantix.org/2012/data.html',
									    ]      ,   )






		def      UpperCAmelCase__    (      self      ,   _SCREAMING_SNAKE_CASE      ,   _SCREAMING_SNAKE_CASE      ,   _SCREAMING_SNAKE_CASE=True      ,   _SCREAMING_SNAKE_CASE=False      ,   _SCREAMING_SNAKE_CASE=False      ,   _SCREAMING_SNAKE_CASE=False						)			->	str:




									"""simple docstring"""





									_UpperCAmelCase					=      [
									    ('mentions', evaluator.mentions),
									    ('muc', evaluator.muc),
									    ('bcub', evaluator.b_cubed),
									    ('ceafe', evaluator.ceafe),
									    ('lea', evaluator.lea),
									]

									if min_span:
																_UpperCAmelCase					=      util.check_gold_parse_annotation(_SCREAMING_SNAKE_CASE						)
																if not has_gold_parse:
																							raise NotImplementedError('References should have gold parse annotation to use \'min_span\'.'						)
																							# util.parse_key_file(key_file)
																							# key_file = key_file + ".parsed"

									_UpperCAmelCase					=      evaluate(
									    key_lines=_SCREAMING_SNAKE_CASE      ,   sys_lines=_SCREAMING_SNAKE_CASE      ,   metrics=_SCREAMING_SNAKE_CASE      ,   NP_only=_SCREAMING_SNAKE_CASE      ,   remove_nested=_SCREAMING_SNAKE_CASE      ,   keep_singletons=_SCREAMING_SNAKE_CASE      ,   min_span=_SCREAMING_SNAKE_CASE      ,   )

									return score
