
'''simple docstring'''






import math_equivalence  # From: git+https://github.com/hendrycks/math.git

import datasets


A			      =      '\\n@article{hendrycksmath2021,\n  title={Measuring Mathematical Problem Solving With the MATH Dataset},\n  author={Dan Hendrycks\n    and Collin Burns\n    and Saurav Kadavath\n    and Akul Arora\n    and Steven Basart\n    and Eric Tang\n    and Dawn Song\n    and Jacob Steinhardt},\n  journal={arXiv preprint arXiv:2103.03874},\n  year={2021}\n}\n'


A			      =      '\\nThis metric is used to assess performance on the Mathematics Aptitude Test of Heuristics (MATH) dataset.\nIt first canonicalizes the inputs (e.g., converting "1/2" to "\\frac{1}{2}") and then computes accuracy.\n'


A			      =      R'\nCalculates accuracy after canonicalizing inputs.\n\nArgs:\n    predictions: list of predictions to score. Each prediction\n        is a string that contains natural language and LaTex.\n    references: list of reference for each prediction. Each\n        reference is a string that contains natural language\n        and LaTex.\nReturns:\n    accuracy: accuracy after canonicalizing inputs\n        (e.g., converting "1/2" to "\\frac{1}{2}")\n\nExamples:\n    >>> metric = datasets.load_metric("competition_math")\n    >>> results = metric.compute(references=["\\frac{1}{2}"], predictions=["1/2"])\n    >>> print(results)\n    {\'accuracy\': 1.0}\n'




@datasets.utils.file_utils.add_end_docstrings(_DESCRIPTION    ,   _KWARGS_DESCRIPTION)
class     __snake_case		(   datasets.Metric):
					def     UpperCAmelCase_							(     self      ):

									"""simple docstring"""


									return datasets.MetricInfo(
									    description=_DESCRIPTION,    citation=_CITATION,    inputs_description=_KWARGS_DESCRIPTION,    features=datasets.Features(
									        {
									            'predictions': datasets.Value('string'      ),
									            'references': datasets.Value('string'      ),
									        }      ),    homepage='https://github.com/hendrycks/math',    codebase_urls=['https://github.com/hendrycks/math'],    )




					def     UpperCAmelCase_							(     self,    A,    A      ):

									"""simple docstring"""


									lowerCamelCase					:			List[str]									= 0.0
									for i, j in zip(A,    A      ):
													n_correct += 1.0 if math_equivalence.is_equiv(A,    A      ) else 0.0
									lowerCamelCase					:			str									= n_correct / len(A      )
									return {
									    "accuracy": accuracy,
									}


'''simple docstring'''






import string

# frequency taken from https://en.wikipedia.org/wiki/Letter_frequency
A			      =      {
    'E': 12.70,
    'T': 9.06,
    'A': 8.17,
    'O': 7.51,
    'I': 6.97,
    'N': 6.75,
    'S': 6.33,
    'H': 6.09,
    'R': 5.99,
    'D': 4.25,
    'L': 4.03,
    'C': 2.78,
    'U': 2.76,
    'M': 2.41,
    'W': 2.36,
    'F': 2.23,
    'G': 2.02,
    'Y': 1.97,
    'P': 1.93,
    'B': 1.29,
    'V': 0.98,
    'K': 0.77,
    'J': 0.15,
    'X': 0.15,
    'Q': 0.10,
    'Z': 0.07,
}
A			      =      'ETAOINSHRDLCUMWFGYPBVKJXQZ'
A			      =      'ABCDEFGHIJKLMNOPQRSTUVWXYZ'





def    UpperCAmelCase							(  UpperCAmelCase__							:							str):
				lowerCamelCase					:			Optional[Any]									= {letter: 0 for letter in string.ascii_uppercase}
				for letter in message.upper():
								if letter in LETTERS:
												letter_count[letter] += 1

				return letter_count





def    UpperCAmelCase							(  UpperCAmelCase__							:							tuple):
				return x[0]





def    UpperCAmelCase							(  UpperCAmelCase__							:							str):
				lowerCamelCase					:			Optional[Any]									= get_letter_count(UpperCAmelCase__)
				lowerCamelCase					:			dict[int, list[str]]									= {
				    freq: [] for letter, freq in letter_to_freq.items()
				}
				for letter in LETTERS:
								freq_to_letter[letter_to_freq[letter]].append(UpperCAmelCase__)

				lowerCamelCase					:			dict[int, str]									= {}

				for freq in freq_to_letter:
								freq_to_letter[freq].sort(key=ETAOIN.find       ,							reverse=UpperCAmelCase__)
								lowerCamelCase					:			int									= ''.join(freq_to_letter[freq])

				lowerCamelCase					:			Any									= list(freq_to_letter_str.items())
				freq_pairs.sort(key=UpperCAmelCase__       ,							reverse=UpperCAmelCase__)

				lowerCamelCase					:			list[str]									= [freq_pair[1] for freq_pair in freq_pairs]

				return "".join(UpperCAmelCase__)





def    UpperCAmelCase							(  UpperCAmelCase__							:							str):
				lowerCamelCase					:			Optional[Any]									= get_frequency_order(UpperCAmelCase__)
				lowerCamelCase					:			Optional[Any]									= 0
				for common_letter in ETAOIN[:6]:
								if common_letter in freq_order[:6]:
												match_score += 1

				for uncommon_letter in ETAOIN[-6:]:
								if uncommon_letter in freq_order[-6:]:
												match_score += 1

				return match_score


if __name__ == "__main__":
					import doctest

					doctest.testmod()
