WO2004012028A2 - Method for specifying equivalence of language grammars and automatically translating sentences in one language to sentences in another language in a computer environment - Google Patents

Method for specifying equivalence of language grammars and automatically translating sentences in one language to sentences in another language in a computer environment Download PDF

Info

Publication number
WO2004012028A2
WO2004012028A2 PCT/IN2002/000159 IN0200159W WO2004012028A2 WO 2004012028 A2 WO2004012028 A2 WO 2004012028A2 IN 0200159 W IN0200159 W IN 0200159W WO 2004012028 A2 WO2004012028 A2 WO 2004012028A2
Authority
WO
WIPO (PCT)
Prior art keywords
symbol
terminal
grammar
symbols
language
Prior art date
Application number
PCT/IN2002/000159
Other languages
French (fr)
Other versions
WO2004012028A3 (en
Inventor
Kumar Bulusu Gopi
Desikan Murali
Ranga Swami Reddy Muthumula
Subramanian Seethalakshmi Gopala
Original Assignee
Kumar Bulusu Gopi
Desikan Murali
Ranga Swami Reddy Muthumula
Gopala Subramanian Seethalaksh
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Kumar Bulusu Gopi, Desikan Murali, Ranga Swami Reddy Muthumula, Gopala Subramanian Seethalaksh filed Critical Kumar Bulusu Gopi
Priority to AU2002313588A priority Critical patent/AU2002313588A1/en
Priority to US10/522,328 priority patent/US7529658B2/en
Priority to PCT/IN2002/000159 priority patent/WO2004012028A2/en
Priority to EP02753185A priority patent/EP1554663A4/en
Publication of WO2004012028A2 publication Critical patent/WO2004012028A2/en
Publication of WO2004012028A3 publication Critical patent/WO2004012028A3/en

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F40/00—Handling natural language data
    • G06F40/40—Processing or translation of natural language
    • G06F40/55—Rule-based translation

Definitions

  • the invention relates to a method for specifying equivalence of language
  • a language is basically a set of sentences that can be formed by following
  • a grammar specifies the syntax or stmcture of a language; irrespective of whether it is a language such as English or programming
  • a method used in the prior art for translating a language to another language used is carried out in the following manner.
  • ttie present invention is to provide a method to automatically translate sentences
  • one of the object of the present invention is to be able to specify the
  • Another object of the present invention is to allow mapping to multiple
  • the invention provides a method for representing equivalence of language
  • Each grammar is unique to that particular language.
  • Each grammar Gi to G n consists of a set of terminal symbols, a set of nonterminal symbols, a unique start symbol which is a nonterminal symbol and a set of production rales.
  • These production rules are the main aspects of the grammar.
  • Production rule define the rules to reduce a string of terminal and/or nonterminal symbols to a target nonterminal symbol.
  • a sentence of a language may be defined as any string derived from the start symbol composed of only terminal symbols.
  • the text in the source language is separated into a list of tokens using conventional
  • Figure I shows a system with which the method according to the invention can be
  • Figure II shows the flow chart of the method according to the invention.
  • Figure III shows the steps taken to create the unified grammar specification in the
  • figure II and the seventh step of figure V.
  • Figure VI shows the steps taken to obtain the sentence 'I from a unified
  • the method according to the invention can be implemented by using a
  • processing device (1) such as a microprocessor, a memory (2) and a user input
  • the user-input device may be a
  • the memory typically consists of a RAM and a ROM. According to
  • the invention the method of automatic translation of a sentences from a source
  • Step 1 Grammars Gi to G Catar of all the languages Li to L n respectively and a text
  • Step 2 A unified grammar specification UG is created for the grammars G x to
  • Step 3 The input text 'S' in the source language L s is separated into a list of
  • Step 4 A nonterminal symbol ⁇ ' is set to the start symbol of the unified
  • Step 5 A set of grammar production rules P e is obtained by selecting the
  • Step 6 For each unified grammar production rule P in the set of grammar
  • Step 7 For each terminal symbol obtained from the previous step which is
  • step (5) onwards with the new nonterminal E s .
  • Step 8 If all the symbols in the said list of terminal symbols and/or non-terminal
  • Step 9 Take each symbol one by one, from the list of symbols t corresponding
  • Step 10 For each terminal symbol obtained from the previous step output the
  • the method according to the invention can be used to represent the

Abstract

A method for specifying equivalence of language grammars and automatically translating sentences in one language to sentences in another language in a computer environment (figure 2). The method uses a unified grammar specification (2) of grammar of different languages (1) in a single unified representation of all the individual grammars where production rules (5) of each of the grammars are merged into a single unified production rule (6). This method can be used to represent the equivalence of computer languages like high level language, assembly language and machine language and for translating sentences in any of these languages into another language (7).

Description

METHOD FOR SPECIFYING EQUIVALENCE OF LANGUAGE GRAMMARS AND AUTOMATICALLY TRANSLATING
SENTENCES IN ONE LANGUAGE TO SENTENCES IN ANOTHER LANGUAGE IN A COMPUTER ENVIRONMENT
Field of Invention :
The invention relates to a method for specifying equivalence of language
grammars and the automatic translation of sentences in one language to sentences
in another language in a computer environment.
Background of the Invention :
A language is basically a set of sentences that can be formed by following
certain rules. The basic building block of any language is its alphabet. There are
numerous languages existing today in the same way. The sentences are a
collection of words that are formed from the letters of the alphabet. There are
certain rules to be followed when putting these words together. These rules are
called grammar of the language and are unique for each and every language.
These rules detennine the valid sentences of the language. Thus one can define
grammar as a concise specification using which, it is possible to generate all the
valid sentences of the language. A grammar specifies the syntax or stmcture of a language; irrespective of whether it is a language such as English or programming
language such as 'C or assembly language.
Very often, it is required to convert sentences in one language to equivalent
sentences in another language. For example from English to French or from a
programming language to assembly language. To perform such tasks the language
grammars have to be specified and the source language statements should be
validated and translated to sentences in the target language.
A method used in the prior art for translating a language to another language used is carried out in the following manner.
Define the source language grammar. Parse ttie sentences and convert them
to a predefined intermediate format and translate finally, the intermediate format
to the target language.
The disadvantages in performing a translation by the above mentioned method are the following.
(i) This method will not allow equivalence of the source language
grammar and target language grammar to be specified. Thus there is no real correspondence between source language grammar and
target language grammar,
(ii) Normally this method allows the translation from one source
language to one target language only. Mapping to multiple target
languages will not be possible,
(iii) Mapping from a source language to a target language is predefined
and thus supporting translations to new languages will be difficult.
Object of the Invention :
Bearing in mind the problems and detriments of the prior art, the object of
ttie present invention is to provide a method to automatically translate sentences
from one language to another, overcoming the above mentioned deficiencies.
Thus one of the object of the present invention is to be able to specify the
equivalence of the source language grammar and target language grammar.
Another object of the present invention is to allow mapping to multiple
target languages. Method according to the invention should have no restrictions to
translating a source language to more than one target languages. Description of the invention :
The invention provides a method for representing equivalence of language
grammars and for the automatic translation of sentences in one language to
sentences in another language in a computer environment.
Let Li toL„ be n number of languages and Gi to G„ represent the respective grammars for the languages Li to L„. Each grammar is unique to that particular language. Each grammar Gi to Gn consists of a set of terminal symbols, a set of nonterminal symbols, a unique start symbol which is a nonterminal symbol and a set of production rales. These production rules are the main aspects of the grammar. Production rule define the rules to reduce a string of terminal and/or nonterminal symbols to a target nonterminal symbol.
In a grammar, there is at least one production rule that has the start symbol as its target nonterminal symbol. A sentence of a language may be defined as any string derived from the start symbol composed of only terminal symbols.
In the method according to the invention, a unified grammar specification is
created for the grammars Gi to Gn of all the languages Li to Ln respectively. Then
the text in the source language is separated into a list of tokens using conventional
lexical analyser for the source language. A nonterminal symbol is set to the start
symbol of the unified grammar specification. Then a set of grammar production rules is obtained for the said non-terminal symbol form the unified grammar
specifications. Take each symbol one by one from a list of terminal symbols
and/or nonterminal symbols corresponding to the source language grammar,
determine whether it is a terminal symbol or a nonterminal symbol. For each
terminal symbol obtained which is equivalent to a corresponding symbol in the list
of tokens form the source language, consider the next symbol in the list of said
terminal symbols and/or nonterminal symbols. For each nonterminal symbol
obtained which refers to another non-terminal symbol obtain a set of grammar
production rules for that nonterminal symbol and repeat the previous steps.
If all the symbols in the said list of terminal symbols and/or non-terminal
symbols corresponding to the source language grammar match with symbols in the
said list of tokens of the input text obtain a list of symbols corresponding to the
target language grammar from the said unified grammar production rule. For
those symbols in the said list of terminal symbols and/or non-terminal symbols
which do not match with symbols in the said list of tokens, repeat the earlier steps
considering the next production rule from the set of production rules obtained for
the non-terminal.
Taking each symbol one by one from the said list of symbols corresponding
to the target language grammar, determine whether it is a terminal symbol or non- terminal symbol. Each terminal symbol obtained are provided as output. For each
nonterminal symbol, obtain another unified grammar production rule
corresponding to that nonteπninal symbol and repeat this step till all the symbols
in the said list of symbols corresponding to the target language grammar are
exhausted.
BRIEF DESCRIPTION OF DRAWINGS :
Figure I shows a system with which the method according to the invention can be
implemented.
Figure II shows the flow chart of the method according to the invention.
Figure III shows the steps taken to create the unified grammar specification in the
second step shown in figure II.
Figure IV shows the steps taken to determine if all symbols in a unified grammar
production rule match with the symbols in the token list 'T' in the sixth step of
figure II and the seventh step of figure V.
Figure V shows the steps taken to determine if a symbol from a unified grammar
production rule matches with a symbol from the token list 'T' in the fourth step of
figure IV.
Figure VI shows the steps taken to obtain the sentence 'I from a unified
grammar production rule ' in the eight step of figure II and in the seventh step
of figure VI. DESCRIPTION WITH REFERENCE TO THE DRAWINGS :
The method according to the invention can be implemented by using a
processing device (1) such as a microprocessor, a memory (2) and a user input
device (3) connected to said processor (1). The user-input device may be a
keyboard or any other device which can provide information signals to the
processor. The memory typically consists of a RAM and a ROM. According to
the invention, the method of automatic translation of a sentences from a source
language Ls selected from a number of languages Lj to Ln to a target language Lt
selected from the number of languages Li to L„ comprises the following steps.
Step 1 : Grammars Gi to G„ of all the languages Li to Ln respectively and a text
SS' in the source language Lg are provided as inputs.
Step 2 : A unified grammar specification UG is created for the grammars Gx to
Gn.
Step 3 : The input text 'S' in the source language Ls is separated into a list of
tokens T using a lexical analyser for the source language Lg.
Step 4 : A nonterminal symbol Ε' is set to the start symbol of the unified
grammar specification UG.
Step 5 : A set of grammar production rules Pe is obtained by selecting the
production rules which contain 'E' as their target non-terminal symbol from the
unified grammar specification UG. Step 6 : For each unified grammar production rule P in the set of grammar
production rules Pe taking each symbol one by one from a list of terminal symbols
and/or non-terminal symbols corresponding to the source language grammar Gs,
determine whether it is a terminal symbol or a non-terminal symbol.
Step 7 : 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 Ls, consider the next symbol in said list of terminal symbols
and or nonterminal symbols corresponding to the source language grammar Gs and
for each nontemiinal symbol obtained fiom the previous step which refers to
another nonterminal symbol Eg, of the unified grammar specification UG, repeat
step (5) onwards with the new nonterminal Es.
Step 8 : If all the symbols in the said list of terminal symbols and/or non-terminal
symbols corresponding to the source language grammar Gs match with all the
symbols in the list of tokens T of the input text in the source language Ls, obtain a
list of symbols t corresponding to the target language grammar Gt from the
unified grammar production rule P and for those symbols which do not match,
repeat step 6 onwards for the next unified grammar production rule P defined for
the nonterminal symbol Ε\
Step 9 : Take each symbol one by one, from the list of symbols t corresponding
to the target grammar Gt and determine whether it is a terminal symbol or a non¬
terminal symbol. Step 10 : For each terminal symbol obtained from the previous step output the
symbol, and consider the next symbol and for each nonterøiinal symbol obtained
from the previous step, obtain another unified grammar production rule P
corresponding to that nonterminal symbol and repeat 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 Gt are exhausted.
The unified grammar specification UG, for the grammars Gi to G„ of
languages Li to L„, is created by defining a unified production rule ?ι in the
unified grammar specification UG having the target nonterminal symbol of the
production rule P as its target nonterminal symbol for every production rule P of
the grammars Gi to Gn and creating a list of terminal symbols and or nonterminal
symbols in the said production rule ?ι for each grammar G% to Gπ; adding each and
every symbol in the list of terminal and/or nonterminal symbols that are
represented by the target nonterminal symbol in the production rule P to the said
unified production rule Pi and repeating previous steps for the next production
rule of the grammars Gi to Gn.
The method according to the invention can be used to represent the
equivalence of multiple language grammars and for translating sentences of one
language to another.

Claims

CLAIMS :
1. A method of automatic translation of sentences from a source language Ls
selected from language Lj to L„ to a target language Lt selected from
languages Li to Ln comprising the steps of :
(i) providing grammars Gi to Gn of all the languages Li to Ln respectively
and a text 'S' in the source language Ls as inputs-,
(ii) creating a unified grammar specification UG for the grammars Gi to Gn;
(iii) separating the input text 'S' in the source language Ls into a list of tokens
using a lexical analyser for the source language Ls;
(iv) setting a non-terminal symbol Ε* to the start symbol of the unified
grammar specification UG;
(v) obtaining a set of grammar production rules Pe 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 Pe taking each symbol one by one from a list of terminal
symbols and/or non-terminal symbols corresponding to the source language
grammar Gs, 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 Lg, considering the next symbol in said list of
terminal symbols and/or non-terminal symbols corresponding to the source
language grammar Gs and for each non-terminal symbol obtained from the
previous step which refers to another non-terminal symbol Es, of the
unified grammar specification UG, repeating step (v) onwards with the
new non-terminal symbol Es;
(viii) if all the symbols in the said list of terminal symbols and or non-terminal
symbols corresponding to the source language grammar Gs match with all
the symbols in the list of tokens T of the input text in the source language
LSJ obtaining a list of symbols t corresponding to the target language
grammar Gt torn 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
Ε';
(ix) talcing each symbol one by one, from the list of symbols t corresponding to
the target grammar Gt and determiήiiig whether it is a temiinal symbol or
a non-termiiial symbol;
(x) for each temiinal 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 Gt are exhausted.
2. The method as claimed in claim 1, wherein the unified grammar
specification UG, for the grammars Gi to Gn of languages Li to Ln, is created by
the steps of :
(i) for every production mle P of the grammars Gi to G^ of the languages Li
to L„, defining a unified production mle Pi in the unified grammar specification
UG having the target non-terminal symbol of the production mle P as its target
non-terminal symbol; and
(ii) for each grammar Gi to Gn creating a list of terminal symbols and/or non-
temiinal symbols in the said production mle Pi and adding each and every symbol
in the list of terminal symbols and/or non-terminal symbols that are represented
by the target non-terminal symbol in the production rale P to the said unified
production mle Pi and repeating previous step for the next production mle of the
grammars Gi to Gn.
PCT/IN2002/000159 2002-07-26 2002-07-26 Method for specifying equivalence of language grammars and automatically translating sentences in one language to sentences in another language in a computer environment WO2004012028A2 (en)

Priority Applications (4)

Application Number Priority Date Filing Date Title
AU2002313588A AU2002313588A1 (en) 2002-07-26 2002-07-26 Method for specifying equivalence of language grammars and automatically translating sentences in one language to sentences in another language in a computer environment
US10/522,328 US7529658B2 (en) 2002-07-26 2002-07-26 Method for specifying equivalence of language grammars and automatically translating sentences in one language to sentences in another language in a computer environment
PCT/IN2002/000159 WO2004012028A2 (en) 2002-07-26 2002-07-26 Method for specifying equivalence of language grammars and automatically translating sentences in one language to sentences in another language in a computer environment
EP02753185A EP1554663A4 (en) 2002-07-26 2002-07-26 Method for specifying equivalence of language grammars and automatically translating sentences in one language to sentences in another language in a computer environment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/IN2002/000159 WO2004012028A2 (en) 2002-07-26 2002-07-26 Method for specifying equivalence of language grammars and automatically translating sentences in one language to sentences in another language in a computer environment

Publications (2)

Publication Number Publication Date
WO2004012028A2 true WO2004012028A2 (en) 2004-02-05
WO2004012028A3 WO2004012028A3 (en) 2004-12-23

Family

ID=30776582

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/IN2002/000159 WO2004012028A2 (en) 2002-07-26 2002-07-26 Method for specifying equivalence of language grammars and automatically translating sentences in one language to sentences in another language in a computer environment

Country Status (4)

Country Link
US (1) US7529658B2 (en)
EP (1) EP1554663A4 (en)
AU (1) AU2002313588A1 (en)
WO (1) WO2004012028A2 (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8515733B2 (en) * 2006-10-18 2013-08-20 Calculemus B.V. Method, device, computer program and computer program product for processing linguistic data in accordance with a formalized natural language
US8364463B2 (en) 2009-09-25 2013-01-29 International Business Machines Corporation Optimizing a language/media translation map
CN107229616B (en) 2016-03-25 2020-10-16 阿里巴巴集团控股有限公司 Language identification method, device and system

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4599691A (en) * 1982-05-20 1986-07-08 Kokusai Denshin Denwa Co., Ltd. Tree transformation system in machine translation system
US6278967B1 (en) * 1992-08-31 2001-08-21 Logovista Corporation Automated system for generating natural language translations that are domain-specific, grammar rule-based, and/or based on part-of-speech analysis
US6463404B1 (en) * 1997-08-08 2002-10-08 British Telecommunications Public Limited Company Translation

Family Cites Families (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4984178A (en) * 1989-02-21 1991-01-08 Texas Instruments Incorporated Chart parser for stochastic unification grammar
US5487147A (en) * 1991-09-05 1996-01-23 International Business Machines Corporation Generation of error messages and error recovery for an LL(1) parser
US5317647A (en) * 1992-04-07 1994-05-31 Apple Computer, Inc. Constrained attribute grammars for syntactic pattern recognition
US5642519A (en) * 1994-04-29 1997-06-24 Sun Microsystems, Inc. Speech interpreter with a unified grammer compiler
US5581696A (en) * 1995-05-09 1996-12-03 Parasoft Corporation Method using a computer for automatically instrumenting a computer program for dynamic debugging
US5754860A (en) * 1996-07-23 1998-05-19 Digital Equipment Corporation Method and apparatus for software testing using a differential testing technique to test compilers
US6233545B1 (en) * 1997-05-01 2001-05-15 William E. Datig Universal machine translator of arbitrary languages utilizing epistemic moments
US6016467A (en) * 1997-05-27 2000-01-18 Digital Equipment Corporation Method and apparatus for program development using a grammar-sensitive editor
GB9716887D0 (en) * 1997-08-08 1997-10-15 British Telecomm Translation
US5963742A (en) * 1997-09-08 1999-10-05 Lucent Technologies, Inc. Using speculative parsing to process complex input data
US6223150B1 (en) * 1999-01-29 2001-04-24 Sony Corporation Method and apparatus for parsing in a spoken language translation system
US6999917B1 (en) * 2000-02-22 2006-02-14 Microsoft Corporation Left-corner chart parsing system
US20020138819A1 (en) * 2000-12-19 2002-09-26 Hills Theodore S. Computer programming language to describe and encapsulate a computer as a set of classes and objects
US7257529B2 (en) * 2001-09-10 2007-08-14 Intel Corporation Apparatus and method for an automated grammar file expansion tool
EP1604277A2 (en) * 2003-02-28 2005-12-14 Lockheed Martin Corporation Hardware accelerator personality compiler
US20070043871A1 (en) * 2005-07-19 2007-02-22 Mistletoe Technologies, Inc. Debug non-terminal symbol for parser error handling

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4599691A (en) * 1982-05-20 1986-07-08 Kokusai Denshin Denwa Co., Ltd. Tree transformation system in machine translation system
US6278967B1 (en) * 1992-08-31 2001-08-21 Logovista Corporation Automated system for generating natural language translations that are domain-specific, grammar rule-based, and/or based on part-of-speech analysis
US6463404B1 (en) * 1997-08-08 2002-10-08 British Telecommunications Public Limited Company Translation

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP1554663A2 *

Also Published As

Publication number Publication date
EP1554663A2 (en) 2005-07-20
US7529658B2 (en) 2009-05-05
US20050256699A1 (en) 2005-11-17
AU2002313588A8 (en) 2004-02-16
EP1554663A4 (en) 2009-02-11
WO2004012028A3 (en) 2004-12-23
AU2002313588A1 (en) 2004-02-16

Similar Documents

Publication Publication Date Title
US8515733B2 (en) Method, device, computer program and computer program product for processing linguistic data in accordance with a formalized natural language
US8417512B2 (en) Method, used by computers, for developing an ontology from a text in natural language
CN104899010B (en) The multi-lingual opinion on public affairs method and system of source code
CN102135814A (en) Word input method and system
RU2016137833A (en) System and method for machine translation
US4833611A (en) Machine translation system
JP2016164707A (en) Automatic translation device and translation model learning device
US20050256699A1 (en) Method for specifying equivalence of language grammars and automatically translating sentences in one language to sentences in another language in a computer environment
US20030200535A1 (en) System for program source code conversion
Diwakar et al. Transliteration among indian languages using wx notation
JPH05266069A (en) Two-way machie translation system between chinese and japanese languages
JP2006201873A (en) Device for automatically extracting unregistered word and program, and device for automatically registering unregistered word and program
Tablan et al. A Unicode-based Environment for Creation and Use of Language Resources.
Dolatian et al. A free/open-source morphological transducer for western armenian
WO2009144890A1 (en) Pre-translation rephrasing rule generating system
JP2005149042A (en) Voice input translation system and translation program
Freigang Automation of translation: past, presence, and future
JP2004258759A (en) Text analyzing device, method and program
WO2006051647A1 (en) Text data structure and text data processing method
KR19980036108A (en) Automatic Grammar Correction of Concept-based Multilingual Translation System
KR20220086436A (en) Method of generating vocabulary list for language learing using similar words
KR860000681B1 (en) Hangul/hanja(korean character/chinese character)word processor
JP3892227B2 (en) Machine translation system
KR20010028946A (en) Morphological analysis method and apparatus used in text-to-speech synthesizer
JP2769919B2 (en) Conversion-driven machine translation

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ OM PH PL PT RO RU SD SE SG SI SK SL TJ TM TN TR TT TZ UA UG US UZ VN YU ZA ZM ZW

AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR IE IT LU MC NL PT SE SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
WWE Wipo information: entry into national phase

Ref document number: 10522328

Country of ref document: US

WWE Wipo information: entry into national phase

Ref document number: 2002753185

Country of ref document: EP

WWP Wipo information: published in national office

Ref document number: 2002753185

Country of ref document: EP

NENP Non-entry into the national phase

Ref country code: JP

WWW Wipo information: withdrawn in national office

Country of ref document: JP