Filters








42,530 Hits in 8.0 sec

About Reformulation in Full-Text 1 R S

Fathi Debili, Pierre Radasoa, Christian Fluhr
1988 Open research Areas in Information Retrieval  
In this paper, are onalyzed differe,nt kinds of reformulation used in Information Retrieval systems where full-text databases are accessed through natural language queries.  ...  These reformulations are tested separately on large actual full-text databases managed by the SPIRIT system (Syntactic and Probalistic Indexing and Retrieval of Information in Texts).  ...  For each normalized term and relation, the system gives information about occurences in text (l.e. its address and length).  ... 
dblp:conf/riao/DebiliRF88 fatcat:staqmrxgejcjbi2yvgyq6k27cu

Improving Question Answering over Incomplete KBs with Knowledge-Aware Reader [article]

Wenhan Xiong, Mo Yu, Shiyu Chang, Xiaoxiao Guo, William Yang Wang
2019 arXiv   pre-print
KB subgraph; then reformulates the question in the latent space and reads the texts with the accumulated entity knowledge at hand.  ...  The evidence from KB and texts are finally aggregated to predict answers.  ...  Formally, the final attention scorẽ s (r i ,e i ) over each neighbor (r i , e i ) is defined as: s (r i ,e i ) ∝ exp(I[e i ∈ E 0 ] + s r i ).  ... 
arXiv:1905.07098v2 fatcat:3sqnezdi3baz7kmxyjotjifrfi

What Underlies Immersion Students' Production: The Case Of Avoir Besoin De

Sharon Lapkin, Merrill Swain
2004 Foreign language annals  
In this papel; we analyze dialogues between pairs of eighth grade French immersion students about avoir besoin de.  ...  One ofthe advantages of having students work in pairs on language-related tasks is that teachers and researchers can listen to what the students say as they cawy out their assigned tasks.  ...  I S T U D E N T PAIRS A N D F R E N C H P R O F I C 1 EN CY RAT I N G S I R~t h Strong ZOO Stron LI M ia Avcragc Susan b'Ci3k SI l1lOll Averagc AllglC Strong S W \ T Avcragc Amy Avcragc Information about  ... 
doi:10.1111/j.1944-9720.2004.tb02693.x fatcat:a6qfugtlvbc3lo6ivbvkhwje2a

Improving Question Answering over Incomplete KBs with Knowledge-Aware Reader

Wenhan Xiong, Mo Yu, Shiyu Chang, Xiaoxiao Guo, William Yang Wang
2019 Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics  
KB subgraph; then reformulates the question in the latent space and reads the texts with the accumulated entity knowledge at hand.  ...  On the widely-used KBQA benchmark WebQSP, our model achieves consistent improvements across settings with different extents of KB incompleteness. 1  ...  w r 1 , w r 2 , ..., w r lr }.  ... 
doi:10.18653/v1/p19-1417 dblp:conf/acl/XiongYCGW19 fatcat:zqr3f73kfbftvpmjeu4b2alvsi

Large Scale Image Indexing Using Online Non-negative Semantic Embedding [chapter]

Jorge A. Vanegas, Fabio A. González
2013 Lecture Notes in Computer Science  
The experimental evaluation shows that the proposed method, in comparison with several baseline methods, is faster and consumes less memory, keeping a competitive performance in content-based image search  ...  This paper presents a novel method to address the problem of indexing a large set of images taking advantage of associated multimodal content such as text or tags.  ...  The updating rule is reformulated as follows: S τ+1 = S τ + γ v τ S τ t τ − [1] n×1 t T τ . (3) The resulting algorithm (Algorithm 1) starts by randomly initialization of the transformation matrix.  ... 
doi:10.1007/978-3-642-41822-8_46 fatcat:cnsejphfuzgmtmmpnejkjwo5ya

Page 356 of Computational Linguistics Vol. 19, Issue 2 [page]

1993 Computational Linguistics  
About reformulation in full-text IRS.” In Proceedings, RIAO-88, 343-357. Evans, R., and Gazdar, G., editors. (1990). “The DATR papers: February 1990.”  ...  S., and Smadja, F. Z. (1989). “Full text indexing based on lexical relations, an application: Software libraries.” In Proceedings, SIGIR. 127-136.  ... 

Generating Plans from Proofs: The Interpolation-based Approach to Query Reformulation

Michael Benedikt, Julien Leblay, Balder ten Cate, Efthymia Tsamoura
2016 Synthesis Lectures on Data Management  
Many practical problems in data management can be seen as instances of the reformulation problem.  ...  In this book we approach query reformulation in a very general setting that encompasses all the problems above, by relating it to a line of research within mathematical logic.  ...  Benedikt's work was sponsored by the Engineering and Physical Sciences Research Council of the United Kingdom, grants EP/M005852/1 and EP/L012138/1.  ... 
doi:10.2200/s00703ed1v01y201602dtm043 fatcat:pjmzooijszezfaedsqgrpidt6m

MARS [chapter]

Alin Deutsch, Val Tannen
2003 Proceedings 2003 VLDB Conference  
The correspondence between public and proprietary schemas is given by a combination of LAVand GAV-style views expressed in XQuery.  ...  We present a system for publishing as XML data from mixed (relational+XML) proprietary storage, while supporting redundancy in storage for tuning purposes.  ...  /title](b, t), a = a1• Example 3. 1 1 Assume we want to chase the query Q(a, g) : −R(a, b), R(b, c), R(c, d), S(d, e), S(e, f ), S(f, g) Figure 4 : 4 Evaluating JT P on Inst(Q) database instance whose  ... 
doi:10.1016/b978-012722442-8/50026-4 dblp:conf/vldb/DeutschT03 fatcat:hpfvgn2oxbg7xkffgdw4bokqii

