Sciweavers

3299 search results - page 6 / 660
» A general mathematics of names
Sort
View
COLING
2002
14 years 9 months ago
Unsupervised Learning of Generalized Names
We present an algorithm, Nomen, for learning generalized names in text. Examples of these are names of diseases and infectious agents, such as bacteria and viruses. These names ex...
Roman Yangarber, Winston Lin, Ralph Grishman
TGC
2005
Springer
15 years 3 months ago
A General Name Binding Mechanism
We study fusion and binding mechanisms in name passing process calculi. To this purpose, we introduce the U-Calculus, a process calculus with no I/O polarities and a unique form of...
Michele Boreale, Maria Grazia Buscemi, Ugo Montana...
79
Voted
ICFP
2005
ACM
15 years 9 months ago
Toward a general theory of names: binding and scope
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
James Cheney
CIKM
2007
Springer
15 years 3 months ago
Generalizing from relevance feedback using named entity wildcards
Traditional adaptive filtering systems learn the user’s interests in a rather simple way – words from relevant documents are favored in the query model, while words from irre...
Abhimanyu Lad, Yiming Yang
91
Voted
TPHOL
2005
IEEE
15 years 3 months ago
Alpha-Structural Recursion and Induction
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...
Andrew M. Pitts