File Information
File: 05-lr/acl_arc_1_sum/cleansed_text/xml_by_section/metho/86/c86-1135_metho.xml
Size: 23,955 bytes
Last Modified: 2025-10-06 14:11:54
<?xml version="1.0" standalone="yes"?> <Paper uid="C86-1135"> <Title>Generating Natural Language Text in a Dialog System</Title> <Section position="3" start_page="0" end_page="576" type="metho"> <SectionTitle> 2. Main Components of the Dialog System </SectionTitle> <Paragraph position="0"> The dialog system consists of the following modules: Linguistic Processor, Turns&quot; Interpreter, Turns&quot; Generator, Planner, Dialog Monitor, 5oluar~ In addition to this the dialog system includes several knowledge bases for long-term knowledge: goals&quot; knowledge base, problem domain knowledge base, linguistic knowledge base, dialog knowledge base, partner's knowledge base and selfknowledge base. To store short-term know~edge the system contains a number of models: of activated goals of the system, of the text of preceding dialog turns, of the communicative situation, of the partner, of the system itself.</Paragraph> <Paragraph position="1"> Dialog partners always follow certain goals in their interaction. Yhe goals of the dialog system may be thought of as implicit questions the system is seeking answers to during the dialog. The long-term goals of the system are kept in goals'~ knowledge base where they have attached to them priority assessments. In the course of interaction these goals (or subgoals) may rise or lower.</Paragraph> <Paragraph position="2"> For every new goal the system must set a priority assessment.</Paragraph> <Paragraph position="3"> There can be three types of questions in the dialog system: user questions to the system, the questions of the system to itself, and the questions of the system to its user. Every guestion in its turn may concern either the problem domain or the process of interaction. The central notion of the dialog is a &quot;turn&quot;. In natural dialog both interlocutors generate their turns in certain order and thus we may represent a dialog as a sequence of interchanging turns t;, where t~, t~,L etc. ere the turns of the first ~terlocuto~, b b ~nd t1~ t~, etc. are the turns of the second interlocutor. Every turn may consist-of one or several communicative steps, e.g. the turn refusal may consist of the communicative steps REFUSAL + MOTIVATION, where REFUSAL dominates MOTIVATION.</Paragraph> <Paragraph position="4"> The dialog system functions 8s follows.</Paragraph> <Paragraph position="5"> The Linguistic Processor carries out morphological and syntactic analysis of the input turn with the help of linguistic knowledge base. A later task of the Linguistic Processor is the generation of the surface answer from its semantic representation.</Paragraph> <Paragraph position="6"> The Turns~ Interpreter fulfills several tasks: i) it constructs the semantic representation of the turn with the help of problem domain knowledge base. For the interpretation of the folIowing turns it may be necessary to take into account the preceding turns of the~pa~thers. To this end the Turns&quot; Interpreter simultaneously constructs the semnatic interpretation of the dialog text already 8na~i ? lysed.</Paragraph> <Paragraph position="7"> ii) the Turns&quot; Intenpreter should recognize in a turn the corresponding communicative step(s). For this task it uses the dialog knowledge base. At the same time the Turns&quot; Interpreter forms the model of communicative situation, by supplementing it with typical structures of recognized communicative steps and combining them into bigger units on the basis of recognized turns and turn cycies.</Paragraph> <Paragraph position="8"> iii) it establishes the activated goals of the dialog system during a dialog proceeding from the turn under interpretation. The questions which the user poses to the system and the questions that the system formuIates on the basis of recognized communicative steps with the he~p of &quot;interest rules&quot; are carried into the model of goals and supplied with priority assessments.</Paragraph> <Paragraph position="9"> When the Turns&quot; Interpreter has finished its job the Planner scans the goals in the goaIs knowledge base and the model of activated goa\]s. It a~so tries to find answers to the remaining questions by addressing the Solver when the question concerns the problem domain, or the Dialog Monitor when the problem is about communication, The Turns&quot; Generator selects the type of answer turn on the basis of the set of questions chosen by Planner and the communicati ~ ve steps which will form the prospective turn. For instance, the question may be conveyed as communicative steps ANSWER, EX-</Paragraph> </Section> <Section position="4" start_page="576" end_page="576" type="metho"> <SectionTitle> PRESSION OF DOUBT, etc. The question that </SectionTitle> <Paragraph position="0"> has not yet been answered may be conveyed as communicative steps QUESTIONj REQUEST, OROER, etc. Secondly, the Turns Generator constructs the semantic representation of the future turn end adds it to the model of text of preceding dialog turns. The generation of an answer turn is finished by the Linguistic Processor which transforms semantic representation of a turn into a text.</Paragraph> <Paragraph position="1"> To organize cooperation between the different modules is a very complicated process We share the opinion that it cannot proceed linearly but is rather organized as cooperation between experts permanently exchanging information among themselves (Oim et el., 1984), 3. Knowledge Used in Text Generation 3.1. Dialog knowledge base Dialog knowledge base contains type structures of communicative steps and rules which the dialog system uses in interpreting the replies of its partner and generating its own turns.</Paragraph> <Paragraph position="2"> \[he main structural components of a communicative step are: SETTING - facts describing the situation where the given communicative step takes place: preconditions which hold about the author of that step or, in the author's mind, about the partner as well as about the objective reality PLOT - contents/theme of the given communicative step GOAL - communicative goal of the author of the step CONSEO - hhe outcome of the communicative step~ i.e. the changes in the com-.</Paragraph> <Paragraph position="3"> municatiue situation which take place as a result of that communicative step.</Paragraph> <Paragraph position="4"> For the cooperation with the dialog system to be natural the dialog knowledge base should also contain certain rules of communication which the system should follow when carrying out the dialog. Among them the most important are the principle of cooperation I Grice 1975) and the principle of politeness Leech 1983). In dialog knowledge base these principles ere contained as fixed types of rul es.</Paragraph> <Paragraph position="5"> In the following we exemplify some of ' these rules together with some examples of using them in live dialogs.</Paragraph> <Paragraph position="6"> I. The general form of rules of behavior is as follows:</Paragraph> <Paragraph position="8"> IF interlocutors A and B have a common goal G and A thinks that there exists an obstacle on the way of achieving G THEN A has the right to demand from B the discussion of that obstacle and discovering of the possible ways of or@re coming it These rules, on the one hand, limit the activity of the author of a turn in oon~ tructino his turns and, on the other hand, help the addressee understand these turns by drawing implicatures.</Paragraph> <Paragraph position="9"> Implicetures are inferences drawn if two conditions are met. First, the turn of the partner violates a principle of communication and, secondly, the communicative situation does not contain any clues that it is done intentionally. Therefore the addressee starts making hypotheses, i.e. drawing inferences which help him construct such an in~ terpretation for the input turn which satis~ flee the principle of cooperation. If there are no counterarguments to this hypothesis the addressee supposes this to be the intended meaning of the input turn.</Paragraph> <Paragraph position="10"> Drawing of implicatures in the dialog system proceeds according to special proce~ dures oased on rules of behavior.</Paragraph> <Paragraph position="11"> 2= A special case of rules of behavior are ra metic inference rules: IF ~type of communicative step~</Paragraph> </Section> <Section position="5" start_page="576" end_page="580" type="metho"> <SectionTitle> THEN ~default GOAL~> </SectionTitle> <Paragraph position="0"> Where GOAL&quot; is a goal inferred by default from the GOAL of the author of the turn. For instance, when A asks B how to reach a goal (e.g. How can I get to the railway station?) then his goal may be to achieve that result (i.e. to be st the station).</Paragraph> <Paragraph position="1"> 3. Rules of interest have the form <interest source>~<question/problem> They determine from the type of a communicative step the questions, or &quot;interests&quot;, which the interlocuto~ must find answers to.</Paragraph> <Paragraph position="2"> They typically concern such problems, as = what does the author suppose about the addressee when asking a question or making a proposal - does the claim of the author hold - ere there any obstacles to the plan put forward in a communicative stept etc.</Paragraph> <Paragraph position="3"> As interestsources may function various communicative situations with wide difference in their complexity. The questions they trigger are typically related to the structural parts SETTING and GOAL of the communlcative s~tep.</Paragraph> <Paragraph position="4"> Here are some examples of the rules (Am author, B= addressee): A: REFUSAL ~ B: Why A refused (What is the MOTIVE of REFUSAL)? A: CLAIM P ~ B: Does P hold? 4. Rules of logical inference use data within one communicative step ..... only. We have treated that type of rules in detail in (Oim, 5aluveer~ 1985) and w~ll therefore not discuss them here.</Paragraph> <Paragraph position="5"> 5. Rules of turn ,compilation~ are used in constructing and interpreting a turn which consists of more then one communicative steps. For examplep a turn expressing a refusal may consist of only one communicative step REFUSAL, but more common are such combinations as REFUSAL plus MOTIVE, only MOTIVE, REFUSAL plus ALTERNATIVES, etc.. The rules of turn compilatlon fix the possible combinations of communicative steps and their possible sequence in a turn (the sequence of turns is important because the steps ere not simply linearly ordered but there exist fixed subordlnation relations between the communicative steps within a turn). These rules have the general form type of turn ~ CI~ C2~ ..., C k (k~l),where CI,O.. , C k are types of communicative steps~ 6. To rules of dialo~ coherence belong first and foremost rules which determine from the components SETTING and CONSEQ of a partner's turn the contents of the component SETTING in the other partner's turn.</Paragraph> <Paragraph position="6"> There are several subgroups within this general group: (i) default rules are used in such situations in a dialog where the turn of a partner is &quot;blank&quot;, i.e. when the partner does not answer to a remark. EdegG. t when somebody asks &quot;Don't you belive me?&quot; then a silence from his partner is equal to a negatiue turn (the partner does not belive the author).</Paragraph> <Paragraph position="7"> (ii) rules determining cycles of turns in coherent dialog. It has been pointed out that as a minimal unit in interaction functions not a pair of turns but a triplette.g. The rules of these two groups may be best represented in the form of augmented transition networks where types of communicative steps correspond to nodes and the steps which can follow one another in a dialog are connected with arcs (Me:zing, 1980).</Paragraph> <Paragraph position="8"> 3.2. Linguistic knowledge base This base includes knowledge about morphology= syntax and to a certain degree of semantics of the language.</Paragraph> <Paragraph position="9"> The lexicon stores declarative knowledge of the language in the form of following entries: <primary form> <stem> ~type of stem> <semantic characteristics of word> Morphological rules should guarantee the morphological analysis end synthesis of the words used, i.e. a transition from the word form to its morphological representation (number I case, tense, person) in analysis and the reversed transition in generation. The output of syntactic analysis (and input to syntactic generation) is a tree of dependencies.</Paragraph> <Paragraph position="10"> In order to reduce the number of possible resulting dependency trees we may use instead of purely syntactic rules suntacticosemantic rules which combine syntactic and semantic features of a word: word 1 word 2 IF morphological morphological information I information 2 + semantic semantic characteristics I characteristics 2 THEN word I relatidegn~ word 2 Linguistic knowledge base is used mainly by the Linguistic Processor. During parsing the input to the Linguistic Processor is the user's utterance in natural language, the output is the syntactic representation of the turn in the form of dependency trees. In surface generation the input to the Linguistic Processor is the dependency tree(s) and the output is an answer turn in natural language. null 3.5. Problem domain knowledge base To this base belong definitions of all the objects and relations between them in that problem domain and ale5 the methods of solving the problems the system deals with. The definitions of objects end their relations may be represented in the form of frames, the algorithms of solving problems as procedures with parametres. Some procedures may be fillers of frame slots. This knowledge base is used by both the Turns Generator and Interpreter, as well as by the Planner (when solving problems which have cropped up during the dialog).</Paragraph> <Paragraph position="11"> 4. Answering the User: Text Generation 4.1. Planning the answer In planning its answer the dialog system proceeds from its current activated goals. The Planner choses questions from the model of goals which then underlie the output turn. The choice is made according to the priorities of the questions, which may concern either the problem domain or interaction. Planning the answer turn is carried out simultaneously with interpreting the user's input turn. In case of questions which are connected with the problem domain the Planner makes use of the Solver. The Solver tries to answe~ the questions put to the system by the use~snW~oC/?~y the system itself and marks in the model of goals these questions which it has succeeded in finding an answer to~ In order to answer questions about interaction the Planner turns to the Dialog Monitor. Most questions about interaction belong to the domain &quot;system questions to itself&quot;. Rare exception are ouestions of the type &quot;How dare you speak to me like this?&quot; The dialog system usually does not direct the questions about interaction to its partner except in cases when the partner's turn somehow concerns the dialog system as a &quot;personality&quot; (in man-machine dialog this is yet an unimportant aspect of interaction). To find out such questions the dialog system uses its knowledge about dialog, as well as interest rules and dialog coherence rules and its own and the partner's models. In interpreting a turn the dialog system must also check whether the partner has stuck to aIl rules of communication. In the opposite case a question appers in the column &quot;system questions to the user&quot; which the dialog system may ask about the violation of communicative rules.</Paragraph> <Paragraph position="12"> 4.2. Non-lingulstic synthesis of the answer As a r0~sult of the work of the Planner in the model of goals of the dialog system there ere a number of questions from the system to its user from which the Turns'Generator must construct the semantic representation of the future turn. With the highest priority are questions about the problem domain. The Turns'Generator determines i) the possible types of answer turns enswer~ refusal, request etcdeg ii) the choice among the possible alternatives with the help of rules of behavior iii) the use of rules of turn compilation by deciding which types of communicative steps the turn of the dialog system must consist ofp end filling in concrete information to the chosen typical structures of communicative steps.</Paragraph> <Paragraph position="13"> As a result of all these actions the semantic representation of the future turn Is formed.</Paragraph> <Paragraph position="14"> 4.3. Linguistic synthesis of the answer The generation of surface text from its semantic representation takes place in the Linguistic Processor and can be divided into three stages: transformation of semantic representation into syntactic (semantic synthesis), transformation of syntactic representation Into morphological (syntactic synthesis) and transformation of morphological represen~ ration into the surface text (morphological synthesis).</Paragraph> <Paragraph position="15"> In the process of semantic synthesis it is necessary to ~slice~ the semantic representstion of the future text (text frame in case of TARLUS) into sentence representations~ : i.e. sentence frames. To achieve this the frames which belong to the semantic category of ACTION. must be separated from one en~ other according to their sequence in time.</Paragraph> <Paragraph position="16"> Every action frame is transformed into a dependency tree of a (simple) sentence. A number of slots in the action frame containing irrelevant information from the point of view of the user are disposed of (e.g. slot SUP referring to the generic notion of a category, procedural slots in frames, etc.). The remaining slot fillers serve as labels of the nodes of the dependency tree, while slot ~ames serve as labels for the arcs on the tree. The preliminary order of the nodee wilI be determined by the corresponding verb patterns for that action. A verb pattern will determine the order of verb and its attributes In an isolated sentence but not in actual text. Verb patterns depend upon target language.</Paragraph> <Paragraph position="17"> The text frame is composed of either terminal or conceptual frames. The names of the former are words of the target (i.e. Estonian) language. The names of the latter are names of semantic categories, e.g. ACTION, ANIMAL, TRANSFER, etc. If the dependency tree node is labelled by a semantic category, a word of the target language must be substituted for it depending on the context. E.g. instead of the conceptual frame TRANSFER the system has to choose one of the words from the list of verbs such as ~uy, borrow, rob, make a present, etc,, The proo~-~hoos~ng a correct lexical item for a semantic category node is a categoryoriented pass through a binary tree each node of which presents a discrimination procedure. The tree gradually limits the set of possible candidates until finally there will ~e only one word lefto The choice of a word among nea~ synonyms is a means for achieving a greater coherence of the text (cf. lexemes like steel, pilfer, nab~ purloin, etc. for the semantic notion of stealing). When choosing among these near synonyms the Linguistic Processor should also take into account the model of the partner: the output text shoul not contain words which are unknown to him.</Paragraph> <Paragraph position="18"> This stage can in its turn divided into two steps: first, transformations on dependency trees with the aim of achieving greater coherence of the text and, secondly, suppying the lexemes with morphological information. null To achieve a greater smoothness of the output text it is necessary to perform some modifications on the dependency trees during this phase of generation: i) reordering of nodes The primary order of nodes in a dependency tree is determined by the verb pattern which does not take into account the place of the sentence in the text. Therefore, it will be necessary sometimes to change the order of nodes: the nodes expressing the theme of the sentence will be placed higher and those representing the theme will be placed lower. To accomplish this reordering of nodes,, a mechanism of three stacks is used, The first two stacks contain the labels of the two immediately preceding dependency trees~ In the third stack those labels which have occured in the previous two stacks are also placed lower. Experiments have shown that it is sufficient to take into account the word order of only two immediately preceding sentences. Even more - if the system &quot;remembers&quot; too much from the preceding information, the smoothness of the text may get losto The use of thls, method allows us to get text (2) instead of text (1): (1) John took a book from John's briefcase.</Paragraph> <Paragraph position="19"> John gave Mary the book,~ John left John's briefcase, on the table.</Paragraph> <Paragraph position="20"> (2) John took a book from John's briefcase.</Paragraph> <Paragraph position="21"> The book he gave to Mary.</Paragraph> <Paragraph position="22"> John's briefcase John left on the table.</Paragraph> <Paragraph position="23"> ii) Use of pronouns A pronoun may be substituted for a lexeme corresponding to a node of a dependency tree according to special rules. The application of these rules gives us text (3) instead of text (2): (3) John took a book from his briefcase.</Paragraph> <Paragraph position="24"> The book he gave to Mary.</Paragraph> <Paragraph position="25"> His briefcase John left on the table.</Paragraph> <Paragraph position="26"> iii) Deletion of repeated phrases If there exist similar subtrees in two dependency trees then in the second tree the stem may be substituted for the subtree. The result is text (4)t (4) John took a book from his briefcase.</Paragraph> <Paragraph position="27"> The book he gave to Mary.</Paragraph> <Paragraph position="28"> The briefcase he left on the table.</Paragraph> <Paragraph position="29"> iv) Integration of two or more dependency trees into a coherent graph.</Paragraph> <Paragraph position="30"> One of the rules in this domain states: IF in several immediately following dependency trees one and the same lexeme fulfills the role of agent/patient THEN all these trees may be integrated into one coherent graph by removing from the second tree downward the nodes with identical label, and connecting arcs to the corresponding node of the first tree This rule helps us get text (5) instead of text (1): (5) John took a book from John's briefcasep gave Msry the book and left on the table John's briefcase.</Paragraph> <Paragraph position="31"> The use of these rules in different order results in different, output texts, To ascribe morphological information to lexemes syntactic rules are used which determine from the syntactlco- semantic relations between two words the morphological characteristics of the words., and as a result we get the morphological representation of the text, On the basis of morphological representation with the help of primary forms of words and their morphological characteristics concrete word forms are built. If it is possible to construct several parallel forms as~ for example, are short and long forms of the plural nouns in Estonian, then the choice of one of them is an additional means for achieving fluency of the text.</Paragraph> <Paragraph position="32"> From the above mentioned facts it may be concluded that coherent text generation differs in many respects from single sentence generation, and the regularities governing this process must be taken into account from the very start of the generation process.</Paragraph> </Section> class="xml-element"></Paper>