Andere Kunden interessierten sich auch für
![Euclidean Distance Transform of 3D Images on L.A.R.P.B.S. model]( "Euclidean Distance Transform of 3D Images on L.A.R.P.B.S. model")
Euclidean Distance Transform of 3D Images on L.A.R.P.B.S. model32,99 €![On the Editing Distance Between Trees and Related Problems]( "On the Editing Distance Between Trees and Related Problems")
On the Editing Distance Between Trees and Related Problems30,99 €![Optimization of Routes for Traveling in Brazil]( "Optimization of Routes for Traveling in Brazil")
Optimization of Routes for Traveling in Brazil39,99 €![Distance training of teachers to use multimedia tools and technologies]( "Distance training of teachers to use multimedia tools and technologies")
Distance training of teachers to use multimedia tools and technologies32,99 €![3D Movie Making]( "3D Movie Making")
3D Movie Making196,99 €![Bridging the Gap Between Graph Edit Distance and Kernel Machines]( "Bridging the Gap Between Graph Edit Distance and Kernel Machines")
Bridging the Gap Between Graph Edit Distance and Kernel Machines109,99 €![Human Recognition at a Distance in Video]( "Human Recognition at a Distance in Video")
Human Recognition at a Distance in Video74,99 €
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.