Skip-Grams-Solution


Skip-gram word2vec

In this notebook, I'll lead you through using TensorFlow to implement the word2vec algorithm using the skip-gram architecture. By implementing this, you'll learn about embedding words for use in natural language processing. This will come in handy when dealing with things like machine translation.

Readings

Here are the resources I used to build this notebook. I suggest reading these either beforehand or while you're working on this material.

Word embeddings

When you're dealing with words in text, you end up with tens of thousands of classes to predict, one for each word. Trying to one-hot encode these words is massively inefficient, you'll have one element set to 1 and the other 50,000 set to 0. The matrix multiplication going into the first hidden layer will have almost all of the resulting values be zero. This a huge waste of computation.

To solve this problem and greatly increase the efficiency of our networks, we use what are called embeddings. Embeddings are just a fully connected layer like you've seen before. We call this layer the embedding layer and the weights are embedding weights. We skip the multiplication into the embedding layer by instead directly grabbing the hidden layer values from the weight matrix. We can do this because the multiplication of a one-hot encoded vector with a matrix returns the row of the matrix corresponding the index of the "on" input unit.

Instead of doing the matrix multiplication, we use the weight matrix as a lookup table. We encode the words as integers, for example "heart" is encoded as 958, "mind" as 18094. Then to get hidden layer values for "heart", you just take the 958th row of the embedding matrix. This process is called an embedding lookup and the number of hidden units is the embedding dimension.

There is nothing magical going on here. The embedding lookup table is just a weight matrix. The embedding layer is just a hidden layer. The lookup is just a shortcut for the matrix multiplication. The lookup table is trained just like any weight matrix as well.

Embeddings aren't only used for words of course. You can use them for any model where you have a massive number of classes. A particular type of model called Word2Vec uses the embedding layer to find vector representations of words that contain semantic meaning.

Word2Vec

The word2vec algorithm finds much more efficient representations by finding vectors that represent the words. These vectors also contain semantic information about the words. Words that show up in similar contexts, such as "black", "white", and "red" will have vectors near each other. There are two architectures for implementing word2vec, CBOW (Continuous Bag-Of-Words) and Skip-gram.

In this implementation, we'll be using the skip-gram architecture because it performs better than CBOW. Here, we pass in a word and try to predict the words surrounding it in the text. In this way, we can train the network to learn representations for words that show up in similar contexts.

First up, importing packages.


In [2]:
import time

import numpy as np
import tensorflow as tf

import utils

Load the text8 dataset, a file of cleaned up Wikipedia articles from Matt Mahoney. The next cell will download the data set to the data folder. Then you can extract it and delete the archive file to save storage space.


In [3]:
from urllib.request import urlretrieve
from os.path import isfile, isdir
from tqdm import tqdm
import zipfile

dataset_folder_path = 'data'
dataset_filename = 'text8.zip'
dataset_name = 'Text8 Dataset'

class DLProgress(tqdm):
    last_block = 0

    def hook(self, block_num=1, block_size=1, total_size=None):
        self.total = total_size
        self.update((block_num - self.last_block) * block_size)
        self.last_block = block_num

if not isfile(dataset_filename):
    with DLProgress(unit='B', unit_scale=True, miniters=1, desc=dataset_name) as pbar:
        urlretrieve(
            'http://mattmahoney.net/dc/text8.zip',
            dataset_filename,
            pbar.hook)

if not isdir(dataset_folder_path):
    with zipfile.ZipFile(dataset_filename) as zip_ref:
        zip_ref.extractall(dataset_folder_path)
        
with open('data/text8') as f:
    text = f.read()

Preprocessing

Here I'm fixing up the text to make training easier. This comes from the utils module I wrote. The preprocess function coverts any punctuation into tokens, so a period is changed to <PERIOD>. In this data set, there aren't any periods, but it will help in other NLP problems. I'm also removing all words that show up five or fewer times in the dataset. This will greatly reduce issues due to noise in the data and improve the quality of the vector representations. If you want to write your own functions for this stuff, go for it.


In [4]:
words = utils.preprocess(text)
print(words[:30])


['anarchism', 'originated', 'as', 'a', 'term', 'of', 'abuse', 'first', 'used', 'against', 'early', 'working', 'class', 'radicals', 'including', 'the', 'diggers', 'of', 'the', 'english', 'revolution', 'and', 'the', 'sans', 'culottes', 'of', 'the', 'french', 'revolution', 'whilst']

In [5]:
print("Total words: {}".format(len(words)))
print("Unique words: {}".format(len(set(words))))


Total words: 16680599
Unique words: 63641

And here I'm creating dictionaries to covert words to integers and backwards, integers to words. The integers are assigned in descending frequency order, so the most frequent word ("the") is given the integer 0 and the next most frequent is 1 and so on. The words are converted to integers and stored in the list int_words.


In [6]:
vocab_to_int, int_to_vocab = utils.create_lookup_tables(words)
int_words = [vocab_to_int[word] for word in words]

Subsampling

Words that show up often such as "the", "of", and "for" don't provide much context to the nearby words. If we discard some of them, we can remove some of the noise from our data and in return get faster training and better representations. This process is called subsampling by Mikolov. For each word $w_i$ in the training set, we'll discard it with probability given by

$$ P(w_i) = 1 - \sqrt{\frac{t}{f(w_i)}} $$

where $t$ is a threshold parameter and $f(w_i)$ is the frequency of word $w_i$ in the total dataset.

I'm going to leave this up to you as an exercise. Check out my solution to see how I did it.

Exercise: Implement subsampling for the words in int_words. That is, go through int_words and discard each word given the probablility $P(w_i)$ shown above. Note that $P(w_i)$ is that probability that a word is discarded. Assign the subsampled data to train_words.


In [18]:
from collections import Counter
import random

threshold = 1e-5
word_counts = Counter(int_words)
total_count = len(int_words)
freqs = {word: count/total_count for word, count in word_counts.items()}
p_drop = {word: 1 - np.sqrt(threshold/freqs[word]) for word in word_counts}
train_words = [word for word in int_words if random.random() < (1 - p_drop[word])]

In [22]:
len(train_words)


Out[22]:
4627550

Making batches

Now that our data is in good shape, we need to get it into the proper form to pass it into our network. With the skip-gram architecture, for each word in the text, we want to grab all the words in a window around that word, with size $C$.

From Mikolov et al.:

"Since the more distant words are usually less related to the current word than those close to it, we give less weight to the distant words by sampling less from those words in our training examples... If we choose $C = 5$, for each training word we will select randomly a number $R$ in range $< 1; C >$, and then use $R$ words from history and $R$ words from the future of the current word as correct labels."

Exercise: Implement a function get_target that receives a list of words, an index, and a window size, then returns a list of words in the window around the index. Make sure to use the algorithm described above, where you chose a random number of words to from the window.


In [8]:
def get_target(words, idx, window_size=5):
    ''' Get a list of words in a window around an index. '''
    
    R = np.random.randint(1, window_size+1)
    start = idx - R if (idx - R) > 0 else 0
    stop = idx + R
    target_words = set(words[start:idx] + words[idx+1:stop+1])
    
    return list(target_words)

Here's a function that returns batches for our network. The idea is that it grabs batch_size words from a words list. Then for each of those words, it gets the target words in the window. I haven't found a way to pass in a random number of target words and get it to work with the architecture, so I make one row per input-target pair. This is a generator function by the way, helps save memory.


In [9]:
def get_batches(words, batch_size, window_size=5):
    ''' Create a generator of word batches as a tuple (inputs, targets) '''
    
    n_batches = len(words)//batch_size
    
    # only full batches
    words = words[:n_batches*batch_size]
    
    for idx in range(0, len(words), batch_size):
        x, y = [], []
        batch = words[idx:idx+batch_size]
        for ii in range(len(batch)):
            batch_x = batch[ii]
            batch_y = get_target(batch, ii, window_size)
            y.extend(batch_y)
            x.extend([batch_x]*len(batch_y))
        yield x, y

Building the graph

From Chris McCormick's blog, we can see the general structure of our network.

The input words are passed in as one-hot encoded vectors. This will go into a hidden layer of linear units, then into a softmax layer. We'll use the softmax layer to make a prediction like normal.

