This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...
In this paper we present a new method of baseline detection of online or offline short handwriting. This work is part of a large project for the edification of a dual online / off...
Sponsored search systems are tasked with matching queries to relevant advertisements. The current state-of-the-art matching algorithms expand the user's query using a variety...
Andrei Z. Broder, Peter Ciccolo, Evgeniy Gabrilovi...
Disambiguating concepts and entities in a context sensitive way is a fundamental problem in natural language processing. The comprehensiveness of Wikipedia has made the online enc...
Lev-Arie Ratinov, Dan Roth, Doug Downey, Mike Ande...
This paper describes experiences with on-line and in-class sections of a writing-intensive course, including a collaborative library literacy unit. It reports on a mid-semester so...