Fangorn: a system for querying very large treebanks

Link: http://nltk.ldc.upenn.edu:9090/index

Intro: Fangorn is an open source tool for querying very large treebanks, built on top of Apache Lucene.  Fangorn implements the LPath linguistic path language, which has an XPath-like syntax along with linguistically motivated extensions.  Result trees are annotated with the query in order to show how the query matched the tree, and these annotations can themselves be modified and submitted as further queries.

Intel® Threading Building Blocks (Intel® TBB)

Link: http://threadingbuildingblocks.org/

Intro: Intel® Threading Building Blocks (Intel® TBB) offers a rich and complete approach to expressing parallelism in a C++ program. It is a library that helps you take advantage of multi-core processor performance without having to be a threading expert. Intel TBB is not just a threads-replacement library. It represents a higher-level, task-based parallelism that abstracts platform details and threading mechanisms for scalability and performance. 

ACCURAT Toolkit

Link: http://www.accurat-project.eu/

Intro: The ACCURAT project (http://www.accurat-project.eu/) is pleased to announce the release of ACCURAT Toolkit - a collection of tools for comparable corpora collection and multi-level alignment and information extraction from comparable corpora. By using the ACCURAT Toolkit, users may obtain:

- Comparable corpora from the Web (current news corpora, filtered Wikipedia corpora, and narrow domain focussed corpora);

- Comparable document alignments;

- Semi-parallel sentence/phrase mapping from comparable corpora (for SMT training purposes or other tasks);

- Translated terminology extracted and mapped from bilingual comparable corpora;

- Translated named entities extracted and mapped from bilingual comparable corpora.

OpenFst Library

Link: http://www.openfst.org/twiki/bin/view/FST/WebHome

Intro: OpenFst is a library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs). Weighted finite-state transducers are automata where each transition has an input label, an output label, and a weight. The more familiar finite-state acceptor is represented as a transducer with each transition's input and output label equal. Finite-state acceptors are used to represent sets of strings (specifically, regular or rational sets); finite-state transducers are used to represent binary relations between pairs of strings (specifically, rational transductions). The weights can be used to represent the cost of taking a particular transition.

Free API for Search the Web instead of Google Search API

Entireweb: http://entireweb.com/services/
Quora: http://www.quora.com/What-can-I-do-with-Blekkos-API
...

Champollion Tool Kit - Text Sentence Aligner

Link: http://champollion.sourceforge.net/

Intro: Built around LDC's champollion sentence aligner kernel, Champollion Tool Kit (CTK) aims to providing ready-to-use parallel text sentence alignment tools for as many language pairs as possible.

Champollion depends heavily on lexical information, but uses sentence length information as well. A translation lexicon is required. Past experiments indicate that champollion's performance improves as the translation lexicon become larger.

PML Tree Query

Link: http://ufal.mff.cuni.cz/~pajas/pmltq/

Intro: PML-TQ is an powerful open-source search tool for all kinds of linguistaically annotated treebanks with several client interfaces and two search backends (one based on a SQL database and one based on Perl and the TrEd toolkit). The tool works natively with treebanks encoded in the PML data format (conversion scripts are available for many established treebank formats).