Results 11 - 20 of 7,987

Evaluating WordNet-based measures of lexical semantic relatedness

by Alexander Budanitsky, Graeme Hirst - Computational Linguistics , 2006
"... The quantification of lexical semantic relatedness has many applications in NLP, and many different measures have been proposed. We evaluate five of these measures, all of which use WordNet as their central resource, by comparing their performance in detecting and correcting real-word spelling error ..."
Abstract - Cited by 321 (0 self) - Add to MetaCart
errors. An information-content–based measure proposed by Jiang and Conrath is found superior to those proposed by Hirst and St-Onge, Leacock and Chodorow, Lin, and Resnik. In addition, we explain why distributional similarity is not an adequate proxy for lexical semantic relatedness. 1.

Fixing the Java memory model

by Jeremy Manson, William Pugh, Sarita V. Adve, Jeremy Manson - In ACM Java Grande Conference , 1999
"... This paper describes the new Java memory model, which has been revised as part of Java 5.0. The model specifies the legal behaviors for a multithreaded program; it defines the semantics of multithreaded Java programs and partially determines legal implementations of Java virtual machines and compile ..."
Abstract - Cited by 385 (10 self) - Add to MetaCart
This paper describes the new Java memory model, which has been revised as part of Java 5.0. The model specifies the legal behaviors for a multithreaded program; it defines the semantics of multithreaded Java programs and partially determines legal implementations of Java virtual machines

A Tutorial on Learning Bayesian Networks

by David Heckerman - Communications of the ACM , 1995
"... We examine a graphical representation of uncertain knowledge called a Bayesian network. The representation is easy to construct and interpret, yet has formal probabilistic semantics making it suitable for statistical manipulation. We show how we can use the representation to learn new knowledge by c ..."
Abstract - Cited by 365 (12 self) - Add to MetaCart
We examine a graphical representation of uncertain knowledge called a Bayesian network. The representation is easy to construct and interpret, yet has formal probabilistic semantics making it suitable for statistical manipulation. We show how we can use the representation to learn new knowledge

The Temporal Query Language TQuel

by Richard Snodgrass, Santiago Gomez, Richard Snodgrass, Santiago Gomez - ACM Transactions on Database Systems , 1987
"... This paper defines aggregates in the temporal query language TQuel and provides their rormal semantics in the tuple relational calculus. A rormal semantics (or Que! aggregates is defined in the process. Multiple aggregates; aggregates appearing in the where, when, valid, and as-or clauses; nested ag ..."
Abstract - Cited by 332 (45 self) - Add to MetaCart
aggregation; and instantaneous, cumulative, and unique variants are supported. These aggregates give the user a rich set or statistical functions that range over time, while requiring minimal additions to TQuel and its semantics..:'l'bi1 work wu nppolied bJ NSF (l'&lli DCR·8402330 and by a

Fuzzy Truthoods Based on an Additive Semantic Measure with Break of Global Symmetry in Modal Logic

by I. B. Türksen, Germano Resconi
"... We propose an additive "semantic measure" theory based on the model of a perception based fuzzy truthoods in analogy to probability measure. Probability measure, which is the subject of the probability theory, is a special case of the fuzzy measure in the Dempster-Shafer theory when the fo ..."
Abstract - Add to MetaCart
We propose an additive "semantic measure" theory based on the model of a perception based fuzzy truthoods in analogy to probability measure. Probability measure, which is the subject of the probability theory, is a special case of the fuzzy measure in the Dempster-Shafer theory when

Sweetening Ontologies with DOLCE

by Aldo Gangemi, Nicola Guarino, Claudio Masolo, Alessandro Oltramari, Luc Schneider , 2002
"... In this paper we introduce the DOLCE upper level ontology, the first module of a Foundational Ontologies Library being developed within the WonderWeb project. DOLCE is presented here in an intuitive way; the reader should refer to the project deliverable for a detailed axiomatization. A comparis ..."
Abstract - Cited by 310 (10 self) - Add to MetaCart
comparison with WordNet's top-level taxonomy of nouns is also provided, which shows how DOLCE, used in addition to the OntoClean methodology, helps isolating and understanding some major WordNet's semantic limitations. We suggest

Vector-based models of semantic composition

by Jeff Mitchell, Mirella Lapata - In Proceedings of ACL-08: HLT , 2008
"... This paper proposes a framework for representing the meaning of phrases and sentences in vector space. Central to our approach is vector composition which we operationalize in terms of additive and multiplicative functions. Under this framework, we introduce a wide range of composition models which ..."
Abstract - Cited by 220 (5 self) - Add to MetaCart
This paper proposes a framework for representing the meaning of phrases and sentences in vector space. Central to our approach is vector composition which we operationalize in terms of additive and multiplicative functions. Under this framework, we introduce a wide range of composition models which

The Measurement of Textual Coherence with Latent Semantic Analysis

by Peter W. Foltz, Walter Kintsch, Thomas K. Landauer , 1998
"... Latent Semantic Analysis is used as a technique for measuring the coherence of texts. By comparing the vectors for two adjoining segments of text in a highdimensional semantic space, the method provides a characterization of the degree of semantic relatedness between the segments. We illustrate the ..."
Abstract - Cited by 236 (14 self) - Add to MetaCart
Latent Semantic Analysis is used as a technique for measuring the coherence of texts. By comparing the vectors for two adjoining segments of text in a highdimensional semantic space, the method provides a characterization of the degree of semantic relatedness between the segments. We illustrate

Chromium: A Stream-Processing Framework for Interactive Rendering on Clusters

by Greg Humphreys, Mike Houston, Ren Ng, Randall Frank, Sean Ahern, Peter D. Kirchner, James T. Klosowski , 2002
"... We describe Chromium, a system for manipulating streams of graphics API commands on clusters of workstations. Chromium's stream filters can be arranged to create sort-first and sort-last parallel graphics architectures that, in many cases, support the same applications while using only commodit ..."
Abstract - Cited by 308 (10 self) - Add to MetaCart
commodity graphics accelerators. In addition, these stream filters can be extended programmatically, allowing the user to customize the stream transformations performed by nodes in a cluster. Because our stream processing mechanism is completely general, any cluster-parallel rendering algorithm can

Recovering Documentation-to-Source-Code Traceability Links using Latent Semantic Indexing

by Andrian Marcus, Jonathan I. Maletic
"... An information retrieval technique, latent semantic indexing, is used to automatically identi traceability links from system documentation to program source code. The results of two experiments to identi links in existing software systems (i.e., the LEDA library, and Albergate) are presented. These ..."
Abstract - Cited by 237 (13 self) - Add to MetaCart
An information retrieval technique, latent semantic indexing, is used to automatically identi traceability links from system documentation to program source code. The results of two experiments to identi links in existing software systems (i.e., the LEDA library, and Albergate) are presented
Results 11 - 20 of 7,987