摘要
介绍了一种基于关系代数的句法分析单元设计.尝试通过与关系代数模型紧密集成,利用关系数据库系统能够组织和快速检索海量数据的特点,提高句法分析单元的处理复杂文法样本的能力,同时减轻用户的编码负担.在此框架中,部分推导树集合被表示为关系;推理规则集被表示为扩展的关系代数运算.给出了算法实现所需的数据结构和控制结构.从而将句法分析算法完全表示为数据库系统中的一个关系运算过程.最后通过原型系统验证了该方法的可行性.
A method for implementing parsing algorithm as standard relational queries is discussed on an rela- tional data stream management system. In this framework, each set of partial derivation trees is represented as a relation in the relational database. Deduction steps are represented as extended relational operators, the data structures and control structures of the Earley parsing systems are described, and the prototype implementation is present to demonstrate the feasibility of parsing using the system.
出处
《大连交通大学学报》
CAS
2012年第3期59-62,共4页
Journal of Dalian Jiaotong University
关键词
模式识别
句法分析
关系代数
Earley算法
pattern recognition
syntactic analysis
relational algebra
earley algorithm