User:Rahul/GSOCApplication - Revision history

Rahul: /* Dependency Parse Tree */

2011-04-07T19:03:47Z

Dependency Parse Tree

Rahul: /* The module for making the tree */

2011-04-07T19:02:41Z

The module for making the tree

Rahul: /* The module for making the tree */

2011-04-07T19:01:13Z

The module for making the tree

Rahul at 18:49, 7 April 2011

2011-04-07T18:49:32Z

Rahul at 18:48, 7 April 2011

2011-04-07T18:48:08Z

Rahul: moved User:Rahul to User:Rahul/GSOCApplication

2011-04-07T18:46:20Z

moved User:Rahul to User:Rahul/GSOCApplication

Rahul: /* Introduction */

2011-04-07T18:42:43Z

Introduction

Rahul at 18:40, 7 April 2011

2011-04-07T18:40:48Z

Rahul: /* Work plan (including, if possible, a brief schedule with milestones and deliverable) */

2011-04-07T18:27:26Z

Work plan (including, if possible, a brief schedule with milestones and deliverable)

Rahul at 18:25, 7 April 2011

2011-04-07T18:25:33Z

Show changes

@@ Line 148: / Line 148: @@
 vmain ( NULL-0 , sung-5 )
-This is the link to the image where dependency tree is drawn: [http://i53.tinypic.com/15p01m1.jpg] <br /><br />
 [[File:tree.jpg]]

@@ Line 153: / Line 153: @@
 === The module for making the tree===
-Once I get the dependency analysis from cg-proc, I’ll use this analysis to make the dependency tree. Note that the child node will be at the leftmost position if, in the sentence it has the lowest position. For example children of sungs-5 are kept in dependency tree, poets-3 at the leftmost position as it has the lowest position out of the all the children of sung-5 in the sentence and praise-8 at the right most position, so all the child nodes are kept accordingly. This way the rules can be formulated keeping in mind the order in which nodes with particular syntactic tag occur for some particular parent in the target language. Example of reordering a particular node can be found at this url: [http://i52.tinypic.com/rtzsao.jpg]<br /><br />
+Once I get the dependency analysis from cg-proc, I’ll use this analysis to make the dependency tree. Note that the child node will be at the leftmost position if, in the sentence it has the lowest position. For example children of sungs-5 are kept in dependency tree, poets-3 at the leftmost position as it has the lowest position out of the all the children of sung-5 in the sentence and praise-8 at the right most position, so all the child nodes are kept accordingly. This way the rules can be formulated keeping in mind the order in which nodes with particular syntactic tag occur for some particular parent in the target language. Example of reordering a particular node:
 [[File:tree2.jpg]]

@@ Line 154: / Line 154: @@
 Once I get the dependency analysis from cg-proc, I’ll use this analysis to make the dependency tree. Note that the child node will be at the leftmost position if, in the sentence it has the lowest position. For example children of sungs-5 are kept in dependency tree, poets-3 at the leftmost position as it has the lowest position out of the all the children of sung-5 in the sentence and praise-8 at the right most position, so all the child nodes are kept accordingly. This way the rules can be formulated keeping in mind the order in which nodes with particular syntactic tag occur for some particular parent in the target language. Example of reordering a particular node can be found at this url: [http://i52.tinypic.com/rtzsao.jpg]<br /><br />
-[[File:tree1.jpg]]
+[[File:tree2.jpg]]
 For this reordering, a rule (rule#4) formulated which is given written below. If we analyze the nodes after reordering it still follow the same concept I used to make the tree at the first hand. So printing the tree will also become an easy task here.<br /><br />

@@ Line 1: / Line 1: @@
+[[Category:GSoC 2011 Student Proposals]]
-[[Category:Google Summer of Code]]
 == Introduction ==

← Older revision		Revision as of 18:48, 7 April 2011
Line 1:		Line 1:

			[[Category:Google Summer of Code]]

	== Introduction ==		== Introduction ==

← Older revision	Revision as of 18:46, 7 April 2011
(No difference)

@@ Line 3: / Line 3: @@
 '''Name: Rahul Agarwal<br />
 Email: rahul.agarwal.90@gmail.com, rahul_agarwal@students.iiit.ac.in<br />
-Phone: +91-9963145450<br />'''
+Phone: +91-9963145450<br />
+IRC : rahul1@freenode'''
 == ''Why is it you are interested in machine translation?'' ==

@@ Line 8: / Line 8: @@
 == ''Why is it you are interested in machine translation?'' ==
-	I am very much fascinated by the difference in properties of the languages syntactically and semantically. Some languages are very much complicated than others because they are very flexible. Also machine translation tool is very helpful for the people having language problem, this is also a way to give something back to the society.<br />
+	I am very much fascinated by the difference in properties of the languages syntactically and semantically. I wasn't much excited about machine translation until 2 years ago when I had to choose a field for my major, I talked to a whole lot of people from different areas, finally I found my interest in Machine Translation. Some languages are very much complicated than others because some languages are very flexible. I have also worked on project related to machine translation at my research lab. Also machine translation tool is very helpful for the people having language problem, this is also a way to give something back to the society.<br />
 == ''Why is it that you are interested in the Apertium project?'' ==
-	I find Apertium as a perfect platform to work on Machine Translation problems, as it provides a wide variety of the problems which occur during machine translation. Also When I talked to people already working on Apertium for a long time, I found them to be very knowledgeable and helpful, so it would a great opportunity for me to work with them and learn something in this area.<br />
+	I find Apertium as a perfect platform to work on Machine Translation problems, as it provides with wide variety challenges to solve which occur during machine translation for example lexical transfer and reordering. Also When I talked to people already working on Apertium for a long time, I found them to be very knowledgeable and helpful, so it would a great opportunity for me to work with them and learn something in this area.<br />
@@ Line 34: / Line 34: @@
 === How and who will it benefit in society?===
 	This module can be very useful in improving the quality of machine translation especially for the people using languages having long distance relationship. Machine translation is always very helpful for the society, improving the quality of the translation would increase the relevance of the text, which in turn will provide ease to the users to understand the translated text.<br /><br />
-=== Work plan (including, if possible, a brief schedule with milestones and deliverable)===
-	In this project, first I'll have to convert cg-proc (constraint grammar processor) so it can output dependency analyses. cg-proc makes use of Constraint Grammar (CG) within the Apertium MT platform and currently it doesn't output the dependency analysis. Dependency analysis is must to use it further along with syntactic tags for the reordering purpose. <br /><br />
-Secondly I'll create a separate module, which given with the tags and dependency analysis (obtained from first) builds a tree. Once we have a tree and manually written rules (According the syntax of target language), I’ll make use of the features like dependency relations and the order of syntactic tags to reorder the source dependency tree. Reordering will also involve prioritizing; the rule will only be used if it is nearest to the current pattern. For e.g. If we have rule for 'det' , 'noun' and 'det noun' and we need to match them with the pattern having 'det noun', so third rule will be activated as it does nearly match the pattern other than two other rules.<br /><br />
-Some of important things on which I will pay special attention are superblanks (Formatting in Apertium), partial sentences/parses (These parses are not enough or reliable, so here reordering can only be performed if we have something sensible as input. The main idea is to keep precision high but need not have a recall) and defining an XML format for the rules which makes sense, and also draws on experience from other modules in Apertium.  I already have some ideas about handling superblanks which I shared with one of my possible project mentor Francis Tyers.  <br /><br />
 === List of skills===
-	I am proficient in mostly high level programming languages like C, C++ and Java as well scripting languages like Python, Perl, PHP.<br /><br />
+	I am proficient in mostly high level programming languages like C, C++ and Java as well as scripting languages like Python, Perl, PHP. <br /><br />
 === Evidence of your qualifications===
-	I am an MS by research student at International institute of information technology, Hyderabad. I am currently in my final semester of my Btech. I have planned to pursue my MS in Language Technologies. I am working as Research Assistant at LTRC (Language Technology Research Centre) based at IIIT. I have also worked on several research projects since last 2 years. Below I have listed down the projects that I undertook. I have also worked as a summer intern at LTRC in summer 2009 and summer 2010. I have also attended a conferences (ICON 2010) based on NLP.  My interest has generally been in Machine Translation. I worked on Statistical Machine Translation using discriminative approaches for a project. I have already tried tree-based reordering using statistical approach in my project. But it will be interesting to use rule based approach as rules are always promising at least if we talk in terms of precision.<br /><br />
+	I am an MS by research student at International institute of information technology, Hyderabad(IIIT-H). I am currently in my final semester of my Btech. I have planned to pursue my MS in Language Technologies. I am working as Research Assistant at LTRC (Language Technology Research Centre) based at IIIT. I have also worked on several research projects since last 2 years. Below I have listed down the projects that I undertook. I have also worked as a summer intern at LTRC in summer 2009 and summer 2010. I have also attended a conferences (ICON 2010) based on NLP.  My interest has generally been in Machine Translation. I worked on Statistical Machine Translation using discriminative approaches for a project. I have already tried tree-based reordering using statistical approach in my project. But it will be interesting to use rule based approach as rules are always promising at least if we talk in terms of precision.<br /><br />
 === Current field of study and major ===
-	Currently I am working on language technology. <br />
+	Currently I am working in the field language technology. <br />
 '''Some of the projects which I have undertaken are:'''<br />
@@ Line 72: / Line 67: @@
 === Non-Summer-of-Code plans you have for the summer, especially employment and class-taking===
 	I might not be available from 11th may to 22nd may as I have some urgent work, but I am willing to cover for that time by increasing my work hours for other weak. Also I am attending summer school at my college on advanced natural language processing from 23 May 2011 to 5 June 2011 but that won’t affect my work for GSOC, apart from this I will be having only GSOC for my summer.<br />
-=== Work plan===
+=== Work plan (including, if possible, a brief schedule with milestones and deliverable)===
+	In this project, first I'll have to convert cg-proc (constraint grammar processor) so it can output dependency analyses. cg-proc makes use of Constraint Grammar (CG) within the Apertium MT platform and currently it doesn't output the dependency analysis. Dependency analysis is must to use it further along with syntactic tags for the reordering purpose. <br /><br />
+Secondly I'll create a separate module, which given with the tags and dependency analysis (obtained from first) builds a tree. Once we have a tree and manually written rules (According the syntax of target language), I’ll make use of the features like dependency relations and the order of syntactic tags to reorder the source dependency tree. Reordering will also involve prioritizing; the rule will only be used if it is nearest to the current pattern. For e.g. If we have rule for 'det' , 'noun' and 'det noun' and we need to match them with the pattern having 'det noun', so third rule will be activated as it does nearly match the pattern other than two other rules.<br /><br />
+Some of important things on which I will pay special attention are superblanks (Formatting in Apertium), partial sentences/parses (These parses are not enough or reliable, so here reordering can only be performed if we have something sensible as input. The main idea is to keep precision high but need not have a recall) and defining an XML format for the rules which makes sense, and also draws on experience from other modules in Apertium.  I already have some ideas about handling superblanks which I shared with one of my possible project mentor Francis Tyers.  <br /><br />
 I have prepared the work plan thinking of maximum time the task may take. If a task for a week finishes before the end of the assigned interval, I’ll start working on the task for the next week.<br />