summaryrefslogtreecommitdiff
path: root/src/main/java/bjc/inflexion/InflectionML.java
blob: 34b534ab2d0887eb2dbe063f1979c5456a2a008c (plain)
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
/*
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package bjc.inflexion;

import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.regex.Matcher;
import java.util.regex.Pattern;

import bjc.inflexion.nouns.InflectionException;
import bjc.inflexion.nouns.Noun;
import bjc.inflexion.nouns.Nouns;
import bjc.inflexion.nouns.Prepositions;

/*
 * @TODO 10/11/17 Ben Culkin :InflectionML
 *
 * Complete the implementation of this from the documentation for Lingua::EN:Inflexion.
 *
 * ADDENDA 10/25/18
 * 	Everything that doesn't require doing verbs is done.
 */
/**
 * Implementation of a simple format language for inflections.
 *
 * @author student
 */
public class InflectionML {
	/* The options implied by the E option. */
	private static final List<String> ESUB_OPT = Arrays.asList("a", "s", "w");

	/* The regex that marks an inflection form. */
	private static Pattern FORM_MARKER
			= Pattern.compile("<(?<command>[#N])(?<options>[^:]*):(?<text>[^>]*)>");

	private static Pattern AN_MARKER = Pattern.compile("\\{an(\\d+)\\}");

	/* The database of nouns. */
	private static Nouns nounDB;

	/* Load DBs from files. */
	static {
		final Prepositions prepositionDB = new Prepositions();
		try (InputStream strim
				= InflectionML.class.getResourceAsStream("/prepositions.txt")) {
			prepositionDB.loadFromStream(strim);
		} catch (IOException ioex) {
			ioex.printStackTrace();
		}

		nounDB = new Nouns(prepositionDB);
		try (InputStream strim = InflectionML.class.getResourceAsStream("/nouns.txt")) {
			nounDB.loadFromStream(strim);
		} catch (IOException ioex) {
			ioex.printStackTrace();
		}
	}

	/**
	 * Apply inflection to marked forms in the string.
	 *
	 * @param form
	 *             The string to inflect.
	 *
	 * @return The inflected string.
	 */
	public static String inflect(String form) {
		Matcher formMatcher = FORM_MARKER.matcher(form);
		StringBuffer formBuffer = new StringBuffer();

		int curCount = 1;

		boolean inflectSingular = true;

		int anCount = 0;
		List<String> anVals = new ArrayList<>();

		boolean pendingAN = false;

		while (formMatcher.find()) {
			final String command = formMatcher.group("command");
			final String options = formMatcher.group("options");
			final String text = formMatcher.group("text");

			final Set<String> optionSet = new HashSet<>();

			boolean doCaseFold = false;

			final Map<Character, Integer> numOpts = new HashMap<>();
			numOpts.put('w', 11);
			numOpts.put('o', Integer.MAX_VALUE);
			numOpts.put('f', 0);

			if (!options.equals("")) {
				if (options.matches("(?:[a-z]*[A-Z]+[a-z])+")) {
					doCaseFold = true;
				}

				char prevOption = ' ';

				StringBuilder currNum = new StringBuilder();

				for (int i = 0; i < options.length(); i++) {
					char ci = options.charAt(i);

					if (Character.isDigit(ci)) {
						currNum.append(ci);
						continue;
					}

					if (currNum.length() > 0) {
						numOpts.put(prevOption, Integer.parseInt(currNum.toString()));

						currNum = new StringBuilder();
					}

					String opt = Character.toString(ci);

					// @TODO Ben Culkin 10/14/18
					//
					// There is some weird bug that I think is related to case folding,
					// where having options with a capitalized letter followed by more
					// than 1 lowercase letter gets ignored.
					if (doCaseFold) {
						if (Character.isUpperCase(ci)) {
							System.err.printf("Case-folding '%c'\n", ci);

							opt = opt.toLowerCase();
						} else {

							System.err.printf("Ignoring '%c' due to case folding\n", ci);
							continue;
						}
					}

					prevOption = ci;
					optionSet.add(opt);
				}

				if (currNum.length() > 0) {
					numOpts.put(prevOption, Integer.parseInt(currNum.toString()));

					currNum = new StringBuilder();
				}
			}

			switch (command) {
			case "#":
				/*
				 * @NOTE These should maybe be moved into their own function. This will
				 * also allow the use of custom inflection forms.
				 */
				try {
					if (optionSet.contains("e")) {
						optionSet.remove("e");
						optionSet.addAll(ESUB_OPT);
					}

					curCount = Integer.parseInt(text);

					if (optionSet.contains("i")) {
						curCount += 1;
					}

					if (curCount != 1) {
						if (curCount == 0 && optionSet.contains("s")) {
							inflectSingular = true;
						} else {
							inflectSingular = false;
						}
					} else {
						inflectSingular = true;
					}

					String rep = text;

					if (optionSet.contains("n")) {
						if (curCount == 0) {
							rep = "no";
						}
					}

					if (optionSet.contains("s")) {
						if (curCount == 0) {
							rep = "no";
						}
					}

					if (optionSet.contains("a")) {
						if (curCount == 1) {
							anCount += 1;
							rep = "{an" + anCount + "}";

							pendingAN = true;
						}
					}

					/* Break out of switch. */
					if (optionSet.contains("d")) {
						formMatcher.appendReplacement(formBuffer, "");
						break;
					}

					boolean shouldOverride = true;
					if (rep.equals("no") || rep.matches("\\{an\\d+\\}")) {
						shouldOverride = false;
					}

					if (optionSet.contains("w") && shouldOverride) {
						rep = NumberUtils.toCardinal(curCount, numOpts.get('w'));

					}

					if (optionSet.contains("o") && shouldOverride) {
						if (optionSet.contains("w")) {
							if (curCount < numOpts.get('w'))
								rep = NumberUtils.toOrdinal(curCount, numOpts.get('o'),
										true);
							else
								rep = NumberUtils.toOrdinal(curCount, numOpts.get('o'),
										false);
						} else {
							rep = NumberUtils.toOrdinal(curCount, numOpts.get('o'),
									false);
						}

						if (curCount < numOpts.get('o')) {
							// Respect english usage of ordinals
							curCount = 1;
							inflectSingular = true;
						}
					}

					if (optionSet.contains("f") && shouldOverride) {
						rep = NumberUtils.summarizeNumber(curCount,
								numOpts.get('f') != 0);
					}

					numOpts.put('o', Integer.MAX_VALUE);
					numOpts.put('w', 11);
					numOpts.put('f', 0);

					formMatcher.appendReplacement(formBuffer, rep);
				} catch (final NumberFormatException nfex) {
					throw new InflectionException(
							"Count setter must take a number as a parameter", nfex);
				}
				break;
			case "N":
				final Noun noun = nounDB.getNoun(text);

				String nounVal;

				if (optionSet.contains("p") || !inflectSingular) {
					if (optionSet.contains("c")) {
						nounVal = noun.classicalPlural();
					} else {
						nounVal = noun.plural();
					}
				} else {
					nounVal = noun.singular();
				}

				formMatcher.appendReplacement(formBuffer, nounVal);
				if (pendingAN) {
					anVals.add(EnglishUtils.pickIndefinite(nounVal));

					pendingAN = false;
				}

				break;
			default:
				final String msg = String.format("Unknown command '%s'", command);

				throw new InflectionException(msg);
			}
		}

		formMatcher.appendTail(formBuffer);

		String res = formBuffer.toString();
		formBuffer = new StringBuffer();

		Matcher anMat = AN_MARKER.matcher(res);

		Iterator<String> anItr = anVals.iterator();
		while (anMat.find()) {
			anMat.appendReplacement(formBuffer, anItr.next());
		}
		anMat.appendTail(formBuffer);

		return formBuffer.toString();
	}

	/**
	 * Alias method to format a string, then inflect it.
	 *
	 * @param format
	 *                The combined format/inflection string.
	 *
	 * @param objects
	 *                The parameters for the format string.
	 *
	 * @return The string, formatted &amp; inflected.
	 */
	public static String iprintf(final String format, final Object... objects) {
		return inflect(String.format(format, objects));
	}
}