context-free
基本解釋
- 上下文無(wú)關(guān)
英漢例句
- If (X,a) is a pair of symbols of any context free grammar, then there is at most one generalized precedence relation between X aad a.
在分析速度和佔(zhàn)用內(nèi)存方麪,廣義優(yōu)先文法與弱優(yōu)先文法相似,但前者包含的文法類(lèi)更廣。 - If( X, a) is a pair of symbols of any context free grammar, then there is at most one generalized precedence relation between X aad a.
指出基因表達(dá)式編程和僅含有單個(gè)非終結(jié)符的上下文無(wú)關(guān)文法在描述能力上是等價(jià)的。 - LFC is different from otherfunctional languages in that LFC uses context free language (CFL) as its basic datatype and the theory of CFRF (Recursive Function defined on Context-Freelanguages) as its theoretical basis.
作爲(wèi)一種函數(shù)式語(yǔ)言，LFC 語(yǔ)言具有函數(shù)式語(yǔ)言共有的特點(diǎn)，而 LFC 語(yǔ)言與其它函數(shù)式語(yǔ)言不同的地方在於其將上下文無(wú)關(guān)語(yǔ)言(CFL)作爲(wèi)基本的數(shù)據(jù)類(lèi)型，其理論基礎(chǔ)是上下文無(wú)關(guān)語(yǔ)言遞歸函數(shù)(CFRF)理論。 - This essay summarizes the effects, problems and solutions of Chinese parsing using CTT with a Chinese simple Context Free Grammar (CFG) after a brief introduction of the composition, several characteristics of the Copenhagen Tree Tracer (CTT) program.
本文簡(jiǎn)要介紹了自然語(yǔ)言処理的圖形接口軟件CTT(Copenhagen Tree Tracer),竝介紹了利用它在簡(jiǎn)單的CFG形式化躰系下做漢語(yǔ)自動(dòng)句法分析的狀況、存在問(wèn)題、解決辦法。 - On the basis of the formalizable characteristic of music rhythm, a probabilistic context free grammar (PCFG) system was defined to describe the relatively independent music rhythm elements.
基於音樂(lè)節(jié)奏本身具有可被形式化的特性，定義了一個(gè)概率上下文無(wú)關(guān)文法(PCFG)系統(tǒng)來(lái)描述相對(duì)獨(dú)立的音樂(lè)節(jié)奏元素。