Data-Driven Parsing using Probabilistic Linear Context-Free Rewriting Systems
Bibliographic Data
| ID | 12156396 |
|---|---|
| Authors | Laura Kallmeyer (0000-0001-9691-5990, Heinrich Heine University Düsseldorf, corresponding author), Wolfgang Maier (0000-0003-3305-725X, Heinrich Heine University Düsseldorf) |
| Year | 2012 |
| Volume | 39 |
| Issue | 1 |
| Pages | 87-119 |
| Publication date | 2012-11-13 |
| Open Access | Yes |
| Type | ARTICLE |
| Venue | Computational Linguistics (JOURNAL) |
| Journal identifiers | ISSN: 0891-2017 • E-ISSN: 1530-9312 |
| Publisher | Association for Computational Linguistics (PUBLISHER • US) |
| DOI | 10.1162/coli_a_00136 |
| OpenAlex | W2004967523 |
| Language | EN |
| Citations received | 3 |
| References cited | 32 |
This paper presents the first efficient implementation of a weighted deductive CYK parser for Probabilistic Linear Context-Free Rewriting Systems (PLCFRSs). LCFRS, an extension of CFG, can describe discontinuities in a straightforward way and is therefore a natural candidate to be used for data-driven parsing. To speed up parsing, we use different context-summary estimates of parse items, some of them allowing for A* parsing. We evaluate our parser with grammars extracted from the German NeGra treebank. Our experiments show that data-driven LCFRS parsing is feasible and yields output of competitive quality
Bottom-up parsing · Context (archaeology · Context-free grammar · L-attributed grammar · Natural language processing · Parse tree · Parser combinator · Parsing · Parsing expression grammar · Probabilistic logic · Programming language · Rewriting · S-attributed grammar · Top-down parsing · Top-down parsing language · Treebank · Computer Science · Natural Language Processing Techniques · Semantic Web and Ontologies · Topic Modeling · Artificial Intelligence
| Citations per year | 0.3 |
|---|---|
| Citation span | 2016 - 2020 (5) |
| Highly cited | No |