Sciweavers

136 search results - page 2 / 28
» Learning probabilistic models of tree edit distance
Sort
View
SIGMOD
2009
ACM
140views Database» more  SIGMOD 2009»
13 years 11 months ago
Robust web extraction: an approach based on a probabilistic tree-edit model
On script-generated web sites, many documents share common HTML tree structure, allowing wrappers to effectively extract information of interest. Of course, the scripts and thus ...
Nilesh N. Dalvi, Philip Bohannon, Fei Sha
ISCI
2007
170views more  ISCI 2007»
13 years 4 months ago
Automatic learning of cost functions for graph edit distance
Graph matching and graph edit distance have become important tools in structural pattern recognition. The graph edit distance concept allows us to measure the structural similarit...
Michel Neuhaus, Horst Bunke
IJCV
2007
115views more  IJCV 2007»
13 years 4 months ago
Discovering Shape Classes using Tree Edit-Distance and Pairwise Clustering
This paper describes work aimed at the unsupervised learning of shape-classes from shock trees. We commence by considering how to compute the edit distance between weighted trees. ...
Andrea Torsello, Antonio Robles-Kelly, Edwin R. Ha...
JIIS
2008
95views more  JIIS 2008»
13 years 4 months ago
Approximate schemas, source-consistency and query answering
We use the Edit distance with Moves on words and trees and say that two regular (tree) languages are -close if every word (tree) of one language is -close to the other. A transduc...
Michel de Rougemont, Adrien Vieilleribière
EMNLP
2007
13 years 6 months ago
A Probabilistic Approach to Diachronic Phonology
We present a probabilistic model of diachronic phonology in which individual word forms undergo stochastic edits along the branches of a phylogenetic tree. Our approach allows us ...
Alexandre Bouchard-Côté, Percy Liang,...