Decomposing TAG Parsing Algorithms Using Simple Algebraizations
2012 (English)In: Proceedings of the 11th International Workshop on Tree Adjoining Grammars and Related Formalisms, 2012, 135-143 p.Conference paper (Other academic)
We review a number of different ‘algebraic’ perspectives on TAG and STAG in the framework of interpreted regular tree grammars (IRTGs). We then use this framework to derive a new parsing algorithm for TAGs, based on two algebras that describe strings and derived trees. Our algorithm is extremely modular, and can easily be adapted to the synchronous case.
Place, publisher, year, edition, pages
2012. 135-143 p.
Language Technology (Computational Linguistics)
Research subject Computational Linguistics
IdentifiersURN: urn:nbn:se:liu:diva-100282ISBN: 978-1-937284-46-6OAI: oai:DiVA.org:liu-100282DiVA: diva2:661544
11th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+), 26 - 28 Sept 2012, Paris, France