uu.seUppsala University Publications
Change search
ReferencesLink to record
Permanent link

Direct link
Decomposing TAG Parsing Algorithms Using Simple Algebraizations
University of Potsdam.
Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Languages, Department of Linguistics and Philology. (Datorlingvistik)ORCID iD: 0000-0002-2492-9872
2012 (English)Conference paper (Refereed)
Abstract [en]

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
National Category
Language Technology (Computational Linguistics)
Research subject
Computational Linguistics
URN: urn:nbn:se:uu:diva-187332OAI: oai:DiVA.org:uu-187332DiVA: diva2:574336
11th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+)
Available from: 2012-12-05 Created: 2012-12-05 Last updated: 2013-07-17

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Kuhlmann, Marco
By organisation
Department of Linguistics and Philology
Language Technology (Computational Linguistics)

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 177 hits
ReferencesLink to record
Permanent link

Direct link