Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
USING BIDIRECTIONAL
GENERATIVE ADVERSARIAL
NETWORK
The two sub models play a mini-max game and achieve the
win-win situation when they reach a Nash Equilibrium.
Additionally, the static sentence-level BLEU is utilized as
the reinforced objective for the generator, which biases the
generation towards high BLEU points.
Generative Adversarial Network (GAN) has been proposed
to tackle the exposure bias problem of Neural Machine
Translation (NMT). However, the discriminator typically
results in the instability of the GAN training due to the
inadequate training problem: the search space is so huge
that sampled translations are not sufficient for
discriminator training.
ABSTRACT CONTD……
To address this issue and stabilize the GAN training, in this
paper, a novel Bidirectional Generative Adversarial
Network is proposed for Neural Machine Translation
(BGAN-NMT), which aims to introduce a generator model
to act as the discriminator, whereby the discriminator
naturally considers the entire translation space so that the
inadequate training problem can be alleviated.
RELATED RESEARCH PAPERS:
Generative Adversarial Nets by
Ian J. Goodfellow, Jean Pouget-Abadie∗ , Mehdi Mirza, Bing Xu,
David Warde-Farley, Sherjil Ozair† , Aaron Courville, Yoshua
Bengio‡
Improving Neural Machine Translation with Conditional
Sequence Generative Adversarial Nets by
Zhen Yang , Wei Chen , Feng Wang , Bo Xu
Bidirectional Generative Adversarial Networks for Neural
Machine Translation by
Zhirui Zhang†∗ , Shujie Liu§ , Mu Li¶ , Ming Zhou§ , Enhong
Chen†
GENERATIVE ADVERSARIAL
NETWORKS:
We used the IIT Bombay English-Hindi corpus contains parallel corpus for
English-Hindi as well as monolingual Hindi corpus collected from a
variety of existing sources and corpora developed at the Center for Indian
Language Technology, IIT Bombay over the years. This page describes the
corpus. This corpus has been used at the Workshop on Asian Language
Translation Shared Task in 2016 and 2017 for the Hindi-to-English and
English-to-Hindi languages pairs.
The dataset contains 273,885 Hindi - English sentence pairs which are
divided into two parts the development pairs and the testing pairs.
The development pairs contains about 520 segments and the testing data
contains about 5207 segments.
REASON FOR CHOOSING THE MODEL:
The generative adversarial network can avoid the exposure bias
problem of neural machine translation and is a promising
approach to produce relatively nice results. It can tackle the
problem of the stability of the Generative by using the generator
model in place of both generator and discriminator in the model.
Since the generator model takes into consideration the whole
input sequence.
BLEU SCORE:
BLEU, or the Bilingual Evaluation Understudy, is a score for
comparing a candidate translation of text to one or more reference
translations.
Although developed for translation, it can be used to evaluate text
generated for a suite of natural language processing tasks.
A perfect match results in a score of 1.0, whereas a perfect
mismatch results in a score of 0.0.
The BLEU score was proposed by Kishore Papineni, et al. in their
2002 paper “BLEU: a Method for Automatic Evaluation of
Machine Translation“.
It is implemented to find out the closeness of the text generated
by a machine oriented system to the text generated by humans.
RESULT:
ACCORDING TO THE RESEARCH PAPER:
ACCORDING TO THE USED DATASET:
The BLEU SCORE is calculated after training the dataset for
5000 Hindi- English sentence pairs and the BLEU SCORE for
this dataset after training the model turns out to be 5.26.
Increasing the dataset for the same model and again training the
model will probably increase the BLEU SCORE value by a certain
considerable amount.
When the bigger dataset is used which comprised of 10000
sentences then the BLEU SCORE turns out to be 8.26.
BYTE PAIR ENCODING:
Byte pair encoding or diagram encoding is a simple form of data
compression in which the most common pairs of consecutive bytes
of data is replaced with a byte that does not occur within that
data.
A table of replacement is thus made and is required to rebuilt the
original data.
A variant of the technique has shown to be useful in several
natural language processing applications.
The algorithm was first described publicly by Philip Gage in a
February 1994 article "A New Algorithm for Data Compression"
in the C Users Journal.
BYTE PAIR ENCODING CONTD….
For Example:
Let the data be: aaabdaaabac
Let Z = aa
the data thus becomes: ZabdZabac
Let Y = ab
the data thus becomes: ZYdZYac
Let X = ZY
the data thus becomes: XdXac