NATURAL LANGUAGES AND THE CHOMSKY HIERARCHY


     Related Videos
Software Transactions A Programming-Languages Perspective
Lecture - 1 Introduction to programming languages - YouTube
VOCABULARY IN 20 LANGUAGES = Lecture hall construction work - YouTube
Lecture - 31 Programming Languages - YouTube
Languages Club Lecture - YouTube

     Related Hubpages

    •  Doc. Url:    Embed Code: 

    • citeseer  status
      (0) (0 Votes)
      Views: (1163)   Date: (08-04-09)   Pages: ()
    • Author:  unknown authors  

    • Abstract:  The central claim of the paper is that NL stringsets are regular. Three independent arguments are offered in favor of this position: one based on parsimony considerations, one employing the McCullogh-Pitts (1943) model of neurons, and a purely linguistic one. It is possible to derive explicit upper bounds for the number of (live) states in NL acceptors: the results show that finite state NL parsers can be implemented on presentday computers. The position of NL stringsets within the regular family is also investigated: it is proved that NLs are counter-free, but not locally testable. 0

         Related Documents

           Related Groups

             Related Science News

               More on Sciencestage

                 Answers

                 News

                 Related on Wikipedia




























               

              Powered free by PHPmotion