Sciweavers

1380 search results - page 273 / 276
» Decomposable Modeling in Natural Language Processing
Sort
View
PLDI
2012
ACM
13 years 1 days ago
Speculative linearizability
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
Rachid Guerraoui, Viktor Kuncak, Giuliano Losa
79
Voted
CIKM
2005
Springer
15 years 3 months ago
Retrieving answers from frequently asked questions pages on the web
We address the task of answering natural language questions by using the large number of Frequently Asked Questions (FAQ) pages available on the web. The task involves three steps...
Valentin Jijkoun, Maarten de Rijke
EDOC
2003
IEEE
15 years 2 months ago
How MDA Can Help Designing Component- and Aspect-based Applications
Distributed systems are inherently complex, and therefore difficult to design and develop. Experience shows that new technologies—such as components, aspects, and application f...
Lidia Fuentes, Mónica Pinto, Antonio Vallec...
65
Voted
AAAI
2008
14 years 12 months ago
Extracting Relevant Snippets for Web Navigation
Search engines present fix-length passages from documents ranked by relevance against the query. In this paper, we present and compare novel, language-model based methods for extr...
Qing Li, K. Selçuk Candan, Qi Yan
COLING
1996
14 years 11 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an