CN112634094B

CN112634094B - Method, device, storage medium and electronic equipment for generating contract

Info

Publication number: CN112634094B
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: 2023-09-05
Anticipated expiration: 2040-12-30
Also published as: CN112634094A

Abstract

The embodiment of the disclosure discloses a method, a device, a storage medium and an electronic device for generating a contract, wherein the method comprises the following steps: 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 containing the current problem and a current contract; determining a contract content unit corresponding to the reply information of the current question and a position associated with the contract content unit in a contract template according to the reply information of the current question input by a user; updating the current contract according to the contract content unit and the position; if the next question associated with the answer information of the current question exists 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 fact that the next question associated with the answer information of the current question does not exist is determined according to the question combination, the current contract is taken as the contract generated for the user.

Description

Method, device, storage medium and electronic equipment 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, and an electronic device.

Background

A contract may refer to a respective adherence by at least two parties in order to determine the respective rights and obligations.

Currently, the manner in which a user obtains a contract mainly includes the following two types:

mode one, a contract is written by a person having relevant knowledge such as lawyers.

And obtaining a corresponding contract through a mode II, network downloading and other modes.

The above-mentioned method has problems of low efficiency, high cost and the like. In the second mode, the contract obtained through the network downloading mode is generally regarded as a standard contract, the user demand covered by the standard contract is often limited, and if the standard contract cannot meet the user demand, the user is required to modify the standard contract by himself, which requires the user to have certain legal expertise.

Disclosure of Invention

The embodiment of the disclosure provides a technical scheme for generating contracts, so that contracts meeting the demands of users as much as possible can be generated efficiently and conveniently.

In one aspect of the disclosed embodiments, there is provided a method for generating a contract, comprising: according to information input by a user and used for selecting contract types, determining a contract template and a problem combination corresponding to the contract to be generated, 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 for the user; determining a contract content unit corresponding to the reply information of the current question and a position associated with the contract content unit in the contract template according to the reply 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 answer information of the current question exists according to the question combination, the next question is taken as the current question, and the step of providing the page containing the current question and the current contract for the user is returned; and if the fact that the next question associated with the answer information of the current question does not exist is determined 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.

Optionally, in the method of any embodiment of the 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 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 of any embodiment of the disclosure, deleting the conflicting contract content unit 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 that the conflict contract content unit is displayed in the page in the form of a deletion mark.

Optionally, in the method of any embodiment of the disclosure, the providing the page including the contract to the user includes: providing an editing page containing the contract and having editable contents of the contract to the user; the method further comprises the steps of: and updating the contract according to contract content editing operation executed by the user based on the editing page.

Optionally, in the method of any embodiment of the disclosure, the problem combination includes: a boot-strap issue node graph, the boot-strap issue node graph comprising: a plurality of bootstrap problem nodes, each of the plurality of bootstrap problem nodes being provided with a function for determining a downstream path, and the plurality of bootstrap problem nodes comprising: after node splitting treatment is carried out on the guide problem node with the post-effectiveness, splitting nodes are obtained; the determining the current problem according to the problem combination comprises the following steps: and taking the guide problem corresponding to the head-end node in the guide problem node diagram as the current problem.

Optionally, in the method of 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 contracts to form a node chain set; detecting the node posteffectiveness of the guide problem nodes contained in the node chain set, and obtaining the guide problem nodes with the posteffectiveness; carrying out node splitting treatment on the guide problem node with the post-effectiveness; and respectively setting functions for determining downstream paths for a plurality of guide problem nodes including the guide problem nodes after node splitting processing, and obtaining a guide problem node diagram for generating contracts.

Optionally, in the method of any embodiment of the present disclosure, the detecting the node postavailability of the bootstrap problem node included in the node chain set to obtain the bootstrap problem node with postavailability includes: generating a directed acyclic graph according to all guide problem nodes contained in each guide problem node chain in the node chain set and the jump relation among all guide problem nodes; acquiring node paths contained in the directed acyclic graph, and acquiring a path set; and detecting the node posteffectiveness of the guide problem node contained in the node chain set according to the path set, and obtaining the guide problem node with the posteffectiveness.

In yet another aspect of the disclosed embodiments, there is provided an apparatus for generating a contract, the apparatus comprising: the determining template and combining module is used for determining a contract template and a problem combination corresponding to the contract to be generated according to information which is input by a user and is used for selecting the contract type, and taking the contract template as a current contract; the current problem determining module is used 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 problem 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 reply information of the current question and a position associated with the contract content unit in the contract template according to the reply information of the current question input by the user; the current contract updating module is used for updating the current contract according to the contract content unit and the position; a generation contract module, configured to, if it is determined according to the question combination that there is a next question associated with the answer information of the current question, take the next question as the current question, and trigger the page display module to execute an operation of providing a page that includes both the current question and the current contract to the user; and if the fact that the next question associated with the answer information of the current question does not exist is determined 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.

Optionally, in an apparatus of any embodiment of the disclosure, the problem combination includes: a boot-strap issue node graph, the boot-strap issue node graph comprising: a plurality of bootstrap problem nodes, each of the plurality of bootstrap problem nodes being provided with a function for determining a downstream path, and the plurality of bootstrap problem nodes comprising: after node splitting treatment is carried out on the guide problem node with the post-effectiveness, splitting nodes are obtained; the determine current problem module is further to: and taking the guide problem corresponding to the head-end node in the guide problem node diagram as the current problem.

Optionally, in an apparatus of any embodiment of the disclosure, the apparatus further comprises: means for setting the guidance problem node map, the means for setting the guidance problem node map comprising: the node chain collection forming module is used for obtaining a plurality of guide problem node chains for generating contracts to form a node chain collection; the node post-efficiency detection module is used for detecting the post-efficiency of the nodes of the guide problem contained in the node chain set to obtain the guide problem nodes with the post-efficiency; the node splitting processing module is used for carrying out node splitting processing on the guide problem node with the post-effectiveness; and the function setting module is used for setting functions for determining downstream paths for a plurality of guide problem nodes including the guide problem nodes after the node splitting processing respectively, and obtaining a guide problem node diagram for generating contracts.

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

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

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

Based on the method, the device, the storage medium, the electronic equipment and the program for generating the contract provided by the embodiment of the disclosure, the current problem and the current contract can be obtained by utilizing the problem combination and the contract template by utilizing the information of selecting the contract type input by the user, and the user can know the content in the current contract at any time by providing the page containing the current problem and the current contract to the user, so that the user can timely discover the problem which does not meet the requirement in the contract; the next question associated with the answer information of the current question is determined by continuously using the combination of questions, and the current question is continuously updated by using the contract content unit corresponding to the answer information, so that the user can generate the contract meeting the requirement as far as possible under the condition of autonomous operation of the user. Therefore, the technical scheme provided by the embodiment of the disclosure is beneficial to improving the contract generation efficiency, reducing the cost of contract generation and facilitating the usability of the contract generation technology.

The technical scheme of the present disclosure is described in further detail below through 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 disclosure may be more clearly understood from the following detailed description taken in conjunction with the accompanying drawings in which:

fig. 1 is a flow chart of an embodiment of a method of the present disclosure for generating a contract.

FIG. 2 is a flow chart of one embodiment of a setup guidance problem node map of the present disclosure.

FIG. 3 is a flow chart of one embodiment of the present disclosure for implementing node postavailability detection using directed acyclic graphs.

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

FIG. 5 is a flow chart of one embodiment of node invalidity detection of 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 view of an embodiment of an apparatus for generating a contract of the present disclosure.

