Sciweavers

681 search results - page 126 / 137
» Parsing as Natural Deduction
Sort
View
ACL
2003
14 years 11 months ago
Fast Methods for Kernel-Based Text Analysis
Kernel-based learning (e.g., Support Vector Machines) has been successfully applied to many hard problems in Natural Language Processing (NLP). In NLP, although feature combinatio...
Taku Kudo, Yuji Matsumoto
NIPS
2004
14 years 11 months ago
Learning Syntactic Patterns for Automatic Hypernym Discovery
Semantic taxonomies such as WordNet provide a rich source of knowledge for natural language processing applications, but are expensive to build, maintain, and extend. Motivated by...
Rion Snow, Daniel Jurafsky, Andrew Y. Ng
AAAI
1994
14 years 11 months ago
The Relationship between Architectures and Example-Retrieval Times
This paper proposes a method to find the most suitable architecture for a given response time requirement for Example-Retrieval (ER), which searches for the best match from a bulk...
Eiichiro Sumita, Naoya Nisiyama, Hitoshi Iida
AAAI
1992
14 years 10 months ago
On the Minimality and Decomposability of Constraint Networks
Constraint networks have been shown to be useful in formulating such diverse problems as scene labeling, natural language parsing, and temporal reasoning. Given a constraint netwo...
Peter van Beek
GIR
2008
ACM
14 years 10 months ago
Map-based vs. knowledge-based toponym disambiguation
Toponym Disambiguation, i.e. the task of assigning to place name their correct reference in the world, is getting more attention from many researchers. Many methods have been prop...
Davide Buscaldi, Paolo Rosso