def getList(self, node, parentProbabilities=None): if node is None: return [] if parentProbabilities is None: parentProbabilities = self.getList(node.parent) result = [] for w, p, pp in outerJoin(node.probabilities, parentProbabilities): if p is not None: result.append((w, p)) else: result.append((w, node.backOffWeight * pp)) return result
def joined(m): if m + 1 < M: return outerJoin(sorted(probabilities(m)), sorted(backOffs(m + 1))) else: return outerJoin(sorted(probabilities(m)), [])
def joined(m): if m+1 < M: return outerJoin(sorted(probabilities(m)), sorted(backOffs(m+1))) else: return outerJoin(sorted(probabilities(m)), [])