Sciweavers

681 search results - page 64 / 137
» Combining Theorem Proving with Natural Language Processing
Sort
View
EMNLP
2009
14 years 7 months ago
Supervised Models for Coreference Resolution
Traditional learning-based coreference resolvers operate by training a mentionpair classifier for determining whether two mentions are coreferent or not. Two independent lines of ...
Md. Altaf ur Rahman, Vincent Ng
IUI
2003
ACM
15 years 3 months ago
An experiment in automated humorous output production
Computational humor will be needed in interfaces, no less than other cognitive capabilities. There are many practical settings where computational humor will add value. Among them...
Oliviero Stock, Carlo Strapparava
FDL
2008
IEEE
14 years 10 months ago
MARTE-based Design of a Multimedia Application and Formal Analysis
Digital television (DTV) is an advanced broadcasting technology that is spreading fast today. It gives broadcasters the capability to send programs with a better picture and sound ...
Adolf Abdallah, Abdoulaye Gamatié, Jean-Luc...
MODELS
2009
Springer
15 years 4 months ago
Language support for feature-oriented product line engineering
Product line engineering is an emerging paradigm of developing a family of products. While product line analysis and design mainly focus on reasoning about commonality and variabi...
Wonseok Chae, Matthias Blume
ACL
1994
14 years 11 months ago
Similarity-Based Estimation of Word Cooccurrence Probabilities
In many applications of natural language processing it is necessary to determine the likelihood of a given word combination. For example, a speech recognizer may need to determine...
Ido Dagan, Fernando C. N. Pereira, Lillian Lee