


'''simple docstring'''






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


__A   :    str											= "\\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"

__A   :    List[Any]											= "\\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"

__A   :    Tuple											= "\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   __snake_case			(  datasets.Metric):







    """simple docstring"""



    def __lowercase  (  self       :    Any						)  ->    List[str]:
      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       :    List[Any]       ,		lowerCamelCase       :    Tuple       ,		lowerCamelCase       :    List[str]       ,		lowerCamelCase       :    Optional[int]=None       ,		lowerCamelCase       :    Optional[Any]=None       ,		lowerCamelCase       :    Dict=None       ,		lowerCamelCase       :    str=None       ,		lowerCamelCase       :    Optional[Any]="auto"       ,		lowerCamelCase       :    Tuple=-1       ,		lowerCamelCase       :    Union[str, Any]=0.9       ,		lowerCamelCase       :    str=5       ,		lowerCamelCase       :    List[str]=5_00       ,		lowerCamelCase       :    Optional[int]="gpt2-large"       ,		lowerCamelCase       :    List[str]=-1       ,		lowerCamelCase       :    str=10_24       ,		lowerCamelCase       :    Optional[int]=25       ,		lowerCamelCase       :    Optional[int]=5       ,		lowerCamelCase       :    Tuple=True       ,		lowerCamelCase       :    Optional[Any]=25       ,		)  ->    str:
      lowerCAmelCase_     : Any     =  compute_mauve(
          p_text=lowerCamelCase       ,		q_text=lowerCamelCase       ,		p_features=lowerCamelCase       ,		q_features=lowerCamelCase       ,		p_tokens=lowerCamelCase       ,		q_tokens=lowerCamelCase       ,		num_buckets=lowerCamelCase       ,		pca_max_data=lowerCamelCase       ,		kmeans_explained_var=lowerCamelCase       ,		kmeans_num_redo=lowerCamelCase       ,		kmeans_max_iter=lowerCamelCase       ,		featurize_model_name=lowerCamelCase       ,		device_id=lowerCamelCase       ,		max_text_length=lowerCamelCase       ,		divergence_curve_discretization_size=lowerCamelCase       ,		mauve_scaling_factor=lowerCamelCase       ,		verbose=lowerCamelCase       ,		seed=lowerCamelCase       ,		)
      return out







'''simple docstring'''






from collections.abc import Callable