Fig. 8 is a schematic structural diagram of an application embodiment 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, numerical expressions and numerical values set forth in these embodiments do not limit the scope of the present disclosure unless it is specifically stated otherwise.

It will be appreciated by those of skill in the art that the terms "first," "second," etc. in embodiments of the present disclosure are used merely to distinguish between different steps, devices or modules, etc., and do not represent any particular technical meaning nor necessarily logical order between them.

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

It should also be appreciated that any component, data, or structure referred to in the presently disclosed embodiments may be generally understood as one or more without explicit limitation or the contrary in the context.

In addition, the term "and/or" in this disclosure is merely an association relationship describing an association object, and indicates that three relationships may exist, for example, a and/or B may indicate: a exists alone, A and B exist together, and B exists alone. In addition, the character "/" in the present disclosure generally indicates that the front and rear association objects are 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 that the same or similar features may be referred to each other, and for brevity, will not be described in detail.

Meanwhile, it should be understood that the sizes of the respective parts shown in the drawings are not drawn in actual scale for 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 one 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 numerals and letters denote like items in the following figures, and thus once an item is defined in one figure, no further discussion thereof is necessary in subsequent figures.

Embodiments of the present disclosure may be applicable to electronic devices such as terminal devices, computer systems, servers, etc., which may operate 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 the terminal device, computer system, server, or other electronic device 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, network personal computers, small computer systems, mainframe computer systems, and distributed cloud computing technology environments that include any of the foregoing, 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 implemented in a distributed cloud computing environment in which 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 computing system storage media including memory storage devices.

Fig. 1 is a flow chart of one embodiment of a method of the present disclosure for generating a contract. 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 for selecting the contract type input by a user, and taking the contract template as a current contract.

Contract types in this disclosure may refer to the category of contracts, for example, contract types may include: short term borrowing contracts, general edition trading contracts, house renting types, new house trading types, second house trading types, stock right holding contracts, labor contracts, and the like. Each contract type corresponds to a contract template. In one example, a contract type generally corresponds to a contract template. In another example, a contract type may 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 contract templates corresponding to the contract type.

The present disclosure may provide a user with a page for selecting a contract type for which a contract is to be generated, in one example, a hot contract area and a contract classification area may be provided in the page to facilitate the user in selecting a corresponding contract type. A plurality of contract type triggering pieces can be arranged in the hot joint 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 used for representing classification, and when each trigger used for representing classification is triggered, the triggers of a plurality of contract types corresponding to the triggers are respectively presented to the user.

The contract template in the present disclosure is a previously set known contract template. Each contract template corresponds to the respective contract name, the corresponding contract term set, the corresponding text description and the like. In addition, each contract template typically has a corresponding contract content arrangement format (e.g., the location of the contract name, the location of the contract terms, the location of the written description of the contract, etc.). The present disclosure is not limited to contract templates and their specific manifestations.

The question combinations in this disclosure typically include multiple questions and all questions are related by the options of the question, i.e., each option of one question in the question combination typically has an association with the other questions. In one specific example, a first option of a first question in the question combination is associated with a second question, a second option of the first question is associated with a third question, a third option of the first question is associated with a fourth question, and a fourth option of the first question is associated with a fifth question. The problem combinations of the present disclosure may be presented in the form of trees. The options for the questions corresponding to leaf nodes in the tree typically have no questions associated with them.

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

The present disclosure may select one question from a combination of questions as the current question, i.e., the present disclosure treats one question from the combination of questions as the current question. For example, the present disclosure may consider a headend problem in a problem combination as the current problem. More specifically, in the case where the problem combination is expressed in the form of a tree, the present disclosure may take a problem corresponding to the root node of the tree as a current problem. The current question in this step may be referred to as an initial current question or a first current question.

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

Pages in this disclosure may refer to HTTP (HyperText Transfer Protocol ) based pages, etc. 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 split-zone presentation, e.g., the current question is located in the left-hand region of the page and the current contract is located in the right-hand region of the page.

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

The answer 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 reply information input by the user for the current question in the present disclosure may also be information (i.e., gap filling information) filled by the user for the gap position included in the current question.

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

In another example, the topic portion of a question in a question combination may correspond to a contractual content unit that contains a void portion that needs to be filled, and the present disclosure may fill the void portion of the contractual content unit with void information entered by the user for the topic portion of the question.

The contract content unit in the present disclosure may be considered as a constituent unit (may also be referred to as a constituent part) of the contract, for example, a contract content unit may be a specific term in law and regulation, may be a supplementary explanation in the contract, or the like. The present disclosure is not limited to the specific form of the contract content units.

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

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

The present disclosure may add the contract content unit obtained in the above step to the corresponding position in the current contract according to the position obtained in the above step, thereby realizing the update of the current contract.

S105, if it is determined that the next question associated with the answer information of the current question exists according to the question combination, the next question is taken as the current question, and S102 is returned.

Where the combination of questions in the present disclosure is in the form of a tree, if the current question is not an end node (i.e., a leaf node) of the tree, it may be determined that there is a next question associated with the answer information of the current question.

And S106, if the fact that the next question associated with the answer information of the current question does not exist is determined 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.

Where the combination of questions in the present disclosure is in the form of a tree, if the current question is an end node (i.e., a leaf node) of the tree, it may be determined that there is no next question associated with the answer information of the current question. In the case where it is determined that there is no next question associated with the answer information of the current question, the present disclosure may use the current contract as a contract generated for the user, or may perform certain post-processing (such as format and layout adjustment processing, etc.) on the current contract, and use a contract obtained by the post-processing as a 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, mobile phone, or tablet. The method and the device support the user to view the whole content of the contract through operations such as page turning, cursor moving up, down, left and right and the like.

According to the method and the system, the problem combination and the contract template are determined by utilizing the information of the selected 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 the page containing the current problem and the current contract to the user, so that the user can timely find the problem which does not meet the requirement in the contract; the next question associated with the answer information of the current question is determined by continuously using the combination of questions, and the current question is continuously updated by using the contract content unit corresponding to the answer information, so that the user can generate the contract meeting the requirement as far as possible under the condition of autonomous operation of the user. Therefore, the technical scheme provided by the embodiment of the disclosure is beneficial to improving the contract generation efficiency, reducing the cost of contract generation and facilitating the usability of the contract generation technology.

In an alternative example, the present disclosure may use a different display format to display the content in the current contract differently when updating the current contract with the contract content unit and location. For example, for a contract content unit, the present disclosure may add the contract content unit at a corresponding location of a current contract according to a location associated with the contract content unit in a contract template, and set display format information of the contract content unit to preset highlighting format information, so that the contract content unit may be highlighted in the current page.

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

According to the method and the system, the contract content units added in the current contract are highlighted in the page, so that a user can know the content change of the current contract at any time, the user can timely find out the problem that the contract does not meet the requirement of the user, and the contract meeting the requirement of the user can be provided for the user efficiently.

In an alternative example, the present disclosure should ensure that newly added content to the current contract is not inconsistent with existing content in the current contract prior to the update in updating the current contract based on contract content units and location. Specifically, the present disclosure may detect whether there is a conflicting contract content unit of the contract content units corresponding to the reply information of the current question among all the contract content units included in the current contract before the update, and if the result of the detection is that there is a conflicting contract content unit, the present disclosure may delete the conflicting contract content unit in the current contract. The conflicting contract content units in this disclosure may refer to: if only one of the contract content units in the current contract and one of the existing contract content units in the current contract is needed to be added, the existing contract content unit in the current contract is the contradiction contract content unit of the contract content unit which is needed to be added in the current contract. The contradictory contractual content unit may also be referred to as a contradictory contractual content unit or an opposite contractual content unit, or the like.

In one example, if a contract content unit is: allowing the intended party to process the intended item in manner a, while the other contractual content unit is: the predetermined party is prohibited from processing the predetermined object in manner B, and the present disclosure may consider the two units of contract content to be conflicting with each other, assuming that manner a includes manner B.

Alternatively, the present disclosure may determine whether there is a contract content unit in the current contract that contradicts a contract content unit currently required to be added in the current contract, using mutual contradiction information between preset contract content units. In one example, the mutual contradiction information may be set for different terms in the same law and regulation, and in another example, the mutual contradiction information may be set for corresponding terms in different laws and regulations, respectively.

In one example, the disclosure may provide prompt information for the user that contradictory terms exist, and provide the user with the contradictory contract content units together (e.g., the contradictory contract content units are all displayed in a blinking manner), and delete one of the contradictory contract content units according to deletion selection information input by the user.

In another example, the present disclosure may delete one of the conflicting contractual content units directly without providing the user with relevant prompting information. For example, an existing conflicting contract content unit in the current contract before the update is deleted, and for example, a contract content unit newly added in the current contract is deleted. For another example, the disclosure may compare the respective levels of two units of contract content that contradict each other, and delete the unit of contract content with the lower level in the comparison result. If the levels corresponding to the two contradictory contract content units are the same, the user can determine the contract content units to be deleted, and one of the contract content units can be deleted based on the default setting. The corresponding level of the contractual content units may be related to the nature of the law to which the contractual content units pertain, e.g., the level of the contractual content units that are of a local regulatory nature is generally lower than the level of the contractual content units that are of a legal nature.

The present disclosure facilitates eliminating potential problems in contracts by performing conflicting contract content detection during updating of a current contract, thereby facilitating improving the quality of the generated contract.

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

According to the method and the device for displaying the contract content unit, the contract content unit is displayed in the page in the form of the deletion mark, so that a 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 optional example, in a case where the current question is the last question in the question combination and the present disclosure receives the reply information of the user for the current question, the present disclosure may provide the user with a contract editing function while providing the user with the currently generated complete contract, so that the user may edit the currently generated complete contract by itself through the function.

In one example, the disclosure may provide the user with a page that includes all of the content of the contract and that includes the contract content that is editable, e.g., a contract editing trigger (e.g., a contract editing button) is included in the page that includes all of the content of the contract provided to the user, and upon receiving information that the contract editing trigger is triggered by the user, the disclosure provides the user with a page for editing the contract content that allows the user to perform operations of deleting the content in the contract (e.g., deleting words or sentences or paragraphs, etc.), adding new content in the contract (e.g., adding words or sentences or paragraphs, etc.), and adjusting the arrangement format of the contract. The arrangement format of the adjustment contract can comprise: adjusting the first line indentation of the content in the contract, adjusting the font size of the content in the contract, adjusting the paragraph position of the content in the contract, and the like. The present disclosure may update the contract according to a contract content editing operation performed by the user based on the page. For example, after the user performs the deletion operation of the corresponding content in the contract, the addition operation of the new content in the contract, and the adjustment operation of the arrangement format, and clicks the editing completion trigger (e.g., editing completion submit button, etc.) in the page, the present disclosure may perform the corresponding adjustment of the content in the contract according to all the editing operations of the user, and provide the edited contract to the user, and the present disclosure may use the edited contract as the contract ultimately generated for the user.

In addition, in the process of editing the contract by the user, the method and the device can detect the contract content units against the content in the contract in real time, for example, when the user adds the contract content by himself, the contract content units corresponding to the newly added contract content can be determined, and whether the contract content units against the newly added contract content exist in the contract or not is judged by utilizing mutual collision information among the preset contract content units, so that the phenomenon of improper modification of the contract by the user is avoided.

The method and the system 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 requirement as much as possible.

In one alternative example, the question combination of the present disclosure may be a guide question node graph. The boot issue node map includes: a plurality of guidance problem nodes, and each of the plurality of guidance problem nodes is provided with a function for determining a downstream path. Each boot issue node corresponds to a respective one of the boot issues. In addition, the boot issue node map in the present disclosure includes: and after node splitting treatment is carried out on the guide problem node with the post-effectiveness, the split node is obtained. That is, the boot issue node map in this disclosure can be considered as: at least some of the post-active bootstrap problem nodes are removed and each bootstrap problem node is provided with a directed acyclic graph of a function for determining a downstream path. The setup process of the guidance problem node map in the present disclosure may be referred to the following description with respect to fig. 2.

Optionally, when the questions determined in the disclosure S100 are combined into a guidance question node diagram, the guidance question node diagram may be an independent complete guidance question node diagram, or may be a part of the guidance question node whole diagram, that is, an area diagram in the guidance question node whole diagram. In the case that the problem combination node diagram determined in S100 is an area in the full graph of guide problem nodes, the disclosure may perform corresponding calculation on the received information for selecting the contract type, determine a guide problem node in the full graph of guide problem nodes according to the calculation result, and use the guide problem node as a root node, where all paths formed by using the root node as a path start node are the problem combinations determined in S100.

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

The bootstrap problem node chain in the present disclosure may refer to a logical link formed by a plurality of bootstrap problem nodes and a hopping relationship among the bootstrap problem nodes. That is, the guide problem node chain in the present disclosure includes two basic elements, respectively: the guide problem nodes and the jump relation between the guide problem nodes are respectively corresponding to the respective topics.

In one example, a question includes a stem and a plurality of options. The jump relationship between the lead question nodes is typically determined by the choice of the topic to which the lead question node corresponds. For example, the questions corresponding to a guide question node include n (n is an integer greater than 1) options, and each of the n options leads to a different next question (i.e., the next guide question node), thereby forming a skip relation between the upstream guide question node and the downstream guide question node.

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

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

In one example, all bootstrap problem node chains in the node chain set in the present disclosure typically have the same head-end node. That is, if a tree is formed using all the guided problem node chains in the node chain set, the head end node of all the guided problem node chains in the node chain set is the root node of the tree. Of course, the present disclosure does not exclude the phenomenon that all the guide problem node chains in the node chain set have different head end nodes, so that when forming a tree by using all the guide problem node chains in the node chain set, one tree may be formed, and multiple trees may also be formed.

The present disclosure may acquire a plurality of guidance problem node chains by receiving guidance problem node chain information input from the outside or reading stored information at a predetermined location, or the like. The plurality of lead problem node chains are typically preset according to the specific needs of at least one type of contract. For example, there are often multiple possibilities for the bootstrap problem nodes and their hopping relationships between nodes involved in one type of contract, and the present disclosure may set a bootstrap problem node chain for each possibility separately in advance. Likewise, there are various possibilities for the bootstrap problem nodes and the skip relations between the nodes related to the multiple types of contracts, and the present disclosure may set a bootstrap problem node chain for each possibility in advance.

And S201, detecting the node posteffectiveness of the guide problem nodes contained in the node chain set, and obtaining the guide problem nodes with the posteffectiveness.

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

The method and the device can detect the node postavailability of all the guide problem nodes in the node chain set, and can detect the node postavailability of part of the guide problem nodes in the node chain set respectively. For example, the present disclosure may perform node-post-validity detection on all boot issue nodes in the chain of nodes except for a specific node, where the specific node may include: head end nodes, etc. that direct the chain of problem nodes.

For any boot problem node in the node chain set, the method and the device can judge whether the boot problem node is a boot problem node with a rear effect or a boot problem node without a rear effect (i.e. a boot problem node without a rear effect) through detecting the rear effect of the boot problem node. The method and the device can detect the post-effectiveness of the guide problem nodes in the node chain set based on the logical relationship between the guide problem nodes formed by the respective upstream nodes and downstream nodes of each guide problem node in the node chain set, and obtain the guide problem nodes with post-effectiveness. The present disclosure is not limited to a particular implementation of the node post-validity detection.

S202, carrying out node splitting processing on the guide problem node with the post-effectiveness.

The node splitting process in this disclosure may refer to splitting one boot issue node into two different boot issue nodes. For example, a boot strap problem node with a post-validity is reserved, and a new boot strap problem node is set based on the boot strap problem node with the post-validity, so that two boot strap problem nodes are obtained. For another example, a boot strap problem node with a post-effect is not reserved, and two new boot strap problem nodes are set based on the boot strap problem node with the post-effect, so that two boot strap problem nodes are obtained.

The disclosure is based on two split-obtained bootstrap problem nodes of one bootstrap problem node, which have the same title and the same option, but the split-obtained two bootstrap problem nodes should have different identifications (e.g. have different node identifications), and all downstream nodes of the split-obtained two bootstrap problem nodes are not identical, for example, the next bootstrap problem node led out by the same option of the title corresponding to the two different bootstrap problem nodes is not identical. This means that the functions used to determine the downstream paths corresponding to the two split-obtained bootstrap problem nodes should not be identical, nor should the arguments of the functions be identical.

The node splitting process in the present disclosure may cause a change in a corresponding boot problem chain in the node chain set, e.g., a boot problem node with a post-validity in a boot problem chain in the node chain set is replaced by a new boot problem node obtained by splitting, etc.

S203, setting functions for determining downstream paths for a plurality of guide problem nodes including the guide problem nodes after node splitting processing, and obtaining a guide problem node diagram for generating contracts.

In one example, where a node chain set is updated with a new bootstrap problem node obtained by splitting, a plurality of bootstrap problem nodes in the present disclosure, including the bootstrap problem node after the node splitting process, may include: all the bootstrap problem nodes in all the bootstrap problem node chains in the updated node chain set.

For any one of the bootstrap problem node in the bootstrap problem node graph, the function set by the present disclosure for that bootstrap problem node to determine the downstream path may refer to: a function of all downstream nodes of the lead problem node can be represented. The boot issue node map in the present disclosure may be represented as a directed acyclic graph provided with functions for determining downstream paths.

According to the method and the device, the guide problem nodes with the posteffects are obtained by utilizing the node posteffects detection, and at least part of the guide problem nodes with the posteffects in the node chain set can be eliminated by carrying out node splitting treatment on the guide problem nodes with the posteffects; since the complexity of the function for determining the downstream path is set for the non-post-effect guidance problem node, which is far less than the complexity of the function for determining the downstream path set for the guidance problem node with post-effect, the present disclosure can conveniently set the function for determining the downstream path for the guidance problem node. It can be seen that, the technical solution provided by the embodiments of the present disclosure is beneficial to reducing the maintenance difficulty of the guide problem node diagram for generating the contract, so as to improve the maintenance efficiency of the guide problem node diagram for generating the contract, and further, when the guide problem node diagram is used for generating the contract for the user, the complexity of the function for determining the downstream path of each guide problem node in the guide problem node diagram is low, so that the contract generation efficiency is improved, and the contract generation technology is easy to use.

In an alternative example, all guide problem node chains contained 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, e.g., a house lease type of contract corresponds to one contract template, a new house buy and sell type of contract corresponds to another contract template, and a second house buy and sell type of contract corresponds to yet another contract template. That is, the plurality of guide problem node chains acquired in S200 in the present disclosure all correspond to the same contract template, and the contract template, in cooperation with each guide problem node chain in the node chain set, 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 guide problem node chains contained in the node chain set in the present disclosure correspond to at least two contract templates, and different contract templates generally correspond to different types of contracts. That is, the plurality of guide problem node chains acquired in S200 in the present disclosure correspond to a plurality of contract templates, each corresponding to a part of guide problem node chains in the node chain set, and each contract template is matched with each guide problem node chain corresponding to each contract template, so that contracts of the same type can be generated for the user. The contracts generated based on the different contract templates are typically different types of contracts. In one example, a set of node chains of the present disclosure includes: the m guiding problem node chains are 1 st to m1 st, the 1 st to m2 nd, the m1+1 st to m3 rd, the m1, m2 and m3 are integers greater than or equal to 1, m is the sum of m1, m2 and m3, and m2 is greater than m1, m3 is greater than m2. 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 guide problem node chains contained in the node chain set correspond to the same contract template, the guide problem node diagram obtained by the method is more specific, so that in the process of carrying out maintenance operations such as node addition and deletion on the guide problem node diagram and node skip relation modification, the influence on the process of generating contracts based on other contract templates is avoided, namely, the scope of the maintenance operation is limited.

Under the condition that all guide problem node chains contained in the node chain set correspond to at least two contract templates, the guide problem node diagram obtained by the method is more comprehensive, and because different types of contracts possibly relate to the same guide problem node, the method is beneficial to saving storage resources consumed by the guide problem node diagram.

In one alternative example, the present disclosure may utilize directed acyclic graphs to implement node-postavailability detection. One example of the present disclosure utilizing directed acyclic graphs to implement node-postavailability detection is shown in FIG. 3.

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

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

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

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 set of node chains into one node in the graph. In one example, assume that the node chain set includes 4 bootstrap problem node chains, and the 4 bootstrap problem node chains totally involve 6 bootstrap problem nodes, respectively, node 1, node 2, node 3, node 4, node 5, and node 6, and the 4 bootstrap 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-bar guided problem node chain described above is shown in FIG. 4. The head-end node of the directed acyclic graph in fig. 4 is node 4 and nodes 2 and 5 are both end nodes of the directed acyclic graph. The directed acyclic graph shown in FIG. 4 can be considered a tree with node 4 as the root node and nodes 2 and 5 as the leaf nodes of the tree.

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

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

Alternatively, 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 generally greater than the number of bootstrap problem node chains included in the node chain set. In one example, a portion of the node paths in the path set are identical to all of the guided problem node chains in the node chain set, and another portion of the node paths in the path set are not available in the node chain set.

Continuing with the previous example, for fig. 4, all node paths included in the path set obtained by path traversal of 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, the node chain set includes 4 guide problem node chains, the path set includes 5 node paths, and 4 node paths in the path set are identical to the 4 guide problem node chains included in the node chain set, and node 4- > node 3- > node 6- > node 5 in the path set, and this node path is not included in the node chain set.

S302, according to the path set, detecting the node posteffectiveness of the guide problem node contained in the node chain set, and obtaining the guide problem node with the posteffectiveness.

Optionally, the disclosure may perform node backward validity detection on at least part of the guide problem nodes (such as all the guide problem nodes) in the node chain set based on all the node paths included in the directed acyclic graph and the guide problem node chains in the node chain set, so as to determine whether at least part of the guide problem nodes have backward validity. In the case of node postavailability detection for all bootstrap problem nodes, the present disclosure can distinguish between all bootstrap problem nodes with postavailability and all bootstrap problem nodes without postavailability (i.e., all bootstrap problem nodes without postavailability) in a node chain set.

In one example, for any bootstrap problem node in the set of node chains, the present disclosure may determine whether the bootstrap problem node has a backward validity based on a downstream node condition of the bootstrap problem node in all node paths of the set of paths and a downstream node condition of the bootstrap problem node in at least a portion of the bootstrap problem node chains of the set of node chains. For example, a guided problem node may be considered to have a backward validity if it is more downstream nodes in all node paths of the path set than in at least part of the guided problem node chain of the node chain set, otherwise it is considered to have no backward validity.

