Weighted parsing of trees

Mark Jan Nederhof

Weighted parsing of trees

School of Computer Science

Research output: Contribution to conference › Paper › peer-review

Abstract

We show how parsing of trees can be formalized in terms of the intersection of two
tree languages. The focus is on weighted regular tree grammars and weighted tree adjoining grammars. Potential applications are discussed, such as parameter estimation across formalisms.

Original language	English
Pages	13-24
Number of pages	12
Publication status	Published - 2009
Event	11th International Conference on Parsing Technologies - Paris, France Duration: 7 Oct 2009 → 9 Oct 2009

Conference

Conference	11th International Conference on Parsing Technologies
Country/Territory	France
City	Paris
Period	7/10/09 → 9/10/09

Access to Document

Open Access version in Research@StAndrews:FullText
This is the author version of the conference contribution. A definitive version is available from http://www.aclweb.org/anthology/sigparse#2009_0 licensed under a Creative Commons licence for use in teaching and research (http://creativecommons.org/licenses/by-nc-sa/3.0/)
Accepted author manuscript, 143 KB

Cite this

@conference{f236f284cbb245fbae0fafaa52639ff1,

title = "Weighted parsing of trees",

abstract = "We show how parsing of trees can be formalized in terms of the intersection of twotree languages. The focus is on weighted regular tree grammars and weighted tree adjoining grammars. Potential applications are discussed, such as parameter estimation across formalisms.",

author = "Nederhof, {Mark Jan}",

year = "2009",

language = "English",

pages = "13--24",

note = "11th International Conference on Parsing Technologies ; Conference date: 07-10-2009 Through 09-10-2009",

}

TY - CONF

T1 - Weighted parsing of trees

AU - Nederhof, Mark Jan

PY - 2009

Y1 - 2009

N2 - We show how parsing of trees can be formalized in terms of the intersection of twotree languages. The focus is on weighted regular tree grammars and weighted tree adjoining grammars. Potential applications are discussed, such as parameter estimation across formalisms.

AB - We show how parsing of trees can be formalized in terms of the intersection of twotree languages. The focus is on weighted regular tree grammars and weighted tree adjoining grammars. Potential applications are discussed, such as parameter estimation across formalisms.

M3 - Paper

SP - 13

EP - 24

T2 - 11th International Conference on Parsing Technologies

Y2 - 7 October 2009 through 9 October 2009

ER -

Weighted parsing of trees

Abstract

Conference

Access to Document

Fingerprint

Cite this