Sciweavers

3455 search results - page 424 / 691
» Generalized Game Trees
Sort
View
AAAI
2000
15 years 8 months ago
Class-Based Construction of a Verb Lexicon
We present an approach to building a verb lexicon compatible with WordNet but with explicitly stated syntactic and semantic information, using Levin verb classes to systematically...
Karin Kipper, Hoa Trang Dang, Martha Stone Palmer
ACL
1998
15 years 8 months ago
A Connectionist Architecture for Learning to Parse
We present a connectionist architecture and demonstrate that it can learn syntactic parsing from a corpus of parsed text. The architecture can represent syntactic constituents, an...
James Henderson, Peter Lane
APAL
2006
70views more  APAL 2006»
15 years 6 months ago
On the Hamkins approximation property
We give a short proof of a lemma which generalizes both the main lemma from the original construction in the author's thesis of a model with no 2-Aronszajn trees, and also th...
William J. Mitchell
162
Voted
FUIN
2006
81views more  FUIN 2006»
15 years 6 months ago
Indexing Schemes for Similarity Search: an Illustrated Paradigm
We suggest a variation of the Hellerstein-Koutsoupias--Papadimitriou indexability model for datasets equipped with a similarity measure, with the aim of better understanding the s...
Vladimir Pestov, Aleksandar Stojmirovic
IPL
2008
95views more  IPL 2008»
15 years 6 months ago
Distortion lower bounds for line embeddings
In this paper, we show how we can derive lower bounds and also compute the exact distortion for the line embeddings of some special metrics, especially trees and graphs with certai...
Claire Mathieu, Charalampos Papamanthou