Continuing the previous example, for node 4 in fig. 4, since node 4 is downstream in all node paths of the path set, the situation is: node 3 and node 6, and node 4 directs the downstream node case in the problem node chain in a portion of the node chain set as: node 3 and node 6, therefore, node 4 can be determined to be a non-back-effect node.

Continuing the previous example, for node 6 in fig. 4, since node 6 is downstream in all node paths of the path set, the situation is: node 1 and node 5, and node 6 directs the downstream node case in the problem node chain in a portion of the node chain set as: node 5, therefore, can judge that node 6 is a boot-strap problem node with post-validity.

Since the nodes in the path set are not constrained by the function used to determine the downstream paths, the node paths contained in the path set can clearly and explicitly represent all downstream nodes of each node. If all downstream nodes of a bootstrap problem node in the path set are different from all downstream nodes of the bootstrap problem node in the corresponding bootstrap problem node chain in the node chain set, it may be stated that the post path from the bootstrap problem node to its downstream node has a correlation with the pre-path of the bootstrap problem node, so the disclosure may consider the bootstrap problem node to be a bootstrap problem node with a post effect. The method and the device realize the node posteffectiveness detection by utilizing the path set obtained by traversing the node paths of the directed acyclic graph, and are beneficial to facilitating the implementation of the node posteffectiveness detection.

In an alternative example, when performing node post-validity detection on a bootstrap problem node, the situation that the bootstrap problem node is a downstream node in the path set and the situation that the bootstrap problem node is a downstream node in the node chain set may be used to determine whether the bootstrap problem node is a bootstrap problem node with post-validity. That is, the present disclosure may determine whether the downstream node of the bootstrap problem node in the path set has an invalid downstream node by using the downstream node of the bootstrap problem node in the node chain set, and if the invalid downstream node exists, indicate that the bootstrap problem node is a bootstrap problem node with a post-validity. The downstream nodes in the set of node chains of the bootstrap problem node may be bootstrap problem node chains in the set of node chains having the same end node. The present disclosure may divide all boot-strap problem node chains in a node chain set into a plurality of subsets in units of end nodes in the node chain set, all boot-strap problem node chains in each subset having the same end node, and different subsets corresponding to different end nodes.

In one example, the disclosure may perform node postity detection in units of subsets, for example, for any subset, the disclosure may start from a head-end node of the subset, and, based on a breadth-first search manner, sequentially perform node postity detection on all guide problem nodes (such as guide problem nodes except for the head-end node and the end node) or all guide problem nodes included in all guide problem node chains in the subset by using all node paths in the path set, so as to obtain guide problem nodes with postity in the subset.

Because there is a duplication of the bootstrap problem nodes included in the bootstrap problem node chains in different subsets, any bootstrap problem node in the node chain set may be subjected to multiple node backward validity detection, for example, the first subset and the second subset each include a first bootstrap problem node, a second bootstrap problem node and a third bootstrap problem node, and if the first bootstrap problem node, the second bootstrap problem node and the third bootstrap problem node have backward validity in the process of performing the node backward validity detection on the first subset, the first bootstrap problem node, the second bootstrap problem node and the third bootstrap problem node still have backward validity in the process of performing the node backward validity detection on the second subset. In another aspect, if a bootstrap problem node should appear in two different subsets, the bootstrap problem node may be considered to appear in two different subsets in the form of two different nodes. For example, in the form of one replica of the bootstrap problem node and another replica of the bootstrap problem node, exist in two different subsets. If a bootstrap problem node is determined to be a bootstrap problem node with a postity during the node postity detection process of one subset, the present disclosure will still treat the bootstrap problem node as a bootstrap problem node with a postity, regardless of whether the bootstrap problem node is determined to be a bootstrap problem node without a postity during the node postity detection process of the other subset.

Continuing with the previous example, for FIG. 4, since the end nodes in the node chain set include: node 2 and node 5, the present disclosure may therefore divide the guided problem node chain in the set of node chains into two subsets, where the first subset includes: 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; wherein the second subset comprises: node 4- > node 6- > node 5.

For the first subset, the order of performing node-posteffectiveness detection on each boot-strap problem node based on breadth-first search may be: node 4, (node 3 and node 6), (node 2, node 5 and node 1), wherein the order of the nodes in brackets may be arbitrarily changed.

For the second subset, the order of performing node-posteffectiveness detection on each boot-strap problem node based on breadth-first search may be: node 4, node 6, node 5.

Optionally, in the process of performing node post-efficiency detection on the boot issue nodes in one subset, if one of the boot issue nodes is determined to be a boot issue node with post-efficiency, since node splitting processing needs to be performed on the boot issue node, the disclosure may not perform node post-efficiency detection on each downstream node of the boot issue node in the subset.

According to the method, the end nodes are utilized to divide the guide problem node chains in the node chain set to form a plurality of subsets, and based on the breadth-first search mode, the guide problem nodes in the subsets are sequentially subjected to the post-efficiency detection, so that the node post-efficiency detection is easy to implement, the accuracy of the node post-efficiency detection is guaranteed, and meanwhile the efficiency of the post-efficiency 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 the difference between a path set and each guide problem node chain based on the end node in a node chain set.

Optionally, the disclosure may remove each end node-based guide problem node chain in the node chain set from the path set, for example, subtracting all node paths included in the path set from all end node-based guide problem node chains in the node chain set, so as to obtain differences between the path set and each end node-based guide problem node chain in the node chain set.

Continuing with the previous example, for node 2 in FIG. 4, each bootstrap problem node chain based on node 2 in the node chain set includes: 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; 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 guide 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.

Continuing with the previous example, for node 5 in FIG. 4, each bootstrap problem node chain based on 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 guide 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, taking a guide problem node in each guide problem node chain based on the end node in the node chain set as a node to be detected based on a breadth-first search mode.

Alternatively, the present disclosure may form a tree with each guided problem node chain based on the end node in the node chain set, then, the root node of the tree (for example, node 4 in fig. 4) may be taken as a node to be detected first, next, all the nodes downstream of the root node of the tree (such as node 6 and node 3 in fig. 3) are taken as nodes to be detected in a certain order, and so on until the end node of the tree (such as node 5 or node 2) is taken as a node to be detected. In one example, the present disclosure may not perform node-post-validity detection on the root node and end node of the tree, i.e., may not have to follow and end nodes of the tree as nodes to be detected.

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

Continuing the previous example, where the end node is node 2 in fig. 4, the differences in the path set and the respective guided problem node chains based on end node 2 in the node chain set include:

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

node 4- > node 6- > node 5;

each guide problem node chain with the node 2 as an end node in the node chain set 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 downstream node set comprises: node 3 and node 6; if the node to be detected is node 3, the first downstream node set includes: node 6, the second downstream node set includes: node 2 and node 6; if the node to be detected is node 6, the first downstream node set includes: node 5, the second downstream node set includes: node 1; if the node to be detected is node 1, the first downstream node set is empty, and the second downstream node set includes: node 2.

Continuing the previous example, where the end node is node 5 in fig. 4, the differences in the path set and each guided problem node chain based on end node 5 in the node chain 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; and

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

assume that each guided problem node chain based on node 5 in the 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 downstream node set comprising: a node 6; if the node to be detected is node 6, the first downstream node set includes: node 1 and node 5, the second downstream set comprising: and node 5.

And S503, when the first downstream node set is determined not to belong to the second downstream node set, taking the node to be detected as a guide problem node with post-effectiveness.

