1220 search results - page 26 / 244 » Restricting grammatical complexity |
ICANN
2001
Springer
14 years 2 days ago
2001
Springer
This paper studies the use of discrete-time recurrent neural networks for predicting the next symbol in a sequence. The focus is on online prediction, a task much harder than the c...
CPM
1999
Springer
13 years 12 months ago
1999
Springer
We present a very efficient, in terms of space and access speed, data structure for storing huge natural language data sets. The structure is described as LZ (Ziv Lempel) compresse...
ACL
2003
13 years 9 months ago
2003
We present a supervised machine learning algorithm for metonymy resolution, which exploits the similarity between examples of conventional metonymy. We show that syntactic head-mo...
COLING
1990
13 years 8 months ago
1990
We have designed and implemented a text processing system that can extract important information from hundreds of paragraphs per hour and can be transported within weeks to a new ...
MT
1998
13 years 7 months ago
1998
Real-world natural language sentences are long and complex, and always contain unexpected grammatical constructions. It even includes noise and ungrammaticality. This paper descri...