Sinossi
Excerpt from On the Editing Distance Between Trees and Related Problems
Since a tree can represent a scene description, a grammar parse, a structural description. And many other phenomena, comparing trees is a way to compare scenes, parses and so on. We consider the distance between two trees to be the (weighted) number of edit operations (insert, delete, and modify) to transform one tree to another. Then, we consider the following kinds of questions.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Altre edizioni note dello stesso titolo
Risultati della ricerca per On the Editing Distance Between Trees and Related Problems...
Immagini fornite dal venditore
On the Editing Distance Between Trees and Related Problems (Classic Reprint)
Print on DemandDa: Forgotten Books, London, Regno Unito
Valutazione del venditore 4 su 5 stelle
Paperback. Condizione: New. Print on Demand. This book focuses on string and tree editing, a concept with a wide range of applications in computer science. The author observes the relationship between the editing distance of two trees and other similar problems, then proposes a postorder dynamic programming algorithm that solves this problem in time complexity O( |Ti| X |Tj| X depth(Ti) X depth(Tj)). The book also extends this algorithm to solve the following problems: - Finding the minimum distance between two trees with a subtree removed from one of them - Discovering the minimum distance between two trees with pruning at a node of one of them - Solving the approximate tree matching problem, which seeks the occurrence in one tree that most closely matches another tree The author's depth of exploration in the realm of tree editing and related problems illuminates how these concepts can be applied across disciplines. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Codice articolo 9781332522569_0
Compra nuovo
EUR 14,99
Spedizione gratuita
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
On the Editing Distance Between Trees and Related Problems Classic Reprint
Da: PBShop.store US, Wood Dale, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781332522569
Compra nuovo
EUR 20,98
Spedizione gratuita
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 15 disponibili
Foto dell'editore
On the Editing Distance Between Trees and Related Problems Classic Reprint
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
Valutazione del venditore 4 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781332522569
Compra nuovo
EUR 20,37
Spedizione EUR 3,80
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 15 disponibili