The idea here is to train the hidden layer weight matrix to find efficient representations for our words. We can discard the softmax layer becuase we don't really care about making predictions with this network. We just want the embedding matrix so we can use it in other networks we build from the dataset.

I'm going to have you build the graph in stages now. First off, creating the inputs and labels placeholders like normal.

Exercise: Assign inputs and labels using tf.placeholder. We're going to be passing in integers, so set the data types to tf.int32. The batches we're passing in will have varying sizes, so set the batch sizes to [None]. To make things work later, you'll need to set the second dimension of labels to None or 1.


In [10]:
train_graph = tf.Graph()
with train_graph.as_default():
    inputs = tf.placeholder(tf.int32, [None], name='inputs')
    labels = tf.placeholder(tf.int32, [None, None], name='labels')

Embedding

The embedding matrix has a size of the number of words by the number of units in the hidden layer. So, if you have 10,000 words and 300 hidden units, the matrix will have size $10,000 \times 300$. Remember that we're using tokenized data for our inputs, usually as integers, where the number of tokens is the number of words in our vocabulary.

Exercise: Tensorflow provides a convenient function tf.nn.embedding_lookup that does this lookup for us. You pass in the embedding matrix and a tensor of integers, then it returns rows in the matrix corresponding to those integers. Below, set the number of embedding features you'll use (200 is a good start), create the embedding matrix variable, and use tf.nn.embedding_lookup to get the embedding tensors. For the embedding matrix, I suggest you initialize it with a uniform random numbers between -1 and 1 using tf.random_uniform.


In [11]:
n_vocab = len(int_to_vocab)
n_embedding = 200 # Number of embedding features 
with train_graph.as_default():
    embedding = tf.Variable(tf.random_uniform((n_vocab, n_embedding), -1, 1))
    embed = tf.nn.embedding_lookup(embedding, inputs)

Negative sampling

For every example we give the network, we train it using the output from the softmax layer. That means for each input, we're making very small changes to millions of weights even though we only have one true example. This makes training the network very inefficient. We can approximate the loss from the softmax layer by only updating a small subset of all the weights at once. We'll update the weights for the correct label, but only a small number of incorrect labels. This is called "negative sampling". Tensorflow has a convenient function to do this, tf.nn.sampled_softmax_loss.

Exercise: Below, create weights and biases for the softmax layer. Then, use tf.nn.sampled_softmax_loss to calculate the loss. Be sure to read the documentation to figure out how it works.


In [12]:
# Number of negative labels to sample
n_sampled = 100
with train_graph.as_default():
    softmax_w = tf.Variable(tf.truncated_normal((n_vocab, n_embedding), stddev=0.1))
    softmax_b = tf.Variable(tf.zeros(n_vocab))
    
    # Calculate the loss using negative sampling
    loss = tf.nn.sampled_softmax_loss(softmax_w, softmax_b, 
                                      labels, embed,
                                      n_sampled, n_vocab)
    
    cost = tf.reduce_mean(loss)
    optimizer = tf.train.AdamOptimizer().minimize(cost)

Validation

This code is from Thushan Ganegedara's implementation. Here we're going to choose a few common words and few uncommon words. Then, we'll print out the closest words to them. It's a nice way to check that our embedding table is grouping together words with similar semantic meanings.


