Acquiring compact lexicalized grammars from a cleaner treebank

Julia Hockenmaier; Mark Steedman

Acquiring compact lexicalized grammars from a cleaner treebank

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

Abstract

We present an algorithm which translates the Penn Treebank into a corpus of Combinatory Categorial Grammar (CCG) derivations. To do this we have needed to make several systematic changes to the Treebank which have to effect of cleaning up a number of errors and inconsistencies. This process has yielded a cleaner treebank that can potentially be used in any framework. We also show how unary type-changing rules for certain types of modifiers can be introduced in a CCG grammar to ensure a compact lexicon without augmenting the generative power of the system. We demonstrate how the combination of preprocessing and type-changing rules minimizes the lexical coverage problem.

Original language	English (US)
Pages	1974-1981
Number of pages	8
State	Published - 2002
Externally published	Yes
Event	3rd International Conference on Language Resources and Evaluation, LREC 2002 - Las Palmas, Canary Islands, Spain Duration: May 29 2002 → May 31 2002

Other

Other	3rd International Conference on Language Resources and Evaluation, LREC 2002
Country/Territory	Spain
City	Las Palmas, Canary Islands
Period	5/29/02 → 5/31/02

ASJC Scopus subject areas

Linguistics and Language
Language and Linguistics
Education
Library and Information Sciences

Library availability

Discover UIUC Full Text

Cite this

@conference{de5d48d36ce248e58def5dfaf71608df,

title = "Acquiring compact lexicalized grammars from a cleaner treebank",

abstract = "We present an algorithm which translates the Penn Treebank into a corpus of Combinatory Categorial Grammar (CCG) derivations. To do this we have needed to make several systematic changes to the Treebank which have to effect of cleaning up a number of errors and inconsistencies. This process has yielded a cleaner treebank that can potentially be used in any framework. We also show how unary type-changing rules for certain types of modifiers can be introduced in a CCG grammar to ensure a compact lexicon without augmenting the generative power of the system. We demonstrate how the combination of preprocessing and type-changing rules minimizes the lexical coverage problem.",

author = "Julia Hockenmaier and Mark Steedman",

note = "Funding Information: The research was funded in part by EPSRC grant GR/M96889, by an EPSRC studentship, and by the Edinburgh Language Technology Group. We would like to thank Stephen Clark, Jason Baldridge and Miles Osborne for many helpful discussions and comments.; 3rd International Conference on Language Resources and Evaluation, LREC 2002 ; Conference date: 29-05-2002 Through 31-05-2002",

year = "2002",

language = "English (US)",

pages = "1974--1981",

}

TY - CONF

T1 - Acquiring compact lexicalized grammars from a cleaner treebank

AU - Hockenmaier, Julia

AU - Steedman, Mark

N1 - Funding Information: The research was funded in part by EPSRC grant GR/M96889, by an EPSRC studentship, and by the Edinburgh Language Technology Group. We would like to thank Stephen Clark, Jason Baldridge and Miles Osborne for many helpful discussions and comments.

PY - 2002

Y1 - 2002

N2 - We present an algorithm which translates the Penn Treebank into a corpus of Combinatory Categorial Grammar (CCG) derivations. To do this we have needed to make several systematic changes to the Treebank which have to effect of cleaning up a number of errors and inconsistencies. This process has yielded a cleaner treebank that can potentially be used in any framework. We also show how unary type-changing rules for certain types of modifiers can be introduced in a CCG grammar to ensure a compact lexicon without augmenting the generative power of the system. We demonstrate how the combination of preprocessing and type-changing rules minimizes the lexical coverage problem.

AB - We present an algorithm which translates the Penn Treebank into a corpus of Combinatory Categorial Grammar (CCG) derivations. To do this we have needed to make several systematic changes to the Treebank which have to effect of cleaning up a number of errors and inconsistencies. This process has yielded a cleaner treebank that can potentially be used in any framework. We also show how unary type-changing rules for certain types of modifiers can be introduced in a CCG grammar to ensure a compact lexicon without augmenting the generative power of the system. We demonstrate how the combination of preprocessing and type-changing rules minimizes the lexical coverage problem.

UR - http://www.scopus.com/inward/record.url?scp=84859896026&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84859896026&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:84859896026

SP - 1974

EP - 1981

T2 - 3rd International Conference on Language Resources and Evaluation, LREC 2002

Y2 - 29 May 2002 through 31 May 2002

ER -

Acquiring compact lexicalized grammars from a cleaner treebank

Abstract

Other

ASJC Scopus subject areas

Library availability

Related links

Fingerprint

Cite this