本文论述了基于概率的上下文无关语法的句法分析的原理及实现过程。
This dissertation discusses the theory and realization of the Probabilistic Context Free Grammar-based syntactic parser.
上下文无关语法(简称CFG)在自然语言的句法自动分析中已经得到广泛的应用。
The context free grammar (CFG) was applied broadly in the automatic syntactic parsing of natural language processing.
概率上下文无关语法可以提供对这个问题的解决方法：从歧义中选择概率最大的解释。
Probabilistic context-free grammar can provide a solution to this problem: select the one whose probability is maximum from the ambiguity.
本文将简要介绍单词的分类与词类标注的相关内容，在此基础上介绍句法处理的一个计算机模型：上下文无关语法。
This paper briefly introduces the classification of words and part-of-speech tagging, then introduces a computer model of syntactic processing: context-free grammar.
免费的百科全书Wikipedia提供了对计算语言学和上下文无关语法的概要介绍，并且给出了关于它们两者的资料的有用链接。
Wikipedia, the free encyclopedia, offers an overview of Computational linguistics and context-free grammars with, as always, good links to more information about both.
probabilistic context - freegrammar(或者说是PCFG)是一种上下文无关语法，它将其每一个产品关联到一个概率。
A probabilistic context-free grammar (or PCFG) is a context-free grammar that associates a probability with each of its productions.
如果我有一个上下文无关的语法，它并不能自动产生程序，我还是得写程序。
If I have a context free grammar, it doesn't generate the programs. I still have to write them.
BillVenners：模式语言是不是像一门上下文无关的语法，你可以用来编制相同类型的程序？
Bill Venners: Is a pattern language like having a context free grammar, and from which you can make a whole bunch of programs?
Sequitur压缩算法是线性时间在线算法，为给定的字符串输入生成了一种与上下文无关的语法。
The Sequitur compression algorithm is a linear-time online algorithm that forms a context-free grammar for a given string input.
如果您使用一种上下文无关的文法，那么n元语法的结构(参见参考资料)可能是您所需要的。
If you work with a context-free grammar, the structure of n-gram (see Resources) might be what you require.
如果您使用一种上下文无关的文法，那么n元语法的结构(参见参考资料)可能是您所需要的。
If you work with a context-free grammar, the structure of n-gram (see Resources) might be what you require.
应用推荐