On Thu, Mar 20, 2014 at 5:47 PM, Berg, Matias Juho
Hi all,
I am a final year undergraduate student at a university and I am doing my final honours project on natural language generation from regular expressions. For this to work efficiently I need to simplify the regular expressions before I translate them. It seems that there is some previous work done on this in Haskell but I have only been able to find this code (http://hackage.haskell.org/package/HaLeX-1.1/docs/src/Language-HaLex-RegExp....) which does some elementary simplification.
Does anyone have any suggestions on where to look for more examples so I can see what kinds of attempts people have used to try and solve this problem?
Have not followed this thread closely so please excuse if this is already mentioned or is unfitting to your requirement Have you seen the Berry-Sethi algo?? www2.in.tum.de/hp/file?fid=571