Download JAR files tagged by structure with all dependencies

Stanford CoreNLP provides a set of natural language analysis tools which can take raw English language text input and give the base forms of words, their parts of speech, whether they are names of companies, people, etc., normalize dates, times, and numeric quantities, mark up the structure of sentences in terms of phrases and word dependencies, and indicate which noun phrases refer to the same entities. It provides the foundational building blocks for higher level text understanding applications.

The JAX-SB Generator is a comprehensive framework to facilitate the use of XML in software languages such as Java. This framework intends to provide tools that will allow a developer to easily integrate XML interoperability, bind XML Schemas, and analyze XML Schemas for use with any software. Currently there is only one language and one application that is supported: XML Binding in Java. Next on the agenda is the development of analysis tools for XML Schema Documents. For instance, imagine a tool that will allow you to determine whether an XSD complies to best-practices. This tool will: 1) produce warnings for structures that do not comply to best-practices, 2) tell the developer whether the logical structure can be transformed linearly to a form that complies to best-practices, and 3) to automatically produce an XSD that maintains the logical structure of the original document but now fully complies to best-practices. This is just one of many tools that will be available shortly. In the meantime, check out the binding application.

This is a Java library which provides a flexible and customizable way to bind command line arguments to Java objects, in a similar manner to how JSON, XML, and YAML can be bound to Java objects. You can easily define Java classes that represent the data structure of your command line arguments, and use annotations to specify how those arguments should be parsed and bound to the corresponding fields in your Java object. This allows you to write command line interfaces that are more intuitive and easier to use, while also reducing the amount of boilerplate code that is needed to parse and validate command line arguments.

scala-tptp-parser is a library for parsing the input languages of the TPTP infrastructure for knowledge representation and reasoning. The package contains a data structure for the abstract syntax tree (AST) of the parsed input as well as the parser for the different language of the TPTP, see http://tptp.org for details. In particular, parser are available for: - THF (TH0/TH1): Monomorphic and polymorphic higher-order logic, - TFF (TF0/TF1): Monomorphic and polymorphic typed first-order logic, including extended TFF (TFX), - FOF: Untyped first-order logic, - TCF: Typed clause-normal form, - CNF: (Untyped) clause-normal form, and - TPI: TPTP Process Instruction language. The parser was initially based on v7.4.0.3 of the TPTP syntax BNF (http://tptp.org/TPTP/SyntaxBNF.html), but is continuously updated to keep track of TPTP language updates.

The bit array data structure is implemented in Java as the BitSet class. Unfortunately, this fails to scale without compression. JavaEWAH is a word-aligned compressed variant of the Java bitset class. It uses a 64-bit run-length encoding (RLE) compression scheme. The goal of word-aligned compression is not to achieve the best compression, but rather to improve query processing time. Hence, we try to save CPU cycles, maybe at the expense of storage. However, the EWAH scheme we implemented is always more efficient storage-wise than an uncompressed bitmap (implemented in Java as the BitSet class). Unlike some alternatives, javaewah does not rely on a patented scheme.