7 search results - page 1 / 2 » A Stochastic Approach to Wilson's Editing Algorithm |
IBPRIA
2005
Springer
13 years 9 months ago
2005
Springer
Abstract. Two extensions of the original Wilson’s editing method are introduced in this paper. These new algorithms are based on estimating probabilities from the k-nearest neigh...
ICIAP
1999
ACM
13 years 8 months ago
1999
ACM
ÐThis paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matchi...
ECML
2007
Springer
13 years 10 months ago
2007
Springer
The problem of learning metrics between structured data (strings, trees or graphs) has been the subject of various recent papers. With regard to the specific case of trees, some a...
SIGMOD
2009
ACM
13 years 11 months ago
2009
ACM
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 ...
EMNLP
2007
13 years 5 months ago
2007
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 ...