Created
March 27, 2018 17:05
-
-
Save Venryx/c594a971849d6ef1154feb9d264ea43d to your computer and use it in GitHub Desktop.
ReasonScore - Draft 4
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import { MapNodeL3 } from "Store/firebase/nodes/@MapNode"; | |
import { GetNodeChildrenL2, GetNodeChildrenL3 } from "Store/firebase/nodes"; | |
import {MapNodeL2, Polarity, LayerPlusAnchorParentSet} from "../nodes/@MapNode"; | |
import {IsSpecialEmptyArray, emptyArray_forLoading} from "../../../Frame/Store/ReducerUtils"; | |
import {GetFinalPolarity} from "../nodes/$node"; | |
import {MapNodeType} from "../nodes/@MapNodeType"; | |
import { Lerp } from "js-vextensions"; | |
import { ArgumentType } from "Store/firebase/nodes/@MapNodeRevision"; | |
export function RS_CalculateTruthScore(node: MapNodeL3) { | |
Assert(node.type == MapNodeType.Claim, "RS truth-score can only be calculated for a claim."); | |
let childArguments = GetChildArguments(node); | |
if (childArguments == null || childArguments.length == 0) return 1; | |
let runningAverage; | |
let weightTotalSoFar = 0; | |
for (let argument of childArguments) { | |
let premises = GetNodeChildrenL3(argument).filter(a=>a.type == MapNodeType.Claim); | |
if (premises.length == 0) continue; | |
Assert(argument.current.argumentType == ArgumentType.All, `ReasonScore currently only supports multi-premise arguments of the "all" type.`); | |
let truthScoresProduct = premises.map(premise=>RS_CalculateTruthScore(premise)).reduce((prev, cur)=>prev * cur); | |
let weight = RS_CalculateWeight(argument, premises); | |
if (argument.finalPolarity == Polarity.Opposing) { | |
truthScoresProduct = 1 - truthScoresProduct; | |
} | |
if (runningAverage == null) { | |
weightTotalSoFar = weight; | |
runningAverage = truthScoresProduct; | |
} else { | |
weightTotalSoFar += weight; // increase weight first | |
let deviationFromAverage = truthScoresProduct - runningAverage; | |
let weightRelativeToTotal = weight / weightTotalSoFar; | |
runningAverage += deviationFromAverage * weightRelativeToTotal; | |
} | |
} | |
return runningAverage; | |
} | |
export function RS_CalculateBaseWeight(claim: MapNodeL3) { | |
let truthScore = RS_CalculateTruthScore(claim); | |
// if truth-score drops below 50, it has 0 weight | |
if (truthScore <= .5) return 0; | |
let weight = (truthScore - .5) / .5; | |
return weight; | |
} | |
export function RS_CalculateWeightMultiplier(node: MapNodeL3) { | |
Assert(node.type == MapNodeType.Argument, "RS weight-multiplier can only be calculated for an argument<>claim combo -- which is specified by providing its argument node."); | |
let childArguments = GetChildArguments(node); | |
if (childArguments == null || childArguments.length == 0) return 1; | |
let runningMultiplier = 1; | |
let runningDivisor = 1; | |
for (let argument of childArguments) { | |
let premises = GetNodeChildrenL3(argument).filter(a=>a.type == MapNodeType.Claim); | |
if (premises.length == 0) continue; | |
Assert(argument.current.argumentType == ArgumentType.All, `ReasonScore currently only supports multi-premise arguments of the "all" type.`); | |
let truthScoresProduct = premises.map(premise=>RS_CalculateTruthScore(premise)).reduce((prev, cur)=>prev * cur); | |
let weight = RS_CalculateWeight(argument, premises); | |
if (argument.finalPolarity == Polarity.Supporting) { | |
runningMultiplier += truthScoresProduct * weight; | |
} else { | |
runningDivisor += truthScoresProduct * weight; | |
} | |
} | |
return runningMultiplier / runningDivisor; | |
} | |
export function RS_CalculateWeight(argument: MapNodeL3, premises: MapNodeL3[]) { | |
let baseWeightsProduct = premises.map(premise=>RS_CalculateBaseWeight(premise)).reduce((prev, cur)=>prev * cur); | |
let weightMultiplier = RS_CalculateWeightMultiplier(argument); | |
return baseWeightsProduct * weightMultiplier; | |
} | |
function GetChildArguments(node: MapNodeL3): MapNodeL3[] { | |
let children = GetNodeChildrenL3(node); | |
if (children == emptyArray_forLoading || children.Any(a=>a == null)) return null; // null means still loading | |
let childArguments = children.filter(a=>a.type == MapNodeType.Argument); | |
for (let child of childArguments) { | |
let childChildren = GetNodeChildrenL3(child); | |
if (childChildren == emptyArray_forLoading || childChildren.Any(a=>a == null)) return null; // null means still loading | |
} | |
return childArguments; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment