Lab 1a

1. The way to work around this issue (double r in inflected forms) is to add the intonation to the input as in
Pronunciation: ri-'f&r (* from Merriam-Webster)

In fact, this was the most time-consuming question for me, partly because I’m not a native speaker. But it is always better than trying similar stuff in a completely different language e.g Spanish

2. Added the liner

`dog V_Root4 Verb(dog)
under
V_ROOT_NO_PREF:

3. This statement is incorrect because recognizer actually checks different combinations of possible words in a branch, moving forward letter by letter. If a given path does not match up, with backtracking an alternative path is chosen. E.g. it can try flies and then go back to flier

As the algorithm is explained in PCKimmo’s website

“The recognizer also consults the lexicon. The lexical items recorded in the lexicon are structured as a letter tree. When the recognizer tries a lexical character, it moves down the branch of the letter tree that has that character as its head node. If there is no branch starting with that letter, the lexicon blocks further progress and forces the recognizer to backtrack and try a different lexical character.”

So the situation can arise when a path leading to the wrong branch is chosen.
The same thing would not happen with generation because for generation we do not have to consult the lexicon letter tree. In a parallel fashion , generator outputs the surface form.

4. I chose to create a single automaton. In terms of extensibility, this approach would not fare well. It would be painful if a language had many rules and trying to combine them into a single automaton would be a bad idea for the benefits of modularity and extensibility. As for transparency, I think this solution had much more intuition in this case. Because in effect we are dealing with a single context with left and right environments. However, combination of many rules with distinct contexts may not be transparent if the contexts are so distinct.

With the following write-up

RULE "N realized as m" 4 6
N N p p m @
m n p m m @
1: 3 4 1 0 2 1
2: 3 4 0 2 2 1
3: 0 0 0 1 0 0
4: 3 4 0 0 1 1