An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
Relaxing the Triangle Inequality in Pattern Matching
International Journal of Computer Vision
Upper semi-lattice of binary strings with the relation "x is simple conditional to y"
Theoretical Computer Science
Conditional complexity and codes
Theoretical Computer Science
Logical operations and Kolmogorov complexity
Theoretical Computer Science
Independent minimum length programs to translate between given strings
Theoretical Computer Science
Information distance and conditional complexities
Theoretical Computer Science
Complex Data: Mining Using Patterns
Proceedings of the ESF Exploratory Workshop on Pattern Detection and Discovery
Selecting the right interestingness measure for association patterns
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Logical Operations and Kolmogorov Complexity II
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
Shape Matching: Similarity Measures and Algorithms
SMI '01 Proceedings of the International Conference on Shape Modeling & Applications
Question answering from the web using knowledge annotation and knowledge mining techniques
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Towards parameter-free data mining
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
ACM SIGKDD Explorations Newsletter
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Algorithmic Clustering of Music Based on String Compression
Computer Music Journal
2005 Special Issue: The context-tree kernel for strings
Neural Networks - Special issue on neural networks and kernel methods for structured domains
Building a reusable test collection for question answering
Journal of the American Society for Information Science and Technology - Research Articles
Clustering Fetal Heart Rate Tracings by Compression
CBMS '06 Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems
Incorporating non-local information into information extraction systems by Gibbs sampling
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Bidirectional inference with the easiest-first strategy for tagging sequence data
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
The Google Similarity Distance
IEEE Transactions on Knowledge and Data Engineering
Information distance from a question to an answer
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Shannon entropy vs. kolmogorov complexity
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
IEEE Transactions on Information Theory
Shared information and program plagiarism detection
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Alignment-based surface patterns for factoid question answering systems
Integrated Computer-Aided Engineering - Selected papers from the IEEE Conference on Information Reuse and Integration (IRI), July 13-15, 2008
Measuring the non-compositionality of multiword expressions
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
A new multiword expression metric and its applications
Journal of Computer Science and Technology - Special issue on natural language processing
Information distance and its extensions
DS'11 Proceedings of the 14th international conference on Discovery science
Information distance between what I said and what it heard
Communications of the ACM
| Hi-index | 0.02 |
In a question answering (QA) system, the fundamental problem is how to measure the distance between a question and an answer, hence ranking different answers. We demonstrate that such a distance can be precisely and mathematically defined. Not only such a definition is possible, it is actually provably better than any other feasible definitions. Not only such an ultimate definition is possible, but also it can be conveniently and fruitfully applied to construct a QA system. We have built such a system -- QUANTA. Extensive experiments are conducted to justify the new theory.