3 ms·
Misses the subplot of Lambek's categorial grammar and the way it frames parsing as proof search. Pretty cool idea, perhaps underexplored.
by danharaj 9y ago
Misses the subplot of Lambek's categorial grammar and the way it frames parsing as proof search. Pretty cool idea, perhaps underexplored.
- haskellandchill 9y agoI have some older books and heavy papers on the subject. Any recent lightweight treatments you can link to? Thanks.
- danharaj 9y agoThis paper is fresh in my mind since I recently read it. I liked it: https://www.eecs.harvard.edu/shieber/Biblio/Papers/infer.pdf https://www.eecs.harvard.edu/shieber/Biblio/Papers/infer.pdf We present a system for generating parsers based directly on the metaphor of parsing as deduction. Parsing algorithms can be represented directly as deduction systems, and a single deduction engine can interpret such deduction systems so as to implement the corresponding parser. The method generalizes easily to parsers for augmented phrase structure formalisms, such as definite-clause grammars and other logic grammar formalisms, and has been used for rapid prototyping of parsing algorithms for a variety of formalisms including variants of tree-adjoining grammars, categorial grammars, and lexicalized context-free grammars.
- DonbunEf7 9y agoI knew Earley parsing before I read this paper. Now I know things about logic and theorem proving. Cool paper, would read again.