|
|
|
|
|
|
by SonOfLilit
315 days ago
|
|
|
My brain is screaming that there has to be a solution in <1kb uncompressed (for the non-strict version). Maybe generating a minimal list of regexes that classifies 100% of names correctly? Maybe a big enough bloom filter? Maybe like a bloom filter but instead of hashes we use engineered features? |
|
|