Hi, My name is Andrei Sfrent, I am studying for a Master's Degree in Machine Learning at the Imperial College and I am interested in working on one of the apertium projects in GSoC this summer.
I am proficient in C++ and I also have a good background in the software optimization area (last year I participated in an optimization contest organized by Intel and ended on the first place in Europe / forth place worldwide [1, 2]). I previously had two internships with Google and I had the chance to work with Map Reduce / Knowledge Graph on YouTube data, enhancing my engineering and design skills; you can find more information about me at [3]. Because of my previous experience with algorithms, data structures and software optimization, the "Command-line translation memory fuzzy-match repair" project sounds really appealing to me. I previously read some papers on a possible solution, Case Based Reasoning, which finds a good match for the problem, retrieves the solution for the match and then adapts the solution to the original problem, and made myself familiar with some of the techniques for doing so. The distance between the original query and the match may be modeled as a dynamic programming problem, in a similar way to the Levenstein distance metric [4]. Please, could you give me a few pointers on how to prepare my application? I will start with the warmup task and I hope I can put up a demo in the next few days. [1] http://software.intel.com/fr-fr/articles/contest-winners-are-announced [2] http://intel-software-academic-program.com/tmp/certificates/4.pdf [3] http://asfrent.net/CV.pdf [4] http://en.wikipedia.org/wiki/Levenshtein_distance Best regards, Andrei SFRENT ------------------------------------------------------------------------------ Learn Graph Databases - Download FREE O'Reilly Book "Graph Databases" is the definitive new guide to graph databases and their applications. Written by three acclaimed leaders in the field, this first edition is now available. Download your free book today! http://p.sf.net/sfu/13534_NeoTech _______________________________________________ Apertium-stuff mailing list Apertium-stuff@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/apertium-stuff
