CN112634094A

CN112634094A - Method, apparatus, storage medium, electronic device, and program for generating contract

Info

Publication number: CN112634094A
Application number: CN202011622818.9A
Authority: CN
Inventors: 周子雄
Original assignee: Beijing Jindi Technology Co Ltd
Current assignee: Beijing Jindi Technology Co Ltd
Priority date: 2020-12-30
Filing date: 2020-12-30
Publication date: 2021-04-09
Anticipated expiration: 2040-12-30
Also published as: CN112634094B

Abstract

An embodiment of the present disclosure discloses a method, an apparatus, a storage medium, an electronic device, and a program for generating a contract, wherein the method includes: determining a contract template and a problem combination corresponding to the contract to be generated, and taking the contract template as the current contract; determining a current problem and outputting a page simultaneously containing the current problem and a current contract; determining contract content units corresponding to the response information of the current question and positions related to the contract content units in the contract template according to the response information aiming at the current question input by the user; updating the current contract according to the contract content unit and the position; if the next question associated with the reply information of the current question is determined to exist according to the question combination, taking the next question as the current question, and returning to the step of outputting the page; and if the next question related to the response information of the current question does not exist according to the question combination, taking the current contract as the contract generated for the user.

Description

Method, apparatus, storage medium, electronic device, and program for generating contract

Technical Field

The present disclosure relates to computer technology, and more particularly, to a method for generating a contract, an apparatus for generating a contract, a storage medium, an electronic device, and a computer program.

Background

A contract may refer to a respective compliance article that is contracted by at least two parties for the purpose of determining respective rights and obligations.

Currently, the methods for a user to obtain a contract mainly include the following two methods:

first, a contract is written by a lawyer or other person with relevant knowledge.

And obtaining a corresponding contract in a mode of network downloading and the like.

The first mode often has the problems of low efficiency, high cost and the like. In the second mode, the contract obtained through network downloading and the like is generally regarded as a standard contract, the user requirements which can be covered by the standard contract are often limited, and if the standard contract cannot meet the requirements of the user, the user is required to modify the standard contract by himself, which requires the user to have certain legal professional knowledge.

Disclosure of Invention

The embodiment of the disclosure provides a technical scheme for generating a contract, so that the contract which meets the requirements of a user as far as possible is generated for the user efficiently and conveniently.

In one aspect of the disclosed embodiments, a method for generating a contract is provided, including: determining a contract template and a problem combination corresponding to a contract to be generated according to information which is input by a user and used for selecting the contract type, and taking the contract template as a current contract; determining a current question according to the question combination, and providing a page containing the current question and the current contract to the user; determining a contract content unit corresponding to the response information of the current question and a position associated with the contract content unit in the contract template according to the response information of the current question input by the user; updating the current contract according to the contract content unit and the position; if the next question associated with the reply information of the current question is determined to exist according to the question combination, taking the next question as the current question, and returning to the step of providing the page which simultaneously contains the current question and the current contract for the user; and if it is determined that the next question associated with the reply information of the current question does not exist according to the question combination, acquiring a contract generated for the user according to the current contract, and providing a page containing the contract for the user.

Optionally, in the method of any embodiment of the present disclosure, the updating the current contract according to the contract content unit and the location includes: and adding the contract content unit into the current contract according to the position, and setting the display format information of the contract content unit as preset highlighting format information so as to highlight the contract content unit in the page.

Optionally, in the method of any embodiment of the present disclosure, the updating the current contract according to the contract content unit and the location includes: detecting whether conflict contract content units of the contract content units corresponding to the reply information exist in all contract content units contained in the current contract; and if the conflict contract content unit exists, deleting the conflict contract content unit in the current contract.

Optionally, in the method according to any embodiment of the present disclosure, the deleting conflicting contract content units in the current contract includes: and setting the display format information of the conflict contract content unit as preset deletion mark display format information so as to display the conflict contract content unit in the page in a deletion mark mode.

Optionally, in the method according to any embodiment of the present disclosure, the providing a page containing the contract to the user includes: providing the user with an edit page containing the contract and the content of the contract is editable; the method further comprises the following steps: and updating the contract according to the contract content editing operation executed by the user based on the editing page.

Optionally, in the method of any embodiment of the present disclosure, the problem combination includes: a boot problem node map, the boot problem node map comprising: a plurality of pilot problem nodes each provided with a function for determining a downstream path, the plurality of pilot problem nodes comprising: splitting nodes obtained after node splitting processing is carried out on the guiding problem nodes with the aftereffect; the determining the current question according to the question combination comprises: and taking the guidance question corresponding to the head end node in the guidance question node graph as the current question.

Optionally, in the method according to any embodiment of the present disclosure, the setting manner of the guidance problem node map includes: acquiring a plurality of guide problem node chains for generating a contract to form a node chain set; carrying out node posteffectivity detection on the guide problem nodes contained in the node chain set to obtain guide problem nodes with posteffectivity; carrying out node splitting processing on the guide problem node with the aftereffect; and respectively setting functions for determining downstream paths for a plurality of guidance problem nodes including the guidance problem nodes after node splitting processing, and obtaining a guidance problem node graph for generating a contract.

Optionally, in the method according to any embodiment of the present disclosure, the performing node postefficiency detection on the guidance problem node included in the node chain set to obtain the guidance problem node with postefficiency includes: generating a directed acyclic graph according to all the guidance problem nodes contained in each guidance problem node chain in the node chain set and the jump relation among all the guidance problem nodes; acquiring a node path contained in the directed acyclic graph to obtain a path set; and carrying out node postefficiency detection on the guide problem nodes contained in the node chain set according to the path set to obtain the guide problem nodes with postefficiency.

In yet another aspect of the disclosed embodiments, there is provided an apparatus for generating a contract, the apparatus comprising: the system comprises a determining template and combination module, a problem combination module and a contract template module, wherein the determining template and combination module is used for determining the contract template and the problem combination corresponding to the contract to be generated according to information which is input by a user and used for selecting the contract type, and the contract template is used as the current contract; a current problem determining module for determining a current problem according to the problem combination; the page display module is used for providing a page which simultaneously contains the current question and the current contract for the user; the determining unit and the position module are used for determining a contract content unit corresponding to the response information of the current question and a position associated with the contract content unit in the contract template according to the response information input by the user for the current question; the current contract updating module is used for updating the current contract according to the contract content unit and the position; a contract generation module, configured to, if it is determined that there is a next question associated with the reply information of the current question according to the question combination, take the next question as the current question, and trigger the page presentation module to perform an operation of providing a page including both the current question and the current contract to the user; and if it is determined that the next question associated with the reply information of the current question does not exist according to the question combination, acquiring a contract generated for the user according to the current contract, and providing a page containing the contract for the user.

Optionally, in the apparatus of any embodiment of the present disclosure, the problem combination includes: a boot problem node map, the boot problem node map comprising: a plurality of pilot problem nodes each provided with a function for determining a downstream path, the plurality of pilot problem nodes comprising: splitting nodes obtained after node splitting processing is carried out on the guiding problem nodes with the aftereffect; the determine current problem module is further to: and taking the guidance question corresponding to the head end node in the guidance question node graph as the current question.

Optionally, in the apparatus of any embodiment of the present disclosure, the apparatus further includes: means for setting up the bootstrap problem node map, the means for setting up the bootstrap problem node map comprising: a node chain forming assembly module, configured to acquire a plurality of guide problem node chains used for generating a contract, and form a node chain assembly; the node post-validity detection module is used for carrying out node post-validity detection on the guide problem nodes contained in the node chain set to obtain guide problem nodes with post-validity; the node splitting processing module is used for carrying out node splitting processing on the guide problem node with the aftereffect; and the function setting module is used for respectively setting functions for determining downstream paths for a plurality of guidance problem nodes including the guidance problem nodes after the node splitting processing, and obtaining a guidance problem node graph for generating a contract.

In still another aspect of the disclosed embodiments, there is provided an electronic device including: a memory for storing a computer program; a processor for executing the computer program stored in the memory, and when the computer program is executed, implementing any of the above method embodiments.

In yet another aspect of the embodiments of the present disclosure, a computer-readable storage medium is provided, on which a computer program is stored, which, when executed by a processor, implements any of the above-described method embodiments.

In yet another aspect of the disclosed embodiments, there is provided a computer program comprising: computer readable code which, when run on a device, a processor in the device executes instructions for carrying out the steps of any of the above method embodiments.

Based on the method, the apparatus, the storage medium, the electronic device, and the program for generating a contract provided by the above embodiments of the present disclosure, by determining a problem combination and a contract template by using information for selecting a contract type input by a user, a current problem and a current contract can be obtained by using the problem combination and the contract template, and by providing a page including both the current problem and the current contract to the user, the user can know the content in the current contract at any time, so that the user can timely find the problem in the contract which does not meet the requirement of the contract; the next question related to the response information of the current question is determined by continuously utilizing the question combination, and the current question is continuously updated by utilizing the contract content unit corresponding to the response information, so that the user can generate a contract meeting the requirement of the user as much as possible under the condition of autonomous operation of the user. Therefore, the technical scheme provided by the embodiment of the disclosure is not only beneficial to improving the contract generation efficiency and reducing the cost of contract generation, but also beneficial to enabling the contract generation technology to have usability.

The technical solution of the present disclosure is further described in detail by the accompanying drawings and examples.

Drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments of the disclosure and together with the description, serve to explain the principles of the disclosure.

The present disclosure may be more clearly understood from the following detailed description, taken with reference to the accompanying drawings, in which:

FIG. 1 is a flow diagram of an embodiment of a method for generating a contract of the present disclosure.

FIG. 2 is a flow diagram of an embodiment of a set boot problem node diagram of the present disclosure.

Fig. 3 is a flowchart of an embodiment of implementing node post-validity detection using a directed acyclic graph according to the present disclosure.

FIG. 4 is a schematic diagram of an embodiment of a directed acyclic graph formed by a chain of bootstrap problem nodes of the present disclosure.

Fig. 5 is a flow chart of an embodiment of node invalidity detection according to the present disclosure.

