You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
1.5 KiB
1.5 KiB
Pattern Matching
Pattern matching algorithms extend beyond strings, to include trees and other data structures.
🧭 Part of the pattern-matching group, in PWL
- 📜 Compiling Pattern Matching to good Decision Trees by Luc Maranget. Paper address the issue of compiling ML pattern matching to efficient decisions trees.
- 📜 Extensible Pattern Matching in an Extensible Language by Sam Tobin-Hochstadt. Paper present a sophisticated pattern matcher for Racket, implemented as language extension using macros.
- 📜 Warnings for pattern matching by Luc Maranget. Paper examine the ML pattern-matching anomalies of useless clauses and non-exhaustive matches.
- 📜 Efficient String Matching: An Aid to Bibliographic Search by Alfred V. Aho and Margaret J. Corasick. A single-pass pattern matching algorithm used in early versions of fgrep and similar projects. Aho–Corasick entry in NIST's Dictionary of Algorithms and Data Structures.
Clustering Algorithms
- On the resemblance and containment of documents (Andrei Z. Broder)