org.allenai.nlpstack.parse.poly.fsm

TaskTree

Related Docs: object TaskTree | package fsm

case class TaskTree(baseIdentifier: Option[TaskIdentifier], children: List[(ClassificationTask, TaskTree)]) extends Product with Serializable

A TaskTree can be viewed as a tree-structured TaskConjunctionIdentifier. Recall that a TaskConjunctionIdentifier associates every TransitionParserState with a TaskConjunction.

To do this, each TaskTree is associated with an optional TaskIdentifier ident. If this is None, then it will associate every state with the trivial TaskConjunction (i.e. TaskConjunction(List())). Otherwise, it will compute the ClassificationTask returned by applying the TaskIdentifier to the state. If this task is not contained in its children map, then it will associate the state with TaskConjunction(List(ident)). Otherwise it will recursively call the child TaskTree on the state, and accumulate a TaskConjunction.

TODO: remove this code once all dependent models are gone

baseIdentifier

the (optional) TaskIdentifier associated with this tree

children

a mapping from ClassificationTasks (in the range of baseIdentifier) to TaskTrees

Linear Supertypes
Serializable, Serializable, Product, Equals, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. TaskTree
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. AnyRef
  7. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new TaskTree(baseIdentifier: Option[TaskIdentifier], children: List[(ClassificationTask, TaskTree)])

    baseIdentifier

    the (optional) TaskIdentifier associated with this tree

    children

    a mapping from ClassificationTasks (in the range of baseIdentifier) to TaskTrees

Value Members

  1. final def !=(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Definition Classes
    AnyRef → Any

  3. final def ==(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  4. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  5. val baseIdentifier: Option[TaskIdentifier]

    the (optional) TaskIdentifier associated with this tree

  6. val children: List[(ClassificationTask, TaskTree)]

    a mapping from ClassificationTasks (in the range of baseIdentifier) to TaskTrees

  7. val childrenMap: Map[ClassificationTask, TaskTree]

  8. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  9. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  10. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  11. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  12. def identifyTaskConjunction(state: State): TaskConjunction

    Identifies the TaskConjunction associated with the argument state.

    Identifies the TaskConjunction associated with the argument state.

    state

    the parser state of interest

    returns

    the TaskConjunction associated with the argument state

  13. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  14. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  15. final def notify(): Unit

    Definition Classes
    AnyRef

  16. final def notifyAll(): Unit

    Definition Classes
    AnyRef

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

    Definition Classes
    AnyRef

  18. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  20. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped