KnowBuddy is a collaborative tool for curating and disambiguating text into grammatical English and 'ontology' (which means "knowledge" including logical axioms of various sorts).

KnowBuddy goes further than clarifying lexical or syntactic ambiguities. KnowBuddy clarifies the logical semantics of English to the point of producing formal, logical, axiomatic knowledge suitable for artificial intelligence.

Once you register, you can use KnowBuddy in any of the following ways:

  1. try it in your browser using a publicly shared knowledge base as your 'scratch pad'.
  2. launch it as a application that automatically installs if Java is enabled in your browser.
  3. launch the Java application from the command-line as follows:

For more information, please visit Haley AI or send mail to

Please also get in touch if you may be interested in collaboration or compensation ranging from consultants or employees to micro-task work in the following areas:

For example, we have tens of thousands of tasks available that take from seconds to minutes.

And, we are hiring people interested in the above general areas and topics such as the following:

  1. Stickel, Mark E. "A Prolog-like inference system for computing minimum-cost abductive explanations in natural-language interpretation." Annals of Mathematics and Artificial Intelligence 4.1 (1991): 89-105.
  2. Montazeri, Niloofar, and Jerry R. Hobbs. "Elaborating a knowledge base for deep lexical semantics." Proceedings of the Ninth International Conference on Computational Semantics. Association for Computational Linguistics, 2011.
  3. Wolfe, Ellie Pavlick1 Travis, et al. "FrameNet+: Fast Paraphrastic Tripling of FrameNet."
  4. WordNet, FrameNet, VerbNet, PPDB, and distributed word representations for NLU (lexical and logical semantics interpretation/disambiguation).
  5. Statistical, neural, and unification-based grammars for NLP, NLU, and NLG (c.f., the English Resource Grammar)
  6. Kwiatkowski, T., Zettlemoyer, L., Goldwater, S., & Steedman, M. Inducing Probabilistic CCG Grammars from Logical Form with Higher-Order Unification.
  7. Fahlman, S. E. (2013). The Scone knowledge-base project (home page).
  8. Vulcan's SILK, Flora, and XSB Prolog