lattice = new DFSA<>("wordLattice"); for (int i=0; i<=s.length(); ++i) states.add(new DFSAState<>(i, lattice));
@Override public void printLattice(DFSA<String, Integer> tagLattice, List<CoreLabel> doc, PrintWriter out) { CoreLabel[] docArray = doc.toArray(new CoreLabel[doc.size()]); // Create answer lattice: MutableInteger nodeId = new MutableInteger(0); DFSA<String, Integer> answerLattice = new DFSA<>(null); DFSAState<String, Integer> aInitState = new DFSAState<>(nodeId.intValue(), answerLattice); answerLattice.setInitialState(aInitState); Map<DFSAState<String, Integer>,DFSAState<String, Integer>> stateLinks = Generics.newHashMap(); // Convert binary lattice into word lattice: tagLatticeToAnswerLattice (tagLattice.initialState(), aInitState, new StringBuilder(""), nodeId, 0, 0.0, stateLinks, answerLattice, docArray); try { answerLattice.printAttFsmFormat(out); } catch(IOException e) { throw new RuntimeException(e); } }
(new DFSATransition<>("", tSource, new DFSAState<>(-1, null), "1", "", 0)); DFSAState<String, Integer> aDest = new DFSAState<>(nodeId.intValue(), answerLattice, 0.0); stateLinks.put(tSource,aDest); newASource.addTransition(new DFSATransition<>("", newASource, aDest, newAnswer.toString(), "", newCost));
if(viterbiSearchGraph != null) { int stateId = -1; startState = new DFSAState<>(++stateId, viterbiSearchGraph, 0.0); viterbiSearchGraph.setInitialState(startState); graphStates = new DFSAState[length][]; graphStates[pos][product] = new DFSAState<>(++stateId, viterbiSearchGraph); endState = new DFSAState<>(++stateId, viterbiSearchGraph, 0.0); endState.setAccepting(true);
@Override public void printLattice(DFSA<String, Integer> tagLattice, List<CoreLabel> doc, PrintWriter out) { CoreLabel[] docArray = doc.toArray(new CoreLabel[doc.size()]); // Create answer lattice: MutableInteger nodeId = new MutableInteger(0); DFSA<String, Integer> answerLattice = new DFSA<>(null); DFSAState<String, Integer> aInitState = new DFSAState<>(nodeId.intValue(), answerLattice); answerLattice.setInitialState(aInitState); Map<DFSAState<String, Integer>,DFSAState<String, Integer>> stateLinks = Generics.newHashMap(); // Convert binary lattice into word lattice: tagLatticeToAnswerLattice (tagLattice.initialState(), aInitState, new StringBuilder(""), nodeId, 0, 0.0, stateLinks, answerLattice, docArray); try { answerLattice.printAttFsmFormat(out); } catch(IOException e) { throw new RuntimeException(e); } }
@Override public void printLattice(DFSA<String, Integer> tagLattice, List<CoreLabel> doc, PrintWriter out) { CoreLabel[] docArray = doc.toArray(new CoreLabel[doc.size()]); // Create answer lattice: MutableInteger nodeId = new MutableInteger(0); DFSA<String, Integer> answerLattice = new DFSA<String, Integer>(null); DFSAState<String, Integer> aInitState = new DFSAState<String, Integer>(nodeId.intValue(),answerLattice); answerLattice.setInitialState(aInitState); Map<DFSAState<String, Integer>,DFSAState<String, Integer>> stateLinks = Generics.newHashMap(); // Convert binary lattice into word lattice: tagLatticeToAnswerLattice (tagLattice.initialState(), aInitState, new StringBuilder(""), nodeId, 0, 0.0, stateLinks, answerLattice, docArray); try { answerLattice.printAttFsmFormat(out); } catch(IOException e) { throw new RuntimeException(e); } }
(new DFSATransition<String, Integer>("", tSource, new DFSAState<String, Integer>(-1, null), "1", "", 0)); DFSAState<String, Integer> aDest = new DFSAState<String, Integer>(nodeId.intValue(), answerLattice, 0.0); stateLinks.put(tSource,aDest); newASource.addTransition(new DFSATransition<String, Integer>("", newASource, aDest, newAnswer.toString(), "", newCost));
(new DFSATransition<>("", tSource, new DFSAState<>(-1, null), "1", "", 0)); DFSAState<String, Integer> aDest = new DFSAState<>(nodeId.intValue(), answerLattice, 0.0); stateLinks.put(tSource,aDest); newASource.addTransition(new DFSATransition<>("", newASource, aDest, newAnswer.toString(), "", newCost));
if(viterbiSearchGraph != null) { int stateId = -1; startState = new DFSAState<>(++stateId, viterbiSearchGraph, 0.0); viterbiSearchGraph.setInitialState(startState); graphStates = new DFSAState[length][]; graphStates[pos][product] = new DFSAState<>(++stateId, viterbiSearchGraph); endState = new DFSAState<>(++stateId, viterbiSearchGraph, 0.0); endState.setAccepting(true);
if(viterbiSearchGraph != null) { int stateId = -1; startState = new DFSAState<String, Integer>(++stateId, viterbiSearchGraph, 0.0); viterbiSearchGraph.setInitialState(startState); graphStates = new DFSAState[length][]; graphStates[pos][product] = new DFSAState<String, Integer>(++stateId, viterbiSearchGraph); endState = new DFSAState<String, Integer>(++stateId, viterbiSearchGraph, 0.0); endState.setAccepting(true);
if(viterbiSearchGraph != null) { int stateId = -1; startState = new DFSAState<String, Integer>(++stateId, viterbiSearchGraph, 0.0); viterbiSearchGraph.setInitialState(startState); graphStates = new DFSAState[length][]; graphStates[pos][product] = new DFSAState<String, Integer>(++stateId, viterbiSearchGraph); endState = new DFSAState<String, Integer>(++stateId, viterbiSearchGraph, 0.0); endState.setAccepting(true);