RETE-based parsing algorithm

Structure ambiguity is key issues in parsing.In order to solve this problem,most parsing systems adopt multi-features rules.Comparing with the simple context-free rules,the multi-features rules include more linguistic information to solve ambiguities which can not be solved by context-free rules.But the form of the multi-features rules is more complex than context-free rules.And the amount is far more than the amount of context-free rules.Saving and matching them is difficult.In this paper,we propose a RETE-based parsing algorithm to solve above problems.The rules can be stored and searched in RETE net effectively.The experiments show our algorithm can speed up the rule matching and finally improve the performance of whole parsing algorithm.