// ParseFixtures conforms to Scorer interface
func (fixtures ParseFixtures) Score(adjacency *Adjacency) (float64, uint) {
invariant.NotNil(adjacency.From)
invariant.NotNil(adjacency.To)
key := AdjacencyFixtureKey{adjacency.From.Token, adjacency.To.Token}
return fixtures[key].Score()
}
func (lexicon Lexicon) linkWeight(xOut, yIn *AdjacencyStatistics) (
linkWeight float64, linkDepth uint) {
invariant.NotNil(xOut)
invariant.NotNil(yIn)
label, labelWeight := bestMatchingLabel(xOut, yIn)
if labelWeight == 0 {
return
}
// use the best matching label to determine the 'prototype'
// statistics to use in calculating link weight;
// prototypes tend to be frequent words, and conceptually
// describe the relationship between x & y
var prototype *AdjacencyStatistics
if label.IsClass() {
// label prototypes x along with tokens separating x from y
prototype = lexicon.Db[AdjacencyPoint{label.Token, xOut.Sign()}]
} else {
// label prototypes y in it's relationship with x
prototype = lexicon.Db[AdjacencyPoint{label.Token, -xOut.Sign()}]
}
if prototype == nil {
return
}
if label.IsClass() && prototype.Out > 0 {
linkWeight = fmin(labelWeight, prototype.OutNorm())
return
}
if label.IsAdjacency() {
if prototype.In > 0 {
linkWeight = fmin(labelWeight, prototype.InNorm())
} else if float64(prototype.InRaw) > fabs(prototype.In) {
linkWeight = fmin(labelWeight, prototype.InRawNorm())
}
if linkWeight != 0 {
if float64(prototype.InRaw) < 0 && prototype.Out <= 0 {
linkDepth = 1
}
return
}
}
if prototype.Out <= 0 && prototype.In <= 0 && (label.IsAdjacency() || prototype.Out == 0) {
linkWeight = labelWeight
return
}
return
}