564 search results - page 33 / 113 » Error-tolerant Tree Matching |
101
click to vote
ACL
2008
15 years 3 months ago
2008
This paper proposes a method to correct English verb form errors made by non-native speakers. A basic approach is template matching on parse trees. The proposed method improves on...
109
click to vote
ICDE
2010
IEEE
16 years 1 months ago
2010
IEEE
Abstract-- Despite of advances in machine learning technologies, a schema matching result between two database schemas (e.g., those derived from COMA++) is likely to be imprecise. ...
141
click to vote
STACS
1992
Springer
15 years 5 months ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
227
Voted
CVIU
2011
14 years 8 months ago
2011
In this paper we propose an approach for action recognition based on a vocabulary of local motion-appearance features and fast approximate search in a large number of trees. Large...
108
click to vote
ICALP
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...