Parsing Engine

Uses of Class
danbikel.parser.Item

Packages that use Item
danbikel.parser Provides the core framework of this extensible statistical parsing engine. 
danbikel.parser.constraints Provides interfaces and classes to allow constrain-parsing. 
 

Uses of Item in danbikel.parser
 

Subclasses of Item in danbikel.parser
 class CKYItem
          An item in a CKYChart for use when parsing via a probabilistic version of the CKY algorithm.
static class CKYItem.BaseNPAware
          A base NP–aware version of CKYItem that overrides CKYItem.BaseNPAware.equals(java.lang.Object) and CKYItem.BaseNPAware.hashCode() to take into account the lack of dependence on the distance metric when the root label of an item's set of derivations is NPB.
static class CKYItem.KBestHack
          A hack to approximate k-best parsing by effectively turning off dynamic programming (usability depends on reducing the beam size from its normal value).
static class CKYItem.MappedPrevModBaseNPAware
          Overrides equals and hashCode methods to compare the last previous modifier on each side of each chart item's head child with respect to their respective equivalence classes, as determined by the mapping provided by NTMapper.map(Symbol).
static class CKYItem.PrevModIsStart
          Overrides equals and hashCode methods to take the last previous modifier into account only insofar as its equality to the initial Training.startSym() modifier.
 class EMItem
          Class to represent a chart item when performing the Inside-Outside algorithm.
 

Methods in danbikel.parser that return Item
 Item CKYItem.clear()
          Sets the number of parses represented by this chart item to 1.
 Item EMItem.clear()
          Clears all chart-related data in this item (most of the data members do not need to be cleared, as they are expressly set by the decoder).
 Item Item.clear()
          Clears data members of this item before reclamation (called by Chart.reclaimItem(Item)).
 Item Chart.getTopItem(int start, int end)
          Returns the item with the highest log probability covering the specified span, or null if this span has no items.
 

Methods in danbikel.parser with parameters of type Item
 boolean Chart.add(int start, int end, Item item)
          Adds the specified item covering the specified span to this chart.
protected  boolean CKYChart.cellLimitShouldApplyTo(Item item)
          Returns true if the specified item has received its stop probabilities (that is, if item.stop() == true).
protected abstract  boolean Chart.cellLimitShouldApplyTo(Item item)
          Returns true if cell limiting should apply to the specified item.
 void CKYItem.hasAntecedent(Item antecedent)
          Indicates that the specified item is an antecedent to this item, allowing a subclass instance to store a list of antecedents, or do other computation based on its antecedents.
 void CKYItem.hasEquivalentItem(Item equivalentItem)
          Indicates that the specified item is equivalent to this item, allowing a subclass to do arbitrary computation when the decoder produces such an item (this method is guaranteed to be called by the decoder when that happens).
 void Item.hasEquivalentItem(Item equivalentItem)
          Indicates that the specified item that was produced during decoding is equivalent to this item.
protected  boolean CKYChart.outsideBeam(Item item, double topProb)
           
protected  boolean Chart.outsideBeam(Item item, double topProb)
          Returns whether the specified chart item is outside the beam given the specified top log prob.
protected  boolean EMChart.outsideBeam(Item item, double topProb)
           
protected  void Chart.reclaimItem(Item item)
          Reclaims this chart item.
 boolean BaseNPAwareShifter.skip(Item item, Sexp prevMod)
          The previous modifier is skipped (not included in the construction of the history) if the current parent (as determined by CKYItem.label()) is a base NP and the previous modifier is punctuation.
 boolean DefaultShifter.skip(Item item, Sexp prevMod)
           
 boolean Shift.skip(Item item, Sexp prevMod)
          Returns whether the previously-generated modifier should be skipped when constructing a history for the specified chart item.
 boolean BaseNPAwareShifter.skip(Item item, Word prevWord)
          The head word of the previous modifier is skipped (not included in the construction of the history) ifthe current parent (as determined by CKYItem.label()) is a base NP and the previous modifier is punctuation.
 boolean DefaultShifter.skip(Item item, Word prevWord)
           
 boolean Shift.skip(Item item, Word prevWord)
          Returns whether the previously-generated modifier head word should be skipped when constructing a history for the specified chart item.
protected  boolean Chart.toPrune(int start, int end, Item item)
          Returns true if the specified chart item should not be added to the specified set of items because its probability is not within Chart.pruneFact of the highest-ranked item.
