Abstract
A uniquely parsable grammar (UPG) introduced by Morita and coworkers is a formal grammar with a restricted type of rewriting rules, where parsing can be performed without backtracking. By extending a UPG, we introduce a uniquely parsable unification grammar (UPUG), and we investigate its applicability to parsing. A unification grammar (UG) is a system such that a sequence of terms is rewritten by a set of rules, and the rewriting process accompanies unification of terms as in Prolog. We first define a general framework of a UG and then give a UPUG-condition so that it has the property of unique parsability. Since the class of UPGs is a subclass of UPUGs and is known to be universal in language generating ability, the class of UPUGs is also universal. We then show a simple parsing method for UPUGs. Based on it, we give a Prolog implementation of a parser which will be useful for natural language analysis and other applications.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
