org.allenai.nlpstack.parse.poly.fsm

TaskTreeIdentifier

Related Docs: class TaskTreeIdentifier | package fsm

object TaskTreeIdentifier extends Serializable

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

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. def clone(): AnyRef

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

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

    Definition Classes
    AnyRef → Any
  8. def finalize(): Unit

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

    Definition Classes
    AnyRef → Any
  10. def hashCode(): Int

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

    Definition Classes
    Any
  12. def learnTaskTreeIdentifier(taskIdentifiers: IndexedSeq[TaskIdentifier], goldStates: Iterator[State], qualifyingCount: Int): TaskTreeIdentifier

    Learn a TaskTreeIdentifier from a list of TaskIdentifiers.

    Learn a TaskTreeIdentifier from a list of TaskIdentifiers. It will enumerate the set of parser states found in a set of gold parses. Then, from the set of possible TaskConjunctions induced by the TaskIdentifier list, it will compute the subset which are associated with at least qualifyingCount parser states. Then it will build a tree-structure over these and return a TaskTreeIdentifier.

    taskIdentifiers

    a list of base TaskIdentifiers

    goldStates

    a set of gold states

    qualifyingCount

    the minimum state count that a TaskConjunction needs to qualify for the resulting TaskTree

    returns

    the resulting TaskTreeIdentifier

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

    Definition Classes
    AnyRef
  14. final def notify(): Unit

    Definition Classes
    AnyRef
  15. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  16. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  17. def toString(): String

    Definition Classes
    AnyRef → Any
  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 AnyRef

Inherited from Any

Ungrouped