Volume 14 is in honor of M. Polanyi and of G.M. Leibniz. The chapters do not necessarily mention them, but some chapters do. Most of the chapters (by professional philosophers and other professional scholars) consist of scholarship unique to this volume and are directed to issues related to death, life extension, and anti-death, broadly construed.
Two Applications in Database Record Linkage and Natural Language Processing
Focusing on the challenges of noise and errors in database record linkage and natural language processing, this thesis explores the application of modified Levenshtein edit distances. It enhances the WEKA API for machine learning to achieve high precision and recall in linking records of the same entity. Additionally, it presents an implementation of an approximate Gazetteer for GATE, aimed at effectively searching and annotating specified words in natural language texts.
Formal proofs of interesting mathematical theorems are usually too large and full of trivial structural information, and hence hard to understand and analyze. Techniques to extract specific essential information from these proofs are needed. This book describes four algorithms to extract a Herbrand sequent of the end-sequent of proofs written in Gentzen's Sequent Calculus LK for classical First-Order Logic. Within this calculus, we define a Herbrand sequent as a generalization of Herbrand disjunction, and its extraction can be used to summarize the creative information of a formal proof, which lies on the instantiations chosen for the quantifiers. One of these algorithms has been implemented in CERes (Cut-Elimination by Resolution), an automated system for proof transformations and analysis.