RiTa - a software toolkit for computational literature

Reference

Class

RiMarkov

Name

probabilities
Description Returns the full set of possible next tokens as a map, given an array of tokens representing the path down the tree (with length less than n).
 
Note: seed arrays of any size (>0) may be input, but only the last n-1 elements will be considered.
Example 
rm = new RiMarkov(3); 
rm.loadText(theText);
rm.probabilities(["be", "thought"]);
Parameters
String OR String[]a single token or array of tokens (strings)
doubletemperature (optional)
Returns
Object
(or Map in Java)		An object (JS) or HashMap (Java) mapping words to probabilities
Syntax 
probabilities(pathString);
probabilities(pathArray);
probabilities(pathString, temperature);
probabilities(pathArray, temperature);
Platform Java / JavaScript