Computer-implemented method of browsing a resource through voice interaction comprising the following steps: A. acquiring (100) from a user a request aimed at browsing a resource; B. downloading (130) the requested resource; C. performing a syntactic parsing (135) of the downloaded resource; D. extracting (150) from the downloaded resource one or more lists, if any, of selectable shortcuts pointing to portions inside or outside the downloaded resource through a syntactic analysis and/or a semantic analysis and/or a morphological-visual analysis of extraction of lists of selectable shortcuts on the basis of an ontology (245) corresponding to the type of resource; E. on the basis of the ontology (245) corresponding to the type of resource, building (225) a list of one or more lists of selectable shortcuts extracted in step D ordered according to a list prioritisation; F. extracting (150) from the downloaded resource one or more content elements through a syntactic analysis and/or a semantic analysis and/or a morphological-visual analysis of extraction of content elements on the basis of the ontology (245) corresponding to the type of resource; G. on the basis of the ontology (245) corresponding to the type of resource, building (290) a list of content elements extracted in step F ordered according to a content element prioritisation; H. on the basis of the lists built in steps E and G and on the basis of the ontology (245) corresponding to the type of resource, building a final structure of lists of selectable shortcuts and of content elements; I. playing (125) a voice prompt based on the final structure and starting a voice interaction with the user for browsing the resource.

A business flow creation support device 1 includes a generation unit 11 that receives an effect and a sentence indicating what is desired to be realized, which are input by a user, and generates a flow including a plurality of clauses obtained by morphologically analyzing the sentence, a presentation unit 12 that acquires scores indicating to which fields the effect and words included in the clauses are close, respectively, and presents, to the user, a template of a business flow in a field having a high total score, and a creation support unit 14 that support creation of the business flow corresponding to the effect and the sentence.

A document retrieval system that retrieves documents, with concepts of the documents taken into account, is provided. The document retrieval system (100) includes an input unit (101), a first processing unit (102), a storage unit (105), a second processing unit (103), and an output unit (104). The input unit (101) has a function of inputting a first document (20), the first processing unit (102) has a function of creating a first graph structure (21) from the first document (20), the storage unit (105) has a function of storing a second graph structure (11), the second processing unit (103) has a function of calculating a similarity between the first graph structure (21) and the second graph structure (11), the output unit (104) has a function of supplying information, the first processing unit (102) has a function of dividing the first document (20) into a plurality of tokens, a node and an edge of the first graph structure (21) have a label, and the label includes the plurality of tokens.

A document retrieval system that retrieves documents, with concepts of the documents taken into account, is provided. The document retrieval system (100) includes an input unit (101), a first processing unit (102), a storage unit (105), a second processing unit (103), and an output unit (104). The input unit (101) has a function of inputting a first document (20), the first processing unit (102) has a function of creating a first graph structure (21) from the first document (20), the storage unit (105) has a function of storing a second graph structure (11), the second processing unit (103) has a function of calculating a similarity between the first graph structure (21) and the second graph structure (11), the output unit (104) has a function of supplying information, the first processing unit (102) has a function of dividing the first document (20) into a plurality of tokens, a node and an edge of the first graph structure (21) have a label, and the label includes the plurality of tokens.

Techniques are described herein for assembling/evaluating automated assistant responses for privacy concerns. In various implementations, a free-form natural language input may be received from a first user and may include a request for information pertaining to a second user. Multiple data sources may be identified that are accessible by an automated assistant to retrieve data associated with the second user. The multiple data sources may collectively include sufficient data to formulate a natural language response to the request. Respective privacy scores associated with the multiple data sources may be used to determine an aggregate privacy score associated with responding to the request. The natural language response may then be output at a client device operated by the first user in response to a determination that the aggregate privacy score associated with the natural language response satisfies a privacy criterion established for the second user with respect to the first user.

A method and apparatus for processing a natural language text, a device and a storage medium are provided. An implementation of the method includes: after obtaining a target sentence text to be processed, performing word segmentation on the target sentence text, to obtain a target fixed word slot corresponding to the target sentence text and candidate free word slots corresponding to the target sentence text; then performing, based on syntax rules of preset standard sentence patterns, sentence pattern matching on the target fixed word slot and the candidate free word slots, to obtain a target sentence pattern including the target fixed word slot and a target free word slot; and replacing the target free word slot in the target sentence pattern with a free word corresponding to the target free word slot in the target sentence text, to obtain a target sentence pattern including the free word.

Provided is a device including a memory storing information about sequences of a plurality of registered words; an input unit comprising input circuitry configured to receive an input of a text comprising a first eojeol not belonging to the plurality of registered words, wherein, in the first eojeol, a first word is attached to a first registered word that belongs to the plurality of registered words; and a controller configured to detect the first registered word from the first eojeol, to determine a predicted eojeol to be input after the text, based on the information about the sequences of the plurality of registered words and the detected first registered word and to control a display to display the predicted eojeol.

Provided is a device including a memory storing information about sequences of a plurality of registered words; an input unit comprising input circuitry configured to receive an input of a text comprising a first eojeol not belonging to the plurality of registered words, wherein, in the first eojeol, a first word is attached to a first registered word that belongs to the plurality of registered words; and a controller configured to detect the first registered word from the first eojeol, to determine a predicted eojeol to be input after the text, based on the information about the sequences of the plurality of registered words and the detected first registered word and to control a display to display the predicted eojeol.

A system described herein may provide a technique for the compression of query terms and search data against which the query terms may be evaluated. The compression may be dynamic, in that a quantity of bits used to compress the search data and query terms may be based on a quantity of unique characters included in a given query term. The compression may further include reducing the volume of search data by compressing entire words, that do not include any of the unique characters of the query term, to one particular code.

A system described herein may provide a technique for the compression of query terms and search data against which the query terms may be evaluated. The compression may be dynamic, in that a quantity of bits used to compress the search data and query terms may be based on a quantity of unique characters included in a given query term. The compression may further include reducing the volume of search data by compressing entire words, that do not include any of the unique characters of the query term, to one particular code.