On Memory Limitations in Natural Language Processing
Name
MIT-LCS-TR-245.pdf
Size
6.1 MB
Format
Adobe PDF
Checksum (MD5)
9554a3b3b311891da6448ab4d64a9fa1
Author(s)
Church, Kenneth Ward
Advisor(s)
Szolovits, Peter
Date Issued
September 1980
Series/Report no.
MIT-LCS-TR-245
Abstract
This paper proposes a welcome hypothesis: a computationally simple device is sufficient for processing natural language. Traditionally it has been argued that processing natural language syntax requires very powerful machinery. Many engineers have come to this rather grim conclusion: almost all working parsers are actually Turing Machines (TM). For example, Woods specifically designed his Augmented Transition Networks (ATNs) to be Turing Equivalent.
Persistent DSpace Link
