





from jiwer import compute_measures

import datasets


_a						=   "\\n@inproceedings{inproceedings,\n    author = {Morris, Andrew and Maier, Viktoria and Green, Phil},\n    year = {2004},\n    month = {01},\n    pages = {},\n    title = {From WER and RIL to MER and WIL: improved evaluation measures for connected speech recognition.}\n}\n"

_a						=   "\\nWord error rate (WER) is a common metric of the performance of an automatic speech recognition system.\n\nThe general difficulty of measuring performance lies in the fact that the recognized word sequence can have a different length from the reference word sequence (supposedly the correct one). The WER is derived from the Levenshtein distance, working at the word level instead of the phoneme level. The WER is a valuable tool for comparing different systems as well as for evaluating improvements within one system. This kind of measurement, however, provides no details on the nature of translation errors and further work is therefore required to identify the main source(s) of error and to focus any research effort.\n\nThis problem is solved by first aligning the recognized word sequence with the reference (spoken) word sequence using dynamic string alignment. Examination of this issue is seen through a theory called the power law that states the correlation between perplexity and word error rate.\n\nWord error rate can then be computed as:\n\nWER = (S + D + I) / N = (S + D + I) / (S + D + C)\n\nwhere\n\nS is the number of substitutions,\nD is the number of deletions,\nI is the number of insertions,\nC is the number of correct words,\nN is the number of words in the reference (N=S+D+C).\n\nThis value indicates the average number of errors per reference word. The lower the value, the better the\nperformance of the ASR system with a WER of 0 being a perfect score.\n"

_a						=   "\nCompute WER score of transcribed segments against references.\n\nArgs:\n    references: List of references for each speech input.\n    predictions: List of transcriptions to score.\n    concatenate_texts (bool, default=False): Whether to concatenate all input texts or compute WER iteratively.\n\nReturns:\n    (float): the word error rate\n\nExamples:\n\n    >>> predictions = [\"this is the prediction\", \"there is an other sample\"]\n    >>> references = [\"this is the reference\", \"there is another one\"]\n    >>> wer = datasets.load_metric(\"wer\")\n    >>> wer_score = wer.compute(predictions=predictions, references=references)\n    >>> print(wer_score)\n    0.5\n"






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

			'''simple docstring'''







			def 	__lowerCamelCase       (					self							):



				'''simple docstring'''







				return datasets.MetricInfo(
				    description=_DESCRIPTION ,						citation=_CITATION ,						inputs_description=_KWARGS_DESCRIPTION ,						features=datasets.Features(
				        {
				            '''predictions''': datasets.Value('''string''' ,						id='''sequence'''							),
				            '''references''': datasets.Value('''string''' ,						id='''sequence'''							),
				        }							) ,						codebase_urls=['''https://github.com/jitsi/jiwer/'''] ,						reference_urls=[
				        '''https://en.wikipedia.org/wiki/Word_error_rate''',
				    ] ,						)





			def 	__lowerCamelCase       (					self ,						__lowerCAmelCase=None ,						__lowerCAmelCase=None ,						__lowerCAmelCase=False							):



				'''simple docstring'''







				if concatenate_texts:
					return compute_measures(__lowerCAmelCase ,						__lowerCAmelCase							)["wer"]
				else:
					lowerCamelCase__              =	0
					lowerCamelCase__              =	0
					for prediction, reference in zip(__lowerCAmelCase ,						__lowerCAmelCase							):
						lowerCamelCase__              =	compute_measures(__lowerCAmelCase ,						__lowerCAmelCase							)
						incorrect += measures["substitutions"] + measures["deletions"] + measures["insertions"]
						total += measures["substitutions"] + measures["deletions"] + measures["hits"]
					return incorrect / total










from math import sqrt





def lowerCAmelCase__(__snake_case							)       ->   bool:







	'''simple docstring'''







	assert isinstance(__snake_case ,__snake_case							) and (
	    number >= 0
	), "'number' must been an int and positive"

	lowerCamelCase__              =	True

	# 0 and 1 are none primes.
	if number <= 1:
		lowerCamelCase__              =	False

	for divisor in range(2 ,int(round(sqrt(__snake_case							)							)							) + 1							):
		# if 'number' divisible by 'divisor' then sets 'status'
		# of false and break up the loop.
		if number % divisor == 0:
			lowerCamelCase__              =	False
			break

    # precondition
	assert isinstance(__snake_case ,__snake_case							), "'status' must been from type bool"

	return status





def lowerCAmelCase__(__snake_case							)       ->   Any:







	'''simple docstring'''







	assert isinstance(__snake_case ,__snake_case							) and (n > 2), "'N' must been an int and > 2"

	# beginList: contains all natural numbers from 2 up to N
	lowerCamelCase__              =	list(range(2 ,n + 1							)							)

	lowerCamelCase__              =	[]  # this list will be returns.

	# actual sieve of erathostenes
	for i in range(len(__snake_case							)							):
		for j in range(i + 1 ,len(__snake_case							)							):
			if (begin_list[i] != 0) and (begin_list[j] % begin_list[i] == 0):
				lowerCamelCase__              =	0

    # filters actual prime numbers.
	lowerCamelCase__              =	[x for x in begin_list if x != 0]

	# precondition
	assert isinstance(__snake_case ,__snake_case							), "'ans' must been from type list"

	return ans





def lowerCAmelCase__(__snake_case							)       ->   Optional[Any]:







	'''simple docstring'''







	assert isinstance(__snake_case ,__snake_case							) and (n > 2), "'N' must been an int and > 2"

	lowerCamelCase__              =	[]

	# iterates over all numbers between 2 up to N+1
	# if a number is prime then appends to list 'ans'
	for number in range(2 ,n + 1							):
		if is_prime(__snake_case							):
			ans.append(__snake_case							)

    # precondition
	assert isinstance(__snake_case ,__snake_case							), "'ans' must been from type list"

	return ans





def lowerCAmelCase__(__snake_case							)       ->   List[str]:







	'''simple docstring'''







	assert isinstance(__snake_case ,__snake_case							) and number >= 0, "'number' must been an int and >= 0"

	lowerCamelCase__              =	[]  # this list will be returns of the function.

	# potential prime number factors.

	lowerCamelCase__              =	2

	lowerCamelCase__              =	number

	if number == 0 or number == 1:
		ans.append(__snake_case							)

	# if 'number' not prime then builds the prime factorization of 'number'
	elif not is_prime(__snake_case							):
		while quotient != 1:
			if is_prime(__snake_case							) and (quotient % factor == 0):
				ans.append(__snake_case							)
				quotient /= factor
			else:
				factor += 1

	else:
		ans.append(__snake_case							)

	# precondition
	assert isinstance(__snake_case ,__snake_case							), "'ans' must been from type list"

	return ans





def lowerCAmelCase__(__snake_case							)       ->   List[Any]:







	'''simple docstring'''







	assert isinstance(__snake_case ,__snake_case							) and (
	    number >= 0
	), "'number' bust been an int and >= 0"

	lowerCamelCase__              =	0

	# prime factorization of 'number'
	lowerCamelCase__              =	prime_factorization(__snake_case							)

	lowerCamelCase__              =	max(__snake_case							)

	# precondition
	assert isinstance(__snake_case ,__snake_case							), "'ans' must been from type int"

	return ans





def lowerCAmelCase__(__snake_case							)       ->   Dict:







	'''simple docstring'''







	assert isinstance(__snake_case ,__snake_case							) and (
	    number >= 0
	), "'number' bust been an int and >= 0"

	lowerCamelCase__              =	0

	# prime factorization of 'number'
	lowerCamelCase__              =	prime_factorization(__snake_case							)

	lowerCamelCase__              =	min(__snake_case							)

	# precondition
	assert isinstance(__snake_case ,__snake_case							), "'ans' must been from type int"

	return ans





def lowerCAmelCase__(__snake_case							)       ->   List[Any]:







	'''simple docstring'''







	assert isinstance(__snake_case ,__snake_case							), "'number' must been an int"
	assert isinstance(number % 2 == 0 ,__snake_case							), "compare bust been from type bool"

	return number % 2 == 0





def lowerCAmelCase__(__snake_case							)       ->   List[str]:







	'''simple docstring'''







	assert isinstance(__snake_case ,__snake_case							), "'number' must been an int"
	assert isinstance(number % 2 != 0 ,__snake_case							), "compare bust been from type bool"

	return number % 2 != 0





def lowerCAmelCase__(__snake_case							)       ->   List[Any]:







	'''simple docstring'''







	assert (
	    isinstance(__snake_case ,__snake_case							) and (number > 2) and is_even(__snake_case							)
	), "'number' must been an int, even and > 2"

	lowerCamelCase__              =	[]  # this list will returned

	# creates a list of prime numbers between 2 up to 'number'
	lowerCamelCase__              =	get_prime_numbers(__snake_case							)
	lowerCamelCase__              =	len(__snake_case							)

	# run variable for while-loops.
	lowerCamelCase__              =	0
	lowerCamelCase__              =	None

	# exit variable. for break up the loops
	lowerCamelCase__              =	True

	while i < len_pn and loop:
		lowerCamelCase__              =	i + 1

		while j < len_pn and loop:
			if prime_numbers[i] + prime_numbers[j] == number:
				lowerCamelCase__              =	False
				ans.append(prime_numbers[i]							)
				ans.append(prime_numbers[j]							)

			j += 1

		i += 1

	# precondition
	assert (
	    isinstance(__snake_case ,__snake_case							)
	    and (len(__snake_case							) == 2)
	    and (ans[0] + ans[1] == number)
	    and is_prime(ans[0]							)
	    and is_prime(ans[1]							)
	), "'ans' must contains two primes. And sum of elements must been eq 'number'"

	return ans





def lowerCAmelCase__(__snake_case ,__snake_case							)       ->   str:







	'''simple docstring'''







	assert (
	    isinstance(__snake_case ,__snake_case							)
	    and isinstance(__snake_case ,__snake_case							)
	    and (numbera >= 0)
	    and (numbera >= 0)
	), "'number1' and 'number2' must been positive integer."

	lowerCamelCase__              =	0

	while numbera != 0:
		lowerCamelCase__              =	numbera % numbera
		lowerCamelCase__              =	numbera
		lowerCamelCase__              =	rest

	# precondition
	assert isinstance(__snake_case ,__snake_case							) and (
	    numbera >= 0
	), "'number' must been from type int and positive"

	return numbera





def lowerCAmelCase__(__snake_case ,__snake_case							)       ->   Any:







	'''simple docstring'''







	assert (
	    isinstance(__snake_case ,__snake_case							)
	    and isinstance(__snake_case ,__snake_case							)
	    and (numbera >= 1)
	    and (numbera >= 1)
	), "'number1' and 'number2' must been positive integer."

	lowerCamelCase__              =	1  # actual answer that will be return.

	# for kgV (x,1)
	if numbera > 1 and numbera > 1:
		# builds the prime factorization of 'number1' and 'number2'
		lowerCamelCase__              =	prime_factorization(__snake_case							)
		lowerCamelCase__              =	prime_factorization(__snake_case							)

	elif numbera == 1 or numbera == 1:
		lowerCamelCase__              =	[]
		lowerCamelCase__              =	[]
		lowerCamelCase__              =	max(__snake_case ,__snake_case							)

	lowerCamelCase__              =	0
	lowerCamelCase__              =	0

	lowerCamelCase__              =	[]  # captured numbers int both 'primeFac1' and 'primeFac2'

	# iterates through primeFac1
	for n in prime_fac_a:
		if n not in done:
			if n in prime_fac_a:
				lowerCamelCase__              =	prime_fac_a.count(__snake_case							)
				lowerCamelCase__              =	prime_fac_a.count(__snake_case							)

				for _ in range(max(__snake_case ,__snake_case							)							):
					ans *= n

			else:
				lowerCamelCase__              =	prime_fac_a.count(__snake_case							)

				for _ in range(__snake_case							):
					ans *= n

			done.append(__snake_case							)

    # iterates through primeFac2
	for n in prime_fac_a:
		if n not in done:
			lowerCamelCase__              =	prime_fac_a.count(__snake_case							)

			for _ in range(__snake_case							):
				ans *= n

			done.append(__snake_case							)

    # precondition
	assert isinstance(__snake_case ,__snake_case							) and (
	    ans >= 0
	), "'ans' must been from type int and positive"

	return ans





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







	'''simple docstring'''







	assert isinstance(__snake_case ,__snake_case							) and (n >= 0), "'number' must been a positive int"

	lowerCamelCase__              =	0
	lowerCamelCase__              =	2  # this variable holds the answer

	while index < n:
		index += 1

		ans += 1  # counts to the next number

		# if ans not prime then
		# runs to the next prime number.
		while not is_prime(__snake_case							):
			ans += 1

    # precondition
	assert isinstance(__snake_case ,__snake_case							) and is_prime(
	    __snake_case							), "'ans' must been a prime number and from type int"

	return ans





def lowerCAmelCase__(__snake_case ,__snake_case							)       ->   Dict:







	'''simple docstring'''







	assert (
	    is_prime(__snake_case							) and is_prime(__snake_case							) and (p_number_a < p_number_a)
	), "The arguments must been prime numbers and 'pNumber1' < 'pNumber2'"

	lowerCamelCase__              =	p_number_a + 1  # jump to the next number

	lowerCamelCase__              =	[]  # this list will be returns.

	# if number is not prime then
	# fetch the next prime number.
	while not is_prime(__snake_case							):
		number += 1

	while number < p_number_a:
		ans.append(__snake_case							)

		number += 1

		# fetch the next prime number.
		while not is_prime(__snake_case							):
			number += 1

    # precondition
	assert (
	    isinstance(__snake_case ,__snake_case							)
	    and ans[0] != p_number_a
	    and ans[len(__snake_case							) - 1] != p_number_a
	), "'ans' must been a list without the arguments"

	# 'ans' contains not 'pNumber1' and 'pNumber2' !
	return ans





def lowerCAmelCase__(__snake_case							)       ->   Tuple:







	'''simple docstring'''







	assert isinstance(__snake_case ,__snake_case							) and (n >= 1), "'n' must been int and >= 1"

	lowerCamelCase__              =	[]  # will be returned.

	for divisor in range(1 ,n + 1							):
		if n % divisor == 0:
			ans.append(__snake_case							)

    # precondition
	assert ans[0] == 1 and ans[len(__snake_case							) - 1] == n, "Error in function getDivisiors(...)"

	return ans





def lowerCAmelCase__(__snake_case							)       ->   Optional[Any]:







	'''simple docstring'''







	assert isinstance(__snake_case ,__snake_case							) and (
	    number > 1
	), "'number' must been an int and >= 1"

	lowerCamelCase__              =	get_divisors(__snake_case							)

	# precondition
	assert (
	    isinstance(__snake_case ,__snake_case							)
	    and (divisors[0] == 1)
	    and (divisors[len(__snake_case							) - 1] == number)
	), "Error in help-function getDivisiors(...)"

	# summed all divisors up to 'number' (exclusive), hence [:-1]
	return sum(divisors[:-1]							) == number





def lowerCAmelCase__(__snake_case ,__snake_case							)       ->   Tuple:







	'''simple docstring'''







	assert (
	    isinstance(__snake_case ,__snake_case							)
	    and isinstance(__snake_case ,__snake_case							)
	    and (denominator != 0)
	), "The arguments must been from type int and 'denominator' != 0"

	# build the greatest common divisor of numerator and denominator.
	lowerCamelCase__              =	gcd(abs(__snake_case							) ,abs(__snake_case							)							)

	# precondition
	assert (
	    isinstance(__snake_case ,__snake_case							)
	    and (numerator % gcd_of_fraction == 0)
	    and (denominator % gcd_of_fraction == 0)
	), "Error in function gcd(...,...)"

	return (numerator // gcd_of_fraction, denominator // gcd_of_fraction)





def lowerCAmelCase__(__snake_case							)       ->   Optional[int]:







	'''simple docstring'''







	assert isinstance(__snake_case ,__snake_case							) and (n >= 0), "'n' must been a int and >= 0"

	lowerCamelCase__              =	1  # this will be return.

	for factor in range(1 ,n + 1							):
		ans *= factor

	return ans





def lowerCAmelCase__(__snake_case							)       ->   Optional[Any]:







	'''simple docstring'''







	assert isinstance(__snake_case ,__snake_case							) and (n >= 0), "'n' must been an int and >= 0"

	lowerCamelCase__              =	0
	lowerCamelCase__              =	1
	lowerCamelCase__              =	1  # this will be return

	for _ in range(n - 1							):
		lowerCamelCase__              =	ans
		ans += fiba
		lowerCamelCase__              =	tmp

	return ans



