Sciweavers

176 search results - page 32 / 36
» A probabilistic language based upon sampling functions
Sort
View
ANLP
2000
141views more  ANLP 2000»
15 years 1 months ago
Aggressive Morphology for Robust Lexical Coverage
This paper describes an approach to providing lexical information for natural language processing in unrestricted domains. A system of approximately 1200 morphological rules is us...
William A. Woods
CORR
2012
Springer
170views Education» more  CORR 2012»
13 years 7 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
SIGLEX
1991
15 years 3 months ago
Presuppositions and Default Reasoning: A Study in Lexical Pragmatics
Explaining how the meaning of words relate to the meaning of the utterance in which they are used is of utmost importance. The most common approaches view the meaning of an uttera...
Robert E. Mercer
BMCBI
2010
122views more  BMCBI 2010»
14 years 12 months ago
An overview of the CellML API and its implementation
Background: CellML is an XML based language for representing mathematical models, in a machine-independent form which is suitable for their exchange between different authors, and...
Andrew K. Miller, Justin Marsh, Adam Reeve, Alan G...
SIGSOFT
2007
ACM
16 years 15 days ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...