Aaron, Matthew I am afraid I will not meet the application deadline. My computer died, and I do not think I can work around it. I will put some time into figuring out how to make this defined and achievable and apply next summer. Thank you for the quick responses and advice. -Joe
On Monday, April 29, 2013 1:41:49 PM UTC-6, Joseph Stradling wrote: > > Hello, > My name is Joseph Stradling and I am a junior chemical cngineering student > transitioning into computer science at New Mexico Tech. > > I am interested in improving the pattern matching and recognition as a > project for Google Summer of Code. I am currently trying to determine which > combination of possible project paths would be appropriately difficult and > useful. I am currently leaning towards: > > - Expression complexity measures > As I understand it, this is determining the complexity of regular > expressions. This seems challenging but fairly straightforward, and it > looks like there is pretty good literature on the subject > > - Expression tree similarity testing > Basically make something to determine similarity in expression trees. It > seems like something that can be solved with clever stacking, but I am > probably missing a big piece of the challenge > > - Heuristic equivalence testing > I assume this is just summing the two expressions and seeing if they add > to zero. > > - Semantic matching > To be perfectly honest, I have no idea how to do this cleverly. Possibly > with the heuristic equivalence testing? Also it says: > > - implement semantic matching (e.g. expression: cos(x), pattern: > sin(a*x) + b) > - e.g by using power series for this purpose (improve series speed) > > I don't really know how I would go about using series for semantic > matching. > Bottom line: this seems very difficult and time consuming, but it could > just be that I am pretty clueless about it. It seems pretty useful so I > though it would be worth attempting > > Questions: > What are expression signatures? > Is there anything that has been recently done in this area? > Is there a student already doing this? I looked over the group posts but I > didn't see anything. > Would this be enough to occupy the summer? > > I would appreciate any guidance. > -Joseph Stradling > > Application and patch to follow :-) > > -- You received this message because you are subscribed to the Google Groups "sympy" group. To unsubscribe from this group and stop receiving emails from it, send an email to sympy+unsubscr...@googlegroups.com. To post to this group, send email to sympy@googlegroups.com. Visit this group at http://groups.google.com/group/sympy?hl=en-US. For more options, visit https://groups.google.com/groups/opt_out.
