Patents
Literature
Patsnap Eureka AI that helps you search prior art, draft patents, and assess FTO risks, powered by patent and scientific literature data.

3 results about "Concatenation" patented technology

In formal language theory and computer programming, string concatenation is the operation of joining character strings end-to-end. For example, the concatenation of "snow" and "ball" is "snowball". In some but not all formalisations of concatenation theory, also called string theory, string concatenation is a primitive notion.

Description-driven task-oriented dialogue modeling

Example methods include determining an input schema representation for a task. The schema representation comprises natural language descriptions of slot and intent descriptions, wherein respective indices are associated with each of the slot descriptions and each of the intent descriptions. The methods include determining a contextual representation comprising a concatenation of a history of dialog sequences exchanged between a user and a service agent, wherein the dialog sequences describe a context for the task. The methods include training, a sequence-to-sequence language model and based on a concatenation of the input schema representation and the contextual representation, to predict a sequence of dialog states for an input task, wherein the sequence of dialog states comprises an assignment of values to slots for which the user has indicated a preference in dialog sequences corresponding to the input task. The methods include providing the trained sequence-to-sequence language model.
Owner:GOOGLE LLC

Automatic word processing method and computer system for implementing same

PCT designated stageWO2026092830A1Quantum computersNatural language data processingSyllableWord processing
The invention relates to a method and a system for automatically processing words in syllabic natural languages written in the binary code alphabet. This method is characterised in that it consists in transforming each series of alphabetical characters, each identified by a UNICODE character code and together forming a word, into a specific generic intermediate code by transformation, by the stack processor, of a linear structure of the word into a hierarchical structure of an abstract tree, whose nodes represent the concatenation operation and the fields instantiated by the generic types, and in then using the resulting specific intermediate code to perform a binary differential interpretation between each of the words to be processed, and all of the words of the language concerned, this interpretation being carried out by implementing a quantum measurement.
Owner:REB GÉRARD +2