Patent Document ID: 20050256699
Application ID: 10522328
Patent Status: 0

Claim One:
1. A method of automatic translation of sentences from a source language L s selected from language L 1 to L n to a target language L t selected from languages L 1 to L n comprising the steps of: (i) providing grammars G 1 to G n of all the languages L 1 to L n respectively and a text ‘S’ in the source language L s as inputs; (ii) creating a unified grammar specification UG for the grammars G 1 to G n ; (iii) separating the input text ‘S’ in the source language L s into a list of tokens using a lexical analyser for the source language L s ; (iv) setting a non-terminal symbol ‘E’ to the start symbol of the unified grammar specification UG;. (v) obtaining a set of grammar production rules P e which define the rules to reduce a string of terminal symbols and/or non-terminal symbols to the target non-terminal symbol E from the unified grammar specification UG; (vi) for each unified grammar production rule P in the set of grammar production rules P e taking each symbol one by one from a list of terminal symbols and/or non-terminal symbols corresponding to the source language grammar G s , determining whether it is a terminal symbol or a non-terminal symbol; (vii) for each terminal symbol obtained from the previous step, which is equivalent to a corresponding symbol in the list of tokens T of the input text in the source language L s , considering the next symbol in said list of terminal symbols and/or non-terminal symbols corresponding to the source language grammar G s and for each non-terminal symbol obtained from the previous step which refers to another non-terminal symbol E s , of the unified grammar specification UG, repeating step (v) onwards with the new non-terminal symbol E s ; (viii) if all the symbols in the said list of terminal symbols and/or non-terminal symbols corresponding to the source language grammar G s match with all the symbols in the list of tokens T of the input text in the source language L s , obtaining a list of symbols t corresponding to the target language grammar G t from the unified grammar production rule P and for those symbols which do not match, repeating step (vi) onwards for the next unified grammar production rule P defined for the non-terminal symbol ‘E’; (ix) taking each symbol one by one, from the list of symbols t corresponding to the target grammar G t and determining whether it is a terminal symbol or a non-terminal symbol; (x) for each terminal symbol obtained from the previous step outputing the symbol, and considering the next symbol and for each non-terminal obtained from the previous step, obtaining another unified grammar production rule P corresponding to that non-terminal symbol and repeating the previous step with the new unified grammar production rule, till all the symbols in the list of symbols t corresponding to the target language grammar G t are exhausted,