FIG. 6 is a schematic diagram of another embodiment of a directed acyclic graph of the present disclosure.

FIG. 7 is a schematic structural diagram of an embodiment of an apparatus for generating a contract according to the present disclosure.

Fig. 8 is a schematic structural diagram of an embodiment of an application of the electronic device of the present disclosure.

Detailed Description

Various exemplary embodiments of the present disclosure will now be described in detail with reference to the accompanying drawings. It should be noted that: the relative arrangement of the components and steps, the numerical expressions, and numerical values set forth in these embodiments do not limit the scope of the present disclosure unless specifically stated otherwise.

It will be understood by those of skill in the art that the terms "first," "second," and the like in the embodiments of the present disclosure are used merely to distinguish one element from another, and are not intended to imply any particular technical meaning, nor is the necessary logical order between them.

It is also understood that in embodiments of the present disclosure, "a plurality" may refer to two or more and "at least one" may refer to one, two or more.

It is also to be understood that any reference to any component, data, or structure in the embodiments of the disclosure, may be generally understood as one or more, unless explicitly defined otherwise or stated otherwise.

In addition, the term "and/or" in the present disclosure is only one kind of association relationship describing an associated object, and means that three kinds of relationships may exist, for example, a and/or B may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" in the present disclosure generally indicates that the former and latter associated objects are in an "or" relationship.

It should also be understood that the description of the various embodiments of the present disclosure emphasizes the differences between the various embodiments, and the same or similar parts may be referred to each other, so that the descriptions thereof are omitted for brevity.

Meanwhile, it should be understood that the sizes of the respective portions shown in the drawings are not drawn in an actual proportional relationship for the convenience of description.

The following description of at least one exemplary embodiment is merely illustrative in nature and is in no way intended to limit the disclosure, its application, or uses.

Techniques, methods, and apparatus known to those of ordinary skill in the relevant art may not be discussed in detail but are intended to be part of the specification where appropriate.

It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, further discussion thereof is not required in subsequent figures.

The disclosed embodiments may be applied to electronic devices such as terminal devices, computer systems, servers, etc., which are operational with numerous other general purpose or special purpose computing system environments or configurations. Examples of well known terminal devices, computing systems, environments, and/or configurations that may be suitable for use with electronic devices, such as terminal devices, computer systems, servers, and the like, include, but are not limited to: personal computer systems, server computer systems, thin clients, thick clients, hand-held or laptop devices, microprocessor-based systems, set-top boxes, programmable consumer electronics, networked personal computers, minicomputer systems, mainframe computer systems, distributed cloud computing environments that include any of the above, and the like.

Electronic devices such as terminal devices, computer systems, servers, etc. may be described in the general context of computer system-executable instructions, such as program modules, being executed by a computer system. Generally, program modules may include routines, programs, objects, components, logic, data structures, etc. that perform particular tasks or implement particular abstract data types. The computer system/server may be practiced in distributed cloud computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed cloud computing environment, program modules may be located in both local and remote computer system storage media including memory storage devices.

FIG. 1 is a flow diagram of one embodiment of a method for generating a contract of the present disclosure. As shown in fig. 1, the method for generating a contract of this embodiment includes the steps of:

s100, determining a contract template and a problem combination corresponding to the contract to be generated according to information input by a user and used for selecting the contract type, and taking the contract template as the current contract.

Contract types in this disclosure may refer to the kind of contract, for example, contract types may include: short term borrowing contract, universal version buying and selling contract, house leasing type, new house buying and selling type, second-hand house buying and selling type, equity holding contract and labor contract are equivalent. Each contract type is respectively corresponding to a contract template. In one example, a contract type generally corresponds to a contract template. In another example, one contract type can correspond to multiple contract templates. If one contract type corresponds to a plurality of contract templates, the information input by the user for selecting the contract type can be used for determining not only the contract type of the contract to be generated, but also one of all the contract templates corresponding to the contract type.

The present disclosure may provide a page for a user to select a contract type of a contract to be generated, and in one example, a popular contract region and a contract classification region may be provided in the page to facilitate the user to select a corresponding contract type. A plurality of contract types of triggering pieces can be arranged in the hot contract area, and when each triggering piece is triggered, a contract template corresponding to the triggering key is used as a contract template corresponding to a contract to be generated; the contract classification area can comprise a plurality of triggers for representing the classification, and when each trigger for representing the classification is triggered, the triggers of the plurality of contract types corresponding to the trigger are respectively presented to the user.

The contract template in this disclosure is a pre-set known contract template. Each contract template corresponds to the respective contract name, the corresponding contract clause set, the corresponding text description and the like. In addition, each contract template typically has a corresponding contract content arrangement format (e.g., the position of the contract name, the position of the contract clause, and the position of the text description of the contract, etc.). The present disclosure does not limit the contract templates and the concrete manifestations of the contract templates.

The problem combination in the present disclosure generally includes a plurality of problems, and all the problems are associated with each other through the options of the problems, i.e., each option of one problem in the problem combination generally has an association relationship with other problems. In one specific example, a first option for a first question in a combination of questions is associated with a second question, the second option for the first question is associated with a third question, the third option for the first question is associated with a fourth question, and the fourth option for the first question is associated with a fifth question. The problem combinations of the present disclosure may be represented in the form of a tree. The choice of problem corresponding to a leaf node in the tree typically has no problem associated with it.

And S101, determining the current problem according to the problem combination.

The present disclosure may select a problem from the problem combinations as the current problem, that is, the present disclosure takes one problem from the problem combinations as the current problem. For example, the present disclosure may treat the head end problem in the problem combination as the current problem. More specifically, in the case where the problem combination is represented in the form of a tree, the present disclosure may take the problem corresponding to the root node of the tree as the current problem. The current question in this step may be referred to as the initial current question or the first current question.

And S102, providing a page containing the current question and the current contract for the user.

The page in the present disclosure may refer to a page based on HTTP (HyperText Transfer Protocol), or the like. The page may be a page suitable for a computer, mobile phone or tablet.

The current question and the current contract in the present disclosure may be presented in the same page in a manner of being displayed in a partitioned manner, for example, the current question is located in a left area of the page, and the current contract is located in a right area of the page.

S103, according to the response information input by the user for the current question, determining a contract content unit corresponding to the response information of the current question and a position in the contract template associated with the contract content unit.

The response information for the current question input by the user in the present disclosure may be option selection information made by the user for all options of the current question. The response information input by the user in the present disclosure for the current question may also be information (i.e., filling-in information) filled in by the user for the vacant position included in the current question.

In one example, all options for one of the combinations of questions in the present disclosure are typically each associated with a respective contract content unit. The units of contract content associated with different options in one issue of the present disclosure are typically not the same, however, the units of contract content associated with an option in one issue of the present disclosure may be the same as the units of contract content associated with an option in another issue of the present disclosure. For example, a first option of a first question in a combination of questions of the present disclosure is associated with a first contract content unit, a second option of the first question is associated with a second contract content unit, a third option of the first question is associated with a third contract content, a fourth option of the first question is associated with a fourth contract content, and a third option of a second question in the combination of questions is associated with the first contract content unit, that is, the contract content units associated with each of the four options of the first question are not the same, and the contract content units associated with each of the first option of the first question and the third option of the second question are the same.

In another example, the topic part of a question in a question group can correspond to a contract content unit containing a blank part to be filled, and the disclosure can fill the blank information input by the user for the topic part of the question at the position of the blank part of the contract content unit.

The contract content unit in this disclosure can be considered as a constituent unit (also referred to as a constituent part) of the contract, for example, a contract content unit can be a specific term in the laws and regulations, can also supplement a description in the contract, and the like. The present disclosure does not limit the concrete manifestation of the contract content unit.

The location in the contract template associated with the contract content unit in this disclosure can be considered the location of the contract content unit in the contract template. The positions of the contract content units in the contract template in the present disclosure may be preset, for example, the present disclosure may determine the respective positions of the contract content units in the contract template according to a preset contract content arrangement rule.

And S104, updating the current contract according to the contract content unit and the position.

The method can add the contract content units obtained in the above steps to corresponding positions in the current contract according to the positions obtained in the above steps, thereby realizing the update of the current contract.

And S105, if the next question related to the response information of the current question is determined to exist according to the question combination, taking the next question as the current question, and returning to S102.

In the case where the question combinations in the present disclosure are presented in the form of a tree, if the current question is not the end node (i.e., leaf node) of the tree, it can be determined that there is a next question associated with the response information of the current question.

S106, if it is determined that the next question associated with the reply information of the current question does not exist according to the question combination, obtaining a contract generated for the user according to the current contract, and providing a page containing the contract for the user.

In the case where the question combinations in the present disclosure are presented in the form of a tree, if the current question is the end node (i.e., leaf node) of the tree, it can be determined that there is no next question associated with the answer information of the current question. In the case that it is determined that there is no next question associated with the response information of the current question, the present disclosure may use the current contract as the contract generated for the user, or may perform certain post-processing (such as adjustment processing of format and layout) on the current contract, and use the contract obtained by the post-processing as the contract generated for the user. The page provided by the present disclosure to the user, including the contract, may also be an HTTP-based page, and the page may be a page suitable for a computer, a mobile phone, or a tablet. The method and the device support the user to check all the contents of the contract through page turning, cursor moving up, down, left and right, and other operations.

The problem combination and the contract template are determined by utilizing the information for selecting the contract type input by the user, the current problem and the current contract can be obtained by utilizing the problem combination and the contract template, and the user can know the content in the current contract at any time by providing a page which simultaneously contains the current problem and the current contract for the user, so that the user can find the problem which does not meet the requirement in the contract in time; the next question related to the response information of the current question is determined by continuously utilizing the question combination, and the current question is continuously updated by utilizing the contract content unit corresponding to the response information, so that the user can generate a contract meeting the requirement of the user as much as possible under the condition of autonomous operation of the user. Therefore, the technical scheme provided by the embodiment of the disclosure is not only beneficial to improving the contract generation efficiency and reducing the cost of contract generation, but also beneficial to enabling the contract generation technology to have usability.

In an alternative example, the present disclosure may employ different display formats to differentially display content in the current contract while updating the current contract with the contract content units and locations. For example, for a contract content unit, the present disclosure can add the contract content unit at a corresponding position of the current contract according to the position associated with the contract content unit in the contract template, and set the display format information of the contract content unit as the preset highlight format information, so that the contract content unit can be highlighted in the current page.

In one example, the preset highlight format information may include: one or more of underline-based display format information, highlight-based display format information, enlarged font-based display format information, bolded display format information, and display format information based on a predetermined prominent color (e.g., red, etc.).

The method and the device have the advantages that the contract content unit added in the current contract is highlighted and displayed in the page, so that the user can know the content change of the current contract at any time, the user can timely find the problem which does not meet the requirement in the contract, and the efficient provision of the contract which meets the requirement is facilitated for the user.

In an alternative example, the present disclosure should ensure that there is no contradiction between the newly added content to the current contract and the existing content in the current contract before updating, during the updating of the current contract according to the contract content units and the location. Specifically, the present disclosure may detect whether there is a conflicting contract content unit of the contract content unit corresponding to the reply information of the current question in all contract content units included in the current contract before the update, and may delete the conflicting contract content unit in the current contract if the detected result is that there is a conflicting contract content unit. Conflicting contract content units in this disclosure may refer to: if the contract content unit currently required to be added in the current contract and an existing contract content unit in the current contract only exist in the two contract content units, the existing contract content unit in the current contract is a conflict contract content unit of the contract content unit currently required to be added in the current contract. A conflicting contract content unit may also be referred to as a conflicting contract content unit or an opposite contract content unit, etc.

In one example, if a contract content Unit is: the reservation party is allowed to process the reservation article in the manner a, and another contract content unit is: the predetermined party is prohibited from processing the predetermined object in the mode B, and the disclosure may consider the two contract content units as conflicting contract content units if the mode a includes the mode B.

Optionally, the present disclosure may determine, by using the mutual conflict information between the preset contract content units, whether a contract content unit conflicting with the contract content unit currently required to be added in the current contract exists in the current contract. For example, the mutually conflicting information may be set for different terms in the same law and regulation, and for another example, the mutually conflicting information may be set for corresponding terms in different laws and regulations.

In one example, the disclosure may provide a prompt message indicating that there are conflicting terms for the user, and provide the conflicting contract content units to the user together (for example, the conflicting contract content units are all displayed in a flashing manner).

In another example, the present disclosure may directly delete one of the conflicting contract content units without providing the user with the related prompt information. For example, an existing conflicting contract content unit in the current contract before updating is deleted, and for example, a contract content unit newly added in the current contract is deleted. For another example, the disclosure may compare respective levels of two mutually conflicting contract content units, and delete the contract content unit with the lower level in the comparison result. If the corresponding levels of the two conflicting contract content units are the same, the contract content unit needing to be deleted can be determined by the user, and one contract content unit can be deleted based on default settings. The level to which the contract content units correspond can be related to the nature of the law to which the contract content units pertain, e.g., the level of the contract content units pertaining to the nature of local regulations is typically lower than the level of the contract content units pertaining to the nature of the law.

The method and the device have the advantages that the detection of the content of the conflict contract is performed in the process of updating the current contract, so that potential problems in the contract can be eliminated, and the quality of the generated contract can be improved.

In an alternative example, the present disclosure may use a deletion flag for conflicting contract content units to indicate that conflicting contract content units in the current contract are to be deleted. Specifically, the present disclosure may set the display format information of the conflicting contract content unit to the preset deletion marker display format information, so that the conflicting contract content unit is displayed in the page in a form with the deletion marker. As an example, the present disclosure may set the display format information of the conflicting contract content units to be in-word plus single-line display format information or in-word plus double-line display format information, so that while the current contract is displayed, the conflicting contract content units may still exist in the current contract, except that the conflicting contract content units exist in the current contract in a form of in-word plus single-line or in-word plus double-line. In addition, if a conflicting contract content unit includes a sequence number, that sequence number typically does not result in a discontinuity with the sequence numbers of other contract content units that are adjacent.

According to the method and the device, the conflict contract content unit is displayed in the page in a deleting mark mode, so that the user can better know the generation process of the contract and the content change in the contract, and the user experience is improved.

In an alternative example, in the case that the current question is the last question in the question combination and the present disclosure receives the reply information of the user to the current question, the present disclosure may provide the user with a contract editing function while providing the currently generated complete contract, so that the user can edit the currently generated complete contract by himself through the contract editing function.

In one example, the disclosure may provide all the contents of the contract to the user, and the page with editable contract contents, for example, the page provided by the user and containing all the contents of the contract, further contains a contract editing trigger (e.g., a contract editing button), and when receiving the information that the contract editing trigger is triggered by the user, the disclosure provides the user with the page for editing the contract contents, which allows the user to perform operations of deleting the contents in the contract (e.g., deleting words, sentences, or paragraphs, etc.), adding new contents in the contract (e.g., adding words, sentences, or paragraphs, etc.), and adjusting the arrangement format of the contract. The adjusting of the arrangement format of the contract may include: adjusting the top line indentation of the content in the contract, adjusting the font size of the content in the contract, and adjusting the paragraph position of the content in the contract, etc. The present disclosure can update the contract according to the contract content editing operation performed by the user based on the page. For example, after the user performs the operation of deleting the corresponding content in the contract, the operation of adding new content in the contract, and the operation of adjusting the arrangement format, and clicks the edit completion trigger (such as an edit completion submit button) in the page, the present disclosure may perform corresponding adjustment on the content in the contract according to all the edit operations of the user, and provide the edited contract to the user, and the present disclosure may use the edited contract as the contract that is finally generated for the user.

In addition, in the process of editing the contract by the user, the method can detect the contract content units conflicting with the content in the contract in real time, for example, when the user increases the contract content by himself, the contract content units corresponding to the increased contract content can be determined, and the mutual conflict information between the preset contract content units is utilized to judge whether the contract content units conflicting with the increased contract content exist in the contract, so that the phenomenon of improper contract modification by the user can be avoided.

The method and the device have the advantages that the contract editing function is provided for the user, so that the user can adjust the contract content by himself, the flexibility of contract generation is improved, and the contract can meet the user requirements as much as possible.

In one alternative example, the problem combination of the present disclosure may be a bootstrap problem node graph. The boot problem node map includes: a plurality of pilot problem nodes, each provided with a function for determining a downstream path. Each of the bootstrap problem nodes corresponds to a respective bootstrap problem. In addition, the boot problem node map in the present disclosure includes: and splitting the nodes of the guide problem nodes with the aftereffect to obtain split nodes. That is, the boot problem node map in the present disclosure may be considered as: at least part of the pilot problem nodes with aftereffects are removed and each pilot problem node is provided with a directed acyclic graph of functions for determining downstream paths. The setup process of the bootstrap node map in the present disclosure may be referred to the following description for fig. 2.

Optionally, when the problem combination determined in S100 of the present disclosure is a guidance problem node map, the guidance problem node map may be an independent and complete guidance problem node map, or may be a part of a whole guidance problem node map, that is, an area map in the whole guidance problem node map. In the case that the problem combination node map determined in S100 is an area in the entire guide problem node map, the present disclosure may perform corresponding calculation on the received information for selecting the contract type, determine a guide problem node in the entire guide problem node map according to the calculation result, take the guide problem node as a root node, and determine all paths formed by taking the root node as a path start node as the problem combination determined in S100.

In fig. 2, S200, a plurality of leading problem node chains for generating a contract are acquired to form a node chain set.

A chain of bootstrap problem nodes in the present disclosure may refer to a logical link formed by a plurality of bootstrap problem nodes and a jump relationship between the bootstrap problem nodes. That is, the leading problem node chain in the present disclosure includes two basic elements, respectively: and each problem guiding node corresponds to a respective question.

In one example, a topic includes a stem and a plurality of options. The jumping relationship between the leading problem nodes is usually determined by the options of the topics corresponding to the leading problem nodes. For example, the topic corresponding to a guidance problem node includes n (n is an integer greater than 1) options, and each of the n options leads to a different next topic (i.e., a next guidance problem node), so as to form a jump relationship between an upstream guidance problem node and a downstream guidance problem node.

Each of the guidance issue nodes in the present disclosure may each have a unique identifier (e.g., a node identifier, etc.), and different guidance issue nodes have different identifiers. In a general case, before the node splitting process, the respective topics corresponding to different guidance problem nodes in the node chain set are different. Of course, this disclosure does not exclude the phenomenon that the topics corresponding to two different guidance problem nodes in the node chain set are the same, however, the two different guidance problem nodes corresponding to the same topic should have different identifications.

One chain of leading problem nodes in the present disclosure is typically a link without a branch, for example, one chain of leading problem nodes is: the leading problem node 1 is a head node (also referred to as a start node) of a leading problem node chain, the downstream node of the leading problem node 1 is a leading problem node 2, the downstream node of the leading problem node 2 is a leading problem node 3, the downstream node of the leading problem node 3 is a leading problem node 4, and the leading problem node 4 is an end node of the leading problem node chain. Of course, the present disclosure does not exclude a case where a leading problem node chain is a link with branches, for example, the leading problem node 1 is a head node of a leading problem node chain, a downstream node of the leading problem node 1 is a leading problem node 2, a downstream node of the leading problem node 2 is a leading problem node 3, a downstream node of the leading problem node 3 is a leading problem node 4 and a leading problem node 5, and both the leading problem node 4 and the leading problem node 5 are end nodes of the leading problem node chain.

In one example, all leading problem node chains in a node chain set in the present disclosure typically have the same head-end node. That is, if a tree is formed using all of the leading problem node chains in the node chain set, the head nodes of all of the leading problem node chains in the node chain set are the root nodes of the tree. Of course, this disclosure does not exclude the phenomenon that all of the leading problem node chains in the node chain set have different head nodes, so that when a tree is formed using all of the leading problem node chains in the node chain set, one tree may be formed, or a plurality of trees may be formed.

The method and the device can acquire the plurality of guide problem node chains by receiving externally input guide problem node chain information or reading storage information at a preset position. The plurality of leading problem node chains are typically preset according to the specific requirements of at least one type of contract. For example, there are multiple possibilities for the leading problem node and the jump relationship between the nodes involved in one type of contract, and the present disclosure may set a leading problem node chain for each possibility in advance. Similarly, there are many possibilities for the guiding problem nodes and the jump relations between the nodes involved in the various types of contracts, and the disclosure may set a guiding problem node chain for each possibility in advance.

S201, carrying out node postefficiency detection on the guide problem nodes contained in the node chain set to obtain the guide problem nodes with postefficiency.

Node aftereffect in this disclosure may refer to: for any guidance problem node in the node chain set, if the guidance problem node is taken as the current guidance problem node, the leading path of the current guidance problem node needs to be considered when determining the downstream node of the current guidance problem node. The lead path of the current lead problem node may refer to the path from the head-end node of the lead problem node chain to the current lead problem node.

The method and the device can perform node postefficiency detection on all guidance problem nodes in the node chain set, and can also perform node postefficiency detection on part of guidance problem nodes in the node chain set. For example, the present disclosure may perform node post-validity detection on other guidance problem nodes except for a specific node in all guidance problem node chains in a node chain set, where the specific node may include: a head node and an end node leading a chain of problem nodes, etc.

For any guidance problem node in the node chain set, the present disclosure may determine whether the guidance problem node is a guidance problem node with residual or a guidance problem node without residual (i.e., a guidance problem node without residual) by performing node residual detection on the guidance problem node. The method and the device can perform node postefficiency detection on the guidance problem nodes in the node chain set based on the logical relationship between the formed guidance problem nodes and the respective upstream node and downstream node of each guidance problem node in all the guidance problem node chains in the node chain set, so as to obtain the guidance problem nodes with postefficiency. The present disclosure does not limit the specific implementation of node late detection.

And S202, carrying out node splitting processing on the guide problem nodes with aftereffect.

The node splitting process in the present disclosure may refer to splitting one boot problem node into two different boot problem nodes. For example, a guidance problem node having a residual is retained, and a new guidance problem node is set based on the guidance problem node having the residual, thereby obtaining two guidance problem nodes. For another example, a guidance problem node having a residual is not retained, and two new guidance problem nodes are set based on the guidance problem node having a residual, thereby obtaining two guidance problem nodes.

The two guidance problem nodes obtained by splitting one guidance problem node have the same topic and the same option, but the two guidance problem nodes obtained by splitting should have different identifications (for example, different node identifications), and all downstream nodes of the two guidance problem nodes obtained by splitting are not the same, for example, the next guidance problem node led by the same option of the topic corresponding to the two different guidance problem nodes is not the same. This means that the functions for determining the downstream path corresponding to the two split boot problem nodes should not be the same, and the arguments of the functions should not be the same.

The node splitting process in the present disclosure may change the corresponding boot problem chain in the node chain set, for example, a boot problem node with aftereffect in a boot problem chain in the node chain set is replaced by a new boot problem node obtained by splitting, and the like.

S203, setting functions for determining downstream paths for a plurality of guidance problem nodes including the guidance problem nodes after node splitting processing, and obtaining a guidance problem node graph for generating a contract.

In one example, in the case that the node chain set is updated by the split new guidance problem node, the plurality of guidance problem nodes including the guidance problem node after the node splitting process in the present disclosure may include: all the boot problem nodes in all the boot problem node chains in the updated node chain set.

For any guidance problem node in the guidance problem node map, the function set by the present disclosure for determining the downstream path for the guidance problem node may refer to: the function of all downstream nodes of the lead problem node can be represented. The leading problem node graph in this disclosure may appear as a directed acyclic graph provided with functions for determining downstream paths.

The method and the device have the advantages that the guide problem nodes with the aftereffect are obtained by utilizing the node aftereffect detection, and at least part of the guide problem nodes with the aftereffect in the node chain set can be eliminated by carrying out node splitting processing on the guide problem nodes with the aftereffect; since the complexity of setting the function for determining the downstream path for the non-consequent pilot problem node is much less than the complexity of setting the function for determining the downstream path for the consequent pilot problem node, the present disclosure can conveniently set the function for determining the downstream path for the pilot problem node. Therefore, the technical scheme provided by the embodiment of the disclosure is beneficial to reducing the maintenance difficulty of the guide problem node map for generating the contract, thereby being beneficial to improving the maintenance efficiency of the guide problem node map for generating the contract, and further, when the contract is generated for the user by using the guide problem node map, because the complexity of the function for determining the downstream path of each guide problem node in the guide problem node map is low, the contract generation efficiency is beneficial to being improved, and the contract generation technology is easy to use.

In an alternative example, all the leading problem node chains included in the node chain set in the present disclosure correspond to the same contract template, and one contract template generally corresponds to one type of contract, for example, a contract of a house lease type corresponds to one contract template, a contract of a new house buy and sell type corresponds to another contract template, and a contract of a second house buy and sell type corresponds to another contract template. That is, the plurality of guidance problem node chains acquired in S200 of the present disclosure all correspond to the same contract template, and the contract template is matched with each guidance problem node chain in the node chain set, and can generate contracts of the same type for the user. That is, the present disclosure may set one guidance problem node map for one contract template, with different contract templates corresponding to different guidance problem node maps.

In another alternative example, all of the leading problem node chains contained in a node chain set in the present disclosure correspond to at least two contract templates, and different contract templates typically correspond to different types of contracts. That is, the plurality of guidance problem node chains acquired in S200 of the present disclosure correspond to a plurality of contract templates, each contract template corresponds to a part of the guidance problem node chains in the node chain set, and each contract template is matched with each guidance problem node chain corresponding to each contract template, so that contracts of the same type can be generated for the user. Contracts generated based on different contract templates are typically different types of contracts. In one example, a set of node chains of the present disclosure includes: the system comprises m guide problem node chains, wherein the 1 st to the m1 th guide problem node chains correspond to contract templates of house rent types, the m1+1 to the m2 th guide problem node chains correspond to contract templates of new house buying and selling types, the m2+1 to the m3 th guide problem node chains correspond to contract templates of second house buying and selling types, m1, m2 and m3 are integers which are larger than or equal to 1, m is the sum of m1, m2 and m3, m2 is larger than m1, and m3 is larger than m 2. That is, the present disclosure may set one guidance problem node map for a plurality of contract templates, and different contract templates correspond to different areas in the same guidance problem node map.

Under the condition that all the guide problem node chains contained in the node chain set correspond to the same contract template, the guide problem node graph obtained by the method is more targeted, so that the influence on the process of generating the contract based on other contract templates is avoided in the process of performing maintenance operations such as adding and deleting nodes, modifying jump relations among the nodes and the like on the guide problem node graph, and the coverage range of the maintenance operations is limited.

Under the condition that all the guide problem node chains contained in the node chain set correspond to at least two contract templates, the guide problem node graph obtained by the method is comprehensive, and different types of contracts may relate to the same guide problem node, so that the method is favorable for saving storage resources consumed by the guide problem node graph.

In one optional example, the present disclosure may utilize a directed acyclic graph to implement post-nodal efficiency detection. One example of the present disclosure for utilizing a directed acyclic graph to implement node post-validation is shown in FIG. 3.

S300, generating a directed acyclic graph according to all the guidance problem nodes contained in each guidance problem node chain in the node chain set and the jump relation among all the guidance problem nodes.

Alternatively, a directed acyclic graph in this disclosure may refer to a loop-free directed graph. All the guiding problem nodes contained in all the guiding problem node chains in the node chain set are all the nodes in the directed acyclic graph, and the jump relation among all the guiding problem nodes in all the guiding problem node chains in the node chain set is the jump relation among all the nodes in the directed acyclic graph.

Alternatively, in the case where all the leading problem node chains in the node chain set in the present disclosure have the same head-end node, the directed acyclic graph generated by the present disclosure may be considered as: a tree with the head nodes of all the leading problem node chains as root nodes.

Alternatively, the present disclosure may form a directed acyclic graph by merging the same bootstrap problem node in all bootstrap problem node chains in a node chain set into one node in the graph. In one example, it is assumed that the node chain set includes 4 leading problem node chains, and the 4 leading problem node chains involve 6 leading problem nodes, which are respectively node 1, node 2, node 3, node 4, node 5, and node 6, and the 4 leading problem node chains are respectively:

node 4- - > node 3- - > node 2;

node 4- - > node 3- - > node 6- - > node 1- - > node 2;

node 4- - > node 6- - > node 1- - > node 2;

node 4- - > node 6- - > node 5;

an example of a directed acyclic graph formed by the 4 leading problem node chains is shown in fig. 4. The head-end node of the directed acyclic graph in fig. 4 is node 4, and both node 2 and node 5 are end nodes of the directed acyclic graph. The directed acyclic graph shown in fig. 4 can be considered as a tree with node 4 as the root node and

nodes

2 and 5 as the leaf nodes of the tree.

S301, obtaining the node paths contained in the directed acyclic graph to obtain a path set.

Optionally, the path set in the present disclosure may include: all the node paths contained in the directed acyclic graph. The method and the device for obtaining the node paths in the directed acyclic graph can obtain all node paths contained in the directed acyclic graph in a path traversal mode. In one example, the present disclosure may employ a depth-first path traversal algorithm to perform path traversal on the directed acyclic graph, thereby obtaining all node paths included in the directed acyclic graph.

Optionally, each node path included in the path set may be regarded as a node chain, and the number of node paths included in the path set is usually greater than the number of guidance problem node chains included in the node chain set. In one example, a portion of the node paths in the path set are the same as all of the leading problem node chains in the node chain set, and another portion of the node paths in the path set are absent from the node chain set.

For the previous example, for fig. 4, all node paths included in the path set obtained by the path traversal in the present disclosure are as follows:

node 4- - > node 3- - > node 2;

node 4- - > node 3- - > node 6- - > node 1- - > node 2;

node 4- - > node 3- - > node 6- - > node 5;

node 4- - > node 6- - > node 1- - > node 2;

node 4- - > node 6- - > node 5;

as can be seen from the above description, a node chain set includes 4 problem-guiding node chains, a path set includes 5 node paths, 4 node paths in the path set are completely the same as 4 problem-guiding node chains included in the node chain set, and a node path in the path set is a node path that is not included in the node chain set, where the node path is a node 4- > node 3- > node 6- > node 5.

And S302, carrying out node postefficiency detection on the guidance problem nodes contained in the node chain set according to the path set to obtain the guidance problem nodes with postefficiency.

Optionally, the present disclosure may perform node residual performance detection on at least part of the guidance problem nodes (for example, all guidance problem nodes) in the node chain set respectively based on all node paths included in the directed acyclic graph and the guidance problem node chains in the node chain set, so as to determine whether at least part of the guidance problem nodes have residual performance. In the case of node postefficiency detection on all guidance problem nodes, the present disclosure can distinguish all guidance problem nodes with postefficiency from all guidance problem nodes without postefficiency (i.e., all non-postefficiency guidance problem nodes) in a node chain set.

In one example, for any guidance problem node in a node chain set, the present disclosure may determine whether the guidance problem node has aftereffect according to a downstream node condition of the guidance problem node in all node paths of the path set and a downstream node condition of the guidance problem node in at least part of a guidance problem node chain of the node chain set. For example, a leading problem node may be considered to have a residual if the leading problem node has more downstream nodes in all node paths of the path set than the leading problem node has in at least part of the leading problem node chain of the node chain set, otherwise the leading problem node is considered to have no residual.

For the previous example, for the node 4 in fig. 4, since the downstream node condition of the node 4 in all the node paths of the path set is: node 3 and node 6, and node 4 directs the downstream node instances in the problem node chain in one of the set of node chains: node 3 and node 6, and therefore, node 4 can be determined to be an invalid node.

For the previous example, for node 6 in fig. 4, since the downstream node condition of node 6 in all node paths of the path set is: node 1 and node 5, and node 6 directs the downstream node instances in the problem node chain in one of the set of node chains: node 5, therefore, can determine that node 6 is a bootstrap problem node with aftereffect.

Since the nodes in the path set are not constrained by the function for determining the downstream path, the node path included in the path set can clearly and definitely represent all the downstream nodes of each node. If all downstream nodes of a guidance problem node in the path set are different from all downstream nodes of the guidance problem node in the corresponding guidance problem node chain in the node chain set, it can be stated that the post path from the guidance problem node to the downstream node thereof has correlation with the pre path of the guidance problem node, and therefore, the present disclosure can consider the guidance problem node as a guidance problem node with posteffects. According to the method and the device, the node postefficiency detection is realized by utilizing the path set obtained by traversing the node paths of the directed acyclic graph, and the node postefficiency detection is easy to implement.

In an optional example, when performing node post-validity detection on a guidance problem node, whether the guidance problem node is a guidance problem node with post-validity can be determined by using a downstream node condition of the guidance problem node in a path set and a downstream node condition of the guidance problem node in a node chain set. That is, the present disclosure may determine, by using the downstream node of the guidance problem node in the node chain set, whether there is an invalid downstream node in the downstream node of the guidance problem node in the path set, and if there is an invalid downstream node, it indicates that the guidance problem node is a guidance problem node with aftereffect. The downstream node of the bootstrap problem node in the node chain set may refer to a bootstrap problem node chain having the same end node in the node chain set. The present disclosure may use an end node in a node chain set as a unit to divide all the guidance problem node chains in the node chain set into a plurality of subsets, where all the guidance problem node chains in each subset have the same end node, and different subsets correspond to different end nodes.

In one example, the present disclosure may perform node-consequent detection in units of subsets, for example, for any subset, the present disclosure may sequentially perform node-consequent detection on part of the guidance problem nodes (e.g., guidance problem nodes excluding the head node and the end node) or all of the guidance problem nodes included in all of the guidance problem node chains in the subset by using all of the node paths in the path set, starting from the head node of the subset, based on a breadth-first search, and obtain guidance problem nodes with consequent in the subset.

Because there is a duplication phenomenon in the guidance problem nodes included in the guidance problem node chains in different subsets, any guidance problem node in the node chain set may be subjected to multiple node post-validity detections, for example, the first subset and the second subset both include a first guidance problem node, a second guidance problem node, and a third guidance problem node, and then in the process of performing node post-validity detection on the first subset, whether the first guidance problem node, the second guidance problem node, and the third guidance problem node have post-validity may be detected respectively, and in the process of performing node post-validity detection on the second subset, whether the first guidance problem node, the second guidance problem node, and the third guidance problem node have post-validity may still be detected respectively. In other words, if a lead problem node should appear in two different subsets, the lead problem node can be considered to appear in the two different subsets in the form of two different nodes. For example, in the form of a replica of the bootstrap problem node and another replica of the bootstrap problem node, in two different subsets. If a pilot problem node is determined to be a pilot problem node with aftereffect in the node aftereffect detection process of one subset, the disclosure will treat the pilot problem node as a pilot problem node with aftereffect regardless of whether the pilot problem node is determined to be a pilot problem node without aftereffect in the node aftereffect detection processes of other subsets.

For the previous example, for fig. 4, since the end node in the node chain set includes: node 2 and node 5, therefore, the present disclosure may divide the bootstrap problem node chain in the node chain set into two subsets, where the first subset includes: node 4, node 3, node 6, node 1, node 2, node 4, node 6, node 1, node 2; wherein the second subset comprises: node 4- - > node 6- - > node 5.

For the first subset, the order of node post-validity detection for each guidance problem node based on the breadth-first search mode in the present disclosure may be: node 4, (node 3 and node 6), (node 2, node 5 and node 1), wherein the order of the nodes in parentheses can be changed arbitrarily.

For the second subset, the order of node post-validity detection for each guidance problem node may be, based on the breadth-first search manner in the present disclosure: node 4, node 6, node 5.

Optionally, in the process of performing node post-validity detection on the guidance problem node in the subset, if one of the guidance problem nodes is determined to be the guidance problem node with post-validity, the node splitting processing needs to be performed on the guidance problem node, and therefore, the node post-validity detection may not be performed on each downstream node of the guidance problem node in the subset.

According to the method, the guide problem node chains in the node chain set are divided by the end nodes to form a plurality of subsets, and based on a breadth-first search mode, the guide problem nodes in each subset are sequentially subjected to postefficiency detection, so that the node postefficiency detection is easy to implement, the accuracy of the node postefficiency detection is ensured, and the efficiency of the postefficiency detection is improved.

In an alternative example, the flow of one embodiment of node invalidity detection provided by the present disclosure may be as shown in fig. 5.

S500, for an end node, obtaining a difference between a path set and each problem node chain based on the end node in a node chain set.

Optionally, the present disclosure may remove each guidance problem node chain based on the end node in the node chain set from the path set, for example, subtract all node paths included in the path set from all guidance problem node chains based on the end node in the node chain set, so as to obtain a difference between the path set and each guidance problem node chain based on the end node in the node chain set.

For the previous example, for node 2 in fig. 4, each problem-guiding node chain based on node 2 in the node chain set includes: node 4, node 3, node 6, node 1, node 2, node 4, node 6, node 1, node 2; and the node paths included in the path set include: node 4- - > node 3- - > node 2, node 4- - > node 3- - > node 6- - > node 1- - > node 2, node 4- - > node 3- - > node 6- - > node 5, node 4- - > node 6- - > node 1- - > node 2 and node 4- - > node 6- - > node 5; the difference between the path set and each leading problem node chain based on the end node 2 in the node chain set is: node 4- > node 3- > node 6- > node 5 and 4- > node 6- > node 5.

For the previous example, for the node 5 in fig. 4, each problem-guiding node chain based on the node 5 in the node chain set includes: node 4- - > node 6- - > node 5; the node paths included in the path set include: node 4- - > node 3- - > node 2, node 4- - > node 3- - > node 6- - > node 1- - > node 2, node 4- - > node 3- - > node 6- - > node 5, node 4- - > node 6- - > node 1- - > node 2 and node 4- - > node 6- - > node 5; the difference between the path set and each leading problem node chain based on the end node 5 in the node chain set is: node 4- - > node 3- - > node 2, node 4- - > node 3- - > node 6- - > node 1- - > node 2, node 4- - > node 3- - > node 6- - > node 5 and node 4- - > node 6- - > node 1- - > node 2.

S501, based on a breadth-first search mode, taking a guidance problem node in each guidance problem node chain based on the tail end node in a node chain set as a node to be detected.

Optionally, the present disclosure may form a tree by using each leading problem node chain based on the end node in the node chain set, then, first, a root node (e.g., node 4 in fig. 4) of the tree may be used as a node to be detected, and then, all downstream nodes (e.g.,

nodes

6 and 3 in fig. 3) of the root node of the tree are sequentially used as nodes to be detected according to a certain order, and so on until the end node (e.g., node 5 or node 2) of the tree is used as a node to be detected. In one example, the present disclosure may not perform node post-validity detection on the root node and the end node of the tree, that is, it may not be necessary to use the following node and the end node of the tree as the nodes to be detected.

S502, a first downstream node set of the node to be detected in the difference is obtained, and a second downstream node set of the node to be detected in each guide problem node chain based on the tail end node is obtained.

In the previous example, in the case that the end node is node 2 in fig. 4, the difference between the path set and each leading problem node chain based on end node 2 in the node chain set includes:

node 4- - > node 3- - > node 6- - > node 5; and

node 4- - > node 6- - > node 5;

each problem-guiding node chain in the node chain set, which takes the node 2 as an end node, comprises:

node 4- - > node 3- - > node 2;

node 4- - > node 3- - > node 6- - > node 1- - > node 2; and

node 4- - > node 6- - > node 1- - > node 2;

in the above case, if the node to be detected is node 4, the first downstream node set includes: node 3 and node 6, and the second set of downstream nodes comprises: node 3 and node 6; if the node to be detected is node 3, the first downstream node set comprises: node 6, the second set of downstream nodes comprising: node 2 and node 6; if the node to be detected is node 6, the first downstream node set comprises: node 5, the second set of downstream nodes comprising: a node 1; if the node to be detected is node 1, the first downstream node set is empty, and the second downstream node set comprises: and (4) a node 2.

In the previous example, in the case that the end node is the node 5 in fig. 4, the difference between the path set and each leading problem node chain based on the end node 5 in the node chain set includes:

node 4- - > node 3- - > node 2;

node 4- - > node 3- - > node 6- - > node 1- - > node 2;

node 4- - > node 3- - > node 6- - > node 5; and

node 4- - > node 6- - > node 1- - > node 2;

assume that each leading problem node chain based on node 5 in a node chain set includes:

node 4- - > node 6- - > node 5;

in the above case, if the node to be detected is node 4, the first downstream node set includes: node 3 and node 6, the second set of downstream nodes comprising: a node 6; if the node to be detected is node 6, the first downstream node set comprises: node 1 and node 5, the second downstream set comprising: and a node 5.

S503, when the first downstream node set is determined not to belong to the second downstream node set, the node to be detected is used as a guide problem node with aftereffect.

In the previous example, in the present disclosure, node post-validity detection is not performed on the root node, and in the case that the end node is the node 2 in fig. 4, when the node to be detected is the node 6, the first downstream node set includes: node 5, and the second set of downstream nodes comprises: a node 1; thus, the present disclosure may treat node 6 as a guided problem node with aftereffect.

In the previous example, in the present disclosure, node post-validity detection is not performed on the root node, and in the case that the end node is the node 2 in fig. 4, when the node to be detected is the node 6, the first downstream node set includes: node 1 and node 5, and the second downstream set includes: a node 5; thus, the present disclosure may treat node 6 as a guided problem node with aftereffect.

According to the method, the difference of the guide problem node chain based on the tail end node in the path set and the node chain set is obtained, the difference and the guide problem node chain based on the tail end node in the node chain set can be conveniently utilized, the first downstream node set and the second downstream node set are obtained, therefore, the guide problem node with the aftereffect can be conveniently determined by comparing the first downstream node set with the second downstream node set, and the node aftereffect detection can be efficiently and accurately achieved.

In one optional example, the present disclosure may separately form a split node for each guiding problem node with a residual, and update the guiding problem node with the residual in the corresponding guiding problem chain in the node chain set as the split node. The corresponding guide problem chain here may refer to a part of all guide problem chains in the node chain set, which contain guide problem nodes with aftereffects.

For example, since it is detected that the node 6 is a guidance problem node with a residual effect, the present disclosure may form a node 6 ' for the node 6, and replace the node 6 in the guidance problem node chain of the node 4- > the node 6- > the node 5 with the node 6 ', so as to form the node 4- > the node 6 ' - > the node 5.

According to the method, the splitting node of the guide problem node with the aftereffect is formed, the splitting node is used for replacing the guide problem node with the aftereffect in the corresponding guide problem chain in the node chain set, the problem that the guide problem chain of the node chain set has the guide problem node with the aftereffect is solved, and therefore the guide problem node graph can be conveniently formed by setting functions for determining downstream paths for all the guide problem nodes in the updated node chain set.

In one optional example, the process of the present disclosure setting a function for determining a downstream path for a bootstrap problem node (including a split node) may be: for any guidance problem node in the node chain set, taking each option of a topic corresponding to the guidance problem node as an independent variable, taking all downstream nodes of the guidance problem node as dependent variables, and setting a function for determining a downstream path for the guidance problem node.

In one example, the function for determining the downstream path in the present disclosure may be represented in the form of y ═ f (x), where for any pilot problem node, x represents information of the pilot problem node without needing to represent a set of all pre-paths of the pilot problem node, and y represents a set of possible post-nodes of the pilot problem node calculated from the pilot problem node without needing to represent a set of possible post-nodes of the pilot problem node calculated from a set of all pre-paths of the pilot problem node. The front node is a path from the root node of the guide problem node graph to the guide problem node, and the back node is a downstream node.

Since the argument of the function of the guidance problem node for determining the downstream path in the present disclosure may be each option of the topic corresponding to the node, and it is no longer necessary to represent the set of all the pre-paths of the guidance problem node, the present disclosure greatly simplifies the argument of the function of each guidance problem node for determining the downstream path in the guidance problem node map, that is, when setting the function of the guidance problem node for determining the downstream path, it is not necessary to consider all the pre-paths of the guidance problem node, thereby greatly reducing the difficulty of setting the function for determining the downstream path for the guidance problem node, and further facilitating to improve the dimensional efficiency of the guidance problem node map.

In one alternative example, the present disclosure may store the boot problem node map in a database. That is, the present disclosure may store information related to each of the boot problem nodes in the boot problem node graph in a database. The information involved by each lead issue node in the present disclosure may include: the problem stem in the problem corresponding to the problem node, all options in the problem corresponding to the problem node, and the function of the problem node for determining the downstream path.

A specific implementation of the method for generating a contract of the present disclosure is described below in conjunction with fig. 6.

Suppose that the guidance problem node graph that the present disclosure needs to obtain relates to 10 guidance problem nodes, which are respectively node 1, node 2, node 3, node 4, node 5, node 6, node 7, node 8, node 9, and node 10; assume that a node chain set (i.e., set a) obtained by the present disclosure includes seven guidance problem node chains, which are:

node 1, node 2, node 4, node 5;

node 1, node 2, node 4, node 6, node 7 and node 9;

node 1, node 3, node 6, node 7 and node 9;

node 1, node 3, node 6, node 7, node 8 and node 9;

node 1, node 2, node 4, node 8 and node 10;

node 1, node 2, node 4, node 6, node 7, node 8 and node 10;

node 1, node 3, node 6, node 7, node 8 and node 10;

since the seven leading problem node chains described above include three end nodes, the present disclosure may divide set a into three subsets, which are: subset A₅Subset A₉And subset A₁₀. Subset A thereof₅Comprising 1 chain of leading problem nodes, i.e. node 1->Node 2->Node 4->A node 5; subset A thereof₉Includes 3 chains of leading problem nodes, i.e., node 1->Node 2->Node 4->Node 6->Node 7->Node 9, node 1->Node 3->Node 6->Node 7->Node 9, and node 1->Node 3->Node 6->Node 7->Node 8->A node 9; subset A thereof₁₀Includes 3 chains of leading problem nodes, i.e., node 1->Node 2->Node 4->Node 8->Node 10, node 1->Node 2->Node 4->Node 6->Node 7->Node 8->Node 10, and node 1->Node 3->Node 6->Node 7->Node 8->A node 10. In one example, the three subsets may correspond to the same type of contract, such as to the same contract template. In another example, the three subsets may correspond to different types of contracts, such as subset A₅Corresponding to one type of contract and to a contract template, subset A₉Corresponds to another type of contract, andcorresponding to another contract template, subset A₁₀To yet another type of contract and to yet another contract template.

A directed acyclic graph formed by the 10 nodes and the 7 leading problem node chains is shown in fig. 6. Node 1 in fig. 6 may be considered the head-end node of the directed acyclic graph (i.e., the root node of the tree), and

nodes

5, 9, and 10 are all the end nodes of the directed acyclic graph (i.e., the leaf nodes of the tree).

By performing path traversal on the directed acyclic graph shown in fig. 6, an aggregate B can be obtained, and the aggregate B includes the following 8 leading problem node chains:

node 1, node 2, node 4, node 5;

node 1, node 2, node 4, node 6, node 7 and node 9;

node 1, node 2, node 4, node 8 and node 10;

node 1, node 2, node 4, node 6, node 7, node 8 and node 10;

node 1, node 2, node 4, node 6, node 7, node 8 and node 9;

node 1, node 3, node 6, node 7 and node 9;

node 1, node 3, node 6, node 7, node 8 and node 9;

node 1, node 3, node 6, node 7, node 8 and node 10;

for node 5, the end node, the disclosure may compute set B and subset a₅Form a set A'₅Aggregate A'₅The following chain of bootstrap problem nodes is included:

node 1, node 2, node 4, node 6, node 7 and node 9;

node 1, node 2, node 4, node 8 and node 10;

node 1, node 2, node 4, node 6, node 7, node 8 and node 10;

node 1, node 2, node 4, node 6, node 7, node 8 and node 9;

node 1, node 3, node 6, node 7 and node 9;

node 1, node 3, node 6, node 7, node 8 and node 9;

node 1, node 3, node 6, node 7, node 8 and node 10;

if the method does not perform node post-effectiveness detection on the head node and the tail node, the method performs node post-effectiveness detection on the node 2 at first, and then performs node post-effectiveness detection on the node 4.

Node 2 is in set A'₅The first set of downstream nodes in (1) comprises: node 4, node 2 in subset A₅The second set of downstream nodes of (a) comprises: a node 4; since all nodes included in the first downstream node set belong to the second downstream node set, node 2 is not a late-acting pilot problem node.

Node 4 is in set A'₅The first set of downstream nodes formed by all of the downstream nodes in (b) includes: node 6 and node 8, node 4 in subset A₅The second set of downstream nodes formed by all of the downstream nodes in (b) includes: a node 5; since neither node 6 nor node 8 belongs to the second set of downstream nodes, node 4 is a post-operative guided problem node, and the present disclosure can split node 4 into node 4 and node 4'. The nodes downstream of node 4 are node 5, and the nodes downstream of node 4' are node 6 and node 8.

For node 9, the end node, the disclosure may compute set B and subset a₉Form a set A'₉Aggregate A'₉The following chain of bootstrap problem nodes is included:

node 1, node 2, node 4, node 5;

node 1, node 2, node 4, node 8 and node 10;

node 1, node 2, node 4, node 6, node 7, node 8 and node 10;

node 1, node 2, node 4, node 6, node 7, node 8 and node 9;

node 1, node 3, node 6, node 7, node 8 and node 10;

if the present disclosure does not perform post-nodal validity detection on the head node and the tail node, the present disclosure first performs post-nodal validity detection on (node 2 and node 3), then performs post-nodal validity detection on (node 4 and node 6), then performs post-nodal validity detection on node 7, and finally performs post-nodal validity detection on node 8.

Node 2 is in set A'₉The first set of downstream nodes in (1) comprises: node 4, node 2 in subset A₉The second set of downstream nodes of (a) comprises: a node 4; since all nodes included in the first downstream node set belong to the second downstream node set, node 2 is not a late-acting pilot problem node.

Node 3 is in set A'₉The first set of downstream nodes in (1) comprises: node 6, node 3 in subset A₉The second set of downstream nodes of (a) comprises: a node 6; since all nodes included in the first downstream node set belong to the second downstream node set, node 3 is not a late-acting lead problem node.

Node 4 is in set A'₉The first set of downstream nodes in (1) comprises: node 5, node 6 and node 8, node 4 in subset a₉The second set of downstream nodes of (a) comprises: a node 6; since neither node 5 nor node 8 belongs to the second set of downstream nodes, node 4 is a post-operative guided problem node, and the present disclosure can split node 4 into node 4 and node 4'. The nodes downstream of node 4 are node 5, and the nodes downstream of node 4' are node 6 and node 8.

Because node 6 and node 8 are both downstream nodes of node 4, and node 7 is downstream node of node 6, after determining that node 4 is a guidance problem node with aftereffect, the present disclosure may not perform the node aftereffect detection on node 6, node 7, and node 8 any more.

For this end of node 10Node, the disclosure may compute set B and subset A₁₀Form a set A'₁₀Aggregate A'₁₀The following chain of bootstrap problem nodes is included:

node 1, node 2, node 4, node 5;

node 1, node 2, node 4, node 6, node 7 and node 9;

node 1, node 2, node 4, node 6, node 7, node 8 and node 9;

node 1, node 3, node 6, node 7 and node 9;

node 1, node 3, node 6, node 7, node 8 and node 9;

if the present disclosure does not perform node post-validity detection for head and end nodes, the present disclosure first performs node post-validity detection for (nodes 2 and 3), then performs node post-validity detection for (nodes 4 and 6), and finally performs node post-validity detection for (nodes 7 and 8).

Node 2 is in set A'₁₀The first set of downstream nodes in (1) comprises: node 4, node 2 in subset A₁₀The second set of downstream nodes of (a) comprises: a node 4; since all nodes included in the first downstream node set belong to the second downstream node set, node 2 is not a late-acting pilot problem node.

Node 3 is in set A'₁₀The first set of downstream nodes in (1) comprises: node 6, node 3 in subset A₁₀The second set of downstream nodes of (a) comprises: a node 6; since all nodes included in the first downstream node set belong to the second downstream node set, node 3 is not a late-acting lead problem node.

Node 4 is in set A'₁₀The first set of downstream nodes in (1) comprises: node 5 and node 6, node 4 in subset A₁₀The second set of downstream nodes of (a) comprises: node 6 and node 8; since node 5 does not belong to the second set of downstream nodes, node 4 is a post-operative guided problem node, and the present disclosure may split node 4 into nodesPoint 4 and node 4'. The nodes downstream of node 4 are node 5, and the nodes downstream of node 4' are node 6 and node 8.

However, after splitting node 4 into two nodes, the present disclosure may continue with post-node validity detection for

nodes

6, 7, and 8.

FIG. 7 is a schematic structural diagram of an embodiment of an apparatus for generating a contract according to the present disclosure. The apparatus for generating a contract of this embodiment can be used to implement the above-described method embodiments for generating a contract of this disclosure.

The apparatus of the embodiment shown in fig. 7 comprises: a determine template and combination module 700, a determine current question module 701, a page show module 702, a determine unit and location module 703, an update current contract module 704, and a generate contract module 705. Optionally, the apparatus for generating a contract of the present disclosure may further include: means for setting a bootstrap problem node map, and the means for setting a bootstrap problem node map includes: a node chain aggregation module 706, a node post-validity detection module 707, a node splitting processing module 708, and a set function module 709 are formed.

The determining template and combination module 700 is configured to determine, according to information input by a user and used for selecting a contract type, a contract template and a problem combination corresponding to a contract to be generated, and use the contract template as a current contract.

The determine current question module 701 is configured to determine a current question according to the question combination determined by the determine template and combine module 700.

The page presentation module 702 is used to provide the user with a page containing both the current question determined by the determine current question module 701 and the current contract determined by the determine template and combine module 700.

The determining unit and location module 703 is configured to determine, according to the response information for the current question input by the user, a contract content unit corresponding to the response information for the current question and a location in the contract template associated with the contract content unit.

The update current contract module 704 is used for updating the current contract according to the contract content units and the positions determined by the determining unit and position module 703.

In one example, the update current contract module 704 may add the contract content units determined by the determining unit and the position module 703 to the current contract according to the position determined by the determining unit and the position module 703, and set the display format information of the contract content units as the preset highlighting format information, so that the contract content units are highlighted in the page.

In one example, the update current contract module 704 may detect whether there is a conflicting contract content unit of the contract content unit corresponding to the reply information among all the contract content units included in the current contract, and if there is a conflicting contract content unit, the update current contract module 704 may delete the conflicting contract content unit in the current contract. For example, the update current contract module 704 may set the display format information of the conflicting contract content units as the preset deletion marker display format information, so that the conflicting contract content units are displayed in the form of deletion markers in the page.

The contract generation module 705 is configured to, if it is determined that a next question associated with the response information of the current question exists according to the question combination determined by the determination template and combination module 700, take the next question as the current question, and trigger the page presentation module 702 to perform an operation of providing a page including both the current question and the current contract to the user; if it is determined that there is no next question associated with the reply information of the current question according to the question combination, the contract generation module 705 may obtain a contract generated for the user according to the current contract and provide the user with a page including the contract. For example, the contract generation module 705 provides the user with an edit page containing the contract and the content of the contract is editable.

In one example, the generate contract module 705 can update the contract based on a contract content editing operation performed by the user based on an edit page.

In one optional example, the problem combination of the present disclosure includes: a boot problem node map, the boot problem node map comprising: a plurality of pilot problem nodes each provided with a function for determining a downstream path, and the plurality of pilot problem nodes including: and splitting the nodes of the guide problem nodes with the aftereffect to obtain split nodes. In one example, the determine current problem module 701 is further configured to use the lead problem corresponding to the head node in the lead problem node graph as the current problem.

The form node chain aggregation module 706 is configured to obtain a plurality of leading problem node chains used to generate the contract, forming a node chain aggregation.

In one example, form node chain aggregation module 706 can obtain multiple leading problem node chains for generating the same type of contract from the same contract template, forming a node chain aggregation.

In another example, form node chain aggregation module 706 can obtain a plurality of leading problem node chains for generating different types of contracts from different contract templates, forming a node chain aggregation.

The node post-validity detection module 707 is configured to perform node post-validity detection on the guidance problem nodes included in the node chain set acquired by the node chain set forming module 706, and acquire guidance problem nodes with post-validity. Optionally, the node residual effectiveness detecting module 707 may include: a first sub-module 7071, a second sub-module 7072 and a third sub-module 7073. The first sub-module 7071 is configured to generate a directed acyclic graph according to all the guidance problem nodes included in each guidance problem node chain in the node chain set and the jump relationships among all the guidance problem nodes. The second sub-module 7072 is configured to obtain a node path included in the directed acyclic graph, and obtain a path set. For example, the second sub-module 7072 performs path traversal on the directed acyclic graph to obtain all node paths included in the directed acyclic graph, so as to form a path set. The third sub-module 7073 is configured to perform node postefficiency detection on the guidance problem node included in the node chain set according to the path set, to obtain a guidance problem node with postefficiency. For example, for any end node, the third sub-module 7073 may sequentially perform, according to the path set and based on a breadth-first search, node postefficiency detection on guidance problem nodes in each guidance problem node chain based on the end node in the node chain set, to obtain guidance problem nodes with postefficiency based on the end node.

In one example, the third submodule 7073 may include a first unit, a second unit, a third unit, and a fourth unit. The first unit is configured to obtain a difference between the path set and each leading problem node chain based on the end node in the node chain set. The second unit is configured to use, as a node to be detected, a guidance problem node in each guidance problem node chain based on the end node in the node chain set in a breadth-first search manner. The third unit is configured to acquire a first downstream node set of the node to be detected in the difference, and acquire a second downstream node set of the node to be detected in each guidance problem node chain based on the end node. The fourth unit is configured to, when it is determined that the first downstream node set does not belong to the second downstream node set, take the node to be detected as a guidance problem node having a residual effect.

The node splitting module 708 is configured to perform node splitting on the guidance problem node with aftereffect obtained by the node aftereffect detection module 707. In one example, for any of the guiding problem nodes with the residual, the node splitting processing module 708 forms a split node of the guiding problem node with the residual, and updates the guiding problem node with the residual in the partial guiding problem chain containing the guiding problem node with the residual in the node chain set as the split node.

The function setting module 709 is configured to set a function for determining a downstream path for each of the plurality of guidance problem nodes including the guidance problem node after the node splitting process, and obtain a guidance problem node map for generating the contract. In an example, for any guidance problem node, the setting function module 709 is configured to set a function for determining a downstream path for the guidance problem node, with each option of a topic corresponding to the guidance problem node as an independent variable and all downstream nodes of the guidance problem node as dependent variables.

In addition, an embodiment of the present disclosure also provides an electronic device, including: a memory for storing a computer program; a processor for executing the computer program stored in the memory, and when the computer program is executed, implementing the method for generating a contract according to any of the above embodiments of the present disclosure.

In addition, the embodiment of the present disclosure also provides a computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the computer program implements the method for generating a contract according to any of the above-mentioned embodiments of the present disclosure.

Fig. 8 is a schematic structural diagram of an embodiment of an application of the electronic device of the present disclosure. Next, an electronic apparatus according to an embodiment of the present disclosure is described with reference to fig. 8. The electronic device may be either or both of the first device and the second device, or a stand-alone device separate from them, which stand-alone device may communicate with the first device and the second device to receive the acquired input signals therefrom.

As shown in fig. 8, the electronic device includes one or more processors and memory.

The processor may be a Central Processing Unit (CPU) or other form of processing unit having data processing capabilities and/or instruction execution capabilities, and may control other components in the electronic device to perform desired functions.

The memory may include one or more computer program products that may include various forms of computer-readable storage media, such as volatile memory and/or non-volatile memory. The volatile memory may include, for example, Random Access Memory (RAM), cache memory (cache), and/or the like. The non-volatile memory may include, for example, Read Only Memory (ROM), hard disk, flash memory, etc. One or more computer program instructions may be stored on the computer-readable storage medium and executed by a processor to implement the methods for generating contracts of the various embodiments of the present disclosure described above and/or other desired functions.

In one example, the electronic device may further include: an input device and an output device, which are interconnected by a bus system and/or other form of connection mechanism (not shown). The input device may also include, for example, a keyboard, a mouse, and the like. The output device may output various information including the determined distance information, direction information, and the like to the outside. The output devices may include, for example, a display, speakers, a printer, and a communication network and remote output devices connected thereto, among others. Of course, for simplicity, only some of the components of the electronic device relevant to the present disclosure are shown in fig. 8, omitting components such as buses, input/output interfaces, and the like. In addition, the electronic device may comprise any other suitable components, depending on the application.

In addition to the methods and apparatus described above, embodiments of the present disclosure may also be a computer program product comprising computer program instructions that, when executed by a processor, cause the processor to perform the steps in the method for generating a contract according to the various embodiments of the present disclosure described in the above section of this specification. The computer program product may write program code for carrying out operations for embodiments of the present disclosure in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device, or entirely on the remote computing device or server.

Furthermore, embodiments of the present disclosure may also be a computer-readable storage medium having stored thereon computer program instructions that, when executed by a processor, cause the processor to perform the steps in the method for generating a contract according to the various embodiments of the present disclosure described in the above section of this specification.

The computer-readable storage medium may take any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may include, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

The foregoing describes the general principles of the present disclosure in conjunction with specific embodiments, however, it is noted that the advantages, effects, etc. mentioned in the present disclosure are merely examples and are not limiting, and they should not be considered essential to the various embodiments of the present disclosure. Furthermore, the foregoing disclosure of specific details is for the purpose of illustration and description and is not intended to be limiting, since the disclosure is not intended to be limited to the specific details so described.

In the present specification, the embodiments are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same or similar parts in the embodiments are referred to each other. For the system embodiment, since it basically corresponds to the method embodiment, the description is relatively simple, and for the relevant points, reference may be made to the partial description of the method embodiment. The block diagrams of devices, apparatuses, systems referred to in this disclosure are only given as illustrative examples and are not intended to require or imply that the connections, arrangements, configurations, etc. must be made in the manner shown in the block diagrams. These devices, apparatuses, devices, systems may be connected, arranged, configured in any manner, as will be appreciated by those skilled in the art. Words such as "including," "comprising," "having," and the like are open-ended words that mean "including, but not limited to," and are used interchangeably therewith. The words "or" and "as used herein mean, and are used interchangeably with, the word" and/or, "unless the context clearly dictates otherwise. The word "such as" is used herein to mean, and is used interchangeably with, the phrase "such as but not limited to".

The methods and apparatus of the present disclosure may be implemented in a number of ways. For example, the methods and apparatus of the present disclosure may be implemented by software, hardware, firmware, or any combination of software, hardware, and firmware. The above-described order for the steps of the method is for illustration only, and the steps of the method of the present disclosure are not limited to the order specifically described above unless specifically stated otherwise. Further, in some embodiments, the present disclosure may also be embodied as programs recorded in a recording medium, the programs including machine-readable instructions for implementing the methods according to the present disclosure. Thus, the present disclosure also covers a recording medium storing a program for executing the method according to the present disclosure.

It is also noted that in the devices, apparatuses, and methods of the present disclosure, each component or step can be decomposed and/or recombined. These decompositions and/or recombinations are to be considered equivalents of the present disclosure.

The previous description of the disclosed aspects is provided to enable any person skilled in the art to make or use the present disclosure. Various modifications to these aspects will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other aspects without departing from the scope of the disclosure. Thus, the present disclosure is not intended to be limited to the aspects shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

The foregoing description has been presented for purposes of illustration and description. Furthermore, this description is not intended to limit embodiments of the disclosure to the form disclosed herein. While a number of example aspects and embodiments have been discussed above, those of skill in the art will recognize certain variations, modifications, alterations, additions and sub-combinations thereof.

Claims

1. A method for generating a contract, comprising:

determining a contract template and a problem combination corresponding to a contract to be generated according to information which is input by a user and used for selecting the contract type, and taking the contract template as a current contract;

determining a current question according to the question combination, and providing a page containing the current question and the current contract to the user;

determining a contract content unit corresponding to the response information of the current question and a position associated with the contract content unit in the contract template according to the response information of the current question input by the user;

updating the current contract according to the contract content unit and the position;

if the next question associated with the reply information of the current question is determined to exist according to the question combination, taking the next question as the current question, and returning to the step of providing the page which simultaneously contains the current question and the current contract for the user;

and if it is determined that the next question associated with the reply information of the current question does not exist according to the question combination, acquiring a contract generated for the user according to the current contract, and providing a page containing the contract for the user.

2. The method of claim 1, wherein said updating the current contract based on the contract content units and the location comprises:

and adding the contract content unit into the current contract according to the position, and setting the display format information of the contract content unit as preset highlighting format information so as to highlight the contract content unit in the page.

3. The method of claim 1 or 2, wherein said updating the current contract based on the contract content units and the location comprises:

detecting whether conflict contract content units of the contract content units corresponding to the reply information exist in all contract content units contained in the current contract;

and if the conflict contract content unit exists, deleting the conflict contract content unit in the current contract.

4. The method of claim 3, wherein the deleting conflicting contract content units in the current contract comprises:

and setting the display format information of the conflict contract content unit as preset deletion mark display format information so as to display the conflict contract content unit in the page in a deletion mark mode.

5. The method of any of claims 1-4, wherein providing the user with a page containing the contract comprises:

providing the user with an edit page containing the contract and the content of the contract is editable;

the method further comprises the following steps:

and updating the contract according to the contract content editing operation executed by the user based on the editing page.

6. The method of any of claims 1-5, wherein the problem combining comprises: a boot problem node map, the boot problem node map comprising: a plurality of pilot problem nodes each provided with a function for determining a downstream path, the plurality of pilot problem nodes comprising: splitting nodes obtained after node splitting processing is carried out on the guiding problem nodes with the aftereffect;

the determining the current question according to the question combination comprises:

and taking the guidance question corresponding to the head end node in the guidance question node graph as the current question.

7. The method of claim 6, wherein the directing the problem node map is arranged in a manner comprising:

acquiring a plurality of guide problem node chains for generating a contract to form a node chain set;

carrying out node posteffectivity detection on the guide problem nodes contained in the node chain set to obtain guide problem nodes with posteffectivity;

carrying out node splitting processing on the guide problem node with the aftereffect;

and respectively setting functions for determining downstream paths for a plurality of guidance problem nodes including the guidance problem nodes after node splitting processing, and obtaining a guidance problem node graph for generating a contract.

8. The method according to claim 7, wherein the performing node post-validity detection on the guidance problem node included in the node chain set to obtain a guidance problem node with post-validity comprises:

generating a directed acyclic graph according to all the guidance problem nodes contained in each guidance problem node chain in the node chain set and the jump relation among all the guidance problem nodes;

acquiring a node path contained in the directed acyclic graph to obtain a path set;

and carrying out node postefficiency detection on the guide problem nodes contained in the node chain set according to the path set to obtain the guide problem nodes with postefficiency.

9. An apparatus for generating a contract, comprising:

the system comprises a determining template and combination module, a problem combination module and a contract template module, wherein the determining template and combination module is used for determining the contract template and the problem combination corresponding to the contract to be generated according to information which is input by a user and used for selecting the contract type, and the contract template is used as the current contract;

a current problem determining module for determining a current problem according to the problem combination;

the page display module is used for providing a page which simultaneously contains the current question and the current contract for the user;

the determining unit and the position module are used for determining a contract content unit corresponding to the response information of the current question and a position associated with the contract content unit in the contract template according to the response information input by the user for the current question;

the current contract updating module is used for updating the current contract according to the contract content unit and the position;

a contract generation module, configured to, if it is determined that there is a next question associated with the reply information of the current question according to the question combination, take the next question as the current question, and trigger the page presentation module to perform an operation of providing a page including both the current question and the current contract to the user; and if it is determined that the next question associated with the reply information of the current question does not exist according to the question combination, acquiring a contract generated for the user according to the current contract, and providing a page containing the contract for the user.

10. The apparatus of claim 9, wherein the problem combination comprises: a boot problem node map, the boot problem node map comprising: a plurality of pilot problem nodes each provided with a function for determining a downstream path, the plurality of pilot problem nodes comprising: splitting nodes obtained after node splitting processing is carried out on the guiding problem nodes with the aftereffect;

the determine current problem module is further to:

11. The apparatus of claim 10, further comprising: means for setting up the bootstrap problem node map, the means for setting up the bootstrap problem node map comprising:

a node chain forming assembly module, configured to acquire a plurality of guide problem node chains used for generating a contract, and form a node chain assembly;

the node post-validity detection module is used for carrying out node post-validity detection on the guide problem nodes contained in the node chain set to obtain guide problem nodes with post-validity;

the node splitting processing module is used for carrying out node splitting processing on the guide problem node with the aftereffect;

and the function setting module is used for respectively setting functions for determining downstream paths for a plurality of guidance problem nodes including the guidance problem nodes after the node splitting processing, and obtaining a guidance problem node graph for generating a contract.

12. An electronic device, comprising:

a memory for storing a computer program;

a processor for executing a computer program stored in the memory, and when executed, implementing the method of any of the preceding claims 1-8.

13. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the method of any one of the preceding claims 1 to 8.

14. A computer program comprising computer readable code for, when run on a device, a processor in the device executing instructions for carrying out the steps of the method according to any one of claims 1 to 8.