Term-weighting approaches in automatic text retrieval
Information Processing and Management: an International Journal
A probabilistic model of information retrieval: development and comparative experiments
Information Processing and Management: an International Journal
Flexible pattern matching in strings: practical on-line search algorithms for texts and biological sequences
Cumulated gain-based evaluation of IR techniques
ACM Transactions on Information Systems (TOIS)
Output-sensitive autocompletion search
Information Retrieval
Context-aware query suggestion by mining click-through and session data
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Response time in man-computer conversational transactions
AFIPS '68 (Fall, part I) Proceedings of the December 9-11, 1968, fall joint computer conference, part I
Proceedings of the Second ACM International Conference on Web Search and Data Mining
Efficient interactive fuzzy keyword search
Proceedings of the 18th international conference on World wide web
Extending autocompletion to tolerate errors
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Suggesting Topic-Based Query Terms as You Type
APWEB '10 Proceedings of the 2010 12th International Asia-Pacific Web Conference
Context-sensitive query auto-completion
Proceedings of the 20th international conference on World wide web
Web query expansion by wordnet
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
ASWC'06 Proceedings of the First Asian conference on The Semantic Web
Why the magic number seven plus or minus two
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.00 |
Autocompletion systems support users in the formulation of queries in different computer systems, from development environments to the web. In this paper we describe Composite Match Autocompletion (COMMA), a lightweight approach to the introduction of semantics in the realization of a semi-structured data auto completion matching algorithm. The approach is formally described, then it is applied and evaluated with specific reference to the e-commerce context. The semantic extension to the matching algorithm exploits available information about product categories and distinguishing features of products to enhance the elaboration of exploratory queries. COMMA supports a seamless management of both targeted/precise queries and exploratory/vague ones, combining different filtering and scoring techniques. The algorithm is evaluated with respect both to effectiveness and efficiency in a real-world scenario: the achieved improvement is significant and not associated to a sensible increase of computational costs.