Sciweavers

2891 search results - page 105 / 579
» More or Less Elaborate
Sort
View
CORR
1998
Springer
98views Education» more  CORR 1998»
14 years 10 months ago
Statistical Models for Unsupervised Prepositional Phrase Attachment
We present several unsupervised statistical models for the prepositional phrase attachment task that approach the accuracy of the best supervised methods for this task. Our unsupe...
Adwait Ratnaparkhi
IPL
2010
84views more  IPL 2010»
14 years 9 months ago
Wee LCP
We prove that longest common prefix (LCP) information can be stored in much less space than previously known. More precisely, we show that in the presence of the text and the su...
Johannes Fischer
DATESO
2010
131views Database» more  DATESO 2010»
14 years 9 months ago
Testing Quasigroup Identities using Product of Sequence
Non-associative quasigroups are well known combinatorial designs with many different applications. Many cryptographic algorithms based on quasigroups primitives have been published...
Eliska Ochodkova, Jiri Dvorský, Václ...
NAACL
2010
14 years 8 months ago
Reformulating Discourse Connectives for Non-Expert Readers
In this paper we report a behavioural experiment documenting that different lexicosyntactic formulations of the discourse relation of causation are deemed more or less acceptable ...
Advaith Siddharthan, Napoleon Katsos
DATESO
2009
114views Database» more  DATESO 2009»
14 years 8 months ago
Speeding Up Shortest Path Search in Public Transport Networks
Abstract. The searching for the shortest path in public transport networks can take more time than is acceptable for given situation. We have therefore searched for methods that sp...
Vladislav Martinek, Michal Zemlicka