Artículos relacionados a Levenshtein Distance: Two Applications in Database...
Levenshtein Distance: Two Applications in Database Record Linkage and Natural Language Processing - Tapa blanda
Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Resultados de la búsqueda para Levenshtein Distance: Two Applications in Database...
Imagen del vendedor
Levenshtein Distance
Publicado por
LAP LAMBERT Academic Publishing Jun 2010, 2010
ISBN 10: 3838362438
ISBN 13: 9783838362434
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 96 pp. Englisch. Nº de ref. del artículo: 9783838362434
Comprar nuevo
EUR 49,00
Envío por EUR 23,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen del vendedor
Levenshtein Distance
Publicado por
LAP LAMBERT Academic Publishing, 2010
ISBN 10: 3838362438
ISBN 13: 9783838362434
Nuevo
Tapa blanda
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Woltzenlogel Paleo BrunoWith 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. Nº de ref. del artículo: 5416591
Comprar nuevo
EUR 41,05
Envío por EUR 48,99
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Levenshtein Distance
Publicado por
LAP LAMBERT Academic Publishing Jun 2010, 2010
ISBN 10: 3838362438
ISBN 13: 9783838362434
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 96 pp. Englisch. Nº de ref. del artículo: 9783838362434
Comprar nuevo
EUR 49,00
Envío por EUR 60,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
Levenshtein Distance : Two Applications in Database Record Linkage and Natural Language Processing
Publicado por
LAP LAMBERT Academic Publishing, 2010
ISBN 10: 3838362438
ISBN 13: 9783838362434
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. Nº de ref. del artículo: 9783838362434
Comprar nuevo
EUR 49,00
Envío por EUR 60,81
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen de archivo
Levenshtein Distance: Two Applications in Database Record Linkage and Natural Language Processing
Publicado por
LAP LAMBERT Academic Publishing, 2010
ISBN 10: 3838362438
ISBN 13: 9783838362434
Antiguo o usado
Paperback
Librería: Mispah books, Redhill, SURRE, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
Paperback. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book. Nº de ref. del artículo: ERICA77538383624386
Comprar usado
EUR 122,64
Envío por EUR 29,47
Se envía de Reino Unido a Estados Unidos de America
Se envía de Reino Unido a Estados Unidos de America
Cantidad disponible: 1 disponibles