| 摘要 |
<p>A discrete substring matching method for information searching and information inputting is disclosed. The discrete substring is a character string ("S<SUB>g1</SUB>S<SUB>g2</SUB> S<SUB>gm</SUB>"(1=g1<G2 <)G<SUB>m</SUB>) formed by one or multiple character in the text S="S<SUB>1</SUB>S<SUB>2</SUB> S<SUB>n</SUB>". The discrete substring pattern matching is whether the judgement pattern P="P<SUB>1</SUB>P<SUB>2</SUB>P<SUB>3</SUB> P<SUB>m</SUB>"(1=m=n) is a discrete substring "S<SUB>g1</SUB>S<SUB>g2</SUB> S<SUB>gm</SUB>" of text S or not. On the other hand, the method provides detail steps of the discrete substring pattern matching. The discrete substring expands the concept scope of the substring. The pattern matching method solves the problem of the pretermission in text searching with discrete feature. It has some advantages in function. For example, it improves the integrality and the veracity of searching. It makes position become easy. It has some advantages in application. For example, it makes information searching and information inputting become simple, flexible and quick.</p> |
