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
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
|
package bjc.utils.gen;
import java.util.Hashtable;
import java.util.Map;
import java.util.Random;
import java.util.Set;
import java.util.function.Function;
import bjc.utils.data.Pair;
import bjc.utils.funcdata.FunctionalList;
/**
* A random grammar, where certain rules will come up more often than
* others.
*
* @author ben
*
* @param <E>
* The values that make up sentances of this grammar.
*/
public class WeightedGrammar<E> {
/**
* The initial rule of the grammar
*/
protected String initialRule;
/**
* The rules currently in this grammar
*/
protected Map<E, WeightedRandom<FunctionalList<E>>> rules;
/**
* The random number generator used for random numbers
*/
private Random rng;
/**
* All of the subgrammars of this grammar
*/
protected Map<E, WeightedGrammar<E>> subgrammars;
/**
* Create a new weighted grammar.
*/
public WeightedGrammar() {
rules = new Hashtable<>();
subgrammars = new Hashtable<>();
}
/**
* Create a new weighted grammar that uses the specified source of
* randomness.
*
* @param source
* The source of randomness to use
*/
public WeightedGrammar(Random source) {
this();
rng = source;
}
/**
* Add a case to an already existing rule.
*
* @param rule
* The rule to add a case to.
* @param probability
* The probability for this rule to be chosen.
* @param cse
* The case being added.
*/
public void addCase(E rule, int probability, FunctionalList<E> cse) {
rules.get(rule).addProbability(probability, cse);
}
/**
* Add a alias for an existing subgrammar
*
* @param name
* The name of the subgrammar to alias
* @param alias
* The alias of the subgrammar
* @return Whether the alias was succesfully created
*/
public boolean addGrammarAlias(E name, E alias) {
if (subgrammars.containsKey(alias)) {
return false;
} else {
if (subgrammars.containsKey(name)) {
subgrammars.put(alias, subgrammars.get(name));
return true;
} else {
return false;
}
}
}
/**
* Add a new rule with no cases.
*
* @param name
* The name of the rule to add.
* @return Whether or not the rule was succesfully added.
*/
public boolean addRule(E name) {
if (rng == null) {
rng = new Random();
}
return addRule(name, new WeightedRandom<>(rng));
}
/**
* Add a new rule with a set of cases.
*
* @param name
* The name of the rule to add.
* @param cases
* The set of cases for the rule.
* @return Whether or not the rule was succesfully added.
*/
public boolean addRule(E name,
WeightedRandom<FunctionalList<E>> cases) {
if (rules.containsKey(name)) {
return false;
} else {
rules.put(name, cases);
return true;
}
}
/**
* Add a subgrammar.
*
* @param name
* The name of the subgrammar.
* @param subgrammar
* The subgrammar to add.
* @return Whether or not the subgrammar was succesfully added.
*/
public boolean addSubgrammar(E name, WeightedGrammar<E> subgrammar) {
if (subgrammars.containsKey(name)) {
return false;
} else {
subgrammars.put(name, subgrammar);
return true;
}
}
/**
* Generate a set of debug sentences for the specified rule. Only
* generates sentances one layer deep.
*
* @param ruleName
* The rule to test.
* @return A set of sentances generated by the specified rule.
*/
public FunctionalList<FunctionalList<E>>
generateDebugValues(E ruleName) {
FunctionalList<FunctionalList<E>> returnedList =
new FunctionalList<>();
WeightedRandom<FunctionalList<E>> ruleGenerator =
rules.get(ruleName);
for (int i = 0; i < 10; i++) {
returnedList.add(ruleGenerator.generateValue());
}
return returnedList;
}
/**
* Generate a generic sentance from a initial rule.
*
* @param <T>
* The type of the transformed output
*
* @param initRule
* The initial rule to start with.
* @param tokenTransformer
* The function to transform grammar output into something.
* @param spacer
* The spacer element to add in between output tokens.
* @return A randomly generated sentance from the specified initial
* rule.
*/
public <T> FunctionalList<T> generateGenericValues(E initRule,
Function<E, T> tokenTransformer, T spacer) {
FunctionalList<T> returnedList = new FunctionalList<>();
if (subgrammars.containsKey(initRule)) {
subgrammars.get(initRule).generateGenericValues(initRule,
tokenTransformer, spacer).forEach(rulePart -> {
returnedList.add(rulePart);
returnedList.add(spacer);
});
} else if (rules.containsKey(initRule)) {
rules.get(initRule).generateValue()
.forEach(rulePart -> generateGenericValues(rulePart,
tokenTransformer, spacer)
.forEach(generatedRulePart -> {
returnedList
.add(generatedRulePart);
returnedList.add(spacer);
}));
} else {
returnedList.add(tokenTransformer.apply(initRule));
returnedList.add(spacer);
}
return returnedList;
}
/**
* Generate a random list of grammar elements from a given initial
* rule.
*
* @param initRule
* The initial rule to start with.
* @param spacer
* The item to use to space the list.
* @return A list of random grammar elements generated by the specified
* rule.
*/
public FunctionalList<E> generateListValues(E initRule, E spacer) {
return generateGenericValues(initRule, strang -> strang, spacer);
}
/**
* Get the initial rule of this grammar
*
* @return The initial rule of this grammar
*/
public String getInitialRule() {
return initialRule;
}
/**
* Get the subgrammar with the specified name.
*
* @param name
* The name of the subgrammar to get.
* @return The subgrammar with the specified name.
*/
public WeightedGrammar<E> getSubgrammar(E name) {
return subgrammars.get(name);
}
/**
* Check if this grammar has an initial rule
*
* @return Whether or not this grammar has an initial rule
*/
public boolean hasInitialRule() {
return initialRule != null && !initialRule.equalsIgnoreCase("");
}
/**
* Prefix a given rule with a token multiple times
*
* @param ruleName
* The name of the rule to prefix
* @param prefixToken
* The token to prefix to the rules
* @param additionalProbability
* The additional probability of the tokens
* @param numberOfTimes
* The number of times to prefix the token
*/
public void multiPrefixRule(E ruleName, E prefixToken,
int additionalProbability, int numberOfTimes) {
WeightedRandom<FunctionalList<E>> rule = rules.get(ruleName);
FunctionalList<Pair<Integer, FunctionalList<E>>> newResults =
new FunctionalList<>();
rule.getValues().forEach((pair) -> {
FunctionalList<FunctionalList<E>> newRule =
new FunctionalList<>();
for (int i = 1; i <= numberOfTimes; i++) {
FunctionalList<E> newCase =
pair.merge((left, right) -> right.clone());
for (int j = 1; j <= i; j++) {
newCase.prepend(prefixToken);
}
newRule.add(newCase);
}
newRule.forEach(
(list) -> newResults
.add(new Pair<>(
pair.merge((left, right) -> left)
+ additionalProbability,
list)));
});
newResults.forEach((pair) -> pair
.doWith((left, right) -> addCase(ruleName, left, right)));
}
/**
* Create a series of alternatives for a rule by prefixing them with a
* given token
*
* @param additionalProbability
* The amount to adjust the probability by
* @param ruleName
* The name of the rule to prefix
* @param prefixToken
* The token to prefix to the rule
*/
public void prefixRule(E ruleName, E prefixToken,
int additionalProbability) {
WeightedRandom<FunctionalList<E>> rule = rules.get(ruleName);
FunctionalList<Pair<Integer, FunctionalList<E>>> newResults =
new FunctionalList<>();
rule.getValues().forEach((pair) -> {
FunctionalList<E> newCase =
pair.merge((left, right) -> right.clone());
newCase.prepend(prefixToken);
newResults.add(new Pair<>(pair.merge((left, right) -> left)
+ additionalProbability, newCase));
});
newResults.forEach((pair) -> pair
.doWith((left, right) -> addCase(ruleName, left, right)));
}
/**
* Remove a rule with the specified name.
*
* @param name
* The name of the rule to remove.
*/
public void deleteRule(E name) {
rules.remove(name);
}
/**
* Remove a subgrammar with the specified name.
*
* @param name
* The name of the subgrammar to remove.
*/
public void deleteSubgrammar(E name) {
subgrammars.remove(name);
}
/**
* Returns the number of rules in this grammar
*
* @return The number of rules in this grammar
*/
public int getRuleCount() {
return rules.size();
}
/**
* Returns a set containing all of the rules in this grammar
*
* @return The set of all rule names in this grammar
*/
public Set<E> getRuleNames() {
return rules.keySet();
}
/**
* Set the initial rule of the graphic
*
* @param initRule
* The initial rule of this grammar
*/
public void setInitialRule(String initRule) {
this.initialRule = initRule;
}
/**
* Suffix a token to a rule
*
* @param ruleName
* The rule to suffix
* @param prefixToken
* The token to prefix to the rule
* @param additionalProbability
* Additional probability of the prefixed rule
*/
public void suffixRule(E ruleName, E prefixToken,
int additionalProbability) {
WeightedRandom<FunctionalList<E>> rule = rules.get(ruleName);
FunctionalList<Pair<Integer, FunctionalList<E>>> newResults =
new FunctionalList<>();
rule.getValues().forEach((par) -> {
FunctionalList<E> newCase =
par.merge((left, right) -> right.clone());
newCase.add(prefixToken);
newResults.add(new Pair<>(par.merge((left, right) -> left)
+ additionalProbability, newCase));
});
newResults.forEach((pair) -> pair
.doWith((left, right) -> addCase(ruleName, left, right)));
}
}
|