DOCSLIB.ORG

Faegheh Hasibi

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Faegheh Hasibi ISBN 978-82-326-2967-1 (electronic ver.) ISBN 978-82-326-2967-1(electronic ISBN 978-82-326-2966-4(print ISSN 1503-8181 ISSN ed ver.) aegheh Hasibi aegheh F Doctoral theses at NTNU, 2018:88 NTNU, at theses Doctoral NTNU Norwegian University of Science and Technology Thesis for the Degree of Philosophiae Doctor Faculty of Information Technology and Electrical Engineering Doctoral thesis Department of Computer Science Knowledge Bases Knowledge with Semantic Search Hasibi Faegheh Doctoral thesesatNTNU,2018:88 Faegheh Hasibi Semantic Search with Knowledge Bases Thesis for the Degree of Philosophiae Doctor Trondheim, March 2018 Norwegian University of Science and Technology Faculty of Information Technology and Electrical Engineering Department of Computer Science NTNU Norwegian University of Science and Technology Thesis for the Degree of Philosophiae Doctor Faculty of Information Technology and Electrical Engineering Department of Computer Science © Faegheh Hasibi ISBN 978-82-326-2966-4 (printed ver.) ISBN 978-82-326-2967-1 (electronic ver.) ISSN 1503-8181 IMT-report 2018:88 Doctoral theses at NTNU, 2018:88 Printed by NTNU Grafisk senter Abstract Over the past decade, modern search engines have made significant progress towards better understanding searchers’ intents and providing them with more focused answers, a paradigm that is called “semantic search.” Semantic search is a broad area that encompasses a variety of tasks and has a core enabling data component, called the knowledge base. In this thesis, we utilize knowledge bases to address three tasks involved in semantic search: (i) query understanding, (ii) entity retrieval, and (iii) entity summarization. Query understanding is the first step in virtually every semantic search sys- tem. We study the problem of identifying entity mentions in queries and linking them to the corresponding entries in a knowledge base. We formulate this as the task of entity linking in queries, propose refinements to evaluation measures, and publish a test collection for training and evaluation purposes. We further establish a baseline method for this task through a reproducibility study, and introduce different methods with the aim to strike a balance between efficiency and effectiveness. Next, we turn to using the obtained annotations for answering the queries. Here, our focus is on the entity retrieval task: answering search queries by re- turning a ranked list of entities. We introduce a general feature-based model based on Markov Random Fields, and show improvements over existing base- line methods. We find that the largest gains are achieved for complex natural language queries. Having generated an answer to the query (from the entity retrieval step), we move on to presentation aspects of the results. We introduce and address the novel problem of dynamic entity summarization for entity cards, by breaking it into two subtasks, fact ranking and summary generation. We perform an extensive evaluation of our method using crowdsourcing, and show that our supervised fact ranking method brings substantial improvements over the most comparable baselines. In this thesis, we take the reproducibility of our research very seriously. Therefore, all resources developed within the course of this work are made publicly available. We further make two major software and resource contribu- tions: (i) the Nordlys toolkit, which implements a range of methods for semantic search, and (ii) the extended DBpedia-Entity test collection. iii Preface This thesis is submitted to the Norwegian University of Science and Technology (NTNU) for partial fulfillment of the requirements for the degree Philosophiae Doctor (PhD). The work has been carried out at the Department of Computer Science, NTNU, Trondheim. The doctoral program has been supervised by Professor Svein Erik Bratsberg, Professor Krisztian Balog (University of Sta- vanger), and Dr. Øystein Torbjørnsen (Microsoft Development Center Norway). During the process, the candidate has been supported by the Information Ac- cess Disruptions (iAd) project, funded by the Research Council of Norway and NTNU. iv Acknowledgements This thesis is the end result of a long journey, started back on the first day of my school when I was seven. Many people had affected me during this journey, the most influential ones being: my parents, who raised me with love, care, and a questioning mind; and my lovely husband, the greatest friend of mine, who was emotionally next to me in every step of this thesis and provided me with unconditional support. This thesis is dedicated to them. A number of individuals supported me during the past few years, whom I would like to thank. To my advisors ... My first and foremost acknowledgement goes to my advisor, Prof. Svein Erik Bratsberg, who always offered wise advices and gave me the freedom to pursue my research interests. Thanks for always being there and for providing me with incredible support and encouragement. I extend my appreciation to Dr. Øystein Torbjørsen for his guidance and inspirational meetings during the early stages of my PhD. My special gratitude goes to Prof. Krisztian Balog, as I was fortunate to work under his eminent guidance since July 2014. Thanks for everything you have done for me. You taught me how to do research, from idea to presentation, and provided me with valuable comments and advices about every aspect of my research. Not only that, your encouragement and friendship was always a source of energy during these years. Thanks for your hospitality during my Stavanger visits, making all the fun moments at the IAI group, giving vision and advice about after-PhD career, and of course teaching me a bit of skiing. Words fall short to express my thanks; I summarize it by saying “you were a great friend and manager who was hard to find, difficult to leave, and impossible to forget.” To my PhD dissertation committee ... I am honored and grateful to have Prof. James Allan, Prof. Arjen P. de Vries, and Prof. Kjetil Nørv˚ag serving as my committee members. I would like to thank them for reviewing this dissertation and for providing me with detailed comments and suggestions. v To my colleagues and collaborators ... I am thankful to colleagues at the Department of Computer Science, both PhD students, and technical and administrative staff. The help and support from the former PhD graduates of the group, Massimiliano, Naimdjon, Orestis, Robert, and Simon was a gift. In particular, I thank Simon Lia-Jonassen for the en- lightening advices in the early stages of my PhD and for providing me with constructive feedback on my first paper. The informal chats and group outings with Dirk, Eliezer, Hoda, Jan, Malene, Shweta, Soudabeh, Stella, Tomasz, and T´arik made my stay at NTNU a memorable experience. Thank you Jan for cre- ating a fun, creative office environment, and for capturing our moments through your wonderful lens. I further extend my gratitude to the members of the IAI group at the Univer- sity of Stavanger for the nice company during our group activities and conference trips. I particularly thank Dar´ıo and Shuo, who were also my co-authors and collaborators. My acknowledgments also goes to my co-authors from across the ocean for all that I have learned during our discussions. To my internship hosts ... I would like to express my deepest appreciation to Dr. B. Barla Cambazoglu for hosting me at the Yahoo! research lab and introducing me to the world of machine learning and entity search. Thanks Ioannis for providing me with useful instructions and many fruitful discussions. To my friends and family ... I owe my warm gratitude to my dearest friends, Maryam and Hamid, for their loverly heart and home, which were always open for me during my Stavanger trips. Thanks Maryam for your delicious exotic foods and for our memorable chats during tea-drinking moments. Most importantly, I convey my heartfelt appreciation to my sisters and brother, who were my childhood friends, and later my great teachers. Thanks for helping me to find my path and sending me your love and care over miles of distance. The traces of your love and support are embedded in this thesis. vi Contents 1 Introduction 1 1.1KnowledgeBases........................... 2 1.2 Research Outline and Questions ................... 3 1.2.1 QueryUnderstanding.................... 4 1.2.2 EntityRetrieval....................... 6 1.2.3 EntitySummarization.................... 7 1.3Contributions............................. 8 1.4ThesisOverview........................... 10 1.5Origins................................. 11 2 Background 15 2.1ConventionalInformationRetrieval................. 15 2.1.1 Document Processing .................... 16 2.1.2 QueryProcessing....................... 17 2.1.3 DocumentRetrieval..................... 18 2.1.4 Evaluation.......................... 24 2.2SemanticSearch........................... 26 2.2.1 KnowledgeBases....................... 27 2.2.2 Document Processing .................... 29 2.2.3 QueryUnderstanding.................... 31 2.2.4 Retrieval........................... 32 2.2.5 Result presentation ...................... 35 3 Query Understanding via Entity Linking 37 3.1TaskDefinitions........................... 40 3.1.1 EntityLinking(inDocuments)............... 40 3.1.2 EntityLinkinginQueries.................. 40 vii Contents viii 3.1.3 SemanticLinking....................... 43 3.2EvaluationMethodology....................... 44 3.3TestCollections............................ 45 3.3.1 YSQLE............................ 45 3.3.2 ERD.............................. 47
Load more

Recommended publications
  • Web Query Classification and URL Ranking Based on Click Through Approach
    S.PREETHA et al, International Journal of Computer Science and Mobile Computing Vol.2 Issue. 10, October- 2013, pg. 138-144 Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology ISSN 2320–088X IJCSMC, Vol. 2, Issue. 10, October 2013, pg.138 – 144 RESEARCH ARTICLE Web Query Classification and URL Ranking Based On Click through Approach S.PREETHA1, K.N Vimal Shankar2 PG Scholar1, Asst. Professor2 Department of Computer Science & Engineering1, 2 V.S.B. Engineering College, Karur, India1, 2 [email protected], [email protected] Abstract― In a web based application; different users may have different search goals when they submit it to a search engine. For a broad-topic and ambiguous query it is difficult. Here we propose a novel approach to infer user search goals by analyzing search engine query logs. This is typically shown in cases such as these: Different users have different backgrounds and interests. However, effective personalization cannot be achieved without accurate user profiles. We propose a framework that enables large-scale evaluation of personalized search. The goal of personalized IR (information retrieval) is to return search results that better match the user intent. First, we propose a framework to discover different user search goals for a query by clustering the proposed feedback sessions. Feedback sessions are getting constructed from user click-through logs and can efficiently reflect the information needs of users. Second, we propose an approach to generate pseudo-documents to better represent the feedback sessions for clustering.
    [Show full text]
  • Classifying User Search Intents for Query Auto-Completion
    Classifying User Search Intents for Query Auto-Completion Jyun-Yu Jiang Pu-Jen Cheng Department of Computer Science Department of Computer Science University of California, Los Angeles National Taiwan University California 90095, USA Taipei 10617, Taiwan [email protected] [email protected] ABSTRACT completion is to accurately predict the user's intended query The function of query auto-completion1 in modern search with only few keystrokes (or even without any keystroke), engines is to help users formulate queries fast and precisely. thereby helping the user formulate a satisfactory query with Conventional context-aware methods primarily rank candi- less effort and less time. For instance, users can avoid mis- date queries2 according to term- and query- relationships to spelling and ambiguous queries with query completion ser- the context. However, most sessions are extremely short. vices. Hence, how to capture user's search intents for pre- How to capture search intents with such relationships be- cisely predicting the query one is typing is very important. The context information, such as previous queries and comes difficult when the context generally contains only few 3 queries. In this paper, we investigate the feasibility of dis- click-through data in the same session , is usually utilized covering search intents within short context for query auto- to capture user's search intents. It also has been exten- completion. The class distribution of the search session (i.e., sively studied in both query completion [1, 21, 35] and sug- gestion [18, 25, 37]. Previous work primarily focused on cal- issued queries and click behavior) is derived as search in- 2 tents.
    [Show full text]
  • DRIVING MR. ALBERT a Trip Across America with Einstein's Brain by Michael Paterniti
    DAVID EHRENFELD: THE TECHNO-POX UPON OUR LAND HARPER'S MAGAZINE/OCTOBER 1997 $3.95 DRIVING MR. ALBERT A Trip Across America with Einstein's Brain By Michael Paterniti -----------. ----------- MADE MEN OF LETTERS Our Thing About the Cosa N ostra By Albert Mobilio FASCISM A LA MODE In France, the Far Right Presses for National Purity By David Zane Mairowitz FEATHER AND BONE A story by Mark Slouka Also: Michael Chabon and Andy Warhol's Time Capsule -----------+ ----------- F 0 L 0 DRIVInG ffiR. HIBIRT '~l ••iIII'!"'! I dinck, and Nixon. We made bewitching PRINCETON, NEW JERSEY. sonatas and novels and paintings. Stargazed .FEBRUARY 17, 1997. and. built great cities. Exterminated .sorne people. Settled the West. Cooked meat and n the beginning, there was a brain. All slathered it with special sauce. Did the hustle . of the universe was the size of this .Built the strip mall. I. brain, floating in space. Until' one day it , . And in the end, after billions of years of simply exploded. Out poured photons and evolution, a pink two-story' motel rose up on a quarks and leptons. Out flew dust particles like drag of asphalt in Berkeley, California. The millions of fast-moving birds into the expand- Flamingo Motel. There, a man stepped out on- ingaviary of the cosmos. Cooked heavy o to the balcony in a bright beam' of mil- elements-silicon, magnesium, and lennial sunlight, holding the origi- nickel-were sucked into a small nal universe in his hands, in a pocket and balled together Tupperware container, and under great pressure and for one flickering moment morphed with the organic he saw into the future., I matter of our solar system.
    [Show full text]
  • Fusion-The-Energy-Of-The-Universe
    Fusion The Energy of the Universe WHAT IS THE COMPLEMENTARY SCIENCE SERIES? We hope you enjoy this book. If you would like to read other quality science books with a similar orientation see the order form and reproductions of the front and back covers of other books in the series at the end of this book. The Complementary Science Series is an introductory, interdisciplinary, and relatively inexpensive series of paperbacks for science enthusiasts. The series covers core subjects in chemistry, physics, and biological sciences but often from an interdisciplinary perspective. They are deliberately unburdened by excessive pedagogy, which is distracting to many readers, and avoid the often plodding treatment in many textbooks. These titles cover topics that are particularly appropriate for self-study although they are often used as complementary texts to supplement standard discussion in textbooks. Many are available as examination copies to professors teaching appropriate courses. The series was conceived to fill the gaps in the literature between conventional textbooks and monographs by providing real science at an accessible level, with minimal prerequisites so that students at all stages can have expert insight into important and foundational aspects of current scientific thinking. Many of these titles have strong interdisciplinary appeal and all have a place on the bookshelves of literate laypersons. Potentialauthorsareinvitedtocontactoureditorialoffice: [email protected]. Feedback on the titles is welcome. Titles in the Complementary Science Series are detailed at the end of these pages. A 15% discount is available (to owners of this edition) on other books in this series—see order form at the back of this book.
    [Show full text]
  • Automatic Web Query Classification Using Labeled and Unlabeled Training Data Steven M
    Automatic Web Query Classification Using Labeled and Unlabeled Training Data Steven M. Beitzel, Eric C. Jensen, David D. Lewis, Abdur Chowdhury, Ophir Frieder, David Grossman Aleksandr Kolcz Information Retrieval Laboratory America Online, Inc. Illinois Institute of Technology [email protected] {steve,ej,ophir,dagr}@ir.iit.edu {cabdur,arkolcz}@aol.com ABSTRACT We examine three methods for classifying general web queries: Accurate topical categorization of user queries allows for exact match against a large set of manually classified queries, a increased effectiveness, efficiency, and revenue potential in weighted automatic classifier trained using supervised learning, general-purpose web search systems. Such categorization and a rule-based automatic classifier produced by mining becomes critical if the system is to return results not just from a selectional preferences from hundreds of millions of unlabeled general web collection but from topic-specific databases as well. queries. The key contribution of this work is the development Maintaining sufficient categorization recall is very difficult as of a query classification framework that leverages the strengths web queries are typically short, yielding few features per query. of all three individual approaches to achieve the most effective We examine three approaches to topical categorization of classification possible. Our combined approach outperforms general web queries: matching against a list of manually labeled each individual method, particularly improves recall, and allows queries, supervised learning of classifiers, and mining of us to effectively classify a much larger proportion of an selectional preference rules from large unlabeled query logs. operational web query stream. Each approach has its advantages in tackling the web query classification recall problem, and combining the three 2.
    [Show full text]
  • Semantic Matching in Search
    Foundations and Trends⃝R in Information Retrieval Vol. 7, No. 5 (2013) 343–469 ⃝c 2014 H. Li and J. Xu DOI: 10.1561/1500000035 Semantic Matching in Search Hang Li Huawei Technologies, Hong Kong [email protected] Jun Xu Huawei Technologies, Hong Kong [email protected] Contents 1 Introduction 3 1.1 Query Document Mismatch ................. 3 1.2 Semantic Matching in Search ................ 5 1.3 Matching and Ranking ................... 9 1.4 Semantic Matching in Other Tasks ............. 10 1.5 Machine Learning for Semantic Matching in Search .... 11 1.6 About This Survey ...................... 14 2 Semantic Matching in Search 16 2.1 Mathematical View ..................... 16 2.2 System View ......................... 19 3 Matching by Query Reformulation 23 3.1 Query Reformulation .................... 24 3.2 Methods of Query Reformulation .............. 25 3.3 Methods of Similar Query Mining .............. 32 3.4 Methods of Search Result Blending ............. 38 3.5 Methods of Query Expansion ................ 41 3.6 Experimental Results .................... 44 4 Matching with Term Dependency Model 45 4.1 Term Dependency ...................... 45 ii iii 4.2 Methods of Matching with Term Dependency ....... 47 4.3 Experimental Results .................... 53 5 Matching with Translation Model 54 5.1 Statistical Machine Translation ............... 54 5.2 Search as Translation .................... 56 5.3 Methods of Matching with Translation ........... 59 5.4 Experimental Results .................... 61 6 Matching with Topic Model 63 6.1 Topic Models ........................ 64 6.2 Methods of Matching with Topic Model .......... 70 6.3 Experimental Results .................... 74 7 Matching with Latent Space Model 75 7.1 General Framework of Matching .............. 76 7.2 Latent Space Models ...................
    [Show full text]
  • A New Algorithm for Inferring User Search Goals with Feedback Sessions
    International Journal of Advanced Research in Computer Engineering & Technology (IJARCET) Volume 3 Issue 11, November 2014 A Survey on: A New Algorithm for Inferring User Search Goals with Feedback Sessions Swati S. Chiliveri, Pratiksha C.Dhande a few words to search engines. Because these queries are short Abstract— For a broad-topic and ambiguous query, different and ambiguous, how to interpret the queries in terms of a set users may have different search goals when they submit it to a of target categories has become a major research issue. search engine. The inference and analysis of user search goals can be very useful in improving search engine relevance and For example, when the query ―the sun‖ is submitted to a user experience. This paper provides search engine, some people want to locate the homepage of a an overview of the system architecture of proposed feedback United Kingdom newspaper, while some people want to session framework with their advantages. Also we have briefly discussed the literature survey on Automatic Identification of learn the natural knowledge of the sun. Therefore, it is User Goals in Web Search with their pros and cons. We have necessary and potential to capture different user search goals, presented working of various classification approaches such as user needs in information retrieval. We define user search SVM, Exact matching and Bridges etc. under the web query goals as the information on different aspects of a query that classification framework. Lastly, we have described the existing user groups want to obtain. Information need is a user’s web clustering engines such as MetaCrawler, Carrot 2, particular desire to obtain information to satisfy users need.
    [Show full text]
  • Einstein, Mileva Maric
    ffirs.qrk 5/13/04 7:34 AM Page i Einstein A to Z Karen C. Fox Aries Keck John Wiley & Sons, Inc. ffirs.qrk 5/13/04 7:34 AM Page ii For Mykl and Noah Copyright © 2004 by Karen C. Fox and Aries Keck. All rights reserved Published by John Wiley & Sons, Inc., Hoboken, New Jersey Published simultaneously in Canada No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, electronic, mechanical, photocopying, recording, scanning, or otherwise, except as permitted under Section 107 or 108 of the 1976 United States Copyright Act, without either the prior written permission of the Publisher, or authorization through payment of the appropriate per-copy fee to the Copyright Clearance Center, 222 Rosewood Drive, Danvers, MA 01923, (978) 750-8400, fax (978) 646-8600, or on the web at www.copyright.com. Requests to the Publisher for permission should be addressed to the Permissions Department, John Wiley & Sons, Inc., 111 River Street, Hoboken, NJ 07030, (201) 748-6011, fax (201) 748-6008. Limit of Liability/Disclaimer of Warranty: While the publisher and the author have used their best efforts in preparing this book, they make no representations or warranties with respect to the accuracy or completeness of the contents of this book and specifically disclaim any implied warranties of merchantability or fitness for a particular purpose. No warranty may be created or extended by sales representatives or written sales materials. The advice and strategies contained herein may not be suitable for your situation.
    [Show full text]
  • Most Valuable (Cited)
    Top 100 Most Valuable Patent Portfolios Based on 3 million patents issued from 1-1-2005 to 3-21-2017 Methodology: 1) Identify all US-based patents and their patent citations 2) Identify most cited patents (patent must be cited > 10x as 10x is the average) 3) Aggregate all of the "most cited patents" into their Assignees and sort Patents Total Average Rank Assignee Being Cited Citations Citations/Patent 1 International Business Machines Corporation 5902 163252 27.66 2 Microsoft Corporation 4688 142191 30.33 3 Ethicon Endo-Surgery, Inc. 715 97544 136.43 4 Western Digital Technologies, Inc. 972 71947 74.02 5 Intel Corporation 2273 66689 29.34 6 Hewlett-Packard Development Company, L.P. 1922 58888 30.64 7 Tyco Healthcare Group LP 498 56695 113.85 8 Samsung Electronics Co., Ltd. 2097 53863 25.69 9 Canon Kabushiki Kaisha 1950 52703 27.03 10 Cisco Technology, Inc. 1702 51491 30.25 11 Micron Technology, Inc. 1567 48443 30.91 12 Medtronic, Inc. 1049 42652 40.66 13 Sony Corporation 1454 37963 26.11 14 Semiconductor Energy Laboratory Co., Ltd. 1177 36719 31.20 15 Apple Inc. 1057 36234 34.28 16 Hitachi, Ltd. 1314 36126 27.49 17 Western Digital (Fremont), LLC 322 36007 111.82 18 Masimo Corporation 220 35402 160.92 19 IGT 746 35063 47.00 20 Nokia Corporation 1110 34107 30.73 21 Kabushiki Kaisha Toshiba 1346 33712 25.05 22 Sun Microsystems, Inc. 982 29744 30.29 23 Matsushita Electric Industrial Co., Ltd. 1092 29719 27.22 24 General Electric Company 1301 29432 22.62 25 Silverbrook Research PTY LTD 656 25941 39.54 26 Boston Scientific SciMed, Inc.
    [Show full text]
  • Improving Search Engines Via Classification
    Improving Search Engines via Classi¯cation Zheng Zhu May 2011 A Dissertation Submitted to Birkbeck College, University of London in Partial Ful¯llment of the Requirements for the Degree of Doctor of Philosophy Department of Computer Science & Information Systems Birkbeck College University of London Declaration This thesis is the result of my own work, except where explicitly acknowledge in the text. Zheng Zhu i Abstract In this dissertation, we study the problem of how search engines can be improved by making use of classi¯cation. Given a user query, traditional search engines output a list of results that are ranked according to their relevance to the query. However, the ranking is independent of the topic of the document. So the results of di®erent topics are not grouped together within the result output from a search engine. This can be problematic as the user must scroll though many irrelevant results until his/her desired information need is found. This might arise when the user is a novice or has super¯cial knowledge about the domain of interest, but more typically it is due to the query being short and ambiguous. One solution is to organise search results via categorization, in particular, the classi¯cation. We designed a target testing experiment on a controlled data set, which showed that classi¯cation-based search could improve the user's search experience in terms of the numbers of results the user would have to inspect before satisfying his/her query. In our investigation of classi¯cation to organise search results, we not only consider the classi¯cation of search results, but also query classi¯cation.
    [Show full text]
  • Building Bridges for Web Query Classification
    Building Bridges for Web Query Classification Dou Shen†, Jian-Tao Sun‡, Qiang Yang†, Zheng Chen‡ †Department of Computer Science and Engineering, Hong Kong University of Science and Technology {dshen,qyang}@cs.ust.hk ‡Microsoft Research Asia, Beijing, P.R.China {jtsun, zhengc}@microsoft.com ABSTRACT 1. INTRODUCTION Web query classification (QC) aims to classify Web users’ With exponentially increasing information becoming avail- queries, which are often short and ambiguous, into a set of able on the Internet, Web search has become an indispens- target categories. QC has many applications including page able tool for Web users to gain desired information. Typi- ranking in Web search, targeted advertisement in response cally, Web users submit a short Web query consisting of a to queries, and personalization. In this paper, we present a few words to search engines. Because these queries are short novel approach for QC that outperforms the winning solu- and ambiguous, how to interpret the queries in terms of a tion of the ACM KDDCUP 2005 competition, whose objec- set of target categories has become a major research issue. tive is to classify 800,000 real user queries. In our approach, In this paper, we call the problem of generating a ranked list we first build a bridging classifier on an intermediate tax- of target categories from user queries the query classification onomy in an offline mode. This classifier is then used in problem, or QC for short. an online mode to map user queries to the target categories The importance of QC is underscored by many services via the above intermediate taxonomy.
    [Show full text]
  • Query Classification Based on Textual Patterns Mining and Linguistic Features Mohamed Ettaleb, Chiraz Latiri, Patrice Bellot
    Query Classification based on Textual Patterns Mining and Linguistic Features Mohamed Ettaleb, Chiraz Latiri, Patrice Bellot To cite this version: Mohamed Ettaleb, Chiraz Latiri, Patrice Bellot. Query Classification based on Textual Patterns Mining and Linguistic Features. 20th International Conference on Computational Linguistics and Intelligent Text Processing (CICLing 2019), Apr 2019, La Rochelle, France. hal-02447749 HAL Id: hal-02447749 https://hal.archives-ouvertes.fr/hal-02447749 Submitted on 21 Jan 2020 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Query Classification based on Textual Patterns Mining and Linguistic Features Mohamed ETTALEB1, Chiraz LATIRI2, and Patrice BELLOT2 1 University of Tunis El Manar, Faculty of Sciences of Tunis, LIPAH research Laboratory, Tunis ,Tunisia 2 Aix-Marseille University, CNRS, LIS UMR 7020, 13397, Marseille, France [email protected], [email protected], [email protected] Abstract. We argue that verbose natural language queries used for soft- ware retrieval contain many terms that follow specific discourse rules, yet hinder retrieval. Through verbose queries, users can express complex or highly specific information needs. However, it is difficult for search engine to deal with this type of queries.
    [Show full text]