Laura Kallmeyer
Biographic Data
| ID | 6536335 |
|---|---|
| NAME | Laura Kallmeyer |
| GIVEN NAMES | Laura |
| FAMILY NAME | Kallmeyer |
| SIGNATURE | KALLMEYER L |
| AFFILIATIONS | TALaNa/Lattice, Université Paris7 |
| ORCID | 0000-0001-9691-5990 |
| VERIFIED | Yes |
| TOTAL WORKS | 3 |
| TOTAL CITATIONS | 3 |
| WORKS AS AUTHOR | 3 |
| WORKS AS EDITOR | 0 |
| FIRST PUBLICATION YEAR | 2005 |
| LATEST PUBLICATION YEAR | 2013 |
| H-INDEX | 1 |
Linear Context‐Free Rewriting Systems
This paper introduces Linear Context‐Free Rewriting Systems, a mildly context‐sensitive grammar formalism that displays a range of interesting formal properties and that has attracted a lot of interest in the context of natural language parsing recently because of its capacity to describe discontinuous constituents and non‐projective dependencies. Besides a presentation of the formalism, the paper includes a discussion of recent LCFRS application…
Data-Driven Parsing using Probabilistic Linear Context-Free Rewriting Systems
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 pars…
Tree-Local Multicomponent Tree-Adjoining Grammars with Shared Nodes
This article addresses the problem that the expressive power of tree-adjoining grammars (TAGs) is too limited to deal with certain syntactic phenomena, in particular, with scrambling in free-word-order languages. The TAG variants proposed so far in order to account for scrambling are not entirely satisfying. Therefore, the article introduces an alternative extension of TAG that is based on the notion of node sharing, so-called (restricted) tree-l…
Tree-Local Multicomponent Tree-Adjoining Grammars with Shared Nodes
This article addresses the problem that the expressive power of tree-adjoining grammars (TAGs) is too limited to deal with certain syntactic phenomena, in particular, with scrambling in free-word-order languages. The TAG variants proposed so far in order to account for scrambling are not entirely satisfying. Therefore, the article introduces an alternative extension of TAG that is based on the notion of node sharing, so-called (restricted) tree-l…
Data-Driven Parsing using Probabilistic Linear Context-Free Rewriting Systems
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 pars…
Tree-Local Multicomponent Tree-Adjoining Grammars with Shared Nodes
This article addresses the problem that the expressive power of tree-adjoining grammars (TAGs) is too limited to deal with certain syntactic phenomena, in particular, with scrambling in free-word-order languages. The TAG variants proposed so far in order to account for scrambling are not entirely satisfying. Therefore, the article introduces an alternative extension of TAG that is based on the notion of node sharing, so-called (restricted) tree-l…
Data-Driven Parsing using Probabilistic Linear Context-Free Rewriting Systems
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 pars…
Linear Context‐Free Rewriting Systems
This paper introduces Linear Context‐Free Rewriting Systems, a mildly context‐sensitive grammar formalism that displays a range of interesting formal properties and that has attracted a lot of interest in the context of natural language parsing recently because of its capacity to describe discontinuous constituents and non‐projective dependencies. Besides a presentation of the formalism, the paper includes a discussion of recent LCFRS application…
Artificial Intelligence (3 works) · Computer Science (3 works) · Context-free grammar (3 works) · Natural Language Processing Techniques (3 works) · Programming language (3 works) · Context (archaeology (2 works) · L-attributed grammar (2 works) · Natural language processing (2 works) · Parsing (2 works) · Rewriting (2 works)