Sciweavers

1999 search results - page 120 / 400
» Dependently Typed Grammars
Sort
View
ACL
2003
15 years 7 months ago
Accurate Unlexicalized Parsing
We demonstrate that an unlexicalized PCFG can parse much more accurately than previously shown, by making use of simple, linguistically motivated state splits, which break down fa...
Dan Klein, Christopher D. Manning
NN
2007
Springer
162views Neural Networks» more  NN 2007»
15 years 5 months ago
Learning grammatical structure with Echo State Networks
Echo State Networks (ESNs) have been shown to be effective for a number of tasks, including motor control, dynamic time series prediction, and memorizing musical sequences. Howeve...
Matthew H. Tong, Adam D. Bickett, Eric M. Christia...
IGPL
2010
125views more  IGPL 2010»
15 years 4 months ago
A normative multiagent approach to requirements engineering
In this paper we present a new model for the requirements analysis of a system. We offer a conceptual model defined following a visual modeling language, called dependence network...
Serena Villata
ICASSP
2008
IEEE
16 years 21 days ago
Accurate statistical spoken language understanding from limited development resources
Robust Spoken Language Understanding (SLU) is a key component of spoken dialogue systems. Recent statistical approaches to this problem require additional resources (e.g. gazettee...
I. V. Meza-Ruiz, Sebastian Riedel, Oliver Lemon
CSLP
2004
Springer
15 years 10 months ago
Multi-dimensional Graph Configuration for Natural Language Processing
Many tasks in computational linguistics can be regarded as configuration problems. In this paper, we introduce the notion of lexicalised multi-dimensional configuration problems (l...
Ralph Debusmann, Denys Duchier, Marco Kuhlmann