|
Volumn FS-99-02, Issue , 1999, Pages 1-2
|
and Complexity of Question Answering Systems: Towards a Moore's Law for Natural Language Engineering
|
Author keywords
[No Author keywords available]
|
Indexed keywords
|
EID: 9744252457
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (1)
|
References (0)
|