Sciweavers

16626 search results - page 370 / 3326
» Computing is a natural science
Sort
View
ECCC
2008
108views more  ECCC 2008»
15 years 7 months ago
The Complexity of Rationalizing Matchings
Given a set of observed economic choices, can one infer preferences and/or utility functions for the players that are consistent with the data? Questions of this type are called r...
Shankar Kalyanaraman, Christopher Umans
BIRTHDAY
2008
Springer
15 years 9 months ago
On Natural Non-dcpo Domains
As Dag Normann has recently shown, the fully abstract model for PCF of hereditarily sequential functionals is not -complete and therefore not continuous in the traditional terminol...
Vladimir Sazonov
ANLP
2000
68views more  ANLP 2000»
15 years 8 months ago
Distilling dialogues - A method using natural dialogue corpora for dialogue systems development
We report on a method for utilising corpora collected in natural settings. It is based on distilling re-writing natural dialogues to elicit the type of dialogue that would occur i...
Arne Jönsson, Nils Dahlbäck
INLG
2010
Springer
15 years 4 months ago
Applying Semantic Frame Theory to Automate Natural Language Template Generation From Ontology Statements
Today there exist a growing number of framenet-like resources offering semantic and syntactic phrase specifications that can be exploited by natural language generation systems. I...
Dana Dannélls
CHI
2005
ACM
16 years 7 months ago
Programmatic semantics for natural language interfaces
An important way of making interfaces usable by nonexpert users is to enable the use of natural language input, as in natural language query interfaces to databases, or MUDs and M...
Hugo Liu, Henry Lieberman