Deterministic parsing using PCFGs

Mark Jan Nederhof; Martin McCaffery

doi:10.3115/v1/E14-1036

Deterministic parsing using PCFGs

Mark Jan Nederhof, Martin McCaffery

School of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

We propose the design of deterministic constituent parsers that choose parser actions
according to the probabilities of parses of a given probabilistic context-free
grammar. Several variants are presented. One of these deterministically constructs a
parse structure while postponing commitment to labels. We investigate theoretical
time complexities and report experiments.

Original language	English
Title of host publication	Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics
Editors	Shuly Wintner, Sharon Goldwater, Stefan Riezler
Place of Publication	Stroudsburg, PA
Publisher	Association for Computational Linguistics
Pages	338-347
Number of pages	10
ISBN (Print)	9781937284787
DOIs	https://doi.org/10.3115/v1/E14-1036
Publication status	Published - 1 Apr 2014
Event	14th Conference of the European Chapter of the Association for Computational Linguistics - Gothenburg, Sweden Duration: 26 Apr 2014 → 30 Apr 2014 Conference number: 14

Conference

Conference	14th Conference of the European Chapter of the Association for Computational Linguistics
Country/Territory	Sweden
City	Gothenburg
Period	26/04/14 → 30/04/14

Access to Document

10.3115/v1/E14-1036Licence: CC BY-NC-SA

Cite this

@inproceedings{b142159c4a5c4005a9c66252fccb6624,

title = "Deterministic parsing using PCFGs",

abstract = "We propose the design of deterministic constituent parsers that choose parser actions according to the probabilities of parses of a given probabilistic context-free grammar. Several variants are presented. One of these deterministically constructs a parse structure while postponing commitment to labels. We investigate theoretical time complexities and report experiments.",

author = "Nederhof, \{Mark Jan\} and Martin McCaffery",

year = "2014",

month = apr,

day = "1",

doi = "10.3115/v1/E14-1036",

language = "English",

isbn = "9781937284787",

pages = "338--347",

editor = "Shuly Wintner and Sharon Goldwater and Stefan Riezler",

booktitle = "Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics",

publisher = "Association for Computational Linguistics",

note = "14th Conference of the European Chapter of the Association for Computational Linguistics ; Conference date: 26-04-2014 Through 30-04-2014",

}

Nederhof, MJ & McCaffery, M 2014, Deterministic parsing using PCFGs. in S Wintner, S Goldwater & S Riezler (eds), Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics. Association for Computational Linguistics, Stroudsburg, PA, pp. 338-347, 14th Conference of the European Chapter of the Association for Computational Linguistics, Gothenburg, Sweden, 26/04/14. https://doi.org/10.3115/v1/E14-1036

Deterministic parsing using PCFGs. / Nederhof, Mark Jan; McCaffery, Martin.
Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics. ed. / Shuly Wintner; Sharon Goldwater; Stefan Riezler. Stroudsburg, PA: Association for Computational Linguistics, 2014. p. 338-347.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Deterministic parsing using PCFGs

AU - Nederhof, Mark Jan

AU - McCaffery, Martin

N1 - Conference code: 14

PY - 2014/4/1

Y1 - 2014/4/1

N2 - We propose the design of deterministic constituent parsers that choose parser actions according to the probabilities of parses of a given probabilistic context-free grammar. Several variants are presented. One of these deterministically constructs a parse structure while postponing commitment to labels. We investigate theoretical time complexities and report experiments.

AB - We propose the design of deterministic constituent parsers that choose parser actions according to the probabilities of parses of a given probabilistic context-free grammar. Several variants are presented. One of these deterministically constructs a parse structure while postponing commitment to labels. We investigate theoretical time complexities and report experiments.

UR - https://www.scopus.com/pages/publications/84905717447

U2 - 10.3115/v1/E14-1036

DO - 10.3115/v1/E14-1036

M3 - Conference contribution

SN - 9781937284787

SP - 338

EP - 347

BT - Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics

A2 - Wintner, Shuly

A2 - Goldwater, Sharon

A2 - Riezler, Stefan

PB - Association for Computational Linguistics

CY - Stroudsburg, PA

T2 - 14th Conference of the European Chapter of the Association for Computational Linguistics

Y2 - 26 April 2014 through 30 April 2014

ER -

Deterministic parsing using PCFGs

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Mark Nederhof

Cite this

Deterministic parsing using PCFGs

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Profiles

Mark Nederhof

Cite this