A similarity between probabilistic tree languages: Application to XML document families.

DOI10.1016/S0031-3203(02)00320-5zbMATH Open1047.68550OpenAlexW2088024130MaRDI QIDQ1400519FDOQ1400519

Authors: Rafael C. Carrasco, Juan Ramón Rico-Juan 

Publication date: 13 August 2003

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0031-3203(02)00320-5

Recommendations

• Numerical similarity and dissimilarity measures between two trees
• scientific article; zbMATH DE number 1977838
• scientific article; zbMATH DE number 1950751
• Alignment distance of regular tree languages
• Similarity measures for XML documents based on kernel matrix learning

zbMATH Keywords

Distance between tree languagesSimilarity of structured documents

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Cites Work

• One-unambiguous regular languages
• Computing the relative entropy between regular tree languages
• Accurate computation of the relative entropy between stochastic regular grammars

Cited In (4)

• Generating, sampling and counting subclasses of regular tree languages
• Learning Tree Languages
• Learning tree languages from text
• Similarity measures for XML documents based on kernel matrix learning

This page was built for publication: A similarity between probabilistic tree languages: Application to XML document families.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1400519)