Combinatorial Pattern Matching addresses issues of searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays. The goal is to derive non-trivial combinatorial properties for such structures and then to exploit these properties in order to achieve improved performance for the corresponding computational problem.

Not exactly a fresh resource, but I found it useful.

Automatic Speech Recognition (ASR) on Linux is becoming easier. Several packages are available for users as well as developers. This document describes the basics of speech recognition and describes some of the available software.

Also at http://www.faqs.org/docs/Linux-HOWTO/Speech-Recognition-HOWTO.html

Information, resources newsletters and mailing lists relating to intelligent information agents, intentional agents, software agents, softbots, knowbots, infobots, etc. Published and maintained by the UMBC Laboratory for Advanced Information Technology.

Note: this resource is old/outdated (last updated in 2003 or 2005).