Towards increasing F-measure of approximate string matching in O(1) complexity
Main Authors: | Adrian Boguszewski, Julian Szymański, Karol Draszawka |
---|---|
Format: | Article |
Language: | English |
Published: |
Polish Information Processing Society
2016-10-01
|
Series: | Annals of computer science and information systems |
Online Access: | http://dx.doi.org/10.15439/2016F311 |
Similar Items
-
From Scores to Predictions in Multi-Label Classification: Neural Thresholding Strategies
by: Karol Draszawka, et al.
Published: (2023-06-01) -
Weighted approximate parameterized string matching
by: Shibsankar Das, et al.
Published: (2017-04-01) -
Approximate String Matching with Compressed Indexes
by: Pedro Morales, et al.
Published: (2009-09-01) -
Intuitionistic Fuzzy Automaton for Approximate String Matching
by: K.M. Ravi, et al.
Published: (2014-03-01) -
Improved algorithms for approximate string matching (extended abstract)
by: Papamichail Georgios, et al.
Published: (2009-01-01)