960 search results - page 3 / 192 » Computational Semantics Of Mass Terms |
FSTTCS
2008
Springer
13 years 8 months ago
2008
Springer
ABSTRACT. Formalisms involving some degree of nondeterminism are frequent in computer science. In particular, various programming or specification languages are based on term rewr...
COLING
2008
13 years 9 months ago
2008
Latent Semantic Analysis (LSA) is based on the Singular Value Decomposition (SVD) of a term-by-document matrix for identifying relationships among terms and documents from cooccur...
ACMICEC
2007
ACM
13 years 11 months ago
2007
ACM
An important problem in search engine advertising is keyword1 generation. In the past, advertisers have preferred to bid for keywords that tend to have high search volumes and hen...
RTA
2004
Springer
14 years 1 months ago
2004
Springer
Over the past decade, researchers have found context-sensitive term-rewriting semantics to be powerful and expressive tools for modeling programming languages, particularly in esta...
AGP
1994
IEEE
13 years 11 months ago
1994
IEEE
This paper considers compositions of conditional term rewriting systems as a basis for a modular approach to the design and analysis of equational logic programs. In this context,...