In [13]:
with train_graph.as_default():
    ## From Thushan Ganegedara's implementation
    valid_size = 16 # Random set of words to evaluate similarity on.
    valid_window = 100
    # pick 8 samples from (0,100) and (1000,1100) each ranges. lower id implies more frequent 
    valid_examples = np.array(random.sample(range(valid_window), valid_size//2))
    valid_examples = np.append(valid_examples, 
                               random.sample(range(1000,1000+valid_window), valid_size//2))

    valid_dataset = tf.constant(valid_examples, dtype=tf.int32)
    
    # We use the cosine distance:
    norm = tf.sqrt(tf.reduce_sum(tf.square(embedding), 1, keep_dims=True))
    normalized_embedding = embedding / norm
    valid_embedding = tf.nn.embedding_lookup(normalized_embedding, valid_dataset)
    similarity = tf.matmul(valid_embedding, tf.transpose(normalized_embedding))

In [14]:
# If the checkpoints directory doesn't exist:
!mkdir checkpoints

In [15]:
epochs = 10
batch_size = 1000
window_size = 10

with train_graph.as_default():
    saver = tf.train.Saver()

with tf.Session(graph=train_graph) as sess:
    iteration = 1
    loss = 0
    sess.run(tf.global_variables_initializer())

    for e in range(1, epochs+1):
        batches = get_batches(train_words, batch_size, window_size)
        start = time.time()
        for x, y in batches:
            
            feed = {inputs: x,
                    labels: np.array(y)[:, None]}
            train_loss, _ = sess.run([cost, optimizer], feed_dict=feed)
            
            loss += train_loss
            
            if iteration % 100 == 0: 
                end = time.time()
                print("Epoch {}/{}".format(e, epochs),
                      "Iteration: {}".format(iteration),
                      "Avg. Training loss: {:.4f}".format(loss/100),
                      "{:.4f} sec/batch".format((end-start)/100))
                loss = 0
                start = time.time()
            
            if iteration % 1000 == 0:
                # note that this is expensive (~20% slowdown if computed every 500 steps)
                sim = similarity.eval()
                for i in range(valid_size):
                    valid_word = int_to_vocab[valid_examples[i]]
                    top_k = 8 # number of nearest neighbors
                    nearest = (-sim[i, :]).argsort()[1:top_k+1]
                    log = 'Nearest to %s:' % valid_word
                    for k in range(top_k):
                        close_word = int_to_vocab[nearest[k]]
                        log = '%s %s,' % (log, close_word)
                    print(log)
            
            iteration += 1
    save_path = saver.save(sess, "checkpoints/text8.ckpt")
    embed_mat = sess.run(normalized_embedding)


Epoch 1/10 Iteration: 100 Avg. Training loss: 5.6525 0.5016 sec/batch
Epoch 1/10 Iteration: 200 Avg. Training loss: 5.6068 0.4052 sec/batch
Epoch 1/10 Iteration: 300 Avg. Training loss: 5.5006 0.4084 sec/batch
Epoch 1/10 Iteration: 400 Avg. Training loss: 5.5756 0.3853 sec/batch
Epoch 1/10 Iteration: 500 Avg. Training loss: 5.5162 0.4241 sec/batch
Epoch 1/10 Iteration: 600 Avg. Training loss: 5.5338 0.4879 sec/batch
Epoch 1/10 Iteration: 700 Avg. Training loss: 5.5734 0.3901 sec/batch
Epoch 1/10 Iteration: 800 Avg. Training loss: 5.5438 0.3878 sec/batch
Epoch 1/10 Iteration: 900 Avg. Training loss: 5.4606 0.3782 sec/batch
Epoch 1/10 Iteration: 1000 Avg. Training loss: 5.4305 0.3944 sec/batch
Nearest to use: should, coaches, popularity, livejournal, familiarity, archive, exabyte, cruz,
Nearest to would: workhorse, octave, retroviral, maximinus, scharnhorst, ferry, warrens, tg,
Nearest to called: harmless, ingots, ourcivilisation, cwt, margraves, sidious, phenyl, counterweight,
Nearest to may: sigur, adapter, barrett, dello, bukem, isomorphism, subterfuge, developing,
Nearest to an: machinist, hosea, mboxx, aficionados, hashing, suspend, chamorros, midlands,
Nearest to they: peculiarities, rm, mutharika, noma, gathered, workplace, sailors, shambhala,
Nearest to american: ann, conrad, intentionally, tablet, carlo, advances, popularised, buell,
Nearest to system: romney, pejoratively, curved, yule, aqdas, asm, objects, jinnah,
Nearest to professional: leadership, colonize, harcourt, estonian, bagdad, attlee, noumena, fundraiser,
Nearest to applications: homeschooling, haigh, rumba, misleading, leaped, argumentation, pens, foucault,
Nearest to brother: patient, act, andrade, ethno, strewn, thorstein, morte, stairs,
Nearest to versions: barebones, pillory, laxatives, ebbinghaus, keyboard, pir, consequential, venerable,
Nearest to san: homage, gesture, surrealistic, mammoths, tente, acuity, papen, kenjutsu,
Nearest to mathematics: digitization, fermions, chaplin, northcote, epistemology, chivalric, alright, ar,
Nearest to ice: barbour, cruzeiro, lut, moonlight, ferber, masterson, lactic, utub,
Nearest to governor: logudorese, theosis, alexandre, exoplanets, devdas, stylings, tanakh, trigger,
Epoch 1/10 Iteration: 1100 Avg. Training loss: 5.4677 0.3823 sec/batch
Epoch 1/10 Iteration: 1200 Avg. Training loss: 5.3798 0.4462 sec/batch
Epoch 1/10 Iteration: 1300 Avg. Training loss: 5.3463 0.3871 sec/batch
Epoch 1/10 Iteration: 1400 Avg. Training loss: 5.2519 0.4279 sec/batch
Epoch 1/10 Iteration: 1500 Avg. Training loss: 5.1954 0.3784 sec/batch
Epoch 1/10 Iteration: 1600 Avg. Training loss: 5.1912 0.3777 sec/batch
Epoch 1/10 Iteration: 1700 Avg. Training loss: 5.1078 0.3557 sec/batch
Epoch 1/10 Iteration: 1800 Avg. Training loss: 5.0604 0.3550 sec/batch
Epoch 1/10 Iteration: 1900 Avg. Training loss: 4.9693 0.3615 sec/batch
Epoch 1/10 Iteration: 2000 Avg. Training loss: 5.0025 0.3608 sec/batch
Nearest to use: should, popularity, list, once, archive, cruz, coaches, familiarity,
Nearest to would: their, workhorse, octave, ferry, warrens, highest, maximinus, industry,
Nearest to called: harmless, sidious, may, phenyl, cwt, vandalism, margraves, shortly,
Nearest to may: sigur, needs, developing, flowing, called, isomorphism, who, subterfuge,
Nearest to an: machinist, rest, hosea, hashing, close, aficionados, territories, problems,
Nearest to they: peculiarities, gathered, sailors, workplace, itself, above, conducts, noma,
Nearest to american: ann, conrad, carlo, intentionally, thompson, buell, dated, advances,
Nearest to system: curved, pejoratively, objects, yule, once, romney, since, entropy,
Nearest to professional: leadership, harcourt, colonize, bi, office, bagdad, estonian, attlee,
Nearest to applications: misleading, homeschooling, foucault, thoroughly, usage, capable, basis, leaped,
Nearest to brother: patient, act, ethno, andrade, strewn, kor, progress, morte,
Nearest to versions: barebones, keyboard, friendly, pillory, claus, abramovich, directors, ebbinghaus,
Nearest to san: homage, follows, philanthropists, gesture, thirds, swaziland, chamber, dungeon,
Nearest to mathematics: fermions, epistemology, digitization, planets, occupies, chaplin, usual, chivalric,
Nearest to ice: moonlight, ferber, age, barbour, generalized, christianity, television, lut,
Nearest to governor: logudorese, alexandre, theosis, tanakh, stylings, hillbilly, trigger, alphonse,
Epoch 1/10 Iteration: 2100 Avg. Training loss: 4.9550 0.3763 sec/batch
Epoch 1/10 Iteration: 2200 Avg. Training loss: 4.9124 0.3791 sec/batch
Epoch 1/10 Iteration: 2300 Avg. Training loss: 4.8769 0.3826 sec/batch
Epoch 1/10 Iteration: 2400 Avg. Training loss: 4.8541 0.3737 sec/batch
Epoch 1/10 Iteration: 2500 Avg. Training loss: 4.8096 0.4226 sec/batch
Epoch 1/10 Iteration: 2600 Avg. Training loss: 4.8322 0.4238 sec/batch
Epoch 1/10 Iteration: 2700 Avg. Training loss: 4.8140 0.4171 sec/batch
Epoch 1/10 Iteration: 2800 Avg. Training loss: 4.7994 0.4727 sec/batch
Epoch 1/10 Iteration: 2900 Avg. Training loss: 4.7846 0.3630 sec/batch
Epoch 1/10 Iteration: 3000 Avg. Training loss: 4.7732 0.4655 sec/batch
Nearest to use: should, archive, popularity, livejournal, once, niche, cruz, coaches,
Nearest to would: octave, their, ferry, workhorse, upgrade, boars, harmful, maximinus,
Nearest to called: harmless, sidious, originate, margraves, ingots, phenyl, adjustment, cwt,
Nearest to may: sigur, isomorphism, developing, adapter, subterfuge, barrett, trademarks, flowing,
Nearest to an: machinist, rest, hosea, aficionados, hashing, midlands, suspend, ui,
Nearest to they: peculiarities, gathered, sailors, workplace, rm, basically, effects, conducts,
Nearest to american: ann, conrad, carlo, matthews, thompson, b, dated, popularised,
Nearest to system: curved, pejoratively, yule, entropy, objects, romney, fritz, once,
Nearest to professional: leadership, colonize, harcourt, bagdad, estonian, bi, lessons, office,
Nearest to applications: homeschooling, misleading, argumentation, shut, foucault, preside, thoroughly, capable,
Nearest to brother: patient, act, ethno, progress, years, strewn, stairs, andrade,
Nearest to versions: barebones, keyboard, pillory, ebbinghaus, claus, recreated, directors, friendly,
Nearest to san: homage, gesture, follows, philanthropists, razor, chamber, dungeon, gand,
Nearest to mathematics: epistemology, fermions, usual, digitization, planets, chaplin, introducing, occupies,
Nearest to ice: ferber, moonlight, generalized, age, ensuring, television, codes, lut,
Nearest to governor: logudorese, alexandre, tanakh, march, fled, iona, grosseto, theosis,
Epoch 1/10 Iteration: 3100 Avg. Training loss: 4.7879 0.5224 sec/batch
Epoch 1/10 Iteration: 3200 Avg. Training loss: 4.7453 0.4411 sec/batch
Epoch 1/10 Iteration: 3300 Avg. Training loss: 4.7246 0.4898 sec/batch
Epoch 1/10 Iteration: 3400 Avg. Training loss: 4.7103 0.6003 sec/batch
Epoch 1/10 Iteration: 3500 Avg. Training loss: 4.7638 0.6017 sec/batch
Epoch 1/10 Iteration: 3600 Avg. Training loss: 4.6744 0.5156 sec/batch
Epoch 1/10 Iteration: 3700 Avg. Training loss: 4.7170 0.4903 sec/batch
Epoch 1/10 Iteration: 3800 Avg. Training loss: 4.7436 0.4176 sec/batch
Epoch 1/10 Iteration: 3900 Avg. Training loss: 4.6819 0.4202 sec/batch
Epoch 1/10 Iteration: 4000 Avg. Training loss: 4.6540 0.4759 sec/batch
Nearest to use: should, livejournal, popularity, archive, concept, words, rebuffed, subexpression,
Nearest to would: octave, their, ferry, maximinus, workhorse, upgrade, boars, harmful,
Nearest to called: harmless, ingots, ourcivilisation, sidious, adjustment, margraves, phenyl, cwt,
Nearest to may: isomorphism, sigur, underlie, developing, adapter, trademarks, needs, incomprehensible,
Nearest to an: machinist, aficionados, hosea, midlands, accustomed, hashing, intra, rest,
Nearest to they: peculiarities, gathered, sailors, rm, workplace, convictions, conducts, scripture,
Nearest to american: ann, conrad, b, carlo, matthews, thompson, howser, dated,
Nearest to system: curved, yule, pejoratively, entropy, motorist, romney, misused, objects,
Nearest to professional: colonize, harcourt, leadership, bagdad, estonian, attlee, fundraiser, lessons,
Nearest to applications: argumentation, homeschooling, shut, capable, foucault, preside, misleading, automated,
Nearest to brother: patient, ethno, years, act, progress, strewn, andrade, stairs,
Nearest to versions: keyboard, barebones, pillory, dope, guis, ebbinghaus, claus, laxatives,
Nearest to san: homage, gesture, philanthropists, rodgers, razor, gand, surrealistic, dungeon,
Nearest to mathematics: epistemology, fermions, digitization, chaplin, usual, planets, confirming, ar,
Nearest to ice: confuses, ferber, moonlight, ensuring, television, lactic, taft, lut,
Nearest to governor: logudorese, alexandre, march, iona, surabaya, grosseto, fled, stylings,
Epoch 1/10 Iteration: 4100 Avg. Training loss: 4.6943 0.5503 sec/batch
Epoch 1/10 Iteration: 4200 Avg. Training loss: 4.6557 0.4840 sec/batch
Epoch 1/10 Iteration: 4300 Avg. Training loss: 4.6120 0.4332 sec/batch
---------------------------------------------------------------------------
KeyboardInterrupt                         Traceback (most recent call last)
<ipython-input-15-9312da202e8d> in <module>()
     18             feed = {inputs: x,
     19                     labels: np.array(y)[:, None]}
---> 20             train_loss, _ = sess.run([cost, optimizer], feed_dict=feed)
     21 
     22             loss += train_loss

/usr/local/lib/python3.6/site-packages/tensorflow/python/client/session.py in run(self, fetches, feed_dict, options, run_metadata)
    776     try:
    777       result = self._run(None, fetches, feed_dict, options_ptr,
--> 778                          run_metadata_ptr)
    779       if run_metadata:
    780         proto_data = tf_session.TF_GetBuffer(run_metadata_ptr)

/usr/local/lib/python3.6/site-packages/tensorflow/python/client/session.py in _run(self, handle, fetches, feed_dict, options, run_metadata)
    980     if final_fetches or final_targets:
    981       results = self._do_run(handle, final_targets, final_fetches,
--> 982                              feed_dict_string, options, run_metadata)
    983     else:
    984       results = []

/usr/local/lib/python3.6/site-packages/tensorflow/python/client/session.py in _do_run(self, handle, target_list, fetch_list, feed_dict, options, run_metadata)
   1030     if handle is None:
   1031       return self._do_call(_run_fn, self._session, feed_dict, fetch_list,
-> 1032                            target_list, options, run_metadata)
   1033     else:
   1034       return self._do_call(_prun_fn, self._session, handle, feed_dict,

/usr/local/lib/python3.6/site-packages/tensorflow/python/client/session.py in _do_call(self, fn, *args)
   1037   def _do_call(self, fn, *args):
   1038     try:
-> 1039       return fn(*args)
   1040     except errors.OpError as e:
   1041       message = compat.as_text(e.message)

/usr/local/lib/python3.6/site-packages/tensorflow/python/client/session.py in _run_fn(session, feed_dict, fetch_list, target_list, options, run_metadata)
   1019         return tf_session.TF_Run(session, options,
   1020                                  feed_dict, fetch_list, target_list,
-> 1021                                  status, run_metadata)
   1022 
   1023     def _prun_fn(session, handle, feed_dict, fetch_list):

KeyboardInterrupt: 

Restore the trained network if you need to:


In [20]:
with train_graph.as_default():
    saver = tf.train.Saver()

with tf.Session(graph=train_graph) as sess:
    saver.restore(sess, tf.train.latest_checkpoint('checkpoints'))
    embed_mat = sess.run(embedding)

Visualizing the word vectors

Below we'll use T-SNE to visualize how our high-dimensional word vectors cluster together. T-SNE is used to project these vectors into two dimensions while preserving local stucture. Check out this post from Christopher Olah to learn more about T-SNE and other ways to visualize high-dimensional data.


In [115]:
%matplotlib inline
%config InlineBackend.figure_format = 'retina'

import matplotlib.pyplot as plt
from sklearn.manifold import TSNE

In [138]:
viz_words = 500
tsne = TSNE()
embed_tsne = tsne.fit_transform(embed_mat[:viz_words, :])

In [139]:
fig, ax = plt.subplots(figsize=(14, 14))
for idx in range(viz_words):
    plt.scatter(*embed_tsne[idx, :], color='steelblue')
    plt.annotate(int_to_vocab[idx], (embed_tsne[idx, 0], embed_tsne[idx, 1]), alpha=0.7)