





import datasets

from .evaluate import evaluate


__lowerCamelCase      :    Union[str, Any]   		=   """\\n@inproceedings{Rajpurkar2016SQuAD10,\n  title={SQuAD: 100, 000+ Questions for Machine Comprehension of Text},\n  author={Pranav Rajpurkar and Jian Zhang and Konstantin Lopyrev and Percy Liang},\n  booktitle={EMNLP},\n  year={2016}\n}\n"""

__lowerCamelCase      :    List[str]   		=   """\nThis metric wrap the official scoring script for version 1 of the Stanford Question Answering Dataset (SQuAD).\n\nStanford Question Answering Dataset (SQuAD) is a reading comprehension dataset, consisting of questions posed by\ncrowdworkers on a set of Wikipedia articles, where the answer to every question is a segment of text, or span,\nfrom the corresponding reading passage, or the question might be unanswerable.\n"""

__lowerCamelCase      :    Tuple   		=   """\nComputes SQuAD scores (F1 and EM).\nArgs:\n    predictions: List of question-answers dictionaries with the following key-values:\n        - \'id\': id of the question-answer pair as given in the references (see below)\n        - \'prediction_text\': the text of the answer\n    references: List of question-answers dictionaries with the following key-values:\n        - \'id\': id of the question-answer pair (see above),\n        - \'answers\': a Dict in the SQuAD dataset format\n            {\n                \'text\': list of possible texts for the answer, as a list of strings\n                \'answer_start\': list of start positions for the answer, as a list of ints\n            }\n            Note that answer_start values are not taken into account to compute the metric.\nReturns:\n    \'exact_match\': Exact match (the normalized answer exactly match the gold answer)\n    \'f1\': The F-score of predicted tokens versus the gold answer\nExamples:\n\n    >>> predictions = [{\'prediction_text\': \'1976\', \'id\': \'56e10a3be3433e1400422b22\'}]\n    >>> references = [{\'answers\': {\'answer_start\': [97], \'text\': [\'1976\']}, \'id\': \'56e10a3be3433e1400422b22\'}]\n    >>> squad_metric = datasets.load_metric(\"squad\")\n    >>> results = squad_metric.compute(predictions=predictions, references=references)\n    >>> print(results)\n    {\'exact_match\': 100.0, \'f1\': 100.0}\n"""



@datasets.utils.file_utils.add_start_docstrings(_DESCRIPTION				,     _KWARGS_DESCRIPTION		)
class 							SCREAMING_SNAKE_CASE__		(       datasets.Metric		):





					"""simple docstring"""






					def  _lowercase  (      self  :						Union[str, Any] ):
						return datasets.MetricInfo(
						    description=_DESCRIPTION							,	citation=_CITATION							,	inputs_description=_KWARGS_DESCRIPTION							,	features=datasets.Features(
						        {
						            "predictions": {"id": datasets.Value("string" ), "prediction_text": datasets.Value("string" )},
						            "references": {
						                "id": datasets.Value("string" ),
						                "answers": datasets.features.Sequence(
						                    {
						                        "text": datasets.Value("string" ),
						                        "answer_start": datasets.Value("int32" ),
						                    } ),
						            },
						        } )							,	codebase_urls=["https://rajpurkar.github.io/SQuAD-explorer/"]							,	reference_urls=["https://rajpurkar.github.io/SQuAD-explorer/"]							,	)






					def  _lowercase  (      self  :						List[str]							,	__A  :						List[Any]							,	__A  :						Dict ):
						snake_case__				:   int     =						{prediction["id"]: prediction["prediction_text"] for prediction in predictions}
						snake_case__				:   Dict     =						[
						    {
						        "paragraphs": [
						            {
						                "qas": [
						                    {
						                        "answers": [{"text": answer_text} for answer_text in ref["answers"]["text"]],
						                        "id": ref["id"],
						                    }
						                    for ref in references
						                ]
						            }
						        ]
						    }
						]
						snake_case__				:   List[str]     =						evaluate(dataset=__A							,	predictions=__A )
						return score











import faiss  # noqa: F401 # Here to have a nice missing dependency error message early on
import numpy  # noqa: F401 # Here to have a nice missing dependency error message early on
import requests  # noqa: F401 # Here to have a nice missing dependency error message early on
import sklearn  # noqa: F401 # Here to have a nice missing dependency error message early on
import tqdm  # noqa: F401 # Here to have a nice missing dependency error message early on
from mauve import compute_mauve  # From: mauve-text

import datasets


__lowerCamelCase      :    Optional[int]   		=   """\
@inproceedings{pillutla-etal:mauve:neurips2021,
  title={MAUVE: Measuring the Gap Between Neural Text and Human Text using Divergence Frontiers},
  author={Pillutla, Krishna and Swayamdipta, Swabha and Zellers, Rowan and Thickstun, John and Welleck, Sean and Choi, Yejin and Harchaoui, Zaid},
  booktitle = {NeurIPS},
  year      = {2021}
}

"""

