1912 search results - page 50 / 383 » On the evaluation of argumentation formalisms |
SBMF
2009
Springer
15 years 6 months ago
2009
Springer
Motivated by issues in designing practical total functional programming languages, we are interested in structured recursive equations that uniquely describe a function not because...
JOC
2007
14 years 11 months ago
2007
We give an informal analysis and critique of several typical “provable security” results. In some cases there are intuitive but convincing arguments for rejecting the conclusi...
109
click to vote
EMNLP
2010
14 years 9 months ago
2010
We show that jointly performing semantic role labeling (SRL) on bitext can improve SRL results on both sides. In our approach, we use monolingual SRL systems to produce argument c...
ACL
2010
14 years 10 months ago
2010
This paper improves the use of pseudowords as an evaluation framework for selectional preferences. While pseudowords originally evaluated word sense disambiguation, they are now c...
PEPM
2007
ACM
15 years 6 months ago
2007
ACM
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...