def generate_transition_trigram_probabilities(transition_bigram_counts, transition_trigram_counts):
	"""Takes in the bigram and trigram count matrices.
	Creates dictionary containing the transition trigram 
	probabilities in the following format:
	{(tag[i-2], tag[i-1], tag[i]) : probability}
	where the probability is calculated by the following formula:
	probability((tag[i-2], tag[i-1], tag[i])) = count((tag[-2], tag[i-1], tag[i]))/count((tag[i-2], tag[i-1]))
	"""
	transition_trigram_probabilities = dict()
	for tag_trigram in transition_trigram_counts:
		transition_trigram_probabilities[tag_trigram] = float(transition_trigram_counts[tag_trigram])/transition_bigram_counts[(tag_trigram[0], tag_trigram[1])]
	return transition_trigram_probabilities