We have been considering how our tree recognizer would work with an embeded automaton. If we try to embed the tree before running the recognizer there will be important information lost about where each label in the input tree comes from in terms of the new unique labels from the automaton. It would be impossible to run rec on a tree that has not yet been embeded because the trees would not match. There may be some way to either build an embeded tree as we run rec and then excavate that or simply run rec without an embeded automaton.
In terms of storing the factored trees we attempted to think of ways to retain the information of how they were factored in the new unique labels. We could not come up wtih a satisfactory solution to this problem and thought that adding a pointer to each tree in the automaton which would point to its origin, the tree that was factored into it would make sense. We think the best way would be to create an inherited class from the tree class for automaton rules.
Posted by lemanal at August 5, 2004 04:23 PM