Processing

Please wait...

Settings

Settings

Goto Application

1. CN112074898 - MACHINE GENERATION OF CONTEXT-FREE GRAMMAR FOR INTENT DEDUCTION

Office
China
Application Number 201880089707.0
Application Date 23.11.2018
Publication Number 112074898
Publication Date 11.12.2020
Publication Kind A
IPC
G10L 15/18
GPHYSICS
10MUSICAL INSTRUMENTS; ACOUSTICS
LSPEECH ANALYSIS OR SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING; SPEECH OR AUDIO CODING OR DECODING
15Speech recognition
08Speech classification or search
18using natural language modelling
G10L 15/22
GPHYSICS
10MUSICAL INSTRUMENTS; ACOUSTICS
LSPEECH ANALYSIS OR SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING; SPEECH OR AUDIO CODING OR DECODING
15Speech recognition
22Procedures used during a speech recognition process, e.g. man-machine dialog
G10L 15/26
GPHYSICS
10MUSICAL INSTRUMENTS; ACOUSTICS
LSPEECH ANALYSIS OR SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING; SPEECH OR AUDIO CODING OR DECODING
15Speech recognition
26Speech to text systems
G06F 40/20
GPHYSICS
06COMPUTING; CALCULATING OR COUNTING
FELECTRIC DIGITAL DATA PROCESSING
40Handling natural language data
20Natural language analysis
G06F 40/30
GPHYSICS
06COMPUTING; CALCULATING OR COUNTING
FELECTRIC DIGITAL DATA PROCESSING
40Handling natural language data
30Semantic analysis
CPC
G06F 8/425
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
FELECTRIC DIGITAL DATA PROCESSING
8Arrangements for software engineering
40Transformation of program code
41Compilation
42Syntactic analysis
425Lexical analysis
G06N 3/006
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
NCOMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
3Computer systems based on biological models
004Artificial life, i.e. computers simulating life
006based on simulated virtual individual or collective life forms, e.g. single "avatar", social simulations, virtual worlds or particle swarm optimisation
G06N 5/025
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
NCOMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
5Computer systems using knowledge-based models
02Knowledge representation
025Extracting rules from data
G06N 20/00
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
NCOMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
20Machine learning
G06F 40/237
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
FELECTRIC DIGITAL DATA PROCESSING
40Handling natural language data
20Natural language analysis
237Lexical tools
G06F 8/41
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
FELECTRIC DIGITAL DATA PROCESSING
8Arrangements for software engineering
40Transformation of program code
41Compilation
Applicants MIDEA GROUP CO., LTD.
美的集团股份有限公司
Inventors LI BAOJIE
李宝洁
GU HAISONG
顾海松
Agents 北京派特恩知识产权代理有限公司 11270
北京派特恩知识产权代理有限公司 11270
Priority Data 15902911 22.02.2018 US
Title
(EN) MACHINE GENERATION OF CONTEXT-FREE GRAMMAR FOR INTENT DEDUCTION
(ZH) 用于意图推理的上下文无关文法的机器生成
Abstract
(EN) A method for generating context-free grammar for intent deduction includes: retrieving, through a compiler, a first template file for a respective actionable intent corresponding to a first task thatis to be performed by a machine; parsing the first template file, using the compiler, to identify a first nonterminal variable that refers to a first nonterminal file containing a plurality of first named entity values; and generating, based on a plurality of production rules specified in the first template file, including at least a first production rule that includes the first nonterminal variable, first context-free grammar for the respective actionable intent corresponding to the first task, wherein generating the first context-free grammar for the respective actionable intent corresponding to the first task includes rewriting the first production rule by replacing the first nonterminal variable in the first production rule with the plurality of first named entity values.
(ZH) 一种用于生成用于意图推理的上下文无关文法的方法,包括:针对与待由机器执行的第一任务对应的可操作意图,通过编译器检索第一模板文件;使用编译器解析第一模板文件,以识别第一非终结符变量,第一非终结符变量引用包含多个第一命名实体值的第一非终结符文件;以及基于在第一模板文件中指定的、包括至少第一产生式规则的多个产生式规则,生成与第一任务对应的可操作意图的第一上下文无关文法,第一产生式规则包括第一非终结符变量,其中,生成与第一任务对应的可操作意图的第一上下文无关文法包括:通过用多个第一命名实体值替换第一产生式规则中的第一非终结符变量来重写第一产生式规则。
Related patent documents