protected  boolean EMChart.toPrune(int start, int end, Item item)
           
 

Uses of Item in danbikel.parser.constraints
 

Methods in danbikel.parser.constraints with parameters of type Item
 Constraint ConstraintSet.constraintSatisfying(Item item)
          Returns the first constraint in this set that is found that the specified item satisfies.
 Constraint PartialTreeConstraintSet.constraintSatisfying(Item item)
           
 Constraint UnlexTreeConstraintSet.constraintSatisfying(Item item)
           
 boolean AbstractConstraint.isLocallySatisfiedBy(Item item)
          Throws an UnsupportedOperationException.
 boolean Constraint.isLocallySatisfiedBy(Item item)
          Returns whether the specified item satisfies the local information of the constraint node, regardless of its place in a tree structure of constraints (optional operation).
 boolean LexTreeConstraint.isLocallySatisfiedBy(Item item)
          Returns whether the specified item satisfies the local information of this constraint node, regardless of this node's place in a tree structure of constraints.
 boolean PartialLexTreeConstraint.isLocallySatisfiedBy(Item item)
           
 boolean PartialTreeConstraint.isLocallySatisfiedBy(Item item)
          Returns whether the specified item's span does not exceed the bounds of the span associated with this constraint.
 boolean UnlexTreeConstraint.isLocallySatisfiedBy(Item item)
          Returns whether the specified chart item satisfies the local information contained in this constraint (span and nonterminal label).
 boolean AbstractConstraint.isSatisfiedBy(Item item)
          Throws an UnsupportedOperationException.
 boolean Constraint.isSatisfiedBy(Item item)
          Returns whether the specified item satisfies this constraint (optional operation).
 boolean PartialTreeConstraint.isSatisfiedBy(Item item)
          Returns true if this constraint is satisfied by its local information.
 boolean UnlexTreeConstraint.isSatisfiedBy(Item item)
          Returns true if this constraint is satisfied by its local information and either the specified item represents a preterminal or the constraints of the specified item's children are identical to the children of this constraint, and are in the same order More formally, let us define the term nuclear family of a node in a tree to refer to the node itself and its (immediately dominated) sequence of children.
 boolean AbstractConstraint.isViolatedBy(Item item)
          Throws an UnsupportedOperationException.
 boolean Constraint.isViolatedBy(Item item)
          Returns whether the specified item violates this constraint (optional operation).
 boolean ConstraintSet.isViolatedBy(Item item)
          Returns whether this constraint set is violated by the specified item (optional operation).
 boolean PartialTreeConstraint.isViolatedBy(Item item)
          Throws an UnsupportedOperationException, as this operation is not appropriate for partial tree constraints.
 boolean PartialTreeConstraintSet.isViolatedBy(Item item)
          Simply throws an UnsupportedOperationException, since violations do not need to be checked for this type of constraint set.
 boolean UnlexTreeConstraint.isViolatedBy(Item item)
          Throws an UnsupportedOperationException.
 boolean UnlexTreeConstraintSet.isViolatedBy(Item item)
          Simply throws an UnsupportedOperationException, since violations do not need to be checked for this type of constraint set.
 boolean AbstractConstraint.isViolatedByChild(Item childItem)
          Throws an UnsupportedOperationException.
 boolean Constraint.isViolatedByChild(Item childItem)
          Returns whether the specified child item violates this constraint (optional operation).
 boolean PartialTreeConstraint.isViolatedByChild(Item childItem)
          Returns whether the specified child chart item violates this constraint by having a span beyond the boundaries of this constraint's span.
 boolean UnlexTreeConstraint.isViolatedByChild(Item childItem)
          Returns whether this constraint is violated by the specified child chart item.
protected  boolean PartialTreeConstraint.labelMatches(Item item)
          Returns whether this constraint's label subsumes the label of the specified item.
protected  boolean PartialTreeConstraint.spanMatches(Item item)
          Returns whether the start and end indices of the specified chart item are equal to the start and end indices, respectively, of the span associated with this constraint.
protected  boolean UnlexTreeConstraint.spanMatches(Item item)
          Returns whether the specified item's span matches that of this constraint.
protected  boolean PartialTreeConstraint.spanOK(Item item)
          Returns whether the span of the specified item crosses the span.
 


Parsing Engine

Author: Dan Bikel.