EP0358702A4 - Creation de texte personnalise. - Google Patents

Creation de texte personnalise.

Info

Publication number
EP0358702A4
EP0358702A4 EP19880904769 EP88904769A EP0358702A4 EP 0358702 A4 EP0358702 A4 EP 0358702A4 EP 19880904769 EP19880904769 EP 19880904769 EP 88904769 A EP88904769 A EP 88904769A EP 0358702 A4 EP0358702 A4 EP 0358702A4
Authority
EP
European Patent Office
Prior art keywords
text
prose
expression
directed
command body
Prior art date
Legal status (The legal status 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 status listed.)
Withdrawn
Application number
EP19880904769
Other languages
German (de)
English (en)
Other versions
EP0358702A1 (fr
Inventor
William A Woods Jr
Terrence M Smith
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Applied Expert Systems Inc
Original Assignee
Applied Expert Systems Inc
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 Applied Expert Systems Inc filed Critical Applied Expert Systems Inc
Publication of EP0358702A1 publication Critical patent/EP0358702A1/fr
Publication of EP0358702A4 publication Critical patent/EP0358702A4/fr
Withdrawn legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F40/00Handling natural language data
    • G06F40/10Text processing
    • G06F40/166Editing, e.g. inserting or deleting
    • G06F40/174Form filling; Merging

Definitions

  • This invention relates generally to expert systems and in particular to methods and apparatus which repeatedly perform a planning, reasoning, computation, or decision activity in many different situations and generate a natural prose text result that is highly customized to the situation, linguistically fluent, and appropriate.
  • Many applications of so-called “expert systems” technology have a need to produce natural prose explanations of their "reasoning.”
  • Such systems merely generate a record of the sequence of rules that were applied in reaching a conclusion, using a prestored natural language description of each rule.
  • such a record of the steps by which a conclusion was reached is not a suitable explanation for the end client.
  • a mechanism is thus required that is capable of generating an explanation that is sensitive to the interests and needs of the end client, that takes into account his or her level of experience and sophistication, and that addresses directly any background explanations necessary to explain terminology, introduce concepts, motivate the conclusions, etc. These are the kinds of issues a good writer takes into account and provides for in a document written for a specific audience.
  • Report generating systems do a better job of producing a readable view of a complex situation, but do so primarily through the creation of tables and graphs that present some portion of a data base or some computations such as totals and subtotals that are derived from the data base. They do not have the capacity to construct natural language descriptions of complex chains of reasoning.
  • Other objects of the invention are a natural language generation process capable of providing a description of conclusions reached from a complex analysis of a situation, and for providing a linguistically fluent prose text directed to a specific user and adapted to a specific situation or context.
  • Another object of the invention is a method and apparatus which provides sufficient flexibility and readability for enabling complex text to be generically created for a variety of complex and specific applications.
  • the invention relates to a method and apparatus for generating prose text and, in particular, text which is specific to a particular application and end user.
  • the method features the steps of inputting a text fragment from a text stream, the text fragment containing at least one (embedded) directed prose expression which can be adjacent one or more fixed prose phrases.
  • the directed prose expression has an expression identifier, an expression operator, and a command body.
  • the method further features parsing the input text fragment for copying each fixed prose phrase and for replacing each directed prose expression, the parsing step featuring recognizing each directed prose expression using the expression identifier, decoding the expression operator for the identified expression, and operating upon the command body in response to the decoded expression operator for generating a prose construction to replace the directed prose expression.
  • the invention is thus directed to a system for producing high quality text that is tailored both to the results of a potentially complex analysis of an individual situation and to a specific intended audience.
  • the method and apparatus of the invention permit a human author to design and specify a schematic text that is conditionalized and parameterized by aspects of a specific situation, and which can produce text that may vary substantially from case to case.
  • Such variability can include specific observations and recommendations to make, as well as decisions about the detailed structure of individual observations and recommendations. For example, in a financial analysis system, the analysis can conclude that there are five assets that a client should reposition, each for a different reason.
  • the author of the output text may want to provide for an introductory statement introducing the general subject of repositioning and initially mentioning the recommendations only at an aggregate level of how many recommendations are being made. At a later point, he would enumerate the individual recommendations and present the motivations for each recommendation.
  • the invention provides such a text author with a set of directed prose expressions that can be incorporated into and between fixed prose text, the effect of which is to construct an appropriate prose text to match the specific situation at the time tne directed prose expressions are executed.
  • the prose expressions can be compiled, similar to a programming language, for constructing highly tailored texts that adapt themselves, according to the operation being performed, to individual situations.
  • the directed prose expressions include operators for iterating over objects from a data base of entities and generating descriptions of them, for inserting elements of "text" from a text library (which may itself contain embedded or directed prose expressions), for constructing elements of text by composition of smaller elements (which again may themselves contain embedded or directed prose expressions), and for inserting elements that are obtained or computed from a data base.
  • the operators also allow the author to construct natural language descriptions of observations and proposed actions and describe the reasons for a conclusion.
  • the operators can further initiate reasoning activities in the data base to draw conclusions that are required for the text but are not yet present in the data base.
  • the operators can also construct elements of text ranging in size from the composition of entire documents to the construction of individual sentences or individual words.
  • a text directed to financial planning may need to adapt to whether a client is married, whether there are children and how many, whether the client is a male or female, what the first names of the children are, and many other details that typically vary from one situation to another.
  • an automated financial planning analysis may have concluded that a client should invest some assets in tax free municipal bonds, and may be required to explain that the client should purchase bonds of municipalities in the state in which he lives in order to avoid state taxes as well as federal taxes.
  • the desired text can read as follows: "I recommend that you invest $10,000 in a stock mutual fund and $10,000 in fixed income asset such as bonds. The stock fund provides an opportunity for appreciation, while the bond fund minimizes the overall risk. I would recommend tax free municipal bonds in your case because they are currently paying 9%, which is the equivalent of a taxable investment paying 18% in your tax bracket (49%). Since you reside in Massachusetts, you should invest in Massachusetts municipal bonds to avoid state taxes as well as federal taxes.”
  • This explanation is constructed, according to the invention, by composing two different recommendation "objects” — one object for a stock fund and the other object for municipal bonds, both in the amount of $10,000.
  • the dollar amounts in this case, might be retrieved from the recommendation objects in the data base, the amounts having been previously determined and stored in the data base.
  • the second sentence is a standard explanation of the motivation for diversifying between stock and fixed income investments and is inserted here because of the presence of a corresponding reasoning step leading to the recommendations. (Absent the "corresponding reasoning step," the second sentence would not appear.)
  • the third sentence is generated by a record of a reasoning step that concluded that tax free municipals are advantageous when their effective after tax return based on the client's marginal tax rate is greater than available returns from taxable investments of comparable risk.
  • the fourth sentence is dictated by a directed prose expression having a conditional operator that is sensitive to the residence of the client and the locations of available municipal bonds.
  • Figure 1 is a schematic block diagram of apparatus for carrying out the method of the invention
  • FIG. 2 is a schematic representation of the operation of an apparatus in accordance with the illustrated embodiment of the invention.
  • FIG. 3 is a detailed flow chart outlining the method of the illustrated embodiment of the invention.
  • a computed text document is generated during the analysis of input data by the expert system, and typically is generated at the end of the analysis.
  • the apparatus has available to it a schematic text fragment 10.
  • This text fragment is read or scanned by a procedure for inputting text fragments to the system over a line 10a to a data processor 10b.
  • fixed prose phrases that is text material which will not be altered (noncommand text material)
  • a display device lOd such as a cathode ray tube or a printer or for storage.
  • Portions of the text fragment which are directed prose expressions are detected and invoke embedded commands.
  • the directed prose expressions are signaled by a distinguishing escape character or expression identifier (" " in the illustrated embodiment), that signals or marks the beginning of the expression.
  • Delimiters are used to separate the command body (any additional parameters or text used by the command) from the remaining text.
  • Directed prose expressions can invoke procedures that return text to be transferred to the output stream, transfer text directly to the output stream, or return further schematic text fragment(s) which themselves are to be scanned for direct prose expressions.
  • the process can be nested, recursively, to arbitrary depths, so that the operation upon a directed prose expression can result in a schematic text fragment, which can itself contain directed prose expressions which can generate schematic text fragments, which contain directed prose expressions that refer to data base records which can contain references to schematic text fragments, and so on.
  • Some expression operators can make reference to entries in a data base (or a knowledge base) of static or dynamic information, which entries may themselves contain references to schematic text fragments containing further directed prose expressions, etc.
  • the analysis process initiates a procedure for generating a text document.
  • the text document is generated from a schematic text fragment 14.
  • the schematic text fragment contains fixed prose phrases in an adjacent relationship with directed prose expressions (represented as small boxes 16).
  • the directed prose expressions invoke computations that can include recursive calls to computed text invocations.
  • the first directed prose expression 16a refers to and accesses a portion 20 of a data base 22 which contains, for example, a reference to a schematic text fragment 24 which invokes another schematic text fragment 26, and which in turn contains an -operator that triggers a computation specified by an executable procedure 28.
  • the text generation procedure 12 when the text generation procedure 12 is invoked, it repeatedly scans the input text file, at 30, looking for the end of the file. If the end is found, the text output terminates, at 32. If the end of the file is not found, the next character is read, at 34, and is checked, at 36, for an expression identifier or escape character that signals, in the illustrated embodiment, a directed prose expression. Each time a directed prose expression is found in the text, the operator is read at 37 and the command body is read at 38. The command expression operator is then looked up at 39 and decoded in a dispatch table 40 to determine the code needed to be executed to evaluate, at 42, the arguments of the command. That code is then executed at 44.
  • the code can use parameters and other schematic text fragments from the input text fragment, leaving the scanning pointer at the end of the body of that directed prose expression so that when execution of the command is completed, scanning can begin at that point for subsequent text to be output and subsequent directed prose expressions. At this point, processing loops back to step 30.
  • a further directed prose expression is not detected in step 36, the character of text of the schematic text fragment is written in the output stream, at 45, and the process loops back to the end-of-file test at 30.
  • the format of a directed prose expression consists of an expression identifier or escape character (the symbol @ in this illustrated embodiment), followed by an expression operator identifier, optionally followed by a command body enclosed in parentheses or brackets.
  • Each expression operator has an associated code definition which knows the format of the command body for the operator and knows how to access and interpret that command body as it is received from the input stream.
  • the set of expression operators is open ended, so that new operators can be defined and added to the system. According to the illustrated embodiment, an initial set of operators includes:
  • A. @obs( ⁇ retrieval key> ⁇ secondary sort attribute>) This operator retrieves each of a set of observations from a data base record of the observations made by a reasoning system and for each such observation accesses an associated schematic text fragment characterizing how to generate a natural language expression of that observation.
  • the "retrieval key” specifies a retrieval index for a specific class of observations to be accessed.
  • the secondary sort attribute if present, is the name of an attribute that each retrieved instance is expected to have, and will be used to sort the observations into a preferred order for presentation to the end user.
  • @obs(TaxSituation Importance) would access all of the observations dealing with a client's tax situation and would generate a text version of each one by accessing schematic text fragments from the data base record of that observation.
  • the resulting observations would be generated and presented in order of importance.
  • each observation record can have a text generation field that will contain the text schema to be used to generate its output description. (In a knowledge based system with inheritance, this field may be inherited from a more general class definition, instead of being stored separately for each observation record.)
  • Each such retrieved text schema will be given to the text generator in an environment in which directed prose expressions will be able to access other fields of that observation record to obtain additional parameters to be used in constructing the observation text.
  • the access path consists of a sequence of attribute or field names beginning from some root in the current context. For example, @get(FirstName ClientSpouse) would get the first name of the client's spouse in a given case.
  • This operator has an "object” in its command body followed by an arbitrary number of condition/value lists that specify different results under different conditions.
  • the object determines a focused element about which different conditions will be tested.
  • Each condition/value list consists of a conditional operator (e.g., equality), some parameters for that conditional operator, and a result to be returned if that conditional operator, applied to the initial object and the associated parameters, is satisfied.
  • the condition/value list (EQ MALE "his") specifies that if the "object" is equal to the flag MALE, then the resulting string will be "his".
  • Formats for condition/value lists can include: (EQ ⁇ reference object> ⁇ result>) (MEMB ⁇ list of reference objects> ⁇ result>) (LIST ⁇ result>) (IF ⁇ condition> ⁇ result>)
  • the first argument to. PICK the "object,” can be a variable name or a form to be evaluated.
  • the remaining arguments, the condition lists, are clauses specifying different values depending on the condition being tested.
  • the first element in each clause specifies the condition being tested; the second element generally specifies what that condition is operating on; and the remaining element (in this case usually a string of characters or another schematic text fragment) is the value to be returned if the condition is true.
  • each condition/value list consists of a conditional operator (EQ, MEMB, LIST, IF, and ELSE), possibly followed by parameters for that operator (all except the LIST and ELSE cases), followed by a result to be used if that operator, applied to the initial focused element and those parameters, is satisfied.
  • the conditions can involve equality of the focused element to the value of an expression (EQ), membership of the focused element in a list (MEMB) , whether the focused object is a list (LIST), and arbitrary computational tests (IF).
  • EQ conditional operator
  • MEMB membership of the focused element in a list
  • LIST whether the focused object is a list
  • IF arbitrary computational tests
  • a register in the apparatus stores a computed text variable which is bound to the focused element (effectively, the "object") of the pick command before the clauses are tested; this register value can be accessed within the case clauses by use of an @pickval() form.
  • the result of a condition/value list can consist of a schematic text fragment which can in turn contain embedded commands. The method can also require computational tests to be effected to determine whether a condition is satisfied.
  • the PICK operator is a very powerful operator that can be used to define more specialized operators to be added to the operator inventory.
  • the identifier is the name of the text fragment to be retrieved, and the "lib" operator results in that fragment of text being scanned by the text generator as if it had occurred in the body of the text being scanned.
  • G. ⁇ plural( ⁇ reference> ⁇ word> ⁇ plural form>) This operator generates the singular or plural form of a word depending on whether the indicated reference is to a single object or a list of objects.
  • the indicated plural form of the word if specified, is to be used for the plural form, while the specified word is used for the singular. If the word is pluralized by simply adding an "s," or if the plural form is known from a dictionary or a regular morphological rule, then the explicit plural form can be omitted from the body of the command.
  • the first argument to the plural operator can return a number (in which case the word will be pluralized if the number is greater than 1), a list (in which case the word will be pluralized if the length of the list is greater than 1), or a predicate value such as "T" (in which case the word will be pluralized depending on whether that value is true or false) .
  • a number in which case the word will be pluralized if the number is greater than 1
  • a list in which case the word will be pluralized if the length of the list is greater than 1
  • a predicate value such as "T”
  • This operator is similar to the plural operator and takes arguments in exactly the same form and produces a possessive form of the word in either the singular or plural as appropriate (e.g., "child's” or “children's”) .
  • This operation provides for iterative generation of text forms.
  • the access form (which can be any computed text) is evaluated. If it returns a list, the text body is scanned in accordance with the invention, once for each element of the iteration list, and all resulting text is inserted into the output stream.
  • a computed text variable in effect operating as a pointer, is bound to the current element of the iteration list before the text body is evaluated. It can be accessed within and, in effect, by the text body for inserting references to the iteration element in the resulting text stream, by use of an operator, @withval(). (This operator accesses the variable of iteration in the most immediate dominating ⁇ with or @join expression. ) J. ⁇ tag( ⁇ tag name> ⁇ tag value form>)
  • This operator provides for generalized variables in computed text. If a tag value form is specified, it is assigned to and can subsequently be retrieved by the tag name. If no tag value form is specified, the variable value of the tag name is retrieved. K. @incase( ⁇ case identifier> ⁇ text body>)
  • This operator generates an inflected form of a verb to match the subject in a sentence (for example, "the planes fly” or "the plane flies”). If the subject access form returns a list with more than one element, then the plural subject verb form is used, otherwise the singular subject verb form is used. N. ⁇ join( ⁇ access form> ⁇ join word> ⁇ clause text body>)
  • This operator is a generalization of ⁇ conj() .
  • the access form is assumed to be a list.
  • the join word is typically either "and” or ,r or.”
  • the clause text body is a text fragment.
  • the clause text body is evaluated once for each element of the list returned by the access form.
  • @withval() can be used inside the clause text body. Note that ⁇ conj (@get( ⁇ some fact>)and) can be written as @join(@get( ⁇ some fact>)and @withval( ) ) .
  • This operator treats text as a dot point. It sets up the correct margins and places a bullet in front of the text.
  • This operator formats the result of an access
  • This operator generates a carriage return or end of line.
  • This operator returns a list of the instances (members) of the indicated class. Examples
  • the ⁇ GET(sex Spouse) is nested within the @PICK form and is used for its contents in the resulting text;
  • @WITHVAL() form allows reference to the current element of iteration within the set being iterated across in the @WITH( ) form. Each time an @WITH is called, any old value of iteration is saved and a new one created local in scope to the current iteration. Depth of Text Produced Recursion How Produced
  • ⁇ OBS(taxObservation) would iteratively produce a text fragment for each observation in the knowledge base that is marked as being a taxObservation.
  • the iteration is implicit in the internal definition of the ⁇ OBS() operator.
  • This invention thus provides a clean and comprehensible interface between the reasoning of a knowledge based system and a system that produces high quality, highly tailored output text characterizing the result of the reasoning.
  • Such reasoning can include observations that result from an analysis of a situation and recommendations that are reached as a result of that analysis. It is a practical compromise between full natural language generation from first principles, on the one hand, and simple "canned" text with direct inclusions from a data base on the other.
  • This invention can be used in a variety of situations where high quality prose text is to be generated from a complex situation described in a data base. For example, it can be used to produce customized versions of maintenance manuals, instruction manuals, legal instruments, operating procedures, etc. Although specific operators and syntactic conventions are described herein, the invention is intended to cover a diversity of different syntactic representations of the same kinds of operations. Further, although the invention is presented here as an interpreter that executes the commands as the text is generated, the schematic text fragments can also be compiled into procedures that more efficiently generate the corresponding text at run time. Although the illustrated embodiment of this invention is in English, the same method can be applied to other languages.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Health & Medical Sciences (AREA)
  • Artificial Intelligence (AREA)
  • Audiology, Speech & Language Pathology (AREA)
  • Computational Linguistics (AREA)
  • General Health & Medical Sciences (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Machine Translation (AREA)
EP19880904769 1987-04-09 1988-04-07 Creation de texte personnalise. Withdrawn EP0358702A4 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US3611187A 1987-04-09 1987-04-09
US36111 1998-03-06

Publications (2)

Publication Number Publication Date
EP0358702A1 EP0358702A1 (fr) 1990-03-21
EP0358702A4 true EP0358702A4 (fr) 1990-04-10

Family

ID=21886676

Family Applications (1)

Application Number Title Priority Date Filing Date
EP19880904769 Withdrawn EP0358702A4 (fr) 1987-04-09 1988-04-07 Creation de texte personnalise.

Country Status (3)

Country Link
EP (1) EP0358702A4 (fr)
AU (1) AU1790788A (fr)
WO (1) WO1988008160A1 (fr)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8103526B1 (en) * 2000-03-07 2012-01-24 Insweb Corporation System and method for flexible insurance rating calculation
US8428934B2 (en) * 2010-01-25 2013-04-23 Holovisions LLC Prose style morphing
US8150676B1 (en) 2008-11-25 2012-04-03 Yseop Sa Methods and apparatus for processing grammatical tags in a template to generate text
US9342507B1 (en) 2008-11-25 2016-05-17 Yseop Sa Methods and apparatus for automatically generating text
US20220414485A1 (en) * 2019-11-26 2022-12-29 Chevron U.S.A. Inc. Requirements decomposition for engineering applications
US11436514B2 (en) 2020-04-01 2022-09-06 Chevron U.S.A. Inc. Designing plans using requirements knowledge graph

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0067290A2 (fr) * 1981-06-16 1982-12-22 International Business Machines Corporation Méthode pour intégrer de l'information structurée et groupée dans un système de traitement de données
WO1986005294A2 (fr) * 1985-03-01 1986-09-12 Vickers Shipbuilding & Eng Traitement de textes electronique

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4400777A (en) * 1978-09-06 1983-08-23 Fuji Photo Film Co., Ltd. Information processing system for a computer output microfilmer
US4452136A (en) * 1979-10-19 1984-06-05 International Business Machines Corporation Printer subsystem with dual cooperating microprocessors
US4454576A (en) * 1981-05-18 1984-06-12 International Business Machines Corporation Report preparation
US4433377A (en) * 1981-06-29 1984-02-21 Eustis Mary S Data processing with format varying
US4649513A (en) * 1983-11-15 1987-03-10 International Business Machines Corporation Apparatus and method for processing system printing data records on a page printer
JPS619753A (ja) * 1984-06-26 1986-01-17 Hitachi Ltd 文書処理装置における頻発熟語の自動登録方法

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0067290A2 (fr) * 1981-06-16 1982-12-22 International Business Machines Corporation Méthode pour intégrer de l'information structurée et groupée dans un système de traitement de données
WO1986005294A2 (fr) * 1985-03-01 1986-09-12 Vickers Shipbuilding & Eng Traitement de textes electronique

Non-Patent Citations (1)

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

Also Published As

Publication number Publication date
WO1988008160A1 (fr) 1988-10-20
AU1790788A (en) 1988-11-04
EP0358702A1 (fr) 1990-03-21

Similar Documents

Publication Publication Date Title
US5418717A (en) Multiple score language processing system
US5887120A (en) Method and apparatus for determining theme for discourse
JP3905179B2 (ja) 文書翻訳装置及び機械読み取り可能媒体
CN114616572A (zh) 跨文档智能写作和处理助手
Winograd Computer software for working with language
Cullingford Natural language processing: A knowledge-engineering approach
EP2081118A2 (fr) Analyse de document, système de commentaire et de rapport
US20070174041A1 (en) Method and system for concept generation and management
Ehsan et al. Grammatical and context‐sensitive error correction using a statistical machine translation framework
Kugler et al. Translator’s workbench: Tools and terminology for translation and text processing
Moldovan et al. An interactive tool for the rapid development of knowledge bases
US20030074345A1 (en) Apparatus for interpreting electronic legal documents
Feinerer A text mining framework in R and its applications
Van Halteren et al. Linguistic Exploitation of Syntactic Databases: The Use of the Nijmegen LDB Program
WO1988008160A1 (fr) Creation de texte personnalise
Šukys Querying ontologies on the base of semantics of business vocabulary and business rules
Rosén et al. The enrichment of lexical resources through incremental parsebanking
Asenbrener Katic et al. Comparison of two versions of formalization method for text expressed knowledge
EP1912164A2 (fr) Système d'amélioration de contenu et procédé et applications correspondantes
Fonseca et al. Representation of structured data of the text genre as a technique for automatic text processing
Zhao et al. A methodology of parsing mathematical notation for mathematical computation
Yarushkina et al. The Method for Improving the Quality of Information Retrieval Based on Linguistic Analysis of Search Query
Paik CHronological information Extraction SyStem (CHESS)
Hadizadeh Moghaddam et al. Language independent optimization of text readability formulas with deep reinforcement learning
Macklovitch Can terminological consistency be validated automatically?

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 19891023

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): BE CH DE FR GB IT LI NL

A4 Supplementary search report drawn up and despatched

Effective date: 19900410

17Q First examination report despatched

Effective date: 19910730

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 19920211