A full-featured table implementation method supporting voice search

By using a dynamic cache stack and relational lookup table, the problem of users not knowing when to call complex functions in spreadsheet software is solved, and voice prompts are provided without affecting performance, thus improving office efficiency.

CN114428785BActive Publication Date: 2025-12-09FUJIAN MAHENGDA INFORMATION TECH CO LTD
View PDF 3 Cites 0 Cited by

Patent Information

Application Number
CN202111527307.3
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2021-12-14
Publication Date
2025-12-09
Estimated Expiration
2041-12-14

AI Technical Summary

Technical Problem

In spreadsheet software, beginners often find it difficult to know when to access complex functions, leading to low work efficiency. Existing technology has failed to effectively assist users in utilizing the full range of software features.

Method used

The table operation data is stored in a dynamic cache stack. It is determined whether there are related voice assistance functions, and when the stack is full, the user is prompted with the available voice activation commands. A relationship table between table operations and voice assistance functions is pre-established, and the storage space of the cache stack is dynamically adjusted.

Benefits of technology

It enables timely voice prompts without increasing the system's data processing burden, helping users fully utilize the spreadsheet software's full range of functions and improve office efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114428785B_ABST
    Figure CN114428785B_ABST
Patent Text Reader

Abstract

The application provides a full-function table implementation method supporting voice search, and belongs to the technical field of intelligent voice interaction. The method comprises the following steps: sequentially storing multiple table operation data of a user into a cache stack according to operation time sequence; obtaining at least one table operation data from the cache stack when the cache stack is full; judging whether there is an associated voice auxiliary function based on the table operation data; and if there is a voice auxiliary function, prompting the current user. The storage space of the cache stack is adjustable; if it is judged that there is no associated voice auxiliary function, the storage space of the cache stack is increased, otherwise, the storage space of the cache stack is reduced. The application also provides a human-computer interaction terminal and a computer readable storage medium for implementing the method. The application applies a dynamic cache stack to table software and stores table operation data to execute dynamic semantic auxiliary identification, so that voice auxiliary prompts can be given in time while the data processing amount is reduced.
Need to check novelty before this filing date? Find Prior Art

Description

TECHNICAL FIELD

[0001] The present application belongs to the technical field of intelligent voice interaction, and particularly relates to a full-function table implementation method supporting voice search, a human-computer interaction terminal implementing the method, and a computer readable storage medium. BACKGROUND

[0002] Intelligent voice is an important part of artificial intelligence technology, including voice recognition, semantic understanding, natural language processing, voice interaction, etc. Intelligent voice, i.e. voice information interaction between man and machine, is one of the core technologies of artificial intelligence and one of the earliest technologies of artificial intelligence landing. Voice search is a search instruction issued in a voice manner to assist users in completing corresponding operations.

[0003] Intelligent voice applications are booming in two directions: consumer and enterprise. Consumer applications include smart life scenarios, smart home scenarios, and smart driving scenarios; enterprise applications include smart education scenarios, smart medical scenarios, and intelligent call / customer service scenarios applied to telecommunications / finance / e-commerce scenarios.

[0004] Table processing software is the most common office software. Many table processing software is powerful and can complete complex calculations, statistics, and visualization functions. However, for beginners, they usually do not know about these complex functions; even if they know about these functions, they may not know when to call these functions, so that many functions of office software, especially table processing software, are not fully utilized, resulting in low office efficiency.

[0005] Therefore, how to give auxiliary prompts in time according to the operation habits of users during office processing, especially during the use of table processing software, without increasing the system data processing burden (which may affect the response speed of the table processing software itself), has become a technical problem that technicians in the field need to solve. SUMMARY

[0006] To solve the above technical problems, the present application provides a full-function table implementation method supporting voice search, a human-computer interaction terminal implementing the method, and a computer readable storage medium.

[0007] The technical solution of the present application first stores a plurality of table operation data of a user in a cache stack in sequence according to operation time sequence; when the cache stack is full, at least one table operation data is obtained from the cache stack; based on the table operation data, it is determined whether there is an associated voice assistance function; if there is a voice assistance function, the current user is prompted, and the storage space of the cache stack is adjustable.

[0008] Specifically, in the first aspect of the present application, a full-featured table implementation method supporting voice search is provided. The method comprises the following steps:

[0009] obtaining the current table operation of the user;

[0010] judging whether there is an associated voice auxiliary function based on the table operation;

[0011] if there is a voice auxiliary function, prompting the current user;

