epic.constraints.LabeledSpanConstraints.scala Maven / Gradle / Ivy
package epic
package constraints
import scala.collection.BitSet
import breeze.collection.mutable.TriangularArray
import epic.constraints.LabeledSpanConstraints._
import java.util
import scala.collection.mutable.ArrayBuffer
import scala.annotation.unchecked.uncheckedVariance
import breeze.util.{Encoder, Index}
import epic.util.Has2
import java.io._
import org.mapdb.Serializer
import scala.Serializable
import epic.constraints.LabeledSpanConstraints.SimpleConstraints
/**
* Tells us wehther a given (labeled) span is allowed in a given sentence. Can
* be calculated either using rules/heuristics or via some kind
* of ML algorithm. We use a combination in Epic.
*
* @author dlwh
*/
sealed trait LabeledSpanConstraints[-L] extends SpanConstraints {
def isAllowedLabeledSpan(begin: Int, end: Int, label: Int): Boolean
def isAllowedSpan(begin: Int, end: Int): Boolean
/** How long can a span be if it starts at begin*/
def maxSpanLengthStartingAt(begin: Int):Int
/** How long can a span be if it has label label in this sentence? */
def maxSpanLengthForLabel(label: Int):Int
/**
* Computes the intersection of the constraints
* @param other
* @return
*/
def &(other: LabeledSpanConstraints[L @uncheckedVariance ]): LabeledSpanConstraints[L] = {
if(this eq other) this
else this match {
case NoConstraints => other
case PromotedSpanConstraints(inner) => other match {
case NoConstraints => this
case PromotedSpanConstraints(otherinner) => PromotedSpanConstraints(inner & otherinner)
case SimpleConstraints(maxPosX, maxLx, x) => SimpleConstraints(maxPosX, maxLx,
TriangularArray.tabulate(x.dimension){(b, e) =>
if(x(b,e) == null || !inner.isAllowedSpan(b,e)) null
else x(b,e)
})
}
case SimpleConstraints(maxPosX, maxLx, x) => other match {
case NoConstraints => this
case x: PromotedSpanConstraints => (x:LabeledSpanConstraints[L]) & this
case SimpleConstraints(maxPosY, maxLy, y) =>
require(x.dimension == y.dimension, "Dimensions of constrained spans must match!")
SimpleConstraints( elementwiseMin(maxPosX, maxPosY), elementwiseMin(maxLx, maxLy),
TriangularArray.tabulate(x.dimension) { (b,e) =>
if(x(b,e) == null || y(b,e) == null) null
else x(b,e) & y(b,e)
})
}
}
}
def containsAll(other: LabeledSpanConstraints[L @uncheckedVariance]):Boolean = this match {
case NoConstraints => true
case SimpleConstraints(maxPosX, maxLx, x) => other match {
case NoConstraints => throw new UnsupportedOperationException("Can't check Simple.containsAll(noconstraints)")
case SimpleConstraints(maxPosY, maxLy, y) =>
(maxPosX.zip(maxPosY).forall{case (x,y) => x >= y }
&& maxLx.zip(maxLy).forall{case (x,y) => x >= y }
&& {
for(i <- (0 until x.dimension).iterator;
j <- ((i + 1) until y.dimension).iterator)
yield (y(i,j) eq null) || ((x(i,j) ne null) && (y(i,j) &~ x(i,j )).isEmpty)
}.forall(identity))
}
}
/**
* Computes the union of the constraints
* @param other
* @return
*/
def |(other: LabeledSpanConstraints[L @uncheckedVariance ]): LabeledSpanConstraints[L] = this match {
case NoConstraints => this
case PromotedSpanConstraints(inner) => other match {
case NoConstraints => this
case PromotedSpanConstraints(otherinner) => PromotedSpanConstraints(inner | otherinner)
case SimpleConstraints(maxPosX, maxLx, x) => ???
}
case SimpleConstraints(maxPosX, maxLx, x) => other match {
case NoConstraints => this
case x: PromotedSpanConstraints => (x:LabeledSpanConstraints[L]) | this
case SimpleConstraints(maxPosY, maxLy, y) =>
require(x.dimension == y.dimension, "Dimensions of constrained spans must match!")
SimpleConstraints( elementwiseMax(maxPosX, maxPosY), elementwiseMax(maxLx, maxLy),
TriangularArray.tabulate(x.dimension) { (b,e) =>
if(x(b,e) == null) y(b,e)
else if (y(b,e) == null) x(b, e)
else x(b,e) | y(b,e)
})
}
}
def decode(labelIndex: Index[L@uncheckedVariance ]):String
}
object LabeledSpanConstraints {
implicit def serializerLabeledSpanConstraints[L]:Serializer[LabeledSpanConstraints[L]] = new Serializer[LabeledSpanConstraints[L]] with Serializable {
def serialize(out: DataOutput, value: LabeledSpanConstraints[L]) {
// it really shouldn't need to be unchecked. TODO
(value: @unchecked) match {
case NoConstraints =>
out.writeBoolean(false)
case SimpleConstraints(maxLengthsForPosition, maxLengthsForLabel, spans) =>
out.writeBoolean(true)
val length: Int = maxLengthsForPosition.length
out.writeInt(length)
if(length < Byte.MaxValue) {
for(i <- 0 until length) {
out.writeByte( (maxLengthsForPosition(i) min length).toByte)
}
} else {
for(i <- 0 until length) {
out.writeInt(maxLengthsForPosition(i))
}
}
out.writeInt(maxLengthsForLabel.length)
for(i <- 0 until maxLengthsForLabel.length) {
out.writeInt(maxLengthsForLabel(i))
}
for(i <- 0 until length; j <- (i+1) to length if value.isAllowedSpan(i, j)) {
val cardinality: Int = spans(i, j).cardinality
if(cardinality != 0) {
out.writeInt(TriangularArray.index(i, j))
if(cardinality == 1) {
// have to deal with 0 length mask
out.writeInt(~(spans(i, j).nextSetBit(0)))
} else {
val bitmask: Array[Byte] = spans(i, j).toByteArray
out.writeInt(bitmask.length)
out.write(bitmask)
}
}
}
out.writeInt(-1)
}
}
def deserialize(in: DataInput, available: Int): LabeledSpanConstraints[L] = {
in.readBoolean() match {
case false => NoConstraints
case true =>
import in._
val length = readInt()
val maxLengthsForPosition = new Array[Int](length)
if(length < Byte.MaxValue) {
for(i <- 0 until length) {
maxLengthsForPosition(i) = readByte()
}
} else {
for(i <- 0 until length) {
maxLengthsForPosition(i) = readInt()
}
}
val labelLen = in.readInt()
val maxLengthsForLabel = new Array[Int](labelLen)
for(i <- 0 until maxLengthsForLabel.length) {
maxLengthsForLabel(i) = in.readInt()
}
val spans = new TriangularArray[util.BitSet](length+1)
var ok = true
while(ok) {
ok = false
val ti = readInt()
if(ti >= 0) {
ok = true
val bitmaskSize = readInt()
if(bitmaskSize < 0) {
val index = ~bitmaskSize
spans.data(ti) = new util.BitSet()
spans.data(ti).set(index)
} else {
val bytes = new Array[Byte](bitmaskSize)
in.readFully(bytes)
spans.data(ti) = util.BitSet.valueOf(bytes)
}
}
}
new SimpleConstraints[L](maxLengthsForPosition, maxLengthsForLabel, spans)
}
}
}
trait Factory[L, W] extends SpanConstraints.Factory[W] with Has2[IndexedSeq[W], LabeledSpanConstraints[L]] {
def constraints(w: IndexedSeq[W]):LabeledSpanConstraints[L]
override def get(h: IndexedSeq[W]): LabeledSpanConstraints[L] = constraints(h)
}
def noConstraints[L]:LabeledSpanConstraints[L] = NoConstraints
def apply[L](spans: TriangularArray[_ <: BitSet]):LabeledSpanConstraints[L] = {
val maxLengthPos = Array.tabulate(spans.dimension-1) { begin =>
val maxEnd = ((spans.dimension-1) until begin by -1).find(end => spans(begin,end) != null && spans(begin,end).nonEmpty).getOrElse(begin)
maxEnd - begin
}
val maxLengthLabel = ArrayBuffer[Int]()
for(begin <- 0 until spans.dimension; end <- (begin+1) until spans.dimension) {
if(spans(begin, end) ne null) {
for(l <- spans(begin, end)) {
if(l >= maxLengthLabel.length) {
maxLengthLabel ++= new Array[Int](l - maxLengthLabel.length + 1)
}
maxLengthLabel(l) = maxLengthLabel(l) max (end-begin)
}
}
}
apply(maxLengthPos, maxLengthLabel.toArray, spans)
}
def apply[L](maxLengthPos: Array[Int], maxLengthLabel: Array[Int], spans: TriangularArray[_ <: BitSet]):LabeledSpanConstraints[L] = {
SimpleConstraints(maxLengthPos, maxLengthLabel, spans.map(bs => if(bs eq null) null else java.util.BitSet.valueOf(bs.toBitMask)))
}
def fromTagConstraints[L](constraints: TagConstraints[L]): LabeledSpanConstraints[L] = {
val arr = TriangularArray.tabulate(constraints.length+1) { (b,e) =>
if(b +1 == e) {
ensureBitSet(constraints.allowedTags(b))
} else {
null
}
}
apply(arr)
}
private def ensureBitSet[L](tags: Set[Int]): BitSet = {
tags match {
case x: BitSet => x
case x => BitSet.empty ++ x
}
}
@SerialVersionUID(1L)
class LayeredTagConstraintsFactory[L, W](lexicon: TagConstraints.Factory[Option[L], W], maxLengthForLabel: Array[Int]) extends Factory[L, W] with Serializable {
def constraints(h: IndexedSeq[W]): LabeledSpanConstraints[L] = apply(h)
def apply(words: IndexedSeq[W]) = layeredFromTagConstraints(lexicon.anchor(words), maxLengthForLabel)
}
def layeredFromTagConstraints[L](localization: TagConstraints[Option[L]], maxLengthForLabel: Array[Int]): LabeledSpanConstraints[L] = {
val arr = new TriangularArray[BitSet](localization.length + 1)
val maxMaxLength = maxLengthForLabel.max min localization.length
for(i <- 0 until localization.length) {
arr(i, i+1) = ensureBitSet(localization.allowedTags(i))
}
val maxLengthPos = Array.fill(localization.length)(1)
val maxLengthLabel = maxLengthForLabel.clone()
var acceptableTags = BitSet.empty ++ (0 until maxLengthForLabel.length)
for(length <- 2 to maxMaxLength if acceptableTags.nonEmpty) {
acceptableTags = acceptableTags.filter(i => maxLengthForLabel(i) >= length)
if(acceptableTags.nonEmpty)
for (begin <- 0 to (localization.length - length) ) {
val end = begin + length
if(arr(begin,begin+1) != null && arr(begin+1,end) != null) {
arr(begin, end) = (arr(begin, begin+1) & arr(begin+1, end)) & acceptableTags
if(arr(begin,end).isEmpty) {
arr(begin, end) = null
} else {
maxLengthPos(begin) = length
for(t <- arr(begin, end))
maxLengthLabel(t) = length
}
}
}
}
apply(maxLengthPos, maxLengthLabel, arr)
}
@SerialVersionUID(1L)
object NoConstraints extends LabeledSpanConstraints[Any] with Serializable {
def maxSpanLengthStartingAt(begin: Int): Int = Int.MaxValue/2 // /2 because i get worried about wrap around.
def isAllowedSpan(begin: Int, end: Int): Boolean = true
def isAllowedLabeledSpan(begin: Int, end: Int, label: Int): Boolean = true
def maxSpanLengthForLabel(label: Int):Int = Int.MaxValue / 2
def decode(labelIndex: Index[Any]):String = toString
}
@SerialVersionUID(1L)
case class PromotedSpanConstraints(inner: SpanConstraints) extends LabeledSpanConstraints[Any] with Serializable {
def maxSpanLengthStartingAt(begin: Int): Int = Int.MaxValue/2 // /2 because i get worried about wrap around.
def isAllowedSpan(begin: Int, end: Int): Boolean = inner.isAllowedSpan(begin, end)
def isAllowedLabeledSpan(begin: Int, end: Int, label: Int): Boolean = isAllowedSpan(begin, end)
def maxSpanLengthForLabel(label: Int):Int = Int.MaxValue / 2
def decode(labelIndex: Index[Any]):String = inner.toString
}
// private vars for serialization.
@SerialVersionUID(2L)
case class SimpleConstraints[L](private var maxLengthsForPosition: Array[Int], // maximum length for position
private var maxLengthsForLabel: Array[Int],
private var spans: TriangularArray[java.util.BitSet]) extends LabeledSpanConstraints[L] with Serializable {
def isAllowedSpan(begin: Int, end: Int): Boolean = (spans(begin,end) ne null) && spans(begin,end).cardinality() > 0
def isAllowedLabeledSpan(begin: Int, end: Int, label: Int): Boolean = (spans(begin,end) ne null) && spans(begin, end).get(label)
def maxSpanLengthStartingAt(begin: Int): Int = maxLengthsForPosition(begin)
def maxSpanLengthForLabel(label: Int) = if(maxLengthsForLabel.length <= label) 0 else maxLengthsForLabel(label)
def decode(labelIndex: Index[L]):String = {
val ret = new StringBuilder()
val enc = Encoder.fromIndex(labelIndex)
ret ++= "SimpleConstraints(positionMaxLengths="
ret ++= util.Arrays.toString(maxLengthsForPosition)
ret ++= ", labelMaxLengths="
ret ++= enc.decode(maxLengthsForLabel).toString
ret ++= ")\n"
for(i <- 0 until maxLengthsForPosition.length; j <- (i+1) to maxLengthsForPosition.length) {
val s = spans(i, j)
if(s ne null) {
ret ++= s" ($i,$j) " + enc.decode(Array.tabulate(labelIndex.size)(x => spans(i, j).get(x))).toString + "\n"
}
}
ret.result()
}
/*
@throws(classOf[IOException])
private def writeObject(out: ObjectOutputStream) {
serializerLabeledSpanConstraints[L].serialize(out, this)
}
@throws(classOf[IOException])
private def readObject(in: ObjectInputStream) {
val SimpleConstraints(x,y,z) = serializerLabeledSpanConstraints[L].deserialize(in, -1)
this.maxLengthsForPosition = x
this.maxLengthsForLabel = y
this.spans = z
}
*/
}
private def elementwiseMax(a: Array[Int], b: Array[Int]):Array[Int] = {
// could avoid the allocation, but whatever.
if(a.length < b.length) elementwiseMax(util.Arrays.copyOf(a, b.length), b)
else if(b.length < a.length) elementwiseMax(a, util.Arrays.copyOf(b, a.length))
else {
val result = new Array[Int](a.length)
var i = 0
while(i < result.length) {
result(i) = math.max(a(i), b(i))
i += 1
}
result
}
}
private def elementwiseMin(a: Array[Int], b: Array[Int]):Array[Int] = {
// could avoid the allocation, but whatever.
if(a.length < b.length) elementwiseMin(util.Arrays.copyOf(a, b.length), b)
else if(b.length < a.length) elementwiseMin(a, util.Arrays.copyOf(b, a.length))
else {
val result = new Array[Int](a.length)
var i = 0
while(i < result.length) {
result(i) = math.min(a(i), b(i))
i += 1
}
result
}
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy