Articoli correlati a Levenshtein Distance: Two Applications in Database...
Levenshtein Distance: Two Applications in Database Record Linkage and Natural Language Processing - Brossura
Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Risultati della ricerca per Levenshtein Distance: Two Applications in Database...
Immagini fornite dal venditore
Levenshtein Distance
Editore:
LAP LAMBERT Academic Publishing Jun 2010, 2010
ISBN 10: 3838362438
ISBN 13: 9783838362434
Nuovo
Taschenbuch
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9783838362434
Compra nuovo
EUR 49,00
Spedizione EUR 23,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 2 disponibili
Immagini fornite dal venditore
Levenshtein Distance
Editore:
LAP LAMBERT Academic Publishing, 2010
ISBN 10: 3838362438
ISBN 13: 9783838362434
Nuovo
Brossura
Da: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: 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. Codice articolo 5416591
Compra nuovo
EUR 41,05
Spedizione EUR 48,99
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Levenshtein Distance
Editore:
LAP LAMBERT Academic Publishing Jun 2010, 2010
ISBN 10: 3838362438
ISBN 13: 9783838362434
Nuovo
Taschenbuch
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9783838362434
Compra nuovo
EUR 49,00
Spedizione EUR 60,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Levenshtein Distance : Two Applications in Database Record Linkage and Natural Language Processing
Editore:
LAP LAMBERT Academic Publishing, 2010
ISBN 10: 3838362438
ISBN 13: 9783838362434
Nuovo
Taschenbuch
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9783838362434
Compra nuovo
EUR 49,00
Spedizione EUR 60,81
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Levenshtein Distance: Two Applications in Database Record Linkage and Natural Language Processing
Editore:
LAP LAMBERT Academic Publishing, 2010
ISBN 10: 3838362438
ISBN 13: 9783838362434
Antico o usato
Paperback
Da: Mispah books, Redhill, SURRE, Regno Unito
Valutazione del venditore 4 su 5 stelle
Paperback. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book. Codice articolo ERICA77538383624386
Compra usato
EUR 122,64
Spedizione EUR 29,47
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 1 disponibili