[0012] wherein the obtaining the current table operation of the user specifically comprises:

[0013] storing the multiple table operation data of the user in sequence according to the operation time sequence to the cache stack;

[0014] when the cache stack is full, obtaining at least one table operation data from the cache stack.

[0015] In the above method, a relationship table of table operation and voice auxiliary function needs to be established in advance, and the relationship table can be dynamically updated.

[0016] when the cache stack is full, determining the target table operation data from the cache stack, and then judging whether there is a voice auxiliary function corresponding to the target table operation data in the relationship table;

[0017] if yes, prompting the current user that there is a voice auxiliary function currently, and prompting the voice activation instruction;

[0018] if no, determining the target table operation data from the cache stack again, and repeating the above steps.

[0019] Specifically, when the cache stack is full, obtaining the table operation data not obtained currently from the cache stack as the target table operation data;

[0020] judging whether there is a voice auxiliary function corresponding to the target table operation data in the relationship table;

[0021] if yes, prompting the current user;

[0022] if no, obtaining the next table operation data not obtained from the cache stack, associating the next table operation data not obtained with the table operation data obtained currently, and taking the next table operation data not obtained as the target table operation data, returning to execute the step of judging whether there is a voice auxiliary function corresponding to the target table operation data in the relationship table until all the table operation data in the cache stack are obtained.

[0023] In this process, once there is a voice assistant function corresponding to the target table operation data in the relationship table, the current user is prompted while the cache stack is emptied.

[0024] As a further improvement, the storage space of the cache stack is adjustable, and the storage space size has an upper limit value and a lower limit value.

[0025] Specifically, if it is determined that there is no associated voice assistant function, the storage space of the cache stack is increased, otherwise the storage space of the cache stack is reduced.

[0026] To implement the above method steps, in a second aspect of the present application, a human-computer interaction terminal is provided, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the above steps when executing the computer program.

[0027] In a fourth aspect of the present application, a data storage medium, such as a computer readable storage medium, is provided, which stores a computer program, wherein the computer program is executed by a processor to implement the above steps.

[0028] The present application applies a dynamic cache stack to table software and stores table operation data to perform dynamic semantic auxiliary recognition, which can capture user operation data in time to give voice assistance prompts while reducing data processing amount, and the outstanding advantages will make full use of and embody the full function items of the table.

[0029] Further advantages of the present application will be further embodied in detail in the specific embodiment part in combination with the drawings of the specification. BRIEF DESCRIPTION OF DRAWINGS

[0030] In order to more clearly illustrate the technical solutions in the embodiments of the present application or the prior art, the drawings needed in the embodiments will be briefly introduced below. Obviously, the drawings in the following description are only some embodiments of the present application, and other drawings can be obtained by those skilled in the art without creative labor on the basis of these drawings.

[0031] Figure 1 is a main step flow chart of a full-function table implementation method supporting voice search according to an embodiment of the present application;

[0032] Figures 2-3 is Figure 1 is a further preferred embodiment of the method;

[0033] Figure 4 is Figure 1 is a schematic diagram of the principle of dynamically updating the cache stack in the method;

[0034] Figure 5 is Figure 1 The principle diagram of dynamically updating the relationship contrast table in the method is shown in the figure.

[0035] Figure 6 The structure diagram of the electronic device for implementing the technical scheme of the application is shown in the figure DETAILED DESCRIPTION

[0036] The application will be further described below in combination with the drawings and the specific embodiments.

[0037] Referring to Figure 1 is the main step flow chart of a full-featured table implementation method supporting voice search according to an embodiment of the application.

[0038] For convenience of description, the steps of Figure 1 are added with step numbers as follows: Figure 1

[0039] S1: obtaining the current table operation of the user;

[0040] S2: judging whether there is an associated voice auxiliary function based on the table operation;

[0041] S3: if there is a voice auxiliary function, prompting the current user that there is a usable voice auxiliary function at present and prompting the voice activation instruction;

[0042] The step S1 of obtaining the current table operation of the user is specifically implemented as:

[0043] S101: sequentially storing the multiple table operation data of the user to the cache stack according to the operation time sequence;

[0044] S102: judging whether the cache stack is full, if yes, entering step S103; otherwise, returning to step S101;

[0045] S103: obtaining at least one table operation data from the cache stack.

[0046] It can be seen that the embodiment of the application does not perform recognition for each table operation of the user, which will significantly increase the data processing pressure of the system and affect the performance of the table processing software itself.

