Sciweavers

76 search results - page 4 / 16
» Word Vectors and Two Kinds of Similarity
Sort
View
NIPS
1997
14 years 6 days ago
Learning Human-like Knowledge by Singular Value Decomposition: A Progress Report
Singular value decomposition (SVD) can be viewed as a method for unsupervised training of a network that associates two classes of events reciprocally by linear connections throug...
Thomas K. Landauer, Darrell Laham, Peter W. Foltz
ACL
2010
13 years 9 months ago
Bilingual Sense Similarity for Statistical Machine Translation
This paper proposes new algorithms to compute the sense similarity between two units (words, phrases, rules, etc.) from parallel corpora. The sense similarity scores are computed ...
Boxing Chen, George F. Foster, Roland Kuhn
BIRD
2007
Springer
14 years 2 months ago
An Evaluation of Text Retrieval Methods for Similarity Search of Multi-dimensional NMR-Spectra
Abstract. Searching and mining nuclear magnetic resonance (NMR)spectra of naturally occurring substances is an important task to investigate new potentially useful chemical compoun...
Alexander Hinneburg, Andrea Porzel, Karina Wolfram
PR
2008
146views more  PR 2008»
13 years 10 months ago
Retrieval of machine-printed Latin documents through Word Shape Coding
This paper reports a document retrieval technique that retrieves machine-printed Latin-based document images through word shape coding. Adopting the idea of image annotation, a wo...
Shijian Lu, Chew Lim Tan
FOCS
1993
IEEE
14 years 3 months ago
Dynamic Word Problems
Let M be a fixed finite monoid. We consider the problem of implementing a data type containing a vector x ϭ ( x1, x2, . . . , xn) ʦ Mn , initially (1, 1, . . . , 1), with two kin...
Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, S...