context-free
英 [ˈkɒntekst friː]
美 [ˈkɑːntekst friː]
adj. 上下文无关的
双语例句
- Using the defined context-free grammars, XSeq avoids the sequential scan of irrelevant compressed data and processes only data values that are to be matched by the given query.
使用定义的上下文无关语法，XSeq可以避免无关压缩数据的后续扫描，只处理将通过给定查询进行匹配的数据值。 - The Sequitur compression algorithm is a linear-time online algorithm that forms a context-free grammar for a given string input.
Sequitur压缩算法是线性时间在线算法，为给定的字符串输入生成了一种与上下文无关的语法。 - Finally, you can design your own programming or domain-specific language with the help of ANTLR Studio, which lets you create context-free grammar definitions based on the ANTLR framework.
最后，您可以在ANTLRStudio的帮助下设计您自己的编程语言或特定于域的语言，ANTLRStudio允许您基于ANTLR框架创建上下文自由的语法定义。 - In order to keep this method as context-free as possible, we grab the file as an InputStream out of the ClassLoader that loaded the class.
为了让此方法尽量与上下文无关，我们从加载类的ClassLoader中抓取文件作为InputStream。 - In addition, context-free grammars allow XSeq to process queries directly over the compressed file without full or partial decompression.
此外，上下文无关的语法允许XSeq直接通过压缩文件处理查询，而不必对文件进行全部或部分解压缩。 - The service's boundaries should encapsulate a reusable, context-free capability.
服务的边界应当封装一项可重用、不受上下文约束的功能。 - If you work with a context-free grammar, the structure of n-gram ( see Resources) might be what you require.
如果您使用一种上下文无关的文法，那么n元语法的结构（参见参考资料）可能是您所需要的。 - Context-free ( and other formal) grammars are pretty complex.
上下文无关（及其他形式的）语法是非常复杂的。 - A probabilistic context-free grammar ( or PCFG) is a context-free grammar that associates a probability with each of its productions.
probabilisticcontext-freegrammar（或者说是PCFG）是一种上下文无关语法，它将其每一个产品关联到一个概率。 - Any other approach ignores the representation problem, assumes that context-free facts and logical rules are sufficient, and will fail.
任何其他方法都忽略了表示方面的问题，均假定不会受到环境限制且逻辑规则就已足够了，此方法将会失败。 - Wikipedia, the free encyclopedia, offers an overview of Computational linguistics and context-free grammars with, as always, good links to more information about both.
免费的百科全书Wikipedia提供了对计算语言学和上下文无关语法的概要介绍，并且给出了关于它们两者的资料的有用链接。 - Clark, Alexander. "Unsupervised induction of stochastic context-free grammars using distributional clustering." Conference on Natural Language Learning, 2001. ( PDF)
采用分布聚类的随机上下文无关文法的无监督归纳学习〉。《自然语言学习会议，2001年》。（PDF） - Ambiguity in context-free grammar
上下文自由文法中的二义性 - Computing with Words via Lattice-Valued Context-Free Grammar
格值上下文无关文法对基于词的计算 - Because of the species-and context-free nature of these rules, they can easily be applied to novel domains such as computer game design.
因为这些规则与实验对象、与上下文无关，所以很方便应用到计算机游戏设计上去。 - Proposes the context-free grammar model for GEP.
对基因表达式编程建立了上下文无关文法模型。 - Fuzzy context-free grammar is one important kind of grammars.
模糊上下文无关文法是几种重要文法之一。 - Context-free phrase structure rule
上下文无关短语结构规则 - In this paper, the definitions of fuzzy tree automata and fuzzy context-free tree grammars are extended to a more general lattice-ordered monoid.
本文将模糊树自动机和模糊上下文无关树文法的概念推广到格半群上。 - This chapter describes the context-free grammars used in this specification to define the lexical and syntactic structure of a program.
这章描述在本规范中使用的上下文无关语法来定义程序的词法和语法结构。 - Syntactic analysis is an important part in natural language processing ( NLP). This paper mainly discusses the syntactic analysis methods used in NLP, such as context-free grammars, transformational grammar, parsing, transition network, augmented transition network etc.
语法分析是自然语言处理中的关键环节，本文就自然语言处理中应用到的上下文无关语法、转换语法、剖析、转换网络和扩充转换网络等语法分析方法进行了论述。 - Lex and yacc were used to analyze the lexis and grammar of the languages defined by context-free grammars, and an independent information extracting module was build to extract the information of source files for white-box testing.
为实现白盒测试的源文件信息提取，提出了通过lex和yacc对使用上下文无关文法定义的语言进行词法和语法分析，构建独立的信息提取模块。 - A computational mechanism for context-free language parsing is proposed in this paper, which is called role inverse algorithm.
给出了面向上下文无关语言的句法分析的一种计算机制：角色反演算法。 - A method of judging similarity and equivalence in context-free grammar
对上下文无关文法中的非终止符的相似性和等价性的判定 - This paper analyzes the features and drawbacks of the algorithms commonly used to parse CFG ( Context-Free Grammar), and introduces a space and time optimized algorithm for CFG.
本文分析了常用CFG（Context-freegrammar）分析算法的特点与不足。在此基础上介绍了一种时空均优化的CFG分析算法。 - The Research and Design of Syntax Analysis Canonical Algorithm for Context-Free and Context-Sensitive Problem
前后文无关和有关问题的语法分析规范化算法的研究与设计 - With F rule, FP rule and BP rule, some of the context-free languages cannot be accepted.
使用F规则、FP规则和BP规则时，该文法不能接受某些上下文无关语言。 - Probabilistic context-free grammar can provide a solution to this problem: select the one whose probability is maximum from the ambiguity.
概率上下文无关语法可以提供对这个问题的解决方法：从歧义中选择概率最大的解释。 - Additionally, a test coverage measurement which includes the coverage of both context-free grammar and semantic rules is defined.
在语义覆盖算法中，还定义了一个包含对上下文无关文法和以属性形式表示的语义规则覆盖的测试覆盖度量准则，用于控制算法的终止。 - The regular expression of the basic elements and context-free grammar of flight scheduling were analyzed. Corresponding non-deterministic finite automata and abstract syntax tree were constructed, and LR parse was used.
分析了航班计划基本要素的正规式和航班计划上下文无关文法，构造了对应的不确定有限自动机和语法分析树，并研究了LR分析的应用。