class   __snake_case			:







    """simple docstring"""



    def __init__(  self       :    Tuple       ,		lowerCamelCase       :    Callable | None = None						)  ->    None:
      # Stores actual heap items.
      lowerCAmelCase_     : list     =  []
      # Stores indexes of each item for supporting updates and deletion.
      lowerCAmelCase_     : dict     =  {}
      # Stores current size of heap.
      lowerCAmelCase_     : List[Any]     =  0
      # Stores function used to evaluate the score of an item on which basis ordering
      # will be done.
      lowerCAmelCase_     : Tuple     =  key or (lambda lowerCamelCase						: x)

    def __lowercase  (  self       :    Optional[Any]       ,		lowerCamelCase       :    int						)  ->    int | None:
      return int((i - 1) / 2						) if i > 0 else None

    def __lowercase  (  self       :    Union[str, Any]       ,		lowerCamelCase       :    int						)  ->    int | None:
      lowerCAmelCase_     : List[str]     =  int(2 * i + 1						)
      return left if 0 < left < self.size else None

    def __lowercase  (  self       :    Optional[Any]       ,		lowerCamelCase       :    int						)  ->    int | None:
      lowerCAmelCase_     : List[Any]     =  int(2 * i + 2						)
      return right if 0 < right < self.size else None

    def __lowercase  (  self       :    List[str]       ,		lowerCamelCase       :    int       ,		lowerCamelCase       :    int						)  ->    None:
      lowerCAmelCase_,				lowerCAmelCase_     : Union[str, Any]     =  (
          self.pos_map[self.arr[j][0]],
          self.pos_map[self.arr[i][0]],
      )
      # Then swap the items in the list.
      lowerCAmelCase_,				lowerCAmelCase_     : List[Any]     =  self.arr[j], self.arr[i]

    def __lowercase  (  self       :    Tuple       ,		lowerCamelCase       :    int       ,		lowerCamelCase       :    int						)  ->    bool:
      return self.arr[i][1] < self.arr[j][1]

    def __lowercase  (  self       :    int       ,		lowerCamelCase       :    int						)  ->    int:
      lowerCAmelCase_     : List[str]     =  self._left(lowerCamelCase						)
      lowerCAmelCase_     : Optional[Any]     =  self._right(lowerCamelCase						)
      lowerCAmelCase_     : Tuple     =  i

      if left is not None and not self._cmp(lowerCamelCase       ,		lowerCamelCase						):
        lowerCAmelCase_     : int     =  left
      if right is not None and not self._cmp(lowerCamelCase       ,		lowerCamelCase						):
        lowerCAmelCase_     : Optional[Any]     =  right

      return valid_parent

    def __lowercase  (  self       :    List[Any]       ,		lowerCamelCase       :    int						)  ->    None:
      lowerCAmelCase_     : Tuple     =  self._parent(lowerCamelCase						)
      while parent is not None and not self._cmp(lowerCamelCase       ,		lowerCamelCase						):
        self._swap(lowerCamelCase       ,		lowerCamelCase						)
        lowerCAmelCase_,				lowerCAmelCase_     : str     =  parent, self._parent(lowerCamelCase						)

    def __lowercase  (  self       :    Tuple       ,		lowerCamelCase       :    int						)  ->    None:
      lowerCAmelCase_     : Optional[Any]     =  self._get_valid_parent(lowerCamelCase						)
      while valid_parent != index:
        self._swap(lowerCamelCase       ,		lowerCamelCase						)
        lowerCAmelCase_,				lowerCAmelCase_     : int     =  valid_parent, self._get_valid_parent(lowerCamelCase						)

    def __lowercase  (  self       :    Optional[Any]       ,		lowerCamelCase       :    int       ,		lowerCamelCase       :    int						)  ->    None:
      if item not in self.pos_map:
        return
      lowerCAmelCase_     : Dict     =  self.pos_map[item]
      lowerCAmelCase_     : Dict     =  [item, self.key(lowerCamelCase						)]
      # Make sure heap is right in both up and down direction.
      # Ideally only one of them will make any change.
      self._heapify_up(lowerCamelCase						)
      self._heapify_down(lowerCamelCase						)

    def __lowercase  (  self       :    int       ,		lowerCamelCase       :    int						)  ->    None:
      if item not in self.pos_map:
        return
      lowerCAmelCase_     : List[str]     =  self.pos_map[item]
      del self.pos_map[item]
      lowerCAmelCase_     : Tuple     =  self.arr[self.size - 1]
      lowerCAmelCase_     : List[str]     =  index
      self.size -= 1
      # Make sure heap is right in both up and down direction. Ideally only one
      # of them will make any change- so no performance loss in calling both.
      if self.size > index:
        self._heapify_up(lowerCamelCase						)
        self._heapify_down(lowerCamelCase						)

    def __lowercase  (  self       :    List[Any]       ,		lowerCamelCase       :    int       ,		lowerCamelCase       :    int						)  ->    None:
      lowerCAmelCase_     : Any     =  len(self.arr						)
      if arr_len == self.size:
        self.arr.append([item, self.key(lowerCamelCase						)]						)
      else:
        lowerCAmelCase_     : str     =  [item, self.key(lowerCamelCase						)]
      lowerCAmelCase_     : Optional[Any]     =  self.size
      self.size += 1
      self._heapify_up(self.size - 1						)

    def __lowercase  (  self       :    str						)  ->    tuple | None:
      return self.arr[0] if self.size else None





    def __lowercase  (  self       :    Optional[Any]						)  ->    tuple | None:
      lowerCAmelCase_     : int     =  self.get_top()
      if top_item_tuple:
        self.delete_item(top_item_tuple[0]						)
      return top_item_tuple







def 							UpperCamelCase_     (       ):
  '''simple docstring'''







if __name__ == "__main__":
  import doctest

  doctest.testmod()



