Customers who bought this item also bought

• A Profile of The Brazilian Paint Industry, 3rd Edition
• The Brazilian Automotive Supplier Report 2012
• Brazil Oil Markets, 2012
• Travel and Tourism in Brazil, Key Trends and Opportunities to 2015
• Brazil Neonatal Equipment Market 2012-2016
• Medical Device Market Opportunities in Brazil, 2012
• Emerging Market for Clinical Trials in Brazil - Improved Guidelines from ANVISA and CONEP are Shortening the Regulatory Approval Process and Advancing the Market
• Strategic Analysis of the Brazilian Commercial Truck Market
• Brazil Transport Logistics 2011
• Brazil Tyre Market Forecast & Opportunities, 2016

Levenshtein Distance. Edition No. 1

VDM Publishing House, June 2010, Pages: 96

In database record linkage or natural language processing tasks one usually encounters problems when working with data or texts containing noise, typos and other kinds of errors. In this thesis the use of modified Levenshtein edit distances to deal with these problems is investigated. For the task of linking distinct records representing the same entity in a database we used and extended the WEKA API for Machine Learning, obtaining good precision and recall results. For the task of searching and annotating occurrences of specified words in texts written in natural language we implemented an approximate Gazetteer for GATE, the General Architecture for Text Engineering.

Bruno, Woltzenlogel Paleo.
With this thesis Bruno Woltzenlogel Paleo obtained a M.Sc. degree in Computer Science in the Technological Institute of Aeronautics in Brazil. Subsequently, he specialized in Computational Logic, obtaining M.Sc. and Ph.D. degrees in the Vienna University of Technology in Austria.