


# Usage:
# ./gen-card-facebook-wmt19.py

import os
from pathlib import Path






def   _lowercase(					__a				:						Dict    ,     __a				:						str    ,     __a				:						Any     ):
							a__      ={
							    'en': 'Machine learning is great, isn\'t it?',
							    'ru': 'Машинное обучение - это здорово, не так ли?',
							    'de': 'Maschinelles Lernen ist großartig, oder?',
							}

							# BLUE scores as follows:
							# "pair": [fairseq, transformers]
							a__      ={
							    'ru-en': ['[41.3](http://matrix.statmt.org/matrix/output/1907?run_id=6937)', '39.20'],
							    'en-ru': ['[36.4](http://matrix.statmt.org/matrix/output/1914?run_id=6724)', '33.47'],
							    'en-de': ['[43.1](http://matrix.statmt.org/matrix/output/1909?run_id=6862)', '42.83'],
							    'de-en': ['[42.3](http://matrix.statmt.org/matrix/output/1902?run_id=6750)', '41.35'],
							}
							a__      =f"""{src_lang}-{tgt_lang}"""

							a__      =f"""
---
language: 
- {src_lang}
- {tgt_lang}
thumbnail:
tags:
- translation
- wmt19
- facebook
license: apache-2.0
datasets:
- wmt19
metrics:
- bleu
---

# FSMT

## Model description

This is a ported version of [fairseq wmt19 transformer](https://github.com/pytorch/fairseq/blob/master/examples/wmt19/README.md) for {src_lang}-{tgt_lang}.

For more details, please see, [Facebook FAIR\'s WMT19 News Translation Task Submission](https://arxiv.org/abs/1907.06616).

The abbreviation FSMT stands for FairSeqMachineTranslation

All four models are available:

* [wmt19-en-ru](https://huggingface.co/facebook/wmt19-en-ru)
* [wmt19-ru-en](https://huggingface.co/facebook/wmt19-ru-en)
* [wmt19-en-de](https://huggingface.co/facebook/wmt19-en-de)
* [wmt19-de-en](https://huggingface.co/facebook/wmt19-de-en)

## Intended uses & limitations

#### How to use

```python
from transformers import FSMTForConditionalGeneration, FSMTTokenizer
mname = \"facebook/wmt19-{src_lang}-{tgt_lang}\"
tokenizer = FSMTTokenizer.from_pretrained(mname)
model = FSMTForConditionalGeneration.from_pretrained(mname)

input = \"{texts[src_lang]}\"
input_ids = tokenizer.encode(input, return_tensors=\"pt\")
outputs = model.generate(input_ids)
decoded = tokenizer.decode(outputs[0], skip_special_tokens=True)
print(decoded) # {texts[tgt_lang]}

```

#### Limitations and bias

- The original (and this ported model) doesn\'t seem to handle well inputs with repeated sub-phrases, [content gets truncated](https://discuss.huggingface.co/t/issues-with-translating-inputs-containing-repeated-phrases/981)

## Training data

Pretrained weights were left identical to the original model released by fairseq. For more details, please, see the [paper](https://arxiv.org/abs/1907.06616).

## Eval results

pair   | fairseq | transformers
-------|---------|----------
{pair}  | {scores[pair][0]} | {scores[pair][1]}

The score is slightly below the score reported by `fairseq`, since `transformers`` currently doesn\'t support:
- model ensemble, therefore the best performing checkpoint was ported (``model4.pt``).
- re-ranking

The score was calculated using this code:

```bash
git clone https://github.com/huggingface/transformers
cd transformers
export PAIR={pair}
export DATA_DIR=data/$PAIR
export SAVE_DIR=data/$PAIR
export BS=8
export NUM_BEAMS=15
mkdir -p $DATA_DIR
sacrebleu -t wmt19 -l $PAIR --echo src > $DATA_DIR/val.source
sacrebleu -t wmt19 -l $PAIR --echo ref > $DATA_DIR/val.target
echo $PAIR
PYTHONPATH=\"src:examples/seq2seq\" python examples/seq2seq/run_eval.py facebook/wmt19-$PAIR $DATA_DIR/val.source $SAVE_DIR/test_translations.txt --reference_path $DATA_DIR/val.target --score_path $SAVE_DIR/test_bleu.json --bs $BS --task translation --num_beams $NUM_BEAMS
```
note: fairseq reports using a beam of 50, so you should get a slightly higher score if re-run with `--num_beams 50`.

## Data Sources

- [training, etc.](http://www.statmt.org/wmt19/)
- [test set](http://matrix.statmt.org/test_sets/newstest2019.tgz?1556572561)


### BibTeX entry and citation info

```bibtex
@inproceedings{{...,
  year={{2020}},
  title={{Facebook FAIR\'s WMT19 News Translation Task Submission}},
  author={{Ng, Nathan and Yee, Kyra and Baevski, Alexei and Ott, Myle and Auli, Michael and Edunov, Sergey}},
  booktitle={{Proc. of WMT}},
}}
```


## TODO

- port model ensemble (fairseq uses 4 model checkpoints)

"""
							os.makedirs(UpperCamelCase__    ,     exist_ok=UpperCamelCase__     )
							a__      =os.path.join(UpperCamelCase__    ,     'README.md'     )
							print(f"""Generating {path}"""     )
							with open(UpperCamelCase__    ,     'w'    ,     encoding='utf-8'     ) as f:
														f.write(UpperCamelCase__     )