[0047] On the contrary, the application adopts the cache stack to sequentially store the multiple table operation data of the user, and performs subsequent processing only after the cache stack is full, thereby avoiding frequent data recognition and interaction.

[0048] ​Meanwhile, the above improvement of the embodiment also fully considers the actual use scene of the table processing software itself. When operating the table processing software, a single operation itself does not have auxiliary significance, and therefore it is unnecessary to perform a subsequent operation for a single table operation, but a continuous multiple operations need to be collected and then recognized.

[0049] In Figure 1 On the basis of Figures 2-5 The further preferred implementation details or implementation principles of the above respective steps are respectively given. For the convenience of description, the following will be in the form of different embodiments, and multiple different embodiments under the overall flow will be listed. Figure 1

[0050] The method of the first embodiment includes the following steps, which can be seen from Figure 2 :

[0051] S100: a relationship table of table operations and voice auxiliary functions is established in advance;

[0052] S101: multiple table operation data of a user is sequentially stored into a cache stack according to operation time sequence;

[0053] S102: whether the cache stack is full is judged, if yes, step S103 is entered; otherwise, step S101 is returned;

[0054] S103: current table operation data is obtained from the cache stack as target table operation data;

[0055] S104: whether the relationship table has a voice auxiliary function corresponding to the target table operation data is judged, if yes, the current user is prompted.

[0056] In the embodiment, a relationship table of table operations and voice auxiliary functions is established in advance.

[0057] Preferably, in the relationship table, one voice auxiliary function corresponds to at least one table operation;

[0058] More preferably, in the relationship table, one voice auxiliary function corresponds to multiple continuous table operations.

[0059] As an example of table operations, the continuous table operations may be, for example, opening-inserting-picture-displaying picture address, etc.

[0060] Therefore, the multiple table operation data stored into the cache stack can be "opening-inserting-picture-displaying picture address"

[0061] On this basis, in the embodiment, the target table operation data can be "opening";

[0062] In​Figure 2 Based on the first embodiment, a second embodiment is further proposed, comprising the following steps:

[0063] S100: pre-establishing a relationship table between table operation and voice auxiliary function;

[0064] S101: sequentially storing multiple table operation data of the user into the cache stack according to operation time sequence;

[0065] S102: judging whether the cache stack is full, if yes, entering step S103; otherwise, returning to step S101;

[0066] S103: determining target table operation data from the cache stack;

[0067] Specifically, when the target table operation data is determined from the current cache stack for the first time, the table operation data that has not been obtained from the cache stack (i.e. the first stackable table operation data of the cache stack) is obtained as the target table operation data;

[0068] Taking the first embodiment as an example, at this time, the target table operation data is "displaying picture address";

[0069] It should be pointed out that the various embodiments of the present application use "stack" storage, rather than queue storage or other storage methods.

[0070] This is because the stack is a first-in-last-out structure, while the queue is a first-in-first-out structure.

[0071] In the scenario of the present application, each time the table operation data needs to be the latest user operation, i.e. the last one in needs to be the first one out, therefore, in order to meet this need, the present application adopts stack storage, which is one of the specific improvements of the present application for table operation itself.

[0072] S104: judging whether there is voice auxiliary function corresponding to the target table operation data in the relationship table;

[0073] If yes, prompting the current user that there is voice auxiliary function at present, and prompting the voice activation instruction;

[0074] If no, executing the following step S105.

[0075] S105: obtaining the next table operation data that has not been obtained from the cache stack, associating the next table operation data that has not been obtained with the table operation data that has been obtained, and taking the associated table operation data as the target table operation data, returning to step S104.

[0076] Taking the example of the first embodiment above, at this time, the target table operation data is "picture - display picture address";

[0077] Supposing that there is only the matching relationship between the continuous table operation "open - insert - picture - display picture address" and the voice auxiliary function in the relationship table, the above steps are executed in a loop until the target table operation data is determined as "open - insert - picture - display picture address".

[0078] In this process, once there is a voice auxiliary function corresponding to the target table operation data in the relationship table, the current user is prompted while the cache stack is emptied;

[0079] As an example, prompting the current user can be that the current user is prompted through a pop-up window with a certain transparency that there is a voice auxiliary function available at present, and the continuous table operation "open - insert - picture - display picture address" can be called through voice input, and the activation password for voice input calling is "activate insert picture".

