搜索资源列表
MSTParser.tar
- MSTParser是以最大生成树理论为基础的判别式依存句法分析器。它将一科依存树的得分看作是 所有依存关系的得分的总和，从而依存分析的问题转化成如何寻找最高得分的依存树。-Spanning tree is the largest MSTParser theory-based discriminant Parser interdependence. Section 1 will be scored as interdependent tree are all interdependent re
greycode
- 原始n年数据，可以实现用灰色理论的预测功能，代码可以运行。-N the original data for the year can be achieved using gray prediction theory, the code can run.
RESEARCH_ON_KEY_TECHNOLOGIES_OF_THE_INFORMATION_EX
- 说明：主要集中在命名实体识别和实体关系抽取两个方面，将先进的机器学习算 法和全新的理论方法一全信息理论运用到我们的整个研究过程中。-Descr iption: The main focus on named entity recognition and entity extraction between the two aspects of advanced machine learning algorithms and new theoretical methods of informat
An_Introduction_to_Conditional_Random_Fields_for_R
- 说明： 基于条件随机场模型的经典理论介绍，广泛应用于命名实体识别，实体关系识别领域。-Note: Based on Conditional Random Fields model describes the classical theory is widely used in named entity recognition, entity-relationship identification field.
Automatic_Entity_Relation_Extraction_Based_on_Cond
- 说明：基于条件随机场模型的实体关系识别，内含条件随机场的理论介绍以及该理论应用于实体关系识别的实验及实验分析 -Note: Based on Conditional Random Fields model entity-relationship recognition, implied condition of the theoretical descr iption with the airport, as well as the theory is applied to entity-r
DFA
- 从正则表达式到有穷自动机实例，最近刚学了编译原理 搞出来得这个东西-From regular expressions to finite automata instance, recently learned more this thing come up with compiler theory
Parsers
- 实现了自顶向下深度优先，自顶向下广度优先，自底向上深度优先，自底向上广度优先四个语言分析函数。有助于理解形式语言与计算理论的基本概念。-Depth-first top-down, top-down breadth-first, bottom-up depth-first, bottom-up breadth priority the four linguistic analysis function. Helps to understand the basic concepts of the t
Kalman1960
- 卡曼滤波英文原版，适合初学者学习理论，全是精髓。-Kaman filtering English edition, suitable for beginners to learn the theory, all the essence.