Approximate String Matching

TL;DR: Experiments in hand-written digit recognition are presented, revealing that the normalized edit distance consistently provides better results than both unnormalized or post-normalized classical edit distances.

TL;DR: The parallels between information retrieval and phonetic matching are explained, and the new phonetics matching techniques described are compared with existing techniques to demonstrate that the new techniques are superior.

TL;DR: A three-stage framework for matching pieces of music is proposed and it is shown that, by instantiating the framework with appropriate music manipulation and comparison techniques, Pieces of music that match a query can be identified in a large collection.

TL;DR: Tess (Type Evolution Software System) is built that uses a model of type changes involving multiple types to recognize type changes by comparing schemas and then produces a transformer that can update data in a database to correspond to a newer version of the schema.

TL;DR: This thesis investigates the problem of data optimization for some fundamental static data types, concentrating on linked data structures such as trees, and problems of finding a minimal representation for general unordered trees where pointers to children are stored in a block of consecutive locations.

TL;DR: This thesis proposes three dynamic indexing techniques and a blocking key learning algorithm to be used with real-time ER, and proposes an unsupervised learning algorithm that automatically generates optimal blocking keys for building indexes that are adequate for real- time ER.

TL;DR: A number of new tools were purposely developed for this thesis, including a string-edit distance function, Evolutionary Distance, a technique for reducing strings to their normal forms modulo a non-confluent string rewriting system, new refined formal definitions of transformations system (TS) descriptions of formal languages, and a distance-driven search technique for Valletta's search engine.

TL;DR: The skew algorithm for suffix array construction over integer alphabets that can be implemented to run in linear time using integer sorting as its only nontrivial subroutine is introduced.