Sciweavers

1229 search results - page 23 / 246
» A New Method for Dependent Parsing
Sort
View
NIPS
2004
13 years 9 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
DAM
2010
66views more  DAM 2010»
13 years 7 months ago
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
Rank-width is a structural graph measure introduced by Oum and Seymour and aimed at better handling of graphs of bounded clique-width. We propose a formal mathematical framework an...
Robert Ganian, Petr Hlinený
ACL
2010
13 years 5 months ago
Accurate Context-Free Parsing with Combinatory Categorial Grammar
The definition of combinatory categorial grammar (CCG) in the literature varies quite a bit from author to author. However, the differences between the definitions are important i...
Timothy A. D. Fowler, Gerald Penn
MCS
2002
Springer
13 years 7 months ago
New Measure of Classifier Dependency in Multiple Classifier Systems
Abstract. Recent findings in the domain of combining classifiers provide a surprising revision of the usefulness of diversity for modelling combined performance. Although there is ...
Dymitr Ruta, Bogdan Gabrys
SIGIR
2005
ACM
14 years 1 months ago
Question answering passage retrieval using dependency relations
State-of-the-art question answering (QA) systems employ termdensity ranking to retrieve answer passages. Such methods often retrieve incorrect passages as relationships among ques...
Hang Cui, Renxu Sun, Keya Li, Min-Yen Kan, Tat-Sen...