Making sense of language is an NP-complete problem, which seems like something you might intuitively guess, but you can prove this by reducing the well known NP-complete problem of graph $k$-coloring to the anaphora agreement problem in linguistics.
There are a number of core Linux features or shell utilities that can help build extremely efficient and effective software tools with minimal effort. I find these particularly useful when building server systems, build utilities, or tools for processing large amounts of data. Also, they are great for quick “hacky” solutions.
For some reason, when connected to a VPN, macOS can choose to not route your traffic through the VPN and instead route it through the regular connection.
For unit-length vectors, both the cosine similarity and Euclidean distance measures can be used for ranking with the same order. In fact, you can directly convert between the two.