Sciweavers

656 search results - page 98 / 132
» Marrying Words and Trees
Sort
View
NIPS
2004
15 years 1 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
NIPS
2003
15 years 1 months ago
Unsupervised Context Sensitive Language Acquisition from a Large Corpus
We describe a pattern acquisition algorithm that learns, in an unsupervised fashion, a streamlined representation of linguistic structures from a plain natural-language corpus. Th...
Zach Solan, David Horn, Eytan Ruppin, Shimon Edelm...
CORR
2010
Springer
173views Education» more  CORR 2010»
14 years 12 months ago
CONCISE: Compressed 'n' Composable Integer Set
Bit arrays, or bitmaps, are used to significantly speed up set operations in several areas, such as data warehousing, information retrieval, and data mining, to cite a few. Howeve...
Alessandro Colantonio, Roberto Di Pietro
COLING
2002
14 years 11 months ago
Learning Verb Argument Structure from Minimally Annotated Corpora
In this paper we investigate the task of automatically identifying the correct argument structure for a set of verbs. The argument structure of a verb allows us to predict the rel...
Anoop Sarkar, Woottiporn Tripasai
SIAMCOMP
2000
125views more  SIAMCOMP 2000»
14 years 11 months ago
Approximating the Stretch Factor of Euclidean Graphs
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
Giri Narasimhan, Michiel H. M. Smid