Welcome - Register - Login - Help/FAQ - 0 items

Search
Enter keywords, a title or
a report id number below.

Advanced


	Select a currency for use throughout the site

Viewing report

Order by Fax
Ask a Question
Printer Friendly
PDF Brochure

Hard Copy

Live Chat Live Help Software for Website

Levenshtein Distance. Edition No. 1

VDM Publishing House, June 2010, Pages: 96


	Description



		Authors


		Enquire before Buying


		Send to a Friend

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.

For enquiries please call us on:

+353-1-415-1241 (GMT Office Hours)

1-917-300-0470 (EST Office Hours)