[0080] Alternatively, after all the table operation data in the current cache stack is acquired, the cache stack is emptied.

[0081] On the basis of the first embodiment or the second embodiment, the third embodiment of the method is further proposed, comprising the following steps:

[0082] S100: a relationship table of table operation and voice auxiliary function is established in advance;

[0083] S101: a plurality of table operation data of the user is stored in the cache stack in sequence according to the operation time sequence;

[0084] S102: it is judged whether the cache stack is full, if yes, step S103 is entered; otherwise, step S101 is returned;

[0085] S103: target table operation data is determined from the cache stack;

[0086] S104: it is judged whether there is a voice auxiliary function corresponding to the target table operation data in the relationship table;

[0087] If yes, the storage space of the cache stack is reduced and the cache stack is emptied, and step S101 is returned;

[0088] Otherwise, the storage space of the cache stack is increased, and step S101 is returned.

[0089] Figure 3 Part of the flow chart of the third embodiment is shown.

[0090] As a further improvement, the storage space of the cache stack is adjustable, and the storage space size has an upper limit value and a lower limit value.

[0091] Specifically, if there is no associated voice assistance function, the storage space of the cache stack is increased, otherwise the storage space of the cache stack is reduced.

[0092] The further effect of the above improvement is that the matching between the current user's operation and the voice assistance function can be captured in real time.

[0093] When the matching is further improved, the cache space can be reduced to provide assistance functions more quickly; when the matching is reduced, the cache space can be increased to capture more user operations before attempting to match.

[0094] Specifically, on the basis of the first embodiment, the second embodiment or the third embodiment, the fourth embodiment of the method is further proposed, comprising the following steps:

[0095] S100: A table of operation and voice assistance function relationship table is established in advance;

[0096] S101: A plurality of table operation data of the user is sequentially stored in the cache stack according to the operation time sequence;

[0097] S102: It is judged whether the cache stack is full, if yes, step S103 is entered; otherwise, step S101 is returned;

[0098] S103: Target table operation data is determined from the cache stack;

[0099] S104: It is judged whether there is a voice assistance function corresponding to the target table operation data in the relationship table;

[0100] If there is a voice assistance function corresponding to the target table operation data in the relationship table, the storage space of the cache stack is reduced;

[0101] When the storage space of the cache stack reaches the lower limit value, the following operations are performed:

[0102] After obtaining the current table operation of the user in real time, the next table operation of the user is predicted;

[0103] Based on the predicted next table operation of the user, it is judged whether there is an associated voice assistance function;

[0104] If there is a voice assistance function, the current user is prompted that there is a usable voice assistance function, and a voice activation instruction is prompted.

[0105] The above improvement makes the cache space directly capture the user's every operation after the lower limit value is reached and the high matching degree still exists, and no longer waits for the cache stack to be full, which can further improve the user experience.

[0106] Figure 5 Part of the schematic shows this process.

[0107] In another aspect, if the voice assistance function corresponding to the target table operation data does not exist in the relationship table, the storage space of the cache stack is increased.

[0108] When the storage space of the cache stack reaches the upper limit value, the step of judging whether the associated voice assistance function exists is stopped.

[0109] At this time, the user's multiple table operation data is still stored in the cache stack in the order of operation time sequence, and when the cache stack is full, it is sent to the background analysis for updating the relationship table of the table operation and the voice assistance function.

[0110] The above improvement makes the cache space directly capture the user's every operation after the lower limit value is reached and the high matching degree still exists, and no longer waits for the cache stack to be full, which can further improve the user experience.

[0111] Figure 4 Part of the schematic shows this process.

[0112] Figures 1-5 The steps or the method and process can be automatically realized by computer program instructions. Therefore, referring to Figure 6 , an electronic device is provided, which can be a human-computer interaction terminal, including a processor, a memory and a bus, the memory is used to store a table processing program, the table processing program includes program instructions, and the processor is used to execute the program instructions stored in the computer storage medium, thereby realizing the method steps.

[0113] In another embodiment, the present application also provides a data storage medium, such as a computer readable storage medium (Memory), which is a memory power secondary device in the terminal power secondary device, for storing programs and data. It should be understood that the computer readable storage medium herein can include the built-in storage medium in the terminal power secondary device, and of course can include the expansion storage medium supported by the terminal power secondary device. The computer readable storage medium provides a storage space, which stores the operating system of the terminal. Moreover, one or more instructions suitable for being loaded and executed by the processor are also stored in the storage space, and the instructions can be one or more computer programs (including program codes). It should be noted that the computer readable storage medium herein can be a high-speed RAM memory, or a non-volatile memory, such as at least one disk memory.

