Sciweavers

9507 search results - page 587 / 1902
» Time-based language models
Sort
View
ACL
2012
13 years 9 months ago
Learning to "Read Between the Lines" using Bayesian Logic Programs
Most information extraction (IE) systems identify facts that are explicitly stated in text. However, in natural language, some facts are implicit, and identifying them requires ā€...
Sindhu Raghavan, Raymond J. Mooney, Hyeonseo Ku
POPL
2004
ACM
16 years 7 months ago
Incremental execution of transformation specifications
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...
Ganesh Sittampalam, Oege de Moor, Ken Friis Larsen
SAC
2009
ACM
16 years 2 months ago
Matching ThisType to subtyping
The notion of ThisType has been proposed to promote typesafe reuse of binary methods and recently extended to mutually recursive definitions. It is well-known, however, that This...
Chieri Saito, Atsushi Igarashi
CEC
2008
IEEE
16 years 1 months ago
Conventionalization of linguistic categories under simple communicative constraints
—The language game approach is widely adopted to study conventionalization of linguistic knowledge. Most of contemporary models concentrate on the dynamics of language games in r...
Tao Gong, Andrea Puglisi, Vittorio Loreto, William...
CICLING
2007
Springer
16 years 1 months ago
Finite-State Technology as a Programming Environment
Finite-state technology is considered the preferred model for representing the phonology and morphology of natural languages. The attractiveness of this technology for natural lang...
Shuly Wintner