{"type":"ScholarlyArticle","title":"An Efficient Context-Free Parsing Algorithm for Natural Languages","authors":[{"name":"Masaru Tomita","slug":"masaru-tomita","given":"Masaru","family":"Tomita","affiliation":""}],"abstract":"This paper introduces an efficient context-free parsing algorithm and emphasizes its practical value in natural language processing. The algorithm can be viewed as an extend ed LR parsing algorithm which embodies the concept of a \" graph -structured stack.\" Unlike the standard LA, the algorithm is capable of handling arbitrary non-cyclic context-free grammars including ambiguous grammars, while most of the LA parsing efficiency is preserved. The algorithm seems more efficient than any existing algorithms including the Cocke-Younger-Kasami algorithm and Earley's algorithm , as far a3 practical natural language parsing is concerned , due to utilization of LA parsing tables. The algorithm is an all -path parsing algorithm; it produces all possible parse trees (a parse forest) in an efficient representation called a \"shared-packed forest. \" This paper also shows th at Earley's torest representation has a defect and his algorithm cannot be used in natural language processing as an all -path parsing algorithm.","doi":null,"url":"https://ijcai.org/proceedings/1985/149","pdf":"https://ijcai.org/proceedings/1985/0149.pdf","markdown":"https://ijcai.org/proceedings/1985/149.md","bibtex":"https://ijcai.org/proceedings/1985/bibtex/149","volume":{"slug":"1985","title":"Proceedings of the Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1985","url":"https://ijcai.org/proceedings/1985/","year":1985,"location":"Los Angeles, California, USA","dates":"","editors":"Aravind Joshi","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Natural Language","track":"Natural Language","number":149,"pages":{"first":756,"last":763},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}