Fast serial and parallel algorithms for approximate tree matching with VLDC's (Extended Abstract)
- 1 January 1992
- book chapter
- Published by Springer Nature
- p. 151-161
- https://doi.org/10.1007/3-540-56024-6_12
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A tool for tree pattern matchingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Fast algorithms for the unit cost editing distance between treesJournal of Algorithms, 1990
- An Improved Algorithm For Approximate String MatchingSIAM Journal on Computing, 1990
- Simple Fast Algorithms for the Editing Distance between Trees and Related ProblemsSIAM Journal on Computing, 1989
- Fast parallel and serial approximate string matchingJournal of Algorithms, 1989
- Efficient tree pattern matchingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Semantically significant patterns in dictionary definitionsPublished by Association for Computational Linguistics (ACL) ,1986
- Finding approximate patterns in stringsJournal of Algorithms, 1985
- Extracting semantic hierarchies from a large on-line dictionaryPublished by Association for Computational Linguistics (ACL) ,1985
- The Tree-to-Tree Correction ProblemJournal of the ACM, 1979