Continuing the previous example, in the case where the present disclosure does not perform node post-validity detection on the root node, and in the case where the end node is node 2 in fig. 4, when the node to be detected is node 6, since the first downstream node set includes: node 5, while the second downstream set of nodes comprises: node 1; thus, the present disclosure may treat node 6 as a bootstrapping problem node with post-effectiveness.

Continuing the previous example, in the case where the present disclosure does not perform node post-validity detection on the root node, and in the case where the end node is node 2 in fig. 4, when the node to be detected is node 6, since the first downstream node set includes: node 1 and node 5, while the second downstream set comprises: a node 5; thus, the present disclosure may treat node 6 as a bootstrapping problem node with post-effectiveness.

According to the method and the device, the difference of the end node-based guide problem node chains in the path set and the node chain set is obtained, the difference and the end node-based guide problem node chains in the node chain set can be conveniently utilized, and the first downstream node set and the second downstream node set are obtained, so that the guide problem node with the rear effectiveness can be conveniently determined through comparison of the first downstream node set and the second downstream node set, and further the efficient and accurate detection of the rear effectiveness of the node is facilitated.

In one alternative example, the present disclosure may form split nodes for each backward-active bootstrap problem node separately, and update the backward-active bootstrap problem nodes in the corresponding bootstrap problem chains in the node chain set to the split nodes. The corresponding boot issue chain herein may refer to a portion of all boot issue chains in the set of node chains that contain boot issue nodes with a back effect.

In the previous example, since node 6 is detected as a boot-strap problem node with a post-validity, the present disclosure may form node 6' for node 6 and replace node 6 in the boot-strap problem node chain, node 4- > node 6- > node 5, with node 6' to form node 4- > node 6' - > node 5.

According to the method and the device, split nodes of the guide problem nodes with the rear effectiveness are formed, the split nodes are used for replacing the guide problem nodes with the rear effectiveness in the corresponding guide problem chains in the node chain set, the problem that the guide problem chains of the node chain set have the guide problem nodes with the rear effectiveness is solved, and therefore a guide problem node diagram can be formed conveniently by setting functions for determining downstream paths for the guide problem nodes in the updated node chain set.

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

In one example, the function used to determine the downstream path in the present disclosure may be expressed in the form of y=f (x), where for any guided problem node, x represents information of the guided problem node, and is no longer required to represent a set of all pre-paths of the guided problem node, and y represents a set of possible post-nodes of the guided problem node calculated from the guided problem node, and is no longer required to represent a set of possible post-nodes of the guided problem node calculated from a set of all pre-paths of the guided problem node. The front-end path is the path from the root node of the guide problem node graph to the guide problem node, and the back-end node is the downstream node.

Because the arguments of the function for determining the downstream path of the guide problem node in the present disclosure may be the options of the questions corresponding to the node, and the set of all the pre-paths representing the guide problem node is not needed, the present disclosure greatly simplifies the arguments of the function for determining the downstream path of each guide problem node in the guide problem node graph, that is, when the function for determining the downstream path of the guide problem node is set, all the pre-paths of the guide problem node may not be considered, so that the difficulty of setting the function for determining the downstream path for the guide problem node is greatly reduced, and the dimensional efficiency of the guide problem node graph is further improved.

In one alternative example, the present disclosure may store the boot issue node map in a database. That is, the present disclosure may store information related to each boot issue node in the boot issue node map in a database. The information related to each bootstrap problem node in the present disclosure may include: the method comprises the steps of selecting a question stem in a question corresponding to the guiding question node, selecting all options in the question corresponding to the guiding question node and determining a function of the guiding question node for determining a downstream path.

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

Assume that the boot issue node graph that needs to be obtained by the present disclosure involves 10 boot issue nodes, and is respectively node 1, node 2, node 3, node 4, node 5, node 6, node 7, node 8, node 9, and node 10; assume that the node chain set (i.e., set a) obtained by the present disclosure includes seven guide problem node chains, respectively:

node 1- > node 2- > node 4- > node 5;

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

node 1- > node 3- > node 6- > node 7- > node 9;

node 1- > node 3- > node 6- > node 7- > node 8- > node 9;

Node 1- > node 2- > node 4- > node 8- > node 10;

node 1- > node 2- > node 4- > node 6- > node 7- > node 8- > node 10;

node 1- > node 3- > node 6- > node 7- > node 8- > node 10;

since the seven bootstrap problem node chain described above includes three end nodes, the present disclosure may divide set a into three subsets, which are respectively: subset A ₅ Subset A ₉ Subset a ₁₀ . Of which subset A ₅ Comprising 1 chain of bootstrap problem nodes, i.e. node 1->Node 2-)>Node 4-)>A node 5; of which subset A ₉ Comprising a chain of 3 bootstrap 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; of which subset A ₁₀ Comprising a chain of 3 bootstrap 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-)>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, three subsets may correspond to different types of contracts, such as subset A ₅ Corresponds to one type of contract and corresponds to a contract template, subset A ₉ Corresponds to another type of contract and to another contract template, subset A ₁₀ Corresponds to yet another type of contract and corresponds to yet another contract template.

The directed acyclic graph formed by the 10 nodes described above and the 7 guided problem node chain described above 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 a path traversal of the directed acyclic graph shown in FIG. 6, a set B can be obtained that includes the following 8 guide problem node chains:

node 1- > node 2- > node 4- > node 5;

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

node 1- > node 2- > node 4- > node 8- > node 10;

node 1- > node 2- > node 4- > node 6- > node 7- > node 8- > node 10;

node 1- > node 2- > node 4- > node 6- > node 7- > node 8- > node 9;

node 1- > node 3- > node 6- > node 7- > node 9;

node 1- > node 3- > node 6- > node 7- > node 8- > node 9;

node 1- > node 3- > node 6- > node 7- > node 8- > node 10;

For node 5, the end node, the present disclosure may calculate set B and subset a ₅ Form the set A 'by the difference of (2)' ₅ Set A' ₅ The method comprises the following steps of guiding a problem node chain:

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

node 1- > node 2- > node 4- > node 8- > node 10;

node 1- > node 2- > node 4- > node 6- > node 7- > node 8- > node 10;

node 1- > node 2- > node 4- > node 6- > node 7- > node 8- > node 9;

node 1- > node 3- > node 6- > node 7- > node 9;

node 1- > node 3- > node 6- > node 7- > node 8- > node 9;

node 1- > node 3- > node 6- > node 7- > node 8- > node 10;

if the present disclosure does not perform node-post-efficiency detection for the head-end node and the end node, the present disclosure first performs node-post-efficiency detection for node 2, and then performs node-post-efficiency detection for node 4.

Node 2 is in set A' ₅ Comprising: the node (4) is provided with a node,node 2 is in subset a ₅ Comprising: 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 bootstrap problem node with post-efficiency.

Node 4 is in set A' ₅ The first downstream node set formed by all downstream nodes in (a) comprises: node 6 and node 8, node 4 being in subset a ₅ The second downstream node set formed by all downstream nodes in (a) includes: a node 5; since neither node 6 nor node 8 belongs to the second downstream node set, node 4 is a bootstrapping problem node with a back-effect, and the present disclosure may split node 4 into node 4 and node 4'. The downstream nodes of node 4 are node 5, and the downstream nodes of node 4' are node 6 and node 8.

For node 9, the end node, the present disclosure may calculate set B and subset a ₉ Form the set A 'by the difference of (2)' ₉ Set A' ₉ The method comprises the following steps of guiding a problem node chain:

node 1- > node 2- > node 4- > node 5;

node 1- > node 2- > node 4- > node 8- > node 10;