[0114] It has been proved that the outstanding advantages of the present application will make full use of and embody the full functions of the table. The user does not need to deliberately learn the related functions of the table software, and only needs to use the table software according to the habit of the user. When it is detected that there may be corresponding auxiliary functions, the technical scheme of the present application will automatically give voice auxiliary prompts, which are convenient and fast.

[0115] Those skilled in the art should understand that the embodiments of the present application can be provided as a method, a system, or a computer program product. Therefore, the present application can adopt a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Moreover, the present application can adopt the form of a computer program product implemented on one or more computer usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer usable program codes.

[0116] Finally, it should be noted that: the above embodiments are only used to illustrate the technical solutions of the present application but not to limit it. Although the present application has been described in detail with reference to the above embodiments, those skilled in the art should understand that the specific embodiments of the present application can be modified or replaced, and any modification or replacement without departing from the spirit and scope of the present application should be covered in the protection scope of the claims of the present application.

[0117] The part of the module structure of the present application which is not particularly clear is subject to the content recorded in the prior art. The prior art mentioned in the foregoing background section of the present application can be used as a part of the present application to understand the meaning of part of the technical features or parameters. The protection scope of the present application is subject to the content actually recorded in the claims.

Claims

1. A full-featured table implementation method supporting voice search, characterized by, The method comprises: obtaining the current table operation of the user; determining whether there is an associated voice assistance function based on the table operation; if there is a voice assistance function, prompting the current user; wherein obtaining the current table operation of the user comprises: storing the multiple table operation data of the user in the cache stack in sequence according to the operation time sequence; when the cache stack is full, obtaining at least one table operation data from the cache stack; determining whether there is an associated voice assistance function based on the table operation, specifically comprising: pre-establishing a relationship table of table operation and voice assistance function; when the cache stack is full, obtaining the current table operation data from the cache stack as target table operation data; determining whether there is a voice assistance function corresponding to the target table operation data in the relationship table; if yes, prompting the current user; if no, obtaining the next table operation data from the cache stack, associating the next table operation data with the current table operation data as target table operation data, and returning to the step of determining whether there is a voice assistance function corresponding to the target table operation data in the relationship table.

2. The full-featured table implementation method supporting voice search according to claim 1, wherein: if it is determined that there is a voice assistance function corresponding to the target table operation data in the relationship table, prompting the current user and emptying the cache stack.

3. The full-featured table implementation method supporting voice search according to claim 1 or 2, wherein: the storage space of the cache stack is adjustable; if it is determined that there is a voice assistance function corresponding to the target table operation data in the relationship table, reducing the storage space of the cache stack and emptying the cache stack, and returning to the step of obtaining the current table operation of the user.

4. The full-featured table implementation method supporting voice search according to claim 1, wherein: the storage space of the cache stack is adjustable; if it is determined that there is no associated voice assistance function based on the table operation, increasing the storage space of the cache stack.

5. The full-featured table implementation method supporting voice search according to claim 1, wherein: the storage space of the cache stack is adjustable; if it is determined that there is an associated voice assistance function based on the table operation, reducing the storage space of the cache stack.

6. The full-featured table implementation method supporting voice search according to claim 4 or 5, wherein: the storage space of the cache stack has an upper limit value; when the storage space of the cache stack reaches the upper limit value, stopping the step of determining whether there is an associated voice assistance function.

7. The full-featured table implementation method supporting voice search according to claim 4 or 5, wherein: the storage space of the cache stack has a lower limit value; when the storage space of the cache stack reaches the lower limit value, the step of obtaining the current table operation of the user comprises: after obtaining the current table operation of the user in real time, predicting the next table operation of the user; Based on the predicted next table operation of the user, it is determined whether there is an associated voice assistant function.

8. A human-machine interaction terminal comprising a memory and a processor, the memory storing a table processing program, the table processing program being executed by the processor to implement the steps of the full-featured table implementation method supporting voice search according to any one of claims 1-7.

9. A computer-readable storage medium storing one or more computer programs, the computer programs being executed to implement the method according to any one of claims 1-7.

Citation Information

Patent Citations

  • Operation prompting method and mobile terminal

    CN108037885A

  • Form generation method, device and equipment

    CN113741898A

  • Form generation method and device, computer equipment and storage medium

    CN113778288A