I love that kind of bullshit poetry.
Or you can do,
return filter(None,tokens)
If not, I'm now curious why the `None` special case was added to `filter`..
Eg, arr.filter(Boolean)
pure (n, guard (factor /= n) $> factor)
return [factor for factor in factors if factor and not factor == n]
[0] Haskell: A Great Procedural Language https://entropicthoughts.com/haskell-procedural-programming#... https://news.ycombinator.com/item?id=42754098
Returns a tuple: Left side is n, right side is (Just factor) if factor is not n, or Nothing if it is.
A more direct translation:
# py
[token for token in tokens if token]
-- hs
filter (not . null) tokens
# py
def analyze(text):
tokens = tokenize(text)
tokens = lowercase_filter(tokens)
tokens = stopword_filter(tokens)
tokens = stem_filter(tokens)
return [token for token in tokens if token]
-- hs
analyze :: String -> [String]
analyze = filter (not . null) . stem_filter . stopword_filter . lowercase_filter . tokenizeMost of the difficulty in search is dealing with the sheer volume of data. The algorithms themselves are pretty trivial for the most part.
https://gist.github.com/benob/69d48421f88f5dcc2b26a204d3251d...