Lena Katharina Schiffer
Biographic Data
| ID | 6536834 |
|---|---|
| NAME | Lena Katharina Schiffer |
| GIVEN NAMES | Lena Katharina |
| FAMILY NAME | Schiffer |
| SIGNATURE | SCHIFFER L K |
| AFFILIATIONS | Leipzig University Faculty of Mathematics and Computer Science. [email protected] |
| ORCID | 0000-0002-0164-2932 |
| VERIFIED | Yes |
| TOTAL WORKS | 1 |
| TOTAL CITATIONS | 0 |
| WORKS AS AUTHOR | 1 |
| WORKS AS EDITOR | 0 |
| FIRST PUBLICATION YEAR | 2022 |
| LATEST PUBLICATION YEAR | 2022 |
| H-INDEX | 0 |
Tractable Parsing for CCGs of Bounded Degree
Unlike other mildly context-sensitive formalisms, Combinatory Categorial Grammar (CCG) cannot be parsed in polynomial time when the size of the grammar is taken into account. Refining this result, we show that the parsing complexity of CCG is exponential only in the maximum degree of composition. When that degree is fixed, parsing can be carried out in polynomial time. Our finding is interesting from a linguistic perspective because a bounded deg…
No prominent works on this page.
Tractable Parsing for CCGs of Bounded Degree
Unlike other mildly context-sensitive formalisms, Combinatory Categorial Grammar (CCG) cannot be parsed in polynomial time when the size of the grammar is taken into account. Refining this result, we show that the parsing complexity of CCG is exponential only in the maximum degree of composition. When that degree is fixed, parsing can be carried out in polynomial time. Our finding is interesting from a linguistic perspective because a bounded deg…
Algorithms and Data Compression (1 work) · Artificial Intelligence (1 work) · Bounded function (1 work) · Combinatory categorial grammar (1 work) · Computer Science (1 work) · Context (archaeology (1 work) · Context-free grammar (1 work) · Degree (music (1 work) · Emergent grammar (1 work) · Generative grammar (1 work)