Abstract
We propose anO(M(n2)) time algorithm for the recognition of tree adjoining languages (TALs), wherenis the size of the input string andM(k) is the time needed to multiply twok×kboolean matrices. Tree adjoining grammars are formalisms suitable for natural language processing and have received enormous attention in the past among not only natural language processing researchers but also algorithms designers. The first polynomial time algorithm for TAL parsing was proposed in 1986 and had a run time ofO(n6). Quite recently, anO(n3M(n)) algorithm has been proposed. The algorithm presented in this paper improves the run time of the recent result using an entirely different approach.
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.
