Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
package edu.stanford.nlp.parser.shiftreduce;
import java.util.Collections;
import java.util.IdentityHashMap;
import java.util.List;
import java.util.Map;
import java.util.Set;
import edu.stanford.nlp.trees.Tree;
import edu.stanford.nlp.trees.Trees;
import edu.stanford.nlp.util.Generics;
/**
* Given a possibly incorrect partial parse of a sentence, returns a
* transition which gives the parser the best chance of getting a good
* score. Ideally we would actually return the transition which gets
* the best possible score, but that is not guaranteed.
*
* If the partial parse is in the correct state, though, this will
* return the gold transition.
*
* TODO: make sure all of the return values respect the logic for
* which transitions are and aren't legal.
*
* @author John Bauer
*/
class Oracle {
List binarizedTrees;
List> parentMaps;
List> leafLists;
boolean compoundUnaries;
Set rootStates;
Oracle(List binarizedTrees, boolean compoundUnaries, Set rootStates) {
this.binarizedTrees = binarizedTrees;
parentMaps = Generics.newArrayList(binarizedTrees.size());
leafLists = Generics.newArrayList();
for (Tree tree : binarizedTrees) {
parentMaps.add(buildParentMap(tree));
leafLists.add(Trees.leaves(tree));
}
this.compoundUnaries = compoundUnaries;
}
static IdentityHashMap buildParentMap(Tree tree) {
IdentityHashMap map = Generics.newIdentityHashMap();
buildParentMapHelper(tree, null, map);
return map;
}
static void buildParentMapHelper(Tree tree, Tree parent, IdentityHashMap map) {
if (parent != null) {
map.put(tree, parent);
}
if (!tree.isLeaf()) {
for (Tree child : tree.children()) {
buildParentMapHelper(child, tree, map);
}
}
}
/**
* Returns an attempt at a "gold" transition given the current state
* while parsing a known gold tree.
*
* Tree is passed in by index so the oracle can precompute various
* statistics about the tree.
*
* If we already finalized, then the correct transition is to idle.
*
* If the stack is empty, shift is the only possible answer.
*
* If the first item on the stack is a correct span, correctly
* labeled, and it has unaries transitions above it, then if we are
* not doing compound unaries, the next unary up is the correct
* answer. If we are doing compound unaries, and the state does not
* already have a transition, then the correct answer is a compound
* unary transition to the top of the unary chain.
*
* If the first item is the entire tree, with no remaining unary
* transitions, then we need to finalize.
*
* If the first item is a correct span, with or without a correct
* label, and there are no unary transitions to be added, then we
* must look at the next parent. If it has the same left side, then
* we return a shift transition. If it has the same right side,
* then we look at the next subtree on the stack (which must exist).
* If it is also correct, then the transition is to combine the two
* subtrees with the correct label and side.
*
* TODO: suppose the correct label is not either child label and the
* children are binarized states? We should see what the
* debinarizer does in that case. Perhaps a post-processing step
*
* If the previous stack item is too small, then any binary reduce
* action is legal, with no gold transition. TODO: can this be improved?
*
* If the previous stack item is too large, perhaps because of
* incorrectly attached PP/SBAR, for example, we still need to
* binary reduce. TODO: is that correct? TODO: we could look back
* further in the stack to find hints at a label that would work
* better, for example
*
* If the current item is an incorrect span, then look at the
* containing item. If it has the same left side, shift. If it has
* the same right side, binary reduce (producing an exact span if
* possible). If neither edge is correct, then any of shift or
* binary reduce are acceptable, with no gold transition. TODO: can
* this be improved?
*/
OracleTransition goldTransition(int index, State state) {
if (state.finished) {
return new OracleTransition(new IdleTransition(), false, false, false);
}
if (state.stack.size() == 0) {
return new OracleTransition(new ShiftTransition(), false, false, false);
}
Map parents = parentMaps.get(index);
Tree gold = binarizedTrees.get(index);
List leaves = leafLists.get(index);
Tree S0 = state.stack.peek();
Tree enclosingS0 = getEnclosingTree(S0, parents, leaves);
OracleTransition result = getUnaryTransition(S0, enclosingS0, parents, compoundUnaries);
if (result != null) {
return result;
}
// TODO: we could interject that all trees must end with ROOT, for example
if (state.tokenPosition >= state.sentence.size() && state.stack.size() == 1) {
return new OracleTransition(new FinalizeTransition(rootStates), false, false, false);
}
if (state.stack.size() == 1) {
return new OracleTransition(new ShiftTransition(), false, false, false);
}
if (spansEqual(S0, enclosingS0)) {
Tree parent = parents.get(enclosingS0); // cannot be root
while (spansEqual(parent, enclosingS0)) { // in case we had missed unary transitions
enclosingS0 = parent;
parent = parents.get(parent);
}
if (parent.children()[0] == enclosingS0) { // S0 is the left child of the correct tree
return new OracleTransition(new ShiftTransition(), false, false, false);
}
// was the second (right) child. there must be something else on the stack...
Tree S1 = state.stack.pop().peek();
Tree enclosingS1 = getEnclosingTree(S1, parents, leaves);
if (spansEqual(S1, enclosingS1)) {
// the two subtrees should be combined
return new OracleTransition(new BinaryTransition(parent.value(), ShiftReduceUtils.getBinarySide(parent)), false, false, false);
}
return new OracleTransition(null, false, true, false);
}
if (ShiftReduceUtils.leftIndex(S0) == ShiftReduceUtils.leftIndex(enclosingS0)) {
return new OracleTransition(new ShiftTransition(), false, false, false);
}
if (ShiftReduceUtils.rightIndex(S0) == ShiftReduceUtils.rightIndex(enclosingS0)) {
Tree S1 = state.stack.pop().peek();
Tree enclosingS1 = getEnclosingTree(S1, parents, leaves);
if (enclosingS0 == enclosingS1) {
// BinaryTransition with enclosingS0's label, either side, but preferring LEFT
return new OracleTransition(new BinaryTransition(enclosingS0.value(), BinaryTransition.Side.LEFT), false, false, true);
}
// S1 is smaller than the next tree S0 is supposed to be part of,
// so we must have a BinaryTransition
if (ShiftReduceUtils.leftIndex(S1) > ShiftReduceUtils.leftIndex(enclosingS0)) {
return new OracleTransition(null, false, true, true);
}
// S1 is larger than the next tree. This is the worst case
return new OracleTransition(null, true, true, true);
}
// S0 doesn't match either endpoint of the enclosing tree
return new OracleTransition(null, true, true, true);
}
static Tree getEnclosingTree(Tree subtree, Map parents, List leaves) {
// TODO: make this more efficient
int left = ShiftReduceUtils.leftIndex(subtree);
int right = ShiftReduceUtils.rightIndex(subtree);
Tree gold = leaves.get(left);
while (ShiftReduceUtils.rightIndex(gold) < right) {
gold = parents.get(gold);
}
if (gold.isLeaf()) {
gold = parents.get(gold);
}
return gold;
}
static boolean spansEqual(Tree subtree, Tree goldSubtree) {
return ((ShiftReduceUtils.leftIndex(subtree) == ShiftReduceUtils.leftIndex(goldSubtree)) &&
(ShiftReduceUtils.rightIndex(subtree) == ShiftReduceUtils.rightIndex(goldSubtree)));
}
static OracleTransition getUnaryTransition(Tree S0, Tree enclosingS0, Map parents, boolean compoundUnaries) {
if (!spansEqual(S0, enclosingS0)) {
return null;
}
Tree parent = parents.get(enclosingS0);
if (parent == null || parent.children().length != 1) {
return null;
}
// TODO: should we allow @ here? Handle @ in some other way?
String value = S0.value();
// TODO: go up the parent chain
// What we want is:
// If the top of the stack is part of the unary chain, then parent should point to that subtree's parent.
// If the top of the stack is not part of the unary chain,
if (!enclosingS0.value().equals(value)) {
while (true) {
enclosingS0 = parent;
parent = parents.get(enclosingS0);
if (enclosingS0.value().equals(value)) {
// We found the current stack top in the unary sequence ...
if (parent == null || parent.children().length > 1) {
// ... however, it was the root or the top of the unary sequence
return null;
} else {
// ... not root or top of unary sequence, so create unary transitions based on this top
break;
}
} else if (parent == null) {
// We went to the root without finding a match.
// Treat the root as the unary transition to be made
// TODO: correct logic?
parent = enclosingS0;
break;
} else if (parent.children().length > 1) {
// We went off the top of the unary chain without finding a match.
// Transition to the top of the unary chain without any subnodes
parent = enclosingS0;
break;
}
}
}
if (compoundUnaries) {
List labels = Generics.newArrayList();
while (parent != null && parent.children().length == 1) {
labels.add(parent.value());
parent = parents.get(parent);
}
Collections.reverse(labels);
return new OracleTransition(new CompoundUnaryTransition(labels, false), false, false, false);
} else {
return new OracleTransition(new UnaryTransition(parent.value(), false), false, false, false);
}
}
}
