epic.parser.GrammarAnchoring.scala Maven / Gradle / Ivy
The newest version!
package epic.parser
/*
Copyright 2012 David Hall
Licensed under the Apache License, Version 2.0 (the "License")
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
import nak.inference.Factor
import epic.lexicon.Lexicon
import epic.constraints.{TagConstraints, ChartConstraints}
/**
* A GrammarAnchoring is a grammar that has been tuned to a particular sentence (if applicable).
* It knows how to do two things: assign scores to rules and spans, and determine reachability of various refinements.
*
* It might be nice to consider a refined grammar that doesn't need sentence-specific tuning, but
* that interferes with integrating lexicalization into the framework.
*
* @author dlwh
*/
trait GrammarAnchoring[L, W] {
def topology: RuleTopology[L]
def lexicon: Lexicon[L, W]
def words: IndexedSeq[W]
def sparsityPattern: ChartConstraints[L]
def length = words.length
def logPartition: Double = marginal.logPartition
private lazy val lexLoc = lexicon.anchor(words)
def tagConstraints: TagConstraints[L] = lexLoc
/**
* Scores the indexed label rule with refinenemnt ref, when it occurs at (begin, end). Can be used for s, or for a
* "bottom" label. Mainly used for s.
*/
def scoreSpan(begin: Int, end: Int, label: Int, ref: Int):Double
/**
* Scores the indexed [[epic.trees.BinaryRule]] rule when it occurs at (begin, split, end)
*/
def scoreBinaryRule(begin: Int, split: Int, end: Int, rule: Int, ref: Int):Double
/**
* Scores the indexed [[epic.trees.UnaryRule]] rule when it occurs at (begin, end)
*/
def scoreUnaryRule(begin: Int, end: Int, rule: Int, ref: Int):Double
def addConstraints(constraints: ChartConstraints[L]):GrammarAnchoring[L, W]
// factor methods
/**
* Computes the pointwise product of two grammars, augmenting
* their refinement space to reflect this. If they share the same annotationTag,
* (assuming it's non-negative) they will share their state space. (That is,
* they will have the same annotations.)
* @param other
* @return
*/
def *(other: GrammarAnchoring[L, W]):GrammarAnchoring[L,W] = {
// hacky multimethod dispatch is hacky
if (other eq null) this // ugh
else if (other.isInstanceOf[UnrefinedGrammarAnchoring.Identity[L, W]]) this.addConstraints(other.sparsityPattern)
else if (this.isInstanceOf[UnrefinedGrammarAnchoring.Identity[L, W]]) other.addConstraints(sparsityPattern)
else new ProductGrammarAnchoring(this,other)
}
def *(other: UnrefinedGrammarAnchoring[L, W]):GrammarAnchoring[L, W] = {
// hacky multimethod dispatch is hacky
if (other eq null) this // ugh
else if (other.isInstanceOf[UnrefinedGrammarAnchoring.Identity[L, W]]) this.addConstraints(other.sparsityPattern)
else if (this.isInstanceOf[UnrefinedGrammarAnchoring.Identity[L, W]]) other.addConstraints(other.sparsityPattern)
else new ProductGrammarAnchoring(this,other)
}
/**
* Computes the pointwise division of two grammars, augmenting
* their refinement space to reflect this. If they share the same annotationTag,
* (assuming it's non-negative) they will share their state space. (That is,
* they will have the same annotations.)
* @param other
* @return
*/
def /(other: GrammarAnchoring[L, W]):GrammarAnchoring[L,W] = {
if (other.eq(null)) this
else if (other.isInstanceOf[UnrefinedGrammarAnchoring.Identity[L, W]]) this.addConstraints(other.sparsityPattern)
else new ProductGrammarAnchoring(this, other, -1)
}
def maxMarginal = RefinedChartMarginal(this, maxMarginal = true)
def marginal = RefinedChartMarginal(this, maxMarginal = false)
def isConvergedTo(f: GrammarAnchoring[L, W], diff: Double):Boolean = {
import scala.util.control.Breaks._
var converged = true
breakable {
marginal visit new AnchoredVisitor[L] {
def visitBinaryRule(begin: Int, split: Int, end: Int, rule: Int, ref: Int, score: Double) {
val myScore = scoreBinaryRule(begin, split, end, rule, ref)
val theirScore = f.scoreBinaryRule(begin, split, end, rule, ref)
if (myScore != theirScore) {
if (theirScore.isInfinite || myScore.isInfinite) {
converged = false
break()
}
val df = (myScore - theirScore).abs / math.max(math.max(myScore.abs,theirScore.abs),1E-4)
if (df > diff) {
converged = false
break()
}
}
}
def visitUnaryRule(begin: Int, end: Int, rule: Int, ref: Int, score: Double) {
val myScore = scoreUnaryRule(begin, end, rule, ref)
val theirScore = f.scoreUnaryRule(begin, end, rule, ref)
assert(!myScore.isInfinite)
if (myScore != theirScore) {
if (theirScore.isInfinite || myScore.isInfinite) {
converged = false
break()
}
val df = (myScore - theirScore).abs / math.max(math.max(myScore.abs,theirScore.abs), 1E-4)
if (df > diff) {
converged = false
break()
}
}
}
def visitSpan(begin: Int, end: Int, tag: Int, ref: Int, score: Double) = {
val myScore = scoreSpan(begin, end, tag, ref)
val theirScore = f.scoreSpan(begin, end, tag, ref)
if (myScore != theirScore) {
if (theirScore.isInfinite || myScore.isInfinite) {
converged = true
break()
}
val df = (myScore - theirScore).abs / math.max(math.max(myScore.abs,theirScore.abs), 1E-4)
if (df > diff) {
converged = false
break()
}
}
}
}
}
// println(converged)
converged
}
/**
* The annotationTag controls if two grammars are over the same refinements.
* If they are, then * and / can be much faster.
*
* Note that 0 is reserved for unrefined anchorings, and -1 never matches other tags.
*
* Reserved:
* 1 - Lexicalized Parsers with no symbol or rule annotation
*
* 0's will be optimized
*/
def annotationTag: Int = -1
// stuff related to reachability
/**
* For a given span, what refinements to the label are allowed?
* Refinements in general are in the range (0, numValidRefinements). This
* method may return a subset.
* @return array of valid refinements. Don't modify!
*/
def validLabelRefinements(begin: Int, end: Int, label: Int):Array[Int]
def maxLabelRefinements: Int = (0 until topology.labelIndex.size).map(numValidRefinements _).max
def numValidRefinements(label: Int):Int
def numValidRuleRefinements(rule: Int):Int
/**
* For a given span and the parent's refinement, what refinements to the rule are allowed?
* @param rule
* @param begin
* @param end
* @return
*/
def validRuleRefinementsGivenParent(begin: Int, end: Int, rule: Int, parentRef: Int):Array[Int]
def validRuleRefinementsGivenParent(begin: Int, splitBegin: Int, splitEnd: Int, end: Int, rule: Int, parentRef: Int):Array[Int] = validRuleRefinementsGivenParent(begin, end, rule, parentRef)
def validRuleRefinementsGivenLeftChild(begin: Int, split: Int, completionBegin: Int, completionEnd: Int, rule: Int, childRef: Int):Array[Int]
def validRuleRefinementsGivenRightChild(completionBegin: Int, completionEnd: Int, split: Int, end: Int, rule: Int, childRef: Int):Array[Int]
def validUnaryRuleRefinementsGivenChild(begin: Int, end: Int, rule: Int, childRef: Int):Array[Int]
def leftChildRefinement(rule: Int, ruleRef: Int):Int
def rightChildRefinement(rule: Int, ruleRef: Int):Int
def parentRefinement(rule: Int, ruleRef: Int):Int
def childRefinement(rule: Int, ruleRef: Int):Int
/**
* Returns the refined rule given parent and child refinements for a unary rule.
* May return -1 if no such rule is allowed.
* @param r rule index
* @param refA parent index
* @param refB child index
* @return rule refinement id, or -1 if rule is not allowed with those refinements
*/
def ruleRefinementFromRefinements(r: Int, refA: Int, refB: Int):Int
/**
* Returns the refined rule given parent and child refinements for a unary rule.
* May return -1 if no such rule is allowed.
* @param r rule Index
* @param refA parent index
* @param refB left child index
* @param refC right child index
* @return rule refinement id, or -1 if rule is not allowed with those refinements
*/
def ruleRefinementFromRefinements(r: Int, refA: Int, refB: Int, refC: Int):Int
def validCoarseRulesGivenParentRefinement(a: Int, refA: Int): Array[Int]
def validParentRefinementsGivenRule(begin: Int, splitBegin: Int, splitEnd: Int, end: Int, rule: Int): Array[Int]
def validLeftChildRefinementsGivenRule(begin: Int, end: Int, completionBegin: Int, completionEnd: Int, rule: Int): Array[Int]
def validRightChildRefinementsGivenRule(completionBegin: Int, completionEnd: Int, begin: Int, end: Int, rule: Int): Array[Int]
}
object GrammarAnchoring {
def identity[L, W](topology: RuleTopology[L],
lexicon: Lexicon[L, W],
constraints: ChartConstraints[L],
words: IndexedSeq[W]): GrammarAnchoring[L, W] = {
UnrefinedGrammarAnchoring.identity[L, W](topology, lexicon, words, constraints)
}
trait StructureDelegatingAnchoring[L, W] extends GrammarAnchoring[L, W] {
protected def baseAnchoring: GrammarAnchoring[L, W]
def topology: RuleTopology[L] = baseAnchoring.topology
def lexicon: Lexicon[L, W] = baseAnchoring.lexicon
def words: IndexedSeq[W] = baseAnchoring.words
// def scoreSpan(begin: Int, end: Int, label: Int, ref: Int): Double = baseAnchoring.scoreSpan(begin: Int, end: Int, label: Int, ref: Int)
// def scoreBinaryRule(begin: Int, split: Int, end: Int, rule: Int, ref: Int): Double = baseAnchoring.scoreBinaryRule(begin: Int, split: Int, end: Int, rule: Int, ref: Int)
// def scoreUnaryRule(begin: Int, end: Int, rule: Int, ref: Int): Double = baseAnchoring.scoreUnaryRule(begin: Int, end: Int, rule: Int, ref: Int)
def validLabelRefinements(begin: Int, end: Int, label: Int): Array[Int] = baseAnchoring.validLabelRefinements(begin: Int, end: Int, label: Int)
def numValidRefinements(label: Int): Int = baseAnchoring.numValidRefinements(label: Int)
def numValidRuleRefinements(rule: Int): Int = baseAnchoring.numValidRuleRefinements(rule: Int)
def validRuleRefinementsGivenParent(begin: Int, end: Int, rule: Int, parentRef: Int): Array[Int] = baseAnchoring.validRuleRefinementsGivenParent(begin: Int, end: Int, rule: Int, parentRef: Int)
def validRuleRefinementsGivenLeftChild(begin: Int, split: Int, completionBegin: Int, completionEnd: Int, rule: Int, childRef: Int): Array[Int] = baseAnchoring.validRuleRefinementsGivenLeftChild(begin: Int, split: Int, completionBegin: Int, completionEnd: Int, rule: Int, childRef: Int)
def validRuleRefinementsGivenRightChild(completionBegin: Int, completionEnd: Int, split: Int, end: Int, rule: Int, childRef: Int): Array[Int] = baseAnchoring.validRuleRefinementsGivenRightChild(completionBegin: Int, completionEnd: Int, split: Int, end: Int, rule: Int, childRef: Int)
def validUnaryRuleRefinementsGivenChild(begin: Int, end: Int, rule: Int, childRef: Int): Array[Int] = baseAnchoring.validUnaryRuleRefinementsGivenChild(begin: Int, end: Int, rule: Int, childRef: Int)
def leftChildRefinement(rule: Int, ruleRef: Int): Int = baseAnchoring.leftChildRefinement(rule: Int, ruleRef: Int)
def rightChildRefinement(rule: Int, ruleRef: Int): Int = baseAnchoring.rightChildRefinement(rule: Int, ruleRef: Int)
def parentRefinement(rule: Int, ruleRef: Int): Int = baseAnchoring.parentRefinement(rule: Int, ruleRef: Int)
def childRefinement(rule: Int, ruleRef: Int): Int = baseAnchoring.childRefinement(rule: Int, ruleRef: Int)
def ruleRefinementFromRefinements(r: Int, refA: Int, refB: Int): Int = baseAnchoring.ruleRefinementFromRefinements(r: Int, refA: Int, refB: Int)
def ruleRefinementFromRefinements(r: Int, refA: Int, refB: Int, refC: Int): Int = baseAnchoring.ruleRefinementFromRefinements(r: Int, refA: Int, refB: Int, refC: Int)
def validCoarseRulesGivenParentRefinement(a: Int, refA: Int): Array[Int] = baseAnchoring.validCoarseRulesGivenParentRefinement(a: Int, refA: Int)
def validParentRefinementsGivenRule(begin: Int, splitBegin: Int, splitEnd: Int, end: Int, rule: Int): Array[Int] = baseAnchoring.validParentRefinementsGivenRule(begin: Int, splitBegin: Int, splitEnd: Int, end: Int, rule: Int)
def validLeftChildRefinementsGivenRule(begin: Int, end: Int, completionBegin: Int, completionEnd: Int, rule: Int): Array[Int] = baseAnchoring.validLeftChildRefinementsGivenRule(begin: Int, end: Int, completionBegin: Int, completionEnd: Int, rule: Int)
def validRightChildRefinementsGivenRule(completionBegin: Int, completionEnd: Int, begin: Int, end: Int, rule: Int): Array[Int] = baseAnchoring.validRightChildRefinementsGivenRule(completionBegin: Int, completionEnd: Int, begin: Int, end: Int, rule: Int)
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy