package org.maltparserx.parser.algorithm.nivre;
import java.util.Stack;
import org.maltparserx.core.exception.MaltChainedException;
import org.maltparserx.core.symbol.SymbolTable;
import org.maltparserx.core.symbol.SymbolTableHandler;
import org.maltparserx.core.syntaxgraph.DependencyGraph;
import org.maltparserx.core.syntaxgraph.DependencyStructure;
import org.maltparserx.core.syntaxgraph.edge.Edge;
import org.maltparserx.core.syntaxgraph.node.DependencyNode;
import org.maltparserx.parser.ParserConfiguration;
import org.maltparserx.parser.ParsingException;
/**
* @author Johan Hall
*
*/
public class NivreConfig extends ParserConfiguration {
private final Stack<DependencyNode> stack;
private final Stack<DependencyNode> input;
private final DependencyStructure dependencyGraph;
private boolean allowRoot;
private boolean allowReduce;
public NivreConfig(SymbolTableHandler symbolTableHandler, boolean allowRoot, boolean allowReduce) throws MaltChainedException {
super();
stack = new Stack<DependencyNode>();
input = new Stack<DependencyNode>();
dependencyGraph = new DependencyGraph(symbolTableHandler);
setAllowRoot(allowRoot);
setAllowReduce(allowReduce);
}
public Stack<DependencyNode> getStack() {
return stack;
}
public Stack<DependencyNode> getInput() {
return input;
}
public DependencyStructure getDependencyStructure() {
return dependencyGraph;
}
public boolean isTerminalState() {
return input.isEmpty();
}
public DependencyNode getStackNode(int index) throws MaltChainedException {
if (index < 0) {
throw new ParsingException("Stack index must be non-negative in feature specification. ");
}
if (stack.size()-index > 0) {
return stack.get(stack.size()-1-index);
}
return null;
}
public DependencyNode getInputNode(int index) throws MaltChainedException {
if (index < 0) {
throw new ParsingException("Input index must be non-negative in feature specification. ");
}
if (input.size()-index > 0) {
return input.get(input.size()-1-index);
}
return null;
}
public void setDependencyGraph(DependencyStructure source) throws MaltChainedException {
dependencyGraph.clear();
for (int index : source.getTokenIndices()) {
final DependencyNode gnode = source.getTokenNode(index);
final DependencyNode pnode = dependencyGraph.addTokenNode(gnode.getIndex());
for (SymbolTable table : gnode.getLabelTypes()) {
pnode.addLabel(table, gnode.getLabelSymbol(table));
}
if (gnode.hasHead()) {
final Edge s = gnode.getHeadEdge();
final Edge t = dependencyGraph.addDependencyEdge(s.getSource().getIndex(), s.getTarget().getIndex());
for (SymbolTable table : s.getLabelTypes()) {
t.addLabel(table, s.getLabelSymbol(table));
}
}
}
for (SymbolTable table : source.getDefaultRootEdgeLabels().keySet()) {
dependencyGraph.setDefaultRootEdgeLabel(table, source.getDefaultRootEdgeLabelSymbol(table));
}
}
public DependencyStructure getDependencyGraph() {
return dependencyGraph;
}
public void initialize(ParserConfiguration parserConfiguration) throws MaltChainedException {
if (parserConfiguration != null) {
final NivreConfig nivreConfig = (NivreConfig)parserConfiguration;
final Stack<DependencyNode> sourceStack = nivreConfig.getStack();
final Stack<DependencyNode> sourceInput = nivreConfig.getInput();
setDependencyGraph(nivreConfig.getDependencyGraph());
for (int i = 0, n = sourceStack.size(); i < n; i++) {
stack.add(dependencyGraph.getDependencyNode(sourceStack.get(i).getIndex()));
}
for (int i = 0, n = sourceInput.size(); i < n; i++) {
input.add(dependencyGraph.getDependencyNode(sourceInput.get(i).getIndex()));
}
} else {
stack.push(dependencyGraph.getDependencyRoot());
for (int i = dependencyGraph.getHighestTokenIndex(); i > 0; i--) {
final DependencyNode node = dependencyGraph.getDependencyNode(i);
if (node != null && !node.hasHead()) { // added !node.hasHead()
input.push(node);
}
}
}
}
public boolean isAllowRoot() {
return allowRoot;
}
public void setAllowRoot(boolean allowRoot) {
this.allowRoot = allowRoot;
}
public boolean isAllowReduce() {
return allowReduce;
}
public void setAllowReduce(boolean allowReduce) {
this.allowReduce = allowReduce;
}
public void clear() throws MaltChainedException {
dependencyGraph.clear();
stack.clear();
input.clear();
historyNode = null;
}
public boolean equals(Object obj) {
if (this == obj)
return true;
if (obj == null)
return false;
if (getClass() != obj.getClass())
return false;
NivreConfig that = (NivreConfig)obj;
if (stack.size() != that.getStack().size())
return false;
if (input.size() != that.getInput().size())
return false;
if (dependencyGraph.nEdges() != that.getDependencyGraph().nEdges())
return false;
for (int i = 0; i < stack.size(); i++) {
if (stack.get(i).getIndex() != that.getStack().get(i).getIndex()) {
return false;
}
}
for (int i = 0; i < input.size(); i++) {
if (input.get(i).getIndex() != that.getInput().get(i).getIndex()) {
return false;
}
}
return dependencyGraph.getEdges().equals(that.getDependencyGraph().getEdges());
}
public String toString() {
final StringBuilder sb = new StringBuilder();
sb.append(stack.size());
sb.append(", ");
sb.append(input.size());
sb.append(", ");
sb.append(dependencyGraph.nEdges());
return sb.toString();
}
}