TransitionParserState

A TransitionParserState captures the current state of a transition-based parser (i.e. it corresponds to a partially constructed PolytreeParse). It includes the following fields: - the stack holds the indices of the tokens (note: the index of a token is its index in the tokens vector) on the stack. It is a vector of integers. The head of the vector represents the top of the stack. - the bufferPosition is an integer representing the index of the token that is currently at the front of the buffer. - breadcrumb maps the index of a token to its breadcrumb (see org.allenai.nlpstack.parse.poly.polyparser.PolytreeParse for the definition of breadcrumb). If a token index does not appear as a key in breadcrumb, then its breadcrumb has not yet been determined. - children maps the index of a token to the indices of its children (in the partially constructed polytree). - arcLabels maps a pair of token indices to the label of the arc between them. This presupposes that the two tokens are neighbors in the partially constructed polytree. Note that the pair of token indices is represented as a Set, so order is irrelevant. - tokens is the sequence of tokens in the sentence we are trying to parse. This will be invariant for all states of a given parsing process.

stack: the indices of the token indices on the 'stack' (stack.head is the stack top)
bufferPosition: the index of the token at the front of the 'buffer'
breadcrumb: the breadcrumbs of the partially constructed PolytreeParse
children: the children of the partially constructed PolytreeParse
arcLabels: the arc labels of the partially constructed PolytreeParse
annotatedSentence: the sentence we want to parse

Linear Supertypes

Serializable, Serializable, Product, Equals, State, AnyRef, Any

Instance Constructors

new TransitionParserState(stack: Vector[Int], bufferPosition: Int, breadcrumb: Map[Int, Int], children: Map[Int, Set[Int]], arcLabels: Map[Set[Int], Symbol], annotatedSentence: AnnotatedSentence)

stack
the indices of the token indices on the 'stack' (stack.head is the stack top)
bufferPosition
the index of the token at the front of the 'buffer'
breadcrumb
the breadcrumbs of the partially constructed PolytreeParse
children
the children of the partially constructed PolytreeParse
arcLabels
the arc labels of the partially constructed PolytreeParse
annotatedSentence
the sentence we want to parse

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
val annotatedSentence: AnnotatedSentence

the sentence we want to parse
def applyTransitionSequence(transitions: Seq[(TransitionParserState) ⇒ TransitionParserState]): TransitionParserState

Applies the provided sequence of Transitions (in order) to the state.
Applies the provided sequence of Transitions (in order) to the state.
transitions
a list of Transitions to be applied (in order)
returns
the new state resulting from the sequence of transitions applied to this state
val arcLabels: Map[Set[Int], Symbol]

the arc labels of the partially constructed PolytreeParse
def areNeighbors(token1: Int, token2: Int): Boolean

Returns whether the two tokens are connected in the parse created thus far.
final def asInstanceOf[T0]: T0

Definition Classes
Any
def asSculpture: Option[Sculpture]

Definition Classes
TransitionParserState → State
val breadcrumb: Map[Int, Int]

the breadcrumbs of the partially constructed PolytreeParse
lazy val bufferIsEmpty: Boolean

Returns whether the buffer has been exhausted.
val bufferPosition: Int

the index of the token at the front of the 'buffer'
val children: Map[Int, Set[Int]]

the children of the partially constructed PolytreeParse
def clone(): AnyRef

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

Definition Classes
AnyRef
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 getGretels(nodeIndex: Int): Set[Int]
lazy val isFinal: Boolean

Returns whether this is the final state of a transition parse.
Returns whether this is the final state of a transition parse.

Definition Classes
TransitionParserState → State
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
val sentence: Sentence
val stack: Vector[Int]

the indices of the token indices on the 'stack' (stack.head is the stack top)
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
TransitionParserState → 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 polyparser

case class TransitionParserState(stack: Vector[Int], bufferPosition: Int, breadcrumb: Map[Int, Int], children: Map[Int, Set[Int]], arcLabels: Map[Set[Int], Symbol], annotatedSentence: AnnotatedSentence) extends State with Product with Serializable

Instance Constructors

new TransitionParserState(stack: Vector[Int], bufferPosition: Int, breadcrumb: Map[Int, Int], children: Map[Int, Set[Int]], arcLabels: Map[Set[Int], Symbol], annotatedSentence: AnnotatedSentence)

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

val annotatedSentence: AnnotatedSentence

def applyTransitionSequence(transitions: Seq[(TransitionParserState) ⇒ TransitionParserState]): TransitionParserState

val arcLabels: Map[Set[Int], Symbol]

def areNeighbors(token1: Int, token2: Int): Boolean

final def asInstanceOf[T0]: T0

def asSculpture: Option[Sculpture]

val breadcrumb: Map[Int, Int]

lazy val bufferIsEmpty: Boolean

val bufferPosition: Int

val children: Map[Int, Set[Int]]

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def getGretels(nodeIndex: Int): Set[Int]

lazy val isFinal: Boolean

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val sentence: Sentence

val stack: Vector[Int]

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 Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from State

Inherited from AnyRef

Inherited from Any

Ungrouped