Abstract
Reversibility of logic grammars in natural language processing is desirable for both theoretical and practical reasons. This paper addresses this topic in describing a new approach to automated inversion of logic grammars: the Direct Inversion Approach (dia). A logic grammar is inverted by automatically altering the order of literals in the grammar and reformulating certain recursive procedures at compile time. The inversion process results in a new executable grammar, which is evaluated top-down and left-to-right (using a standard Prolog interpreter), but not left-to-right with respect to the original grammar. Thedia improves upon related approaches not only in being fully automated and computationally tractable, but also with respect to the class of grammars it is able to invert and the performance of the new executable grammar produced.
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.
