

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


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

lowercase_     :   str 				=				'\\nMAUVE is a library built on PyTorch and HuggingFace Transformers to measure the gap between neural text and human text with the eponymous MAUVE measure.\n\nMAUVE summarizes both Type I and Type II errors measured softly using Kullback–Leibler (KL) divergences.\n\nFor details, see the MAUVE paper: https://arxiv.org/abs/2102.01454 (Neurips, 2021).\n\nThis metrics is a wrapper around the official implementation of MAUVE:\nhttps://github.com/krishnap25/mauve\n'

lowercase_     :   List[Any] 				=				'\nCalculates MAUVE scores between two lists of generated text and reference text.\nArgs:\n    predictions: list of generated text to score. Each predictions\n        should be a string with tokens separated by spaces.\n    references: list of reference for each prediction. Each\n        reference should be a string with tokens separated by spaces.\nOptional Args:\n    num_buckets: the size of the histogram to quantize P and Q. Options: \'auto\' (default) or an integer\n    pca_max_data: the number data points to use for PCA dimensionality reduction prior to clustering. If -1, use all the data. Default -1\n    kmeans_explained_var: amount of variance of the data to keep in dimensionality reduction by PCA. Default 0.9\n    kmeans_num_redo: number of times to redo k-means clustering (the best objective is kept). Default 5\n    kmeans_max_iter: maximum number of k-means iterations. Default 500\n    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\'].\n    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\n    max_text_length: maximum number of tokens to consider. Default 1024\n    divergence_curve_discretization_size: Number of points to consider on the divergence curve. Default 25\n    mauve_scaling_factor: "c" from the paper. Default 5.\n    verbose: If True (default), print running time updates\n    seed: random seed to initialize k-means cluster assignments.\nReturns:\n    mauve: MAUVE score, a number between 0 and 1. Larger values indicate that P and Q are closer,\n    frontier_integral: Frontier Integral, a number between 0 and 1. Smaller values indicate that P and Q are closer,\n    divergence_curve: a numpy.ndarray of shape (m, 2); plot it with matplotlib to view the divergence curve,\n    p_hist: a discrete distribution, which is a quantized version of the text distribution p_text,\n    q_hist: same as above, but with q_text.\nExamples:\n\n    >>> # faiss segfaults in doctest for some reason, so the .compute call is not tested with doctest\n    >>> import datasets\n    >>> mauve = datasets.load_metric(\'mauve\')\n    >>> predictions = ["hello there", "general kenobi"]\n    >>> references = ["hello there", "general kenobi"]\n    >>> out = mauve.compute(predictions=predictions, references=references) # doctest: +SKIP\n    >>> print(out.mauve) # doctest: +SKIP\n    1.0\n'






@datasets.utils.file_utils.add_start_docstrings(_DESCRIPTION    ,     _KWARGS_DESCRIPTION    )
class 		_lowerCamelCase		(   datasets.Metric    ):
    def 						UpperCamelCase_				(  self   )       ->					List[Any]:
     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 						UpperCamelCase_				(  self , lowerCAmelCase , lowerCAmelCase , lowerCAmelCase=None , lowerCAmelCase=None , lowerCAmelCase=None , lowerCAmelCase=None , lowerCAmelCase="auto" , lowerCAmelCase=-1 , lowerCAmelCase=0.9 , lowerCAmelCase=5 , lowerCAmelCase=500 , lowerCAmelCase="gpt2-large" , lowerCAmelCase=-1 , lowerCAmelCase=1024 , lowerCAmelCase=25 , lowerCAmelCase=5 , lowerCAmelCase=True , lowerCAmelCase=25 , )       ->					List[Any]:
     SCREAMING_SNAKE_CASE__:   List[str]=      compute_mauve(
         p_text=UpperCAmelCase__ , q_text=UpperCAmelCase__ , p_features=UpperCAmelCase__ , q_features=UpperCAmelCase__ , p_tokens=UpperCAmelCase__ , q_tokens=UpperCAmelCase__ , num_buckets=UpperCAmelCase__ , pca_max_data=UpperCAmelCase__ , kmeans_explained_var=UpperCAmelCase__ , kmeans_num_redo=UpperCAmelCase__ , kmeans_max_iter=UpperCAmelCase__ , featurize_model_name=UpperCAmelCase__ , device_id=UpperCAmelCase__ , max_text_length=UpperCAmelCase__ , divergence_curve_discretization_size=UpperCAmelCase__ , mauve_scaling_factor=UpperCAmelCase__ , verbose=UpperCAmelCase__ , seed=UpperCAmelCase__ , )
     return out


# Lint as: python3
import dataclasses
import re
from dataclasses import dataclass
from functools import total_ordering
from typing import Optional, Union


lowercase_     :   str 				=				re.compile(R'^(?P<major>\d+)' R'\.(?P<minor>\d+)' R'\.(?P<patch>\d+)$')






@total_ordering
@dataclass
class 		_lowerCamelCase		:
    __a  =      42
    __a  =      None
    __a  =      None
    __a  =      None
    __a  =      None
    def 						UpperCamelCase_				(  self   )       ->					str:
     SCREAMING_SNAKE_CASE__,	SCREAMING_SNAKE_CASE__,	SCREAMING_SNAKE_CASE__:   int=      _str_to_version_tuple(self.version_str   )
    def __repr__(  self   )       ->					Dict:
     return f'{self.tuple[0]}.{self.tuple[1]}.{self.tuple[2]}'
    @property
    def 						UpperCamelCase_				(  self   )       ->					List[str]:
     return self.major, self.minor, self.patch
    def 						UpperCamelCase_				(  self , lowerCAmelCase   )       ->					Dict:
     if isinstance(lowerCAmelCase , lowerCAmelCase   ):
      return Version(lowerCAmelCase   )
     elif isinstance(lowerCAmelCase , lowerCAmelCase   ):
      return other
     raise TypeError(f'{other} (type {type(lowerCAmelCase   )}) cannot be compared to version.'   )
    def __eq__(  self , lowerCAmelCase   )       ->					Optional[int]:
     try:
      SCREAMING_SNAKE_CASE__:   List[str]=      self._validate_operand(lowerCAmelCase   )
     except (TypeError, ValueError):
      return False
     else:
      return self.tuple == other.tuple
    def __lt__(  self , lowerCAmelCase   )       ->					List[str]:
     SCREAMING_SNAKE_CASE__:   Optional[Any]=      self._validate_operand(lowerCAmelCase   )
     return self.tuple < other.tuple
    def __hash__(  self   )       ->					List[Any]:
     return hash(_version_tuple_to_str(self.tuple   )   )
    @classmethod
    def 						UpperCamelCase_				(  cls , lowerCAmelCase   )       ->					Tuple:
     SCREAMING_SNAKE_CASE__:   Dict=      {f.name for f in dataclasses.fields(cls   )}
     return cls(**{k: v for k, v in dic.items() if k in field_names}   )



    def 						UpperCamelCase_				(  self   )       ->					str:
     return self.version_str







def 			A__      (	snake_case_ :		int      ):
 SCREAMING_SNAKE_CASE__:   List[Any]=      _VERSION_REG.match(snake_case_      )
 if not res:
  raise ValueError(F'Invalid version \'{version_str}\'. Format should be x.y.z with {{x,y,z}} being digits.'      )
 return tuple(int(snake_case_      ) for v in [res.group('''major'''      ), res.group('''minor'''      ), res.group('''patch'''      )]      )







def 			A__      (	snake_case_ :		Union[str, Any]      ):
 return ".".join(str(snake_case_      ) for v in version_tuple      )

