org.allenai.nlpstack.parse.poly.polyparser

NumChildrenToTheRight

Related Doc: package polyparser

case class NumChildrenToTheRight(max: Int) extends TokenTransform with Product with Serializable

The NumChildrenToTheRight transform maps a token to how many of its children appear to its right in the state's tokens sequence. This will only be relevant for nodes on the stack (it is impossible for a buffer node to be associated with nodes to its right)

It takes an argument max which allows you to specify an upper bound. For instance, if max = 3 and a token has 5 children to its right, then applying this transform to that token will return Set(Symbol("3")), not Set(Symbol("5")).

See the definition of TokenTransform (above) for more details about the interface.

max

an upper bound on the number of children (anything higher will round down to max)

Linear Supertypes
Serializable, Serializable, Product, Equals, TokenTransform, (TransitionParserState, Int) ⇒ Set[Symbol], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. NumChildrenToTheRight
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. TokenTransform
  7. Function2
  8. AnyRef
  9. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new NumChildrenToTheRight(max: Int)

    max

    an upper bound on the number of children (anything higher will round down to max)

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. def apply(state: TransitionParserState, tokenIndex: Int): Set[Symbol]

    Definition Classes
    NumChildrenToTheRight → Function2
  5. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  6. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  7. def curried: (TransitionParserState) ⇒ (Int) ⇒ Set[Symbol]

    Definition Classes
    Function2
    Annotations
    @unspecialized()
  8. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  9. def finalize(): Unit

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

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

    Definition Classes
    Any
  12. val max: Int

    an upper bound on the number of children (anything higher will round down to max)

  13. val name: Symbol

    Provides a symbolic representation of the transform, used for creating feature names.

    Provides a symbolic representation of the transform, used for creating feature names.

    Definition Classes
    NumChildrenToTheRightTokenTransform
  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. def toString(): String

    Definition Classes
    Function2 → AnyRef → Any
  19. def tupled: ((TransitionParserState, Int)) ⇒ Set[Symbol]

    Definition Classes
    Function2
    Annotations
    @unspecialized()
  20. final def wait(): Unit

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  22. 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 TokenTransform

Inherited from (TransitionParserState, Int) ⇒ Set[Symbol]

Inherited from AnyRef

Inherited from Any

Ungrouped