Open Source Search Software

Bowtie, an ultrafast, memory-efficient short read aligner for short DNA sequences (reads) from next-gen sequencers. Please cite: Langmead B, et al. Ultrafast and memory-efficient alignment of short DNA sequences to the human genome. Genome Biol 10:R25.

Elasticsearch is a distributed, RESTful search and analytics engine that lets you store, search and analyze with ease at scale. It lets you perform and combine many types of searches; it scales seamlessly, and offers answers incredibly fast with search results you can rank based on a variety of factors. Elasticsearch can be used for a wide variety of use cases, from maps and metrics to site search and workplace search, and with all data types.

FTimes is a forensic system baselining, searching, and evidence collection tool. Its primary purpose is to gather and/or develop topographical information and attributes about specified directories and files in a manner conducive to intrusion and forensic analysis.

Blaze is an application launcher that distinguishes from amongst the others by being able to automate recurrent tasks performed in the file-system or even any application on Microsoft Windows.

OpenEphyra is an open framework for question answering (QA). It retrieves answers to natural language questions from the Web and other sources. Visit http://www.ephyra.info/ for more details and information on joining this open research initiative.

SCAN (Smart Content Aggregation and Navigation) is a universal semantic content aggregator. It combines search, text analysis, tagging and metadata functions to provide new user experience of desktop navigation and document management.

The semantic annotation system OPTIMA is the result of Andreas Vlachidis PhD work, (supervised by Prof. Douglas Tudhope, University of Glamorgan, UK). OPTIMA performs the NLP tasks of Named Entity Recognition, Relation Extraction, Negation Detection and Word Sense Disambiguation using hand-crafted rules and SKOS terminological resources (English Heritage Thesauri and Glossaries). The resulted semantic annotations are associated with classes of the (ISO 21127:2006) CIDOC Conceptual Reference Model (CRM) and its archaeological extension, CRM-EH. OPTIMA is also targeted at the detection and recognition of contextual relations between CRM entities. Such relations are modeled with respect to the CRM-EH archaeology extension. The pipeline targets the CIDOC-CRM entities; E19.Physical_Object, E53.Place, E49.Time_Appellation and E57.Material and the CRM-EH entities; EHE1001.Context_Event, EHE1002.Production_Event, EHE1004.Deposition_Event and P45.consists_of material property

langcore allow build semantic cores of different humans' and non humans' languages for text to generation and searches. Build cores of many languages and determine language of unknown text or type of file, or determination of unknown author. Click AllF

A high-performance implementation of bloom filters, a lightweight duplicate detection algorithm.

The Diversity Engine provides tools to create diversity-aware multimedia search applications.

The goal of DynaQ is to develop an inquiry system to explore the personal information space, supporting you with the searching paradigm 'orienteering'. DynaQ is a (desktop)search engine with enhanced functionality for file, email and blog search. Look at our GitLab homepage for sourcecode and documentation: http://dynaq.opendfki.de

The GIS Metadata Manager is a simple Java-based desktop application to manage files from geographic information systems (GIS) in a specified directory by grouping files into records, adding metadata and searching the metadata to find files.

This package contains different tools to add NLP capabilities for Lucene 4.x (it has been tested using Lucene version from 4.6.x to 4.8.1). Although it was originally developed for German, it is, mostly, language independent. It allows the user to lemmatize words to be indexed, to weight termy ba their parts of speech (e.g. weighting nouns mor hevaily than pronouns), and to add synonyms taken from GermaNet or a list you provide to the search index and thereby increase recall of lucene.

GoldenOrb is a java library under the Apache License V2.0 for correlation, summarization and clustering of text information.

Kriterion is a document retrieval and categorization engine capable of full text searching. There is no need for keyword or context-based information.

Regular expressions system with Lisp-styled syntax. Also this software can be used as a library for embedding lisp-syntax regular expressions in an another programm.

Lucino is a C-library with some support for reading and writing Apache Lucene-indices. It currently comes with PHP- and Python bindings.

MyLib is a smart desktop assistant to manage PDF/PPT/PS documents. These types of documents are frequently used by academic & engineering communities.

Development and support of OCFA have been discontinued. the code has moved to these github repositories: https://github.com/DNPA/OcfaLib https://github.com/DNPA/OcfaArch https://github.com/DNPA/OcfaJavaLib https://github.com/DNPA/OcfaModules https://github.com/DNPA/OcfaDoc If you are interested in contributing to ongoing work on the creation of a community maintained OCFA inspired computer forensic framework, please join the Mattock/MattockFS community page on G+: https://plus.google.com/communities/102487198908055860744

This project considers the problem of calculating primes as a sorting problem. It includes the most efficient tree-based sorting algorithm that is possible and shows that finding a new prime can be done by sorting the differences between the previous primes in the right way. Unfortunately it has turned out that going this way is even more slowly than trying to find primes by brute force. So it can only be used as a test with heavy load for the sorting algorithm, which can be used for sorting any kind of data. And as already mentioned, it's just the most efficient tree-based sorting algorithm that you can get. But furthermore this way of finding primes interestingly leaves a hard nut to crack for mathematicians: In very rare cases it finds numbers that are not primes. For all primes below one million this phenomenon arises in exactly two cases: 31213 which is 7 * 7 * 7 * 7 * 13 336141 which is 3 * 3 * 13 * 13 * 13 * 17 Who can explain, why?

Network grep, on steroids

ScenConnect shows scenarios as networks of situation and event tag sets, for fast comparisons. It links scenarios to tags, scores, and other metadata, creating situationals suitable for search, mining, machine learning, and planning.

SemanticSearch is a study project with aim to create a tool to augument search capabilities of existing systems with semantic network-based algorithms

StrMatch is a simple java program, created for educational purposes, that allows user to test a great part of string matching algorithms. An intuitive user interface shows each algorithm step accurately...

The system searches synonyms (and related words) in Wikipedia. WikIDF generates index database of Wikipedia (for Russian, English, and German). The continuation of this project is "wikokit" at code.google.com