Find a data sample with the same intent and entities.
Given the parsed data from a message (intent and entities) finds a message in the data that has the same intent and entities.
Plots the graph and persists it into a html file.
Given a set of event lists, visualizing the flows.
Given a set of stories, generates a graph visualizing the flows in the stories.
Visualization is always a trade off between making the graph as small as possible while at the same time making sure the meaning doesn't change to "much". The algorithm will compress the graph generated from the stories to merge nodes that are similar. Hence, the algorithm might create paths through the graph that aren't actually specified in the stories, but we try to minimize that.
Output file defines if and where a file containing the plotted graph should be stored.
The history defines how much 'memory' the graph has. This influences in which situations the algorithm will merge nodes. Nodes will only be merged if they are equal within the history, this means the larger the history is we take into account the less likely it is we merge any nodes.
The training data parameter can be used to pass in a Rasa NLU training data instance. It will be used to replace the user messages from the story file with actual messages from the training data.