-
Notifications
You must be signed in to change notification settings - Fork 2.7k
/
FastExactAutomatonMinimizer.java
320 lines (280 loc) · 10.7 KB
/
FastExactAutomatonMinimizer.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
package edu.stanford.nlp.fsm;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.IdentityHashMap;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.Set;
import edu.stanford.nlp.fsm.TransducerGraph.Arc;
import edu.stanford.nlp.trees.PennTreebankLanguagePack;
import edu.stanford.nlp.util.Maps;
/**
* Minimization in n log n a la Hopcroft.
*
* @author Dan Klein ([email protected])
*/
public class FastExactAutomatonMinimizer implements AutomatonMinimizer {
TransducerGraph unminimizedFA = null;
Map memberToBlock = null;
LinkedList splits = null;
boolean sparseMode = true;
static final Object SINK_NODE = "SINK_NODE";
static class Split {
Collection members;
Object symbol;
Block block;
public Collection getMembers() {
return members;
}
public Object getSymbol() {
return symbol;
}
public Block getBlock() {
return block;
}
public Split(Collection members, Object symbol, Block block) {
this.members = members;
this.symbol = symbol;
this.block = block;
}
}
static class Block {
Set members;
public Set getMembers() {
return members;
}
public Block(Set members) {
this.members = members;
}
}
protected TransducerGraph getUnminimizedFA() {
return unminimizedFA;
}
protected Collection getSymbols() {
return getUnminimizedFA().getInputs();
}
public TransducerGraph minimizeFA(TransducerGraph unminimizedFA) {
// System.out.println(unminimizedFA);
this.unminimizedFA = unminimizedFA;
this.splits = new LinkedList();
this.memberToBlock = new HashMap(); //new IdentityHashMap(); // TEG: I had to change this b/c some weren't matching
minimize();
return buildMinimizedFA();
}
protected TransducerGraph buildMinimizedFA() {
TransducerGraph minimizedFA = new TransducerGraph();
TransducerGraph unminimizedFA = getUnminimizedFA();
for (TransducerGraph.Arc arc : unminimizedFA.getArcs()) {
Object source = projectNode(arc.getSourceNode());
Object target = projectNode(arc.getTargetNode());
try {
if (minimizedFA.canAddArc(source, target, arc.getInput(), arc.getOutput())) {
minimizedFA.addArc(source, target, arc.getInput(), arc.getOutput());
}
} catch (Exception e) {
//throw new IllegalArgumentException();
}
}
minimizedFA.setStartNode(projectNode(unminimizedFA.getStartNode()));
for (Object o : unminimizedFA.getEndNodes()) {
minimizedFA.setEndNode(projectNode(o));
}
return minimizedFA;
}
protected Object projectNode(Object node) {
Set members = getBlock(node).getMembers();
return members;
}
protected boolean hasSplit() {
return splits.size() > 0;
}
protected Split getSplit() {
return (Split) splits.removeFirst();
}
protected void addSplit(Split split) {
splits.addLast(split);
}
// protected Collection inverseImages(Collection block, Object symbol) {
// List inverseImages = new ArrayList();
// for (Iterator nodeI = block.iterator(); nodeI.hasNext();) {
// Object node = nodeI.next();
// inverseImages.addAll(getUnminimizedFA().getInboundArcs(node, symbol));
// }
// return inverseImages;
// }
protected Map sortIntoBlocks(Collection nodes) {
Map blockToMembers = new IdentityHashMap();
for (Object o : nodes) {
Block block = getBlock(o);
Maps.putIntoValueHashSet(blockToMembers, block, o);
}
return blockToMembers;
}
protected void makeBlock(Collection members) {
Block block = new Block(new HashSet(members));
for (Object member : block.getMembers()) {
if (member != SINK_NODE) {
// System.out.println("putting in memberToBlock: " + member + " " + block);
memberToBlock.put(member, block);
}
}
addSplits(block);
}
protected void addSplits(Block block) {
Map symbolToTarget = new HashMap();
for (Object member : block.getMembers()) {
for (Object o : getInverseArcs(member)) {
TransducerGraph.Arc arc = (TransducerGraph.Arc) o;
Object symbol = arc.getInput();
Object target = arc.getTargetNode();
Maps.putIntoValueArrayList(symbolToTarget, symbol, target);
}
}
for (Object symbol : symbolToTarget.keySet()) {
addSplit(new Split((List) symbolToTarget.get(symbol), symbol, block));
}
}
protected void removeAll(Collection block, Collection members) {
// this is because AbstractCollection/Set.removeAll() isn't always linear in members.size()
for (Object member : members) {
block.remove(member);
}
}
protected Collection difference(Collection block, Collection members) {
Set difference = new HashSet();
for (Object member : block) {
if (!members.contains(member)) {
difference.add(member);
}
}
return difference;
}
protected Block getBlock(Object o) {
Block result = (Block) memberToBlock.get(o);
if (result == null) {
System.out.println("No block found for: " + o); // debug
System.out.println("But I do have blocks for: ");
for (Object o1 : memberToBlock.keySet()) {
System.out.println(o1);
}
throw new RuntimeException("FastExactAutomatonMinimizer: no block found");
}
return result;
}
protected Collection getInverseImages(Split split) {
List<Object> inverseImages = new ArrayList<>();
Object symbol = split.getSymbol();
Block block = split.getBlock();
for (Object member : split.getMembers()) {
if (!block.getMembers().contains(member)) {
continue;
}
Collection arcs = getInverseArcs(member, symbol);
for (Object arc1 : arcs) {
TransducerGraph.Arc arc = (TransducerGraph.Arc) arc1;
Object source = arc.getSourceNode();
inverseImages.add(source);
}
}
return inverseImages;
}
protected Collection<Arc> getInverseArcs(Object member, Object symbol) {
if (member != SINK_NODE) {
return getUnminimizedFA().getArcsByTargetAndInput(member, symbol);
}
return getUnminimizedFA().getArcsByInput(symbol);
}
protected Collection<Arc> getInverseArcs(Object member) {
if (member != SINK_NODE) {
return getUnminimizedFA().getArcsByTarget(member);
}
return getUnminimizedFA().getArcs();
}
protected void makeInitialBlocks() {
// sink block (for if the automaton isn't complete
makeBlock(Collections.singleton(SINK_NODE));
// accepting block
Set endNodes = getUnminimizedFA().getEndNodes();
makeBlock(endNodes);
// main block
Collection nonFinalNodes = new HashSet(getUnminimizedFA().getNodes());
nonFinalNodes.removeAll(endNodes);
makeBlock(nonFinalNodes);
}
protected void minimize() {
makeInitialBlocks();
while (hasSplit()) {
Split split = getSplit();
Collection inverseImages = getInverseImages(split);
Map inverseImagesByBlock = sortIntoBlocks(inverseImages);
for (Object o : inverseImagesByBlock.keySet()) {
Block block = (Block) o;
Collection members = (Collection) inverseImagesByBlock.get(block);
if (members.size() == 0 || members.size() == block.getMembers().size()) {
continue;
}
if (members.size() > block.getMembers().size() - members.size()) {
members = difference(block.getMembers(), members);
}
removeAll(block.getMembers(), members);
makeBlock(members);
}
}
}
public static void main(String[] args) {
/*
TransducerGraph fa = new TransducerGraph();
fa.addArc(fa.getStartNode(),"1","a","");
fa.addArc(fa.getStartNode(),"2","b","");
fa.addArc(fa.getStartNode(),"3","c","");
fa.addArc("1","4","a","");
fa.addArc("2","4","a","");
fa.addArc("3","5","c","");
fa.addArc("4",fa.getEndNode(),"c","");
fa.addArc("5",fa.getEndNode(),"c","");
System.out.println(fa);
ExactAutomatonMinimizer minimizer = new ExactAutomatonMinimizer();
System.out.println(minimizer.minimizeFA(fa));
*/
System.out.println("Starting minimizer test...");
List<List<String>> pathList = new ArrayList<>();
TransducerGraph randomFA = TransducerGraph.createRandomGraph(5000, 5, 1.0, 5, pathList);
List<Double> outputs = randomFA.getPathOutputs(pathList);
TransducerGraph.GraphProcessor quasiDeterminizer = new QuasiDeterminizer();
AutomatonMinimizer minimizer = new FastExactAutomatonMinimizer();
TransducerGraph.NodeProcessor ntsp = new TransducerGraph.SetToStringNodeProcessor(new PennTreebankLanguagePack());
TransducerGraph.ArcProcessor isp = new TransducerGraph.InputSplittingProcessor();
TransducerGraph.ArcProcessor ocp = new TransducerGraph.OutputCombiningProcessor();
TransducerGraph detGraph = quasiDeterminizer.processGraph(randomFA);
TransducerGraph combGraph = new TransducerGraph(detGraph, ocp); // combine outputs into inputs
TransducerGraph result = minimizer.minimizeFA(combGraph); // minimize the thing
System.out.println("Minimized from " + randomFA.getNodes().size() + " to " + result.getNodes().size());
result = new TransducerGraph(result, ntsp); // pull out strings from sets returned by minimizer
result = new TransducerGraph(result, isp); // split outputs from inputs
List<Double> minOutputs = result.getPathOutputs(pathList);
System.out.println("Equal? " + outputs.equals(minOutputs));
/*
randomFA = new TransducerGraph(randomFA, new TransducerGraph.OutputCombiningProcessor());
System.out.print("Starting fast minimization...");
FastExactAutomatonMinimizer minimizer2 = new FastExactAutomatonMinimizer();
Timing.startTime();
TransducerGraph minimizedRandomFA = minimizer2.minimizeFA(randomFA);
Timing.tick("done. ( "+randomFA.getArcs().size()+" arcs to "+minimizedRandomFA.getArcs().size()+" arcs)");
minimizedRandomFA = new TransducerGraph(minimizedRandomFA, new TransducerGraph.InputSplittingProcessor());
List minOutputs = minimizedRandomFA.getPathOutputs(pathList);
System.out.println("Equal? "+outputs.equals(minOutputs));
System.out.print("Starting slow minimization...");
ExactAutomatonMinimizer minimizer = new ExactAutomatonMinimizer();
Timing.startTime();
minimizedRandomFA = minimizer.minimizeFA(randomFA);
Timing.tick("done. ( "+randomFA.getArcs().size()+" arcs to "+minimizedRandomFA.getArcs().size()+" arcs)");
minimizedRandomFA = new TransducerGraph(minimizedRandomFA, new TransducerGraph.InputSplittingProcessor());
minOutputs = minimizedRandomFA.getPathOutputs(pathList);
System.out.println("Equal? "+outputs.equals(minOutputs));
*/
}
}