User:Pranavaswaroop/Application - Revision history

Pranavaswaroop: /* Project schedule */

2009-04-03T04:43:15Z

Project schedule

2009-04-03T04:38:19Z

Project schedule

2009-04-03T04:37:34Z

Project plan

2009-04-03T03:19:09Z

Background

2009-04-03T03:05:11Z

Background

2009-04-03T03:02:47Z

Background

2009-03-26T16:28:52Z

2009-03-26T16:25:54Z

Background

2009-03-26T16:25:07Z

Implementation of n-Stage Transfer

2009-03-26T16:24:52Z

Background

@@ Line 20: / Line 20: @@
 ==Project schedule==
-    * April 14 -
+ April 14 -
-    * May 26 -
+ May 26 -
-    * June 15 -
+ June 15 -
-    * July 5 -
+ July 5 -
-    * August 1 -
+ August 1 -
-    * August 10 -
+ August 10 -
-    * August 15 -
+ August 15 -
 ==Deliverables==

@@ Line 20: / Line 20: @@
 ==Project schedule==
+    * April 14 -
+    * May 26 -
+    * June 15 -
+    * July 5 -
+    * August 1 -
+    * August 10 -
+    * August 15 -
 ==Deliverables==
 ==About the author==

@@ Line 18: / Line 18: @@
 ==Project plan==
 ==Project schedule==
 ==Deliverables==

@@ Line 15: / Line 15: @@
 '''Present Status of Apertium'''<br />
-Apertium structural transfer uses finite-state pattern matching to detect, in the usual left-to-right, longest-match way, fixed-length patterns of lexical forms to process and performs the corresponding transformations. A shallowtransfer rule consists of a sequence of lexical forms to detect and the transformations that have to be applied to them.
+Apertium structural transfer uses finite-state pattern matching to detect, in the usual left-to-right, longest-match way, fixed-length patterns of lexical forms to process and performs the corresponding transformations. A shallow-transfer rule consists of a sequence of lexical forms to detect and the transformations that have to be applied to them. Apertium currently has between one and three stages of transfer. This may not be favorable for translation of distant languages. The joining or in other words merging of chunks, which also involves the Verb movement is restricted. I have realized this after working on the transfer rules and inter-chunk transfer rules.
 ==Project plan==

@@ Line 14: / Line 14: @@
 A partial parser is mostly controlled by a cascaded set of finite state automata, hence forth it is described by a number of levels. In this finite state cascade, a genuine recursion is not possible. The whole strategy is based on "simple-first-parsing", as put by Steven Abney, we make easy calls first, whittling away at the harder decisions in the process.
-'''Present Status of Apertium'''
+'''Present Status of Apertium'''<br />
 Apertium structural transfer uses finite-state pattern matching to detect, in the usual left-to-right, longest-match way, fixed-length patterns of lexical forms to process and performs the corresponding transformations. A shallowtransfer rule consists of a sequence of lexical forms to detect and the transformations that have to be applied to them.

← Older revision		Revision as of 16:25, 26 March 2009
Line 1:		Line 1:
	==Implementation of n-Stage Transfer==		=='''Implementation of n-Stage Transfer'''==

	'''A proposal for Google Summer of Code 2009'''		'''A proposal for Google Summer of Code 2009'''

@@ Line 8: / Line 8: @@
 Partial parsing technique tries to grasp the syntactic information reliably and efficiently without digging deep into the analysis. The technique is tested for its robustness and speed. It is basically controlled by a cascade of finite-state automata which consists of a pipeline of recognizers. There have been several implementations of partial parsing including Cass - a fast, robust partial parser, Mirine 2.2 - a Korean grammar-checker and APOLN - a partial parser of unrestricted natural language sentences. These implementations (especially the latter) have shown that partial parsers can be used to resolve treatment of less related languages. Therefore its implementation would be quite beneficial for Apertium. This document describes a novel implementation of the partial parser which would improve the treatment of less related languages and allow for more complex verb movement and proposes the funding of the project through Google Summer of Code 2009 program as a part of Apertium.
-=='''Background'''==
+==Background==
 '''Partial Parser''' <br />
 A partial parser uses 'semi-deterministic' robust parsing algorithms which permit the analysis of unrestricted texts. It works with simple grammars, which are usually defined with regular patterns. The output of the parser is a complete analysis tree.