context-sensitive grammar

context-sensitive grammar的基本解释

-

上下文有关文法

与context-sensitive grammar相关的网络例句 [注：此内容来源于网络，仅供参考]

Third, we designed a transactional workflow description language ISTWL in context-free grammar.

该算法解决了现有调度算法只允许一个工作流执行不可补偿事务的限制。

A previous text steganography scheme uses the mimic function and the Context-Free Grammar to generate pseudo-natural language text to convey secret information.

摘要基于模仿函数的Mimicry文本隐写法利用上下文无关文法构造树形结构，生成的含密仿自然文本在语义连贯性方面存在缺陷。

In this thesis, I summarize and implement the up-to-date language models, such as N-Gram Language Model, Interpolation N-gram Language Model, Context-Free Grammar and Probabilistic Context-Free Grammar, and establish the run-length language model Character-level and word-level run-length language model are established on the base of the concept of limit entropy and discrete stable information source and by using maximum likelihood between character strings.

在充分研究和比较了中文和西文特点的基础上，提出了变长汉语语言模型。应用极限熵、离散平稳信源和字符串之间的最大似然度等概念和方法，建立了字一级的变长语言模型和词一级的变长语言模型。实验的结果显示这种语言模型不仅比Bigram具有更低的复杂度，而且包含了更长距离内的信息，运行时间也大大小于N-Gram。

与context-sensitive grammar相关的网络解释 [注：此内容来源于网络，仅供参考]

continuous discrete event hybrid system simulation：连续离散事件混合系统仿真

context-free grammar 上下文无关语法 | continuous discrete event hybrid system simulation 连续离散事件混合系统仿真 | continuous duty 连续工作制

precedence grammar：优先文法

随后,他又对语法分析进行了系统研究,大家现在熟知的优先文法(precedence grammar),限界上下文文法(bounded context grammar)等都是弗洛伊德在这个时期首先提出来的.

Tree Adjoining Grammar, TAG：树连接语法

稀疏数据问题 <==> sparse data problem | 树连接语法 <==> Tree Adjoining Grammar, TAG | 随机上下文无关文法 <==> Stochastic Context Free Grammar, SCFG (PCFG)