• Publications
  • Influence
N-Gram Analysis Based on Zero-Suppressed BDDs
TLDR
We propose a new method of n-gram computation with a new sequence data structure based on Zero-suppressed BDDs. Expand
  • 9
  • PDF
Fast Regular Expression Matching Using Dual Glushkov NFA
This paper presents a new regular expression matching method by using Dual Glushkov NFA. Dual Glushkov NFA is the variant of Glushkov NFA, and it has the strong property that all the outgoing edgesExpand
Unordered N-gram Representation Based on Zero-suppressed BDDs for Text Mining and Classification
In this paper, we present a new method to analyze unordered n-grams by using ZBDDs (Zero-suppressed BDDs). n-grams have been used not only for text analysis but also for text indexing in some searchExpand
Fast Regular Expression Matching Based On Dual Glushkov NFA
TLDR
We propose the new matching method Look Ahead Matching that suited to Dual Glushkov NFA structure. Expand