On Mon, May 8, 2023 at 8:42 AM Thomas Passin <tbp100...@gmail.com> wrote:
there has been theoretical and (somewhat?) practical work on regular > expressions for trees. E.g., > > Implementing Regular Tree Expressions > <https://theory.stanford.edu/~aiken/publications/papers/fpca91.pdf> (very > tough going) > Tregex, Tsurgeon and Semgrex > <https://nlp.stanford.edu/software/tregex.shtml> > The Aha sidesteps the need for all such tools. Edward -- You received this message because you are subscribed to the Google Groups "leo-editor" group. To unsubscribe from this group and stop receiving emails from it, send an email to leo-editor+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/leo-editor/CAMF8tS18r2E%3DDPYq1v3eP5_2W3shh63Oxii0ugxvFqn1WSP36A%40mail.gmail.com.
