Produce N identical layers.

prepare word2id :param words: words corpus :param lower: whether lower char :return mappings

Initialize the encoder hidden state.

called by constructor and __iadd__ to avoid creating new instances.

called by constructor and __iadd__ to avoid creating new instances.

Takes a test sentence and returns an object that encapsulates everything that BLEU needs to know about it.

Create a mapping (item to ID / ID to item) from a dictionary. Items are ordered by decreasing frequency. char is an indicator whether the

Takes a string as input and returns an object that can be given to either cook_refs or cook_test. This is optional: cook_refs and cook_test ca

Takes a string as input and returns an object that can be given to either cook_refs or cook_test. This is optional: cook_refs and cook_test

Compute ROUGE-L score given one candidate and references for an image :param candidate: str : candidate sentence to be evaluated

Compute term frequency for reference data. This will be used to compute idf (inverse document frequency later) The term frequ

Takes a list of reference sentences for a single segment and returns an object that encapsulates everything that BLEU needs to know about them

Takes a list of reference sentences for a single segment and returns an object that encapsulates everything that BLEU needs to know about them

Takes a test sentence and returns an object that encapsulates everything that BLEU needs to know about it. :param test: list of string : hypot

Create a dictionary of items from a list of list of items.

parse optimization method parameters, and initialize optimizer function

Calculates longest common subsequence for a pair of tokenized strings :param string : list of str : tokens from a string split using whites

return (bleu, len_ratio) pair

add an instance (e.g., from another sentence).

add an instance (e.g., from another sentence).