__lowerCamelCase      :    str   		=   """\
MAUVE is a library built on PyTorch and HuggingFace Transformers to measure the gap between neural text and human text with the eponymous MAUVE measure.

MAUVE summarizes both Type I and Type II errors measured softly using Kullback–Leibler (KL) divergences.

For details, see the MAUVE paper: https://arxiv.org/abs/2102.01454 (Neurips, 2021).

This metrics is a wrapper around the official implementation of MAUVE:
https://github.com/krishnap25/mauve
"""

__lowerCamelCase      :    str   		=   """
Calculates MAUVE scores between two lists of generated text and reference text.
Args:
    predictions: list of generated text to score. Each predictions
        should be a string with tokens separated by spaces.
    references: list of reference for each prediction. Each
        reference should be a string with tokens separated by spaces.
Optional Args:
    num_buckets: the size of the histogram to quantize P and Q. Options: 'auto' (default) or an integer
    pca_max_data: the number data points to use for PCA dimensionality reduction prior to clustering. If -1, use all the data. Default -1
    kmeans_explained_var: amount of variance of the data to keep in dimensionality reduction by PCA. Default 0.9
    kmeans_num_redo: number of times to redo k-means clustering (the best objective is kept). Default 5
    kmeans_max_iter: maximum number of k-means iterations. Default 500
    featurize_model_name: name of the model from which features are obtained. Default 'gpt2-large' Use one of ['gpt2', 'gpt2-medium', 'gpt2-large', 'gpt2-xl'].
    device_id: Device for featurization. Supply a GPU id (e.g. 0 or 3) to use GPU. If no GPU with this id is found, use CPU
    max_text_length: maximum number of tokens to consider. Default 1024
    divergence_curve_discretization_size: Number of points to consider on the divergence curve. Default 25
    mauve_scaling_factor: \"c\" from the paper. Default 5.
    verbose: If True (default), print running time updates
    seed: random seed to initialize k-means cluster assignments.
Returns:
    mauve: MAUVE score, a number between 0 and 1. Larger values indicate that P and Q are closer,
    frontier_integral: Frontier Integral, a number between 0 and 1. Smaller values indicate that P and Q are closer,
    divergence_curve: a numpy.ndarray of shape (m, 2); plot it with matplotlib to view the divergence curve,
    p_hist: a discrete distribution, which is a quantized version of the text distribution p_text,
    q_hist: same as above, but with q_text.
Examples:

    >>> # faiss segfaults in doctest for some reason, so the .compute call is not tested with doctest
    >>> import datasets
    >>> mauve = datasets.load_metric('mauve')
    >>> predictions = [\"hello there\", \"general kenobi\"]
    >>> references = [\"hello there\", \"general kenobi\"]
    >>> out = mauve.compute(predictions=predictions, references=references) # doctest: +SKIP
    >>> print(out.mauve) # doctest: +SKIP
    1.0
"""



@datasets.utils.file_utils.add_start_docstrings(_DESCRIPTION				,     _KWARGS_DESCRIPTION		)
class 							SCREAMING_SNAKE_CASE__		(       datasets.Metric		):





					"""simple docstring"""






					def  _lowercase  (      self  :						Dict ):
						return datasets.MetricInfo(
						    description=_DESCRIPTION							,	citation=_CITATION							,	homepage="https://github.com/krishnap25/mauve"							,	inputs_description=_KWARGS_DESCRIPTION							,	features=datasets.Features(
						        {
						            "predictions": datasets.Value("string"							,	id="sequence" ),
						            "references": datasets.Value("string"							,	id="sequence" ),
						        } )							,	codebase_urls=["https://github.com/krishnap25/mauve"]							,	reference_urls=[
						        "https://arxiv.org/abs/2102.01454",
						        "https://github.com/krishnap25/mauve",
						    ]							,	)






					def  _lowercase  (      self  :						Union[str, Any]							,	__A  :						Dict							,	__A  :						List[str]							,	__A  :						int=None							,	__A  :						List[Any]=None							,	__A  :						Optional[int]=None							,	__A  :						List[Any]=None							,	__A  :						Union[str, Any]="auto"							,	__A  :						Optional[Any]=-1							,	__A  :						Optional[Any]=0.9							,	__A  :						Any=5							,	__A  :						List[Any]=5_0_0							,	__A  :						Tuple="gpt2-large"							,	__A  :						Optional[Any]=-1							,	__A  :						str=1_0_2_4							,	__A  :						Tuple=2_5							,	__A  :						str=5							,	__A  :						Optional[int]=True							,	__A  :						Any=2_5							,	):
						snake_case__				:   List[Any]     =						compute_mauve(
						    p_text=__A							,	q_text=__A							,	p_features=__A							,	q_features=__A							,	p_tokens=__A							,	q_tokens=__A							,	num_buckets=__A							,	pca_max_data=__A							,	kmeans_explained_var=__A							,	kmeans_num_redo=__A							,	kmeans_max_iter=__A							,	featurize_model_name=__A							,	device_id=__A							,	max_text_length=__A							,	divergence_curve_discretization_size=__A							,	mauve_scaling_factor=__A							,	verbose=__A							,	seed=__A							,	)
						return out



