Model fragment comparison using natural language processing techniques

作者: Karagiannis Dimitris , Buchmann Robert Andrei

DOI: 10.1007/978-3-642-54411-8_20

关键词:

摘要: The goal of this paper is to set a common working ground for computational linguistics and the metamodelling paradigm, by integrating notions high abstraction from both fields thus mediating possibility repurposing techniques one field other.

参考文章(24)
Aleš Wojnar, Irena Mlýnková, Jiří Dokulil, None, Similarity of DTDs Based on Edit Distance and Semantics IDC. pp. 207- 216 ,(2008) , 10.1007/978-3-540-85257-5_21
Alexander Maedche, Steffen Staab, Measuring Similarity between Ontologies knowledge acquisition, modeling and management. pp. 251- 263 ,(2002) , 10.1007/3-540-45810-7_24
Philip N. Klein, Computing the Edit-Distance between Unrooted Ordered Trees european symposium on algorithms. pp. 91- 102 ,(1998) , 10.1007/3-540-68530-8_8
Kuo-Chung Tai, The Tree-to-Tree Correction Problem Journal of the ACM. ,vol. 26, pp. 422- 433 ,(1979) , 10.1145/322139.322143
Kaizhong Zhang, Dennis Shasha, Simple fast algorithms for the editing distance between trees and related problems SIAM Journal on Computing. ,vol. 18, pp. 1245- 1262 ,(1989) , 10.1137/0218082
Matthias Weidlich, Artem Polyvyanyy, Nirmit Desai, Jan Mendling, Process Compliance Measurement Based on Behavioural Profiles Advanced Information Systems Engineering. pp. 499- 514 ,(2010) , 10.1007/978-3-642-13094-6_38
Klaus U. Schulz, Stoyan Mihov, Fast string correction with Levenshtein automata International Journal on Document Analysis and Recognition. ,vol. 5, pp. 67- 85 ,(2002) , 10.1007/S10032-002-0082-8
Fred J. Damerau, A technique for computer detection and correction of spelling errors Communications of the ACM. ,vol. 7, pp. 171- 176 ,(1964) , 10.1145/363958.363994