

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

import os
from pathlib import Path





def    __lowerCamelCase      (					UpperCamelCase__  ,				UpperCamelCase__  ,				UpperCamelCase__ ):







							'''simple docstring'''






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

							# BLUE scores as follows:
							# "pair": [fairseq, transformers]
							snake_case_     							=       {
							    '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'],
							}
							snake_case_     							=       F'''{src_lang}-{tgt_lang}'''

							snake_case_     							=       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__ )
							snake_case_     							=       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
_UpperCAmelCase						:  Any									=			Path(__file__).resolve().parent.parent.parent
_UpperCAmelCase						:  Tuple									=			repo_dir / """model_cards"""

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







# Logistic Regression from scratch

# In[62]:

# In[63]:

# importing all the required libraries

import numpy as np
from matplotlib import pyplot as plt
from sklearn import datasets





def    __lowerCamelCase      (					UpperCamelCase__ ):







							'''simple docstring'''






							return 1 / (1 + np.exp(-z ))





def    __lowerCamelCase      (					UpperCamelCase__  ,				UpperCamelCase__ ):







							'''simple docstring'''






							return (-y * np.log(UpperCamelCase__ ) - (1 - y) * np.log(1 - h )).mean()





def    __lowerCamelCase      (					UpperCamelCase__  ,				UpperCamelCase__  ,				UpperCamelCase__ ):







							'''simple docstring'''






							snake_case_     							=       np.dot(UpperCamelCase__  ,				UpperCamelCase__ )
							return np.sum(y * scores - np.log(1 + np.exp(UpperCamelCase__ ) ) )





def    __lowerCamelCase      (					UpperCamelCase__  ,				UpperCamelCase__  ,				UpperCamelCase__  ,				UpperCamelCase__=70000 ):







							'''simple docstring'''






							snake_case_     							=       np.zeros(x.shape[1] )

							for iterations in range(UpperCamelCase__ ):
														snake_case_     							=       np.dot(UpperCamelCase__  ,				UpperCamelCase__ )
														snake_case_     							=       sigmoid_function(UpperCamelCase__ )
														snake_case_     							=       np.dot(x.T  ,				h - y ) / y.size
														snake_case_     							=       theta - alpha * gradient  # updating the weights
														snake_case_     							=       np.dot(UpperCamelCase__  ,				UpperCamelCase__ )
														snake_case_     							=       sigmoid_function(UpperCamelCase__ )
														snake_case_     							=       cost_function(UpperCamelCase__  ,				UpperCamelCase__ )
														if iterations % 100 == 0:
																					print(F'''loss: {j} \t''' )  # printing the loss after every 100 iterations
							return theta


# In[68]:

if __name__ == "__main__":
					_UpperCAmelCase						:  str									=			datasets.load_iris()
					_UpperCAmelCase						:  Union[str, Any]									=			iris.data[:, :2]
					_UpperCAmelCase						:  List[str]									=			(iris.target != 0) * 1

					_UpperCAmelCase						:  Optional[int]									=			0.1
					_UpperCAmelCase						:  Dict									=			logistic_reg(alpha, x, y, max_iterations=7_0000)
					print("""theta: """, theta)  # printing the theta i.e our weights vector





					def    __lowerCamelCase      (					UpperCamelCase__ ):







												'''simple docstring'''






												return sigmoid_function(
												    np.dot(UpperCamelCase__  ,				UpperCamelCase__ ) )  # predicting the value of probability from the logistic regression algorithm

					plt.figure(figsize=(10, 6))
					plt.scatter(x[y == 0][:, 0], x[y == 0][:, 1], color="""b""", label="""0""")
					plt.scatter(x[y == 1][:, 0], x[y == 1][:, 1], color="""r""", label="""1""")
					((_UpperCAmelCase)							,		(_UpperCAmelCase))						:  Any									=			(x[:, 0].min(), x[:, 0].max())
					((_UpperCAmelCase)							,		(_UpperCAmelCase))						:  Union[str, Any]									=			(x[:, 1].min(), x[:, 1].max())
					((_UpperCAmelCase)							,		(_UpperCAmelCase))						:  int									=			np.meshgrid(np.linspace(xa_min, xa_max), np.linspace(xa_min, xa_max))
					_UpperCAmelCase						:  List[Any]									=			np.c_[xxa.ravel(), xxa.ravel()]
					_UpperCAmelCase						:  Dict									=			predict_prob(grid).reshape(xxa.shape)
					plt.contour(xxa, xxa, probs, [0.5], linewidths=1, colors="""black""")

					plt.legend()


					plt.show()




