Fuzzy String Matching with Finite Automat

被引：0

作者：

Kostanyan, Armen ^{[1
]}

机构：

[1] Yerevan State Univ, IT Educ & Res Ctr, Yerevan, Armenia

来源：

2017 ELEVENTH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGIES (CSIT) | 2017年

关键词：

string matching with finite automata; fuzzy sets; fuzzy string matching;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The string matching problem is one of the widely known symbolic computation problems having applications in many areas of artificial intelligence. The most famous algorithms solving the string matching problem are the finite automata method, Knuth-Morris-Pratt and Rabin-Karp's algorithms. In this paper we focus on applying the finite automata method to find a fuzzy pattern in a text.

引用

页码：9 / 11

页数：3

共 7 条

[1]

Baeza-Yates R., 1996, Combinatorial Pattern Matching. 7th Annual Symposium, CPM 96. Proceedings, P1

[2]

BaezaYates R, 1997, LECT NOTES COMPUT SC, V1272, P174

[3] FAST STRING SEARCHING ALGORITHM [J].

BOYER, RS ;

MOORE, JS .

COMMUNICATIONS OF THE ACM, 1977, 20 (10) :762-772

[4]

Knuth D. E., 1977, SIAM Journal on Computing, V6, P323, DOI 10.1137/0206024

[5] EFFICIENT STRING MATCHING WITH K-MISMATCHES [J].

LANDAU, GM ;

VISHKIN, U .

THEORETICAL COMPUTER SCIENCE, 1986, 43 (2-3) :239-249

[6]

Smyth B., 2003, Computing Patterns in Strings

[7]

ZADEH LA, 1975, INFORM SCIENCES, V8, P199, DOI [10.1016/0020-0255(75)90036-5, 10.1016/0020-0255(75)90046-8]

← 1 →