Multi-Stage Conversational Passage Retrieval: An Approach to Fusing Term Importance Estimation and Neural Query Rewriting [article]

Sheng-Chieh Lin, Jheng-Hong Yang, Rodrigo Nogueira, Ming-Feng Tsai, Chuan-Ju Wang, Jimmy Lin
2021 arXiv   pre-print
Specifically, we propose two conversational query reformulation (CQR) methods: (1) term importance estimation and (2) neural query rewriting.  ...  In this paper, we tackle conversational passage retrieval (ConvPR), an important component of conversational search, by addressing query ambiguities with query reformulation integrated into a multi-stage  ...  R = 1 | q i , p) and (b) a query reformulation model P (q i |{u i , u <i }).  ... 
arXiv:2005.02230v2 fatcat:prof2i6vrnfwnbjk3aa6qickra

Using query logs and click data to create improved document descriptions

Maarten van der Heijden, Max Hinne, Wessel Kraaij, Suzan Verberne, Theo van der Weide
2009 Proceedings of the 2009 workshop on Web Search Click Data - WSCD '09  
descriptors extracted from the full text of the web pages.  ...  A pilot experiment demonstrated that document descriptors extracted from the queries that are associated with documents by clicks provide useful semantic information about documents in addition to document  ...  We applied the following scoring function per topic: S(R, T ) = t∈L votes(t) rank(R, t) , (1) in which R ∈ {Rq, R f } is either the query or the full text representation, T the title of the current document  ... 
doi:10.1145/1507509.1507519 dblp:conf/wsdm/HeijdenHKVW09 fatcat:6n6opou3erc6xnazf2z3gso6wm

Transient epileptic amnesia--a clinical update and a reformulation

E A Serafetinides
1994 Journal of Neurology, Neurosurgery and Psychiatry  
Leiguarda R, Lees AJ, Merello M, Starkstein S, Marsden CD. The nature of apraxia in  ...  Other texts about psychiatric emergencies suggest that authors often have difficulty finding enough to say about psychiatric emergencies, with the result that what emerges is a short textbook of psychiatry  ... 
doi:10.1136/jnnp.57.12.1549-a pmid:7798997 pmcid:PMC1073251 fatcat:nrmwjxzjtrfyleagh3t7dboiie

Page 63 of Library & Information Science Abstracts Vol. , Issue 3 [page]

1995 Library & Information Science Abstracts  
Original abstract-amended i 3313 Full-text database retrieval using paragraphs: the example of the Japanese Technical Document Database [in Japanese. ] M. Nozue.  ...  Concludes that further work is needed to determine the best March 1995 reformulation tactics needed to harness the professional searcher’ s intelligence with that much more limited intelligence provided  ... 

Effective searching of RDF knowledge graphs

Hiba Arnaout, Shady Elbassuoni
2018 Journal of Web Semantics  
To do this, we develop a framework for automatic query reformulation that generates a set of reformulated queries that are close in spirit to a given triple-pattern query.  ...  order to learn more about a certain topic or subject.  ...  The third index in the text database is a full-text index that simply stores the full text of the articles.  ... 
doi:10.1016/j.websem.2017.12.001 fatcat:n5zynidqlvc3ddvz54ls534434

CQR-SQL: Conversational Question Reformulation Enhanced Context-Dependent Text-to-SQL Parsers [article]

Dongling Xiao, Linzheng Chai, Qian-Wen Zhang, Zhao Yan, Zhoujun Li, Yunbo Cao
2022 arXiv   pre-print
In this paper, we propose CQR-SQL, which uses auxiliary Conversational Question Reformulation (CQR) learning to explicitly exploit schema and decouple contextual dependency for SQL parsing.  ...  Context-dependent text-to-SQL is the task of translating multi-turn questions into database-related SQL queries.  ...  )) P(s τ |Seq(r τ ))) + KL(P(s τ |Seq(r τ )) P(s τ |Seq(q τ ))).  ... 
arXiv:2205.07686v2 fatcat:nh2utaetdfes5noa4esf64ijyq

On the Equilibrium of Query Reformulation and Document Retrieval

Shihao Zou, Guanyu Tao, Jun Wang, Weinan Zhang, Dell Zhang
2018 Proceedings of the 2018 ACM SIGIR International Conference on Theory of Information Retrieval - ICTIR '18  
In this paper, we study jointly query reformulation and document relevance estimation, the two essential aspects of information retrieval (IR).  ...  both text retrieval and item recommendation.  ...  As such, the utility of Q and M are u Q (s q 2 , s m 1 ) = log p(r = 1|d 2 , q; θ ) + log p(r = 0|d 1 , q; θ ) = −1.2913 u M (s q 2 , s m 1 ) = log p(r = 1|d 1 , q; θ ) + log p(r = 0|d 2 , q; θ ) = −1.4913  ... 
doi:10.1145/3234944.3234962 dblp:conf/ictir/ZouTWZZ18 fatcat:dt6bform2zaytc3rnii5pyy3hq
« Previous Showing results 1 — 15 out of 42,530 results