Monadic second-order logic for finite-state transductions
My thesis concerns the use of
MSO logic for specifying finite-state
transductions. Some of this work is also described in:
Nathan Vaillette (2003). Logical specification of regular relations for NLP. Natural Language
Engineering 9(1):65--85.
The basic constructions described in the thesis and article have been
implemented. I used the
MONA tool to implement the
logical description of the replace operator (note that not all the
varieties discussed in the thesis are implemented):
I used the Finite State
Utilities to reimplement some other approaches to the replace operator for comparison:
I also used the FSU to make an ititial prototype. I include it here
for completeness, but I am not maintaining it at the moment:
Last updated 01/08/04
Nathan Vaillette