Sciweavers

15 search results - page 3 / 3
» A Probabilistic Modeling Framework for Lexical Entailment
Sort
View
COLING
1996
13 years 6 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
NAACL
2003
13 years 6 months ago
Supervised and unsupervised PCFG adaptation to novel domains
This paper investigates adapting a lexicalized probabilistic context-free grammar (PCFG) to a novel domain, using maximum a posteriori (MAP) estimation. The MAP framework is gener...
Brian Roark, Michiel Bacchiani
ACL
2010
13 years 2 months ago
Identifying Non-Explicit Citing Sentences for Citation-Based Summarization
Identifying background (context) information in scientific articles can help scholars understand major contributions in their research area more easily. In this paper, we propose ...
Vahed Qazvinian, Dragomir R. Radev
STACS
2009
Springer
13 years 11 months ago
Strong Completeness of Coalgebraic Modal Logics
ABSTRACT. Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction...
Lutz Schröder, Dirk Pattinson
EMNLP
2010
13 years 2 months ago
Holistic Sentiment Analysis Across Languages: Multilingual Supervised Latent Dirichlet Allocation
In this paper, we develop multilingual supervised latent Dirichlet allocation (MLSLDA), a probabilistic generative model that allows insights gleaned from one language's data...
Jordan L. Boyd-Graber, Philip Resnik