Sciweavers

35 search results - page 6 / 7
» Grammatically Interpreting Feature Compositions
Sort
View
COLING
2000
13 years 7 months ago
Language Identification In Unknown Signals
This paper describes algorithms and software developed to characterise and detect generic intelligent language-like features iu an input signal, using Natural Language Learning te...
John R. Elliott, Eric Atwell, Bill Whyte
LACL
2001
Springer
13 years 10 months ago
Structural Equations in Language Learning
In categorial systems with a fixed structural component, the learning problem comes down to finding the solution for a set of typeassignment equations. A hard-wired structural co...
Michael Moortgat
JFP
2008
135views more  JFP 2008»
13 years 6 months ago
Hoare type theory, polymorphism and separation
We consider the problem of reconciling a dependently typed functional language with imperative features such as mutable higher-order state, pointer aliasing, and non-termination. ...
Aleksandar Nanevski, J. Gregory Morrisett, Lars Bi...
ACL
2011
12 years 9 months ago
Discovering Sociolinguistic Associations with Structured Sparsity
We present a method to discover robust and interpretable sociolinguistic associations from raw geotagged text data. Using aggregate demographic statistics about the authors’ geo...
Jacob Eisenstein, Noah A. Smith, Eric P. Xing
ICFP
2001
ACM
14 years 6 months ago
Macros as Multi-Stage Computations: Type-Safe, Generative, Binding Macros in MacroML
With few exceptions, macros have traditionally been viewed as operations on syntax trees or even on plain strings. This view makes macros seem ad hoc, and is at odds with two desi...
Steven E. Ganz, Amr Sabry, Walid Taha