An artificial neural network based approach for online string matching/filtering of large databases

DOI10.1002/int.20412zbMath1209.68199MaRDI QIDQ3563649

Tatiana Tambouratzis

Publication date: 1 June 2010

Published in: International Journal of Intelligent Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/int.20412

Mathematics Subject Classification ID

68P15: Database theory

68T05: Learning and adaptive systems in artificial intelligence

Uses Software

• LVQ_PAK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Very fast and simple approximate string matching
• String-matching with OBDDs
• A metric index for approximate string matching
• Speeding up transposition-invariant string matching
• Derivation of a parallel string matching algorithm
• Fast string matching with k differences
• Correctness and efficiency of pattern matching algorithms
• Self-organizing maps of symbol strings
• Constant-space string-matching in sublinear average time
• Block edit models for approximate string matching
• Approximate string matching using factor automata
• The wide window string matching algorithm
• Comparison of strings belonging to the same family
• Fast and practical approximate string matching
• Fast string matching by using probabilities: on an optimal mismatch variant of Horspool's algorithm
• Suffix Arrays: A New Method for On-Line String Searches
• The string B-tree
• Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
• An Improved Algorithm For Approximate String Matching
• Efficient randomized pattern-matching algorithms
• A parallel string search algorithm
• Efficient string matching
• Fast Pattern Matching in Strings
• An artificial neural network satisfiability tester
• The String-to-String Correction Problem
• Simple Optimal String Matching Algorithm