Semiring

Operations in factored algorithms are defined by a semiring algebraic structure. Each semiring defines a product and sum operation, and a value for zero and one which satisfy a set of properties. Different semirings are appropriate for certain algorithms and data types.

Linear Supertypes

AnyRef, Any

Known Subclasses

BooleanSemiring, BoundsSumProductSemiring, DivideableSemiRing, LogMaxProductSemiring, LogSumProductSemiring, MaxProductSemiring, SufficientStatisticsSemiring, SumProductSemiring, SumProductUtilitySemiring

Abstract Value Members

abstract val one: T

A value such that a*1 = a
abstract def product(x: T, y: T): T

Product of two entries, as defined by the particular inference problem.
abstract def sum(x: T, y: T): T

Sum of two entries, as defined by the particular inference problem.
Sum of two entries, as defined by the particular inference problem. E.g., for computing conditional probabilities, sum is ordinary addition; for most probable explanation, it is max.
abstract val zero: T

A value such that a + 0 = a

Concrete Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def sumMany(xs: Traversable[T]): T

Sum of many entries.
Sum of many entries. Typically, this would be implemented by the ordinary sum, but there may be more efficient implementations.
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Doc: package factors

trait Semiring[T] extends AnyRef

Abstract Value Members

abstract val one: T

abstract def product(x: T, y: T): T

abstract def sum(x: T, y: T): T

abstract val zero: T

Concrete Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def sumMany(xs: Traversable[T]): T

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

Inherited from AnyRef

Inherited from Any

Ungrouped