# make sure we are under the root of the project
_lowerCAmelCase:						Any   				=       Path(__file__).resolve().parent.parent.parent
_lowerCAmelCase:						Tuple   				=       repo_dir / """model_cards"""

for model_name in ["wmt19-ru-en", "wmt19-en-ru", "wmt19-en-de", "wmt19-de-en"]:
	_lowerCAmelCase:						List[str]   				=       model_name.split('-')
	_lowerCAmelCase:						Optional[int]   				=       model_cards_dir / """facebook""" / model_name
	write_model_card(model_card_dir, src_lang=src_lang, tgt_lang=tgt_lang)




_UpperCAmelCase						:  int									=			range(2, 20 + 1)
_UpperCAmelCase						:  Dict									=			[10**k for k in range(ks[-1] + 1)]
_UpperCAmelCase						:  dict[int, dict[int, list[list[int]]]]									=			{}





def    __lowerCamelCase      (					UpperCamelCase__  ,				UpperCamelCase__  ,				UpperCamelCase__  ,				UpperCamelCase__ ):







							'''simple docstring'''






							snake_case_     							=       sum(a_i[j] for j in range(UpperCamelCase__  ,				len(UpperCamelCase__ ) ) )
							snake_case_     							=       sum(a_i[j] * base[j] for j in range(min(len(UpperCamelCase__ )  ,				UpperCamelCase__ ) ) )

							snake_case_							,       snake_case_     							=       0, 0
							snake_case_     							=       n - i

							snake_case_     							=       memo.get(UpperCamelCase__ )

							if sub_memo is not None:
														snake_case_     							=       sub_memo.get(UpperCamelCase__ )

														if jumps is not None and len(UpperCamelCase__ ) > 0:
																					# find and make the largest jump without going over
																					snake_case_     							=       -1
																					for _k in range(len(UpperCamelCase__ ) - 1  ,				-1  ,				-1 ):
																												if jumps[_k][2] <= k and jumps[_k][1] <= max_dn:
																																			snake_case_     							=       _k
																																			break

																					if max_jump >= 0:
																												snake_case_							,       snake_case_							,       snake_case_     							=       jumps[max_jump]
																												# since the difference between jumps is cached, add c
																												snake_case_     							=       diff + c
																												for j in range(min(UpperCamelCase__  ,				len(UpperCamelCase__ ) ) ):
																																			snake_case_							,       snake_case_     							=       divmod(UpperCamelCase__  ,				10 )
																												if new_c > 0:
																																			add(UpperCamelCase__  ,				UpperCamelCase__  ,				UpperCamelCase__ )

														else:
																					snake_case_     							=       []
							else:
														snake_case_     							=       {c: []}
														snake_case_     							=       sub_memo

							if dn >= max_dn or c + diff >= base[k]:
														return diff, dn

							if k > ks[0]:
														while True:
																					# keep doing smaller jumps
																					snake_case_							,       snake_case_     							=       next_term(UpperCamelCase__  ,				k - 1  ,				i + dn  ,				UpperCamelCase__ )
																					diff += _diff
																					dn += terms_jumped

																					if dn >= max_dn or c + diff >= base[k]:
																												break
							else:
														# would be too small a jump, just compute sequential terms instead
														snake_case_							,       snake_case_     							=       compute(UpperCamelCase__  ,				UpperCamelCase__  ,				i + dn  ,				UpperCamelCase__ )
														diff += _diff
														dn += terms_jumped

							snake_case_     							=       sub_memo[c]

							# keep jumps sorted by # of terms skipped
							snake_case_     							=       0
							while j < len(UpperCamelCase__ ):
														if jumps[j][1] > dn:
																					break
														j += 1

							# cache the jump for this value digitsum(b) and c
							sub_memo[c].insert(UpperCamelCase__  ,				(diff, dn, k) )
							return (diff, dn)





def    __lowerCamelCase      (					UpperCamelCase__  ,				UpperCamelCase__  ,				UpperCamelCase__  ,				UpperCamelCase__ ):







							'''simple docstring'''






							if i >= n:
														return 0, i
							if k > len(UpperCamelCase__ ):
														a_i.extend([0 for _ in range(k - len(UpperCamelCase__ ) )] )

							# note: a_i -> b * 10^k + c
							# ds_b -> digitsum(b)
							# ds_c -> digitsum(c)
							snake_case_     							=       i
							snake_case_							,       snake_case_							,       snake_case_     							=       0, 0, 0
							for j in range(len(UpperCamelCase__ ) ):
														if j >= k:
																					ds_b += a_i[j]
														else:
																					ds_c += a_i[j]

							while i < n:
														i += 1
														snake_case_     							=       ds_c + ds_b
														diff += addend
														snake_case_     							=       0
														for j in range(UpperCamelCase__ ):
																					snake_case_     							=       a_i[j] + addend
																					snake_case_							,       snake_case_     							=       divmod(UpperCamelCase__  ,				10 )

																					ds_c += a_i[j]

														if addend > 0:
																					break

							if addend > 0:
														add(UpperCamelCase__  ,				UpperCamelCase__  ,				UpperCamelCase__ )
							return diff, i - start_i





def    __lowerCamelCase      (					UpperCamelCase__  ,				UpperCamelCase__  ,				UpperCamelCase__ ):







							'''simple docstring'''






							for j in range(UpperCamelCase__  ,				len(UpperCamelCase__ ) ):
														snake_case_     							=       digits[j] + addend
														if s >= 10:
																					snake_case_							,       snake_case_     							=       divmod(UpperCamelCase__  ,				10 )
																					snake_case_     							=       addend // 10 + quotient
														else:
																					snake_case_     							=       s
																					snake_case_     							=       addend // 10

														if addend == 0:
																					break

							while addend > 0:
														snake_case_							,       snake_case_     							=       divmod(UpperCamelCase__  ,				10 )
														digits.append(UpperCamelCase__ )





def    __lowerCamelCase      (					UpperCamelCase__ = 10**15 ):







							'''simple docstring'''






							snake_case_     							=       [1]
							snake_case_     							=       1
							snake_case_     							=       0
							while True:
														snake_case_							,       snake_case_     							=       next_term(UpperCamelCase__  ,				20  ,				i + dn  ,				UpperCamelCase__ )
														dn += terms_jumped
														if dn == n - i:
																					break

							snake_case_     							=       0
							for j in range(len(UpperCamelCase__ ) ):
														a_n += digits[j] * 10**j
							return a_n


if __name__ == "__main__":
					print(F'''{solution() = }''')




