> I hope you mean by parallel processing, on a single machine. Not necessarily! Parallelism in the more general sense. We can parallelize matrix multiplication

> I hope you mean by parallel processing, on a single machine. Not necessarily! Parallelism in the more general sense. We can parallelize matrix multiplication and there is good research on distributing graph algorithms across multiple machines. Spielman discusses this in his recent talk on Algebraic Graph Theory: https://youtu.be/CDMQR422LGM?t=1755 https://youtu.be/CDMQR422LGM?t=1755 > I guess by alphabets you mean dictionaries. Just unordered collections of symbols. Depending on the dictionary or alphabet implementation, it might have an ordering. > I don't agree that the web is a directed graph. This was intentionally vague, but depending on which types of links you consider it may or may not have directionality. Hyperlinks, for example, are directional. > I wouldn't include formula or code parsing because in such cases they are just a means to an end. Part of my goal is to show how simple implementing these algorithms can be. Agree it doesn't flow very well, maybe it should be in the appendix. > You might want to talk here to someone at Oracle. Agreed, I think the work they're doing in probabilistic programming languages is super interesting. I recently gave a short presentation about loopy belief propagation (another interesting graph algorithm for PGMs). https://github.com/breandan/kaliningraph/blob/master/latex/comp766/presentation.pdf https://github.com/breandan/kaliningraph/blob/master/latex/c... > That all being said, I'd like to reiterate on talking to the semantic web community...Cambridge Semantics are quite good Will definitely look into them, thank you! I am fascinated by the whole topic of knowledge bases and semantic parsing, and appreciate the suggestions you provided.