node 1- > node 2- > node 4- > node 6- > node 7- > node 8- > node 10;

node 1- > node 2- > node 4- > node 6- > node 7- > node 8- > node 9;

node 1- > node 3- > node 6- > node 7- > node 8- > node 10;

if the present disclosure does not perform node postavailability detection on the head end node and the end node, the present disclosure first performs node postavailability detection on (node 2 and node 3), then performs node postavailability detection on (node 4 and node 6), then performs node postavailability detection on node 7, and finally performs node postavailability detection on node 8.

Node 2 is in set A' ₉ Comprising: node 4, node 2 in subset A ₉ Comprising: a node 4; due toAll nodes contained in the first downstream node set belong to the second downstream node set, and therefore node 2 is not a bootstrap problem node with post-efficiency.

Node 3 is in set A' ₉ Comprising: node 6, node 3 in subset A ₉ Comprising: 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 bootstrap problem node with post-efficiency.

Node 4 is in set A' ₉ Comprising: node 5, node 6 and node 8, node 4 being in subset a ₉ Comprising: a node 6; since neither node 5 nor node 8 belongs to the second downstream node set, node 4 is a bootstrapping problem node with a back-effect, and the present disclosure may split node 4 into node 4 and node 4'. The downstream nodes of node 4 are node 5, and the downstream nodes of node 4' are node 6 and node 8.

Since node 6 and node 8 are both downstream nodes of node 4 and node 7 is a downstream node of node 6, the present disclosure may not perform node-post-effectiveness detection on node 6, node 7, and node 8 after determining that node 4 is a boot-strap problem node with post-effectiveness.

For this end node of node 10, the present disclosure may calculate set B and subset A ₁₀ Form the set A 'by the difference of (2)' ₁₀ Set A' ₁₀ The method comprises the following steps of guiding a problem node chain:

node 1- > node 2- > node 4- > node 5;

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

node 1- > node 2- > node 4- > node 6- > node 7- > node 8- > node 9;

node 1- > node 3- > node 6- > node 7- > node 9;

node 1- > node 3- > node 6- > node 7- > node 8- > node 9;

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

Node 2 is in set A' ₁₀ Comprising: node 4, node 2 in subset A ₁₀ Comprising: 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 bootstrap problem node with post-efficiency.

Node 3 is in set A' ₁₀ Comprising: node 6, node 3 in subset A ₁₀ Comprising: 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 bootstrap problem node with post-efficiency.

Node 4 is in set A' ₁₀ Comprising: node 5 and node 6, node 4 being in subset a ₁₀ Comprising: node 6 and node 8; since node 5 does not belong to the second set of downstream nodes, node 4 is a bootstrapping problem node with post-efficiency, and the present disclosure can split node 4 into node 4 and node 4'. The downstream nodes of node 4 are node 5, and the downstream nodes of node 4' are node 6 and node 8.

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

Fig. 7 is a schematic diagram of an embodiment of an apparatus for generating contracts of the present disclosure. The apparatus for generating a contract of this embodiment may be used to implement the above-described method embodiments of the present disclosure for generating a contract.

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

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

The determine current questions module 701 is configured to determine the current questions according to the combination of questions determined by the determining template and combining module 700.

The page presentation module 702 is configured to provide a page that includes both the current question determined by the current question determination module 701 and the current contract determined by the determination template and combination module 700 to the user.

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

The update current contract module 704 is configured to update the current contract according to the contract content unit and the location determined by the determining unit and the location module 703.

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

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

The generation contract module 705 is configured to, if it is determined that there is a next question associated with the answer information of the current question according to the combination of the questions determined by the determination template and the combination module 700, take the next question as the current question, and trigger the page display module 702 to perform an operation of providing a page that includes both the current question and the current contract to the user; if it is determined from the combination of questions that there is no next question associated with the answer information of the current question, the generate contract 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 generate contract module 705 provides the user with an edit page that contains the above-described contract, and the content of the contract is editable.

In one example, the generate contract module 705 may update the contract according to contract content editing operations performed by the user based on the editing page.

In one alternative example, the problem combinations of the present disclosure include: a boot-strap issue node graph, the boot-strap issue node graph comprising: a plurality of guidance problem nodes each provided with a function for determining a downstream path, the plurality of guidance problem nodes including: and after node splitting treatment is carried out on the guide problem node with the post-effectiveness, the split node is obtained. In one example, the determine current question module 701 is further configured to use a boot question corresponding to the head-end node in the boot question node map as the current question.

The form node chain aggregation module 706 is configured to obtain a plurality of guide problem node chains for generating contracts, and form a node chain aggregation.

In one example, the form node chain aggregation module 706 may obtain a plurality of guide problem node chains for generating contracts of the same type from the same contract template, forming a node chain aggregation.

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

The node post-efficiency detection module 707 is configured to perform node post-efficiency detection on the bootstrap problem nodes included in the node chain set acquired by the node chain set forming module 706, so as to obtain the bootstrap problem node with post-efficiency. Optionally, the node post-validity detection module 707 may include: a first sub-module 7071, a second sub-module 7072, and a third sub-module 7073. The first submodule 7071 is configured to generate a directed acyclic graph according to all the guide problem nodes included in each guide problem node chain in the node chain set and a skip relation among all the guide problem nodes. The second submodule 7072 is configured to obtain a node path included in the directed acyclic graph, and obtain a path set. For example, the second submodule 7072 obtains all node paths included in the directed acyclic graph by performing path traversal on the directed acyclic graph, and forms a path set. The third submodule 7073 is configured to perform node posteffectiveness detection on the bootstrap problem node included in the node chain set according to the path set, so as to obtain the bootstrap problem node with posteffectiveness. For example, for any end node, the third submodule 7073 may perform, according to the path set, based on the breadth-first search, sequentially performing node backward validity detection on the boot issue nodes in each boot issue node chain based on the end node in the node chain set, to obtain a boot issue node with backward validity based on the end node.

In one example, the third sub-module 7073 may include a first unit, a second unit, a third unit, and a fourth unit. The first unit is used for acquiring differences between the path set and each guide problem node chain based on the end node in the node chain set. The second unit is configured to take a bootstrap problem node in each bootstrap problem node chain based on the end node in the node chain set as a node to be detected in a breadth-first search mode. The third unit is used for acquiring a first downstream node set of the node to be detected in the difference and acquiring a second downstream node set of the node to be detected in each guide problem node chain based on the end node. And the fourth unit is used for taking the node to be detected as a guiding problem node with post-effectiveness when the first downstream node set is determined not to belong to the second downstream node set.

The node splitting processing module 708 is configured to perform node splitting processing on the guided problem node with the post-efficiency obtained by the node post-efficiency detecting module 707. In one example, for any post-active bootstrap problem node, the node split processing module 708 forms a split node of the post-active bootstrap problem node and updates the post-active bootstrap problem node in the partial bootstrap problem chain containing the post-active bootstrap problem node in the node chain set to the split node.

The setting function module 709 is configured to set functions for determining downstream paths for a plurality of bootstrap problem nodes including the bootstrap problem node after the node splitting process, respectively, and obtain a bootstrap problem node map for generating a contract. In one example, for any guiding problem node, the function setting module 709 is configured to set, for the guiding problem node, a function for determining a downstream path, with each option of a topic corresponding to the guiding problem node as an argument, and with all downstream nodes of the guiding problem node as arguments.

In addition, the embodiment of the disclosure also provides an electronic device, which comprises: a memory for storing a computer program; and a processor configured to execute the computer program stored in the memory, and when the computer program is executed, implement the method for generating a contract according to any one of the embodiments of the disclosure.

In addition, the embodiment of the present disclosure further provides a computer readable storage medium, on which a computer program is stored, where the computer program is executed by a processor, to implement the method for generating a contract according to any one of the foregoing embodiments of the present disclosure.

Fig. 8 is a schematic structural diagram of an application embodiment of the electronic device of the present disclosure. Next, an electronic device 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 independent thereof, which 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 and/or instruction execution capabilities, and may control other components in the electronic device to perform the 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) and/or cache memory (cache), and the like. The non-volatile memory may include, for example, read Only Memory (ROM), hard disk, flash memory, and the like. One or more computer program instructions may be stored on the computer readable storage medium that can be executed by a processor to implement the methods for generating contracts and/or other desired functions of the various embodiments of the present disclosure described above.

In one example, the electronic device may further include: input devices and output devices, which are interconnected by a bus system and/or other forms of connection mechanisms (not shown). In addition, the input device may include, for example, a keyboard, a mouse, and the like. The output device may output various information including the determined distance information, direction information, etc., 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, etc. Of course, only some of the components of the electronic device relevant to the present disclosure are shown in fig. 8, components such as buses, input/output interfaces, and the like are omitted for simplicity. In addition, the electronic device may include 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 which, when executed by a processor, cause the processor to perform the steps in the method for generating contracts according to the various embodiments of the present disclosure described in the above section of the specification. The computer program product may write program code for performing the operations of 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, 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, which when executed by a processor, cause the processor to perform the steps in the method for generating contracts according to the various embodiments of the present disclosure described in the above section of the present disclosure.

The computer readable storage medium may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. The readable storage medium may include, for example, but is 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 would include the following: an electrical connection having one or more wires, a portable disk, a hard disk, random Access Memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

The basic principles of the present disclosure have been described above in connection with specific embodiments, however, it should be noted that the advantages, benefits, effects, etc. mentioned in the present disclosure are merely examples and not limiting, and these advantages, benefits, effects, etc. are not to be considered as necessarily possessed by the various embodiments of the present disclosure. Furthermore, the specific details disclosed herein are for purposes of illustration and understanding only, and are not intended to be limiting, since the disclosure is not necessarily limited to practice with the specific details described.

In this specification, each embodiment is described in a progressive manner, and each embodiment is mainly described in a different manner from other embodiments, so that the same or similar parts between the embodiments are mutually referred to. For system embodiments, the description is relatively simple as it essentially corresponds to method embodiments, and reference should be made to the description of method embodiments for relevant points. The block diagrams of the devices, apparatuses, devices, systems referred to in this disclosure are merely illustrative examples and are not intended to require or imply that the connections, arrangements, configurations must be made in the manner shown in the block diagrams. As will be appreciated by one of skill in the art, the devices, apparatuses, devices, systems may be connected, arranged, configured in any manner. Words such as "including," "comprising," "having," and the like are words of openness and mean "including but not limited to," and are used interchangeably therewith. The terms "or" and "as used herein refer to and are used interchangeably with the term" and/or "unless the context clearly indicates otherwise. The term "such as" as used herein refers to, 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, firmware. The above-described sequence of steps for the method is for illustration only, and the steps of the method of the present disclosure are not limited to the sequence specifically described above unless specifically stated otherwise. Furthermore, in some embodiments, the present disclosure may also be implemented 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 apparatus, devices and methods of the present disclosure, components or steps may be disassembled and/or assembled. Such decomposition and/or recombination should be considered equivalent to 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 the embodiments of the disclosure to the form disclosed herein. Although a number of example aspects and embodiments have been discussed above, a person of ordinary skill in the art will recognize certain variations, modifications, alterations, additions, and subcombinations thereof.

Claims

1. A method for generating a contract, comprising:

according to information input by a user and used for selecting contract types, determining a contract template and a problem combination corresponding to the contract to be generated, 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 for the user;

determining a contract content unit corresponding to the reply information of the current question and a position associated with the contract content unit in the contract template according to the reply 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 answer information of the current question exists according to the question combination, the next question is taken as the current question, and the step of providing the page containing the current question and the current contract for the user is returned;

And if the fact that the next question associated with the answer information of the current question does not exist is determined 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.

2. The method of claim 1, wherein said updating said current contract based on said contract content unit and said 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, wherein said updating said current contract based on said contract content unit and said 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. A method according to claim 3, wherein said deleting conflicting contract content units in said current contract comprises:

and setting the display format information of the conflict contract content unit as preset deletion mark display format information so that the conflict contract content unit is displayed in the page in the form of a deletion mark.

5. The method of claim 1, wherein the providing the page containing the contract to the user comprises:

providing an editing page containing the contract and having editable contents of the contract to the user;

the method further comprises the steps of:

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

6. The method of any one of claims 1 to 5, wherein the problem combination comprises: a boot-strap issue node graph, the boot-strap issue node graph comprising: a plurality of bootstrap problem nodes, each of the plurality of bootstrap problem nodes being provided with a function for determining a downstream path, and the plurality of bootstrap problem nodes comprising: after node splitting treatment is carried out on the guide problem node with the post-effectiveness, splitting nodes are obtained;

The determining the current problem according to the problem combination comprises the following steps:

and taking the guide problem corresponding to the head-end node in the guide problem node diagram as the current problem.

7. The method of claim 6, wherein the setting of the guidance problem node map includes:

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

detecting the node posteffectiveness of the guide problem nodes contained in the node chain set, and obtaining the guide problem nodes with the posteffectiveness;

carrying out node splitting treatment on the guide problem node with the post-effectiveness;

and respectively setting functions for determining downstream paths for a plurality of guide problem nodes including the guide problem nodes after node splitting processing, and obtaining a guide problem node diagram for generating contracts.

8. The method of claim 7, wherein performing node postavailability detection on the bootstrap problem nodes included in the node chain set to obtain the bootstrap problem nodes with postavailability comprises:

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

Acquiring node paths contained in the directed acyclic graph, and acquiring a path set;

and detecting the node posteffectiveness of the guide problem node contained in the node chain set according to the path set, and obtaining the guide problem node with the posteffectiveness.

9. An apparatus for generating a contract, comprising:

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

the current problem determining module is used 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 problem 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 reply information of the current question and a position associated with the contract content unit in the contract template according to the reply information of the current question input by the user;

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

A generation contract module, configured to, if it is determined according to the question combination that there is a next question associated with the answer information of the current question, take the next question as the current question, and trigger the page display module to execute an operation of providing a page that includes both the current question and the current contract to the user; and if the fact that the next question associated with the answer information of the current question does not exist is determined 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.

10. The apparatus of claim 9, wherein the problem combination comprises: a boot-strap issue node graph, the boot-strap issue node graph comprising: a plurality of bootstrap problem nodes, each of the plurality of bootstrap problem nodes being provided with a function for determining a downstream path, and the plurality of bootstrap problem nodes comprising: after node splitting treatment is carried out on the guide problem node with the post-effectiveness, splitting nodes are obtained;

the determine current problem module is further to:

11. The apparatus of claim 10, wherein the apparatus further comprises: means for setting the guidance problem node map, the means for setting the guidance problem node map comprising:

the node chain collection forming module is used for obtaining a plurality of guide problem node chains for generating contracts to form a node chain collection;

the node post-efficiency detection module is used for detecting the post-efficiency of the nodes of the guide problem contained in the node chain set to obtain the guide problem nodes with the post-efficiency;

the node splitting processing module is used for carrying out node splitting processing on the guide problem node with the post-effectiveness;

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

12. An electronic device, comprising:

a memory for storing a computer program;

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

13. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the method of any of the preceding claims 1-8.