





from jiwer import compute_measures

import datasets


SCREAMING_SNAKE_CASE_   :      Any			=   '\\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'

SCREAMING_SNAKE_CASE_   :      int			=   '\\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'

SCREAMING_SNAKE_CASE_   :      List[str]			=   '\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 		snake_case_   (							datasets.Metric						):







	'''simple docstring'''




	def    UpperCAmelCase			(						self							:     Dict   )       -> List[Any]:

			'''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    UpperCAmelCase			(						self							:     Optional[Any]					,      __lowerCamelCase							:     Any=None					,      __lowerCamelCase							:     Dict=None					,      __lowerCamelCase							:     Tuple=False   )       -> Tuple:

			'''simple docstring'''




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






import unittest

from transformers.testing_utils import require_bsa
from transformers.utils import is_bsa_available

from ...test_feature_extraction_common import FeatureExtractionSavingTestMixin


if is_bsa_available():
		from transformers import MarkupLMFeatureExtractor




class 					lowerCamelCase__				(							unittest.TestCase):




	'''simple docstring'''




	def __init__(   self						:Optional[int]	,  a						:List[str]		)						->					Union[str, Any]:
								__UpperCamelCase      :  Dict       =   parent







	def   _lowerCamelCase							(   self						:Dict		)						->					int:
								return {}




def       _SCREAMING_SNAKE_CASE   (						)   ->       Optional[Any]:






							'''simple docstring'''





							__UpperCamelCase      :  Union[str, Any]       =   "<HTML>\n\n    <HEAD>\n    <TITLE>sample document</TITLE>\n    </HEAD>\n\n    <BODY BGCOLOR=\"FFFFFF\">\n    <HR>\n    <a href=\"http://google.com\">Goog</a>\n    <H1>This is one header</H1>\n    <H2>This is a another Header</H2>\n    <P>Travel from\n        <P>\n        <B>SFO to JFK</B>\n        <BR>\n        <B><I>on May 2, 2015 at 2:00 pm. For details go to confirm.com </I></B>\n        <HR>\n        <div style=\"color:#0000FF\">\n            <h3>Traveler <b> name </b> is\n            <p> John Doe </p>\n        </div>"

							__UpperCamelCase      :  Optional[int]       =   "\n    <!DOCTYPE html>\n    <html>\n    <body>\n\n    <h1>My First Heading</h1>\n    <p>My first paragraph.</p>\n\n    </body>\n    </html>\n    "

							return [html_string_a, html_string_a]




@require_bsa
class 					lowerCamelCase__				(							__lowercase	,		unittest.TestCase):




	'''simple docstring'''




	_A								=	MarkupLMFeatureExtractor if is_bsa_available() else None







	def   _lowerCamelCase							(   self						:List[str]		)						->					str:
								__UpperCamelCase      :  List[str]       =   MarkupLMFeatureExtractionTester(self		)







	@property
	def   _lowerCamelCase							(   self						:List[Any]		)						->					List[str]:
								return self.feature_extract_tester.prepare_feat_extract_dict()







	def   _lowerCamelCase							(   self						:Dict		)						->					Dict:
								# Initialize feature_extractor
								__UpperCamelCase      :  Tuple       =   self.feature_extraction_class()

								# Test not batched input
								__UpperCamelCase      :  Union[str, Any]       =   get_html_strings()[0]
								__UpperCamelCase      :  Any       =   feature_extractor(a		)

								# fmt: off
								__UpperCamelCase      :  Union[str, Any]       =   [["sample document", "Goog", "This is one header", "This is a another Header", "Travel from", "SFO to JFK", "on May 2, 2015 at 2:00 pm. For details go to confirm.com", "Traveler", "name", "is", "John Doe"]]
								__UpperCamelCase      :  Tuple       =   [["/html/head/title", "/html/body/a", "/html/body/h1", "/html/body/h2", "/html/body/p", "/html/body/p/p/b[1]", "/html/body/p/p/b[2]/i", "/html/body/p/p/div/h3", "/html/body/p/p/div/h3/b", "/html/body/p/p/div/h3", "/html/body/p/p/div/h3/p"]]
								# fmt: on

								self.assertEqual(encoding.nodes	,  a		)
								self.assertEqual(encoding.xpaths	,  a		)

								# Test batched
								__UpperCamelCase      :  str       =   get_html_strings()
								__UpperCamelCase      :  List[Any]       =   feature_extractor(a		)

								# fmt: off
								__UpperCamelCase      :  Optional[int]       =   expected_nodes + [["My First Heading", "My first paragraph."]]
								__UpperCamelCase      :  Tuple       =   expected_xpaths + [["/html/body/h1", "/html/body/p"]]

								self.assertEqual(len(encoding.nodes		)	,  2		)
								self.assertEqual(len(encoding.xpaths		)	,  2		)

								self.assertEqual(encoding.nodes	,  a		)
								self.assertEqual(encoding.xpaths	,  a		)