Finite-State Chart Constraints for Reduced Complexity Context-Free Parsing Pipelines
Saved in:
| Main Authors: | Brian Roark, Kristy Hollingshead, Nathan Bodenstab |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
The MIT Press
2021-03-01
|
| Series: | Computational Linguistics |
| Online Access: | http://dx.doi.org/10.1162/coli_a_00109 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Parsing Linear Context-Free Rewriting Systems with Fast Matrix Multiplication
by: Shay B. Cohen, et al.
Published: (2021-03-01) -
Data-Driven Parsing using Probabilistic Linear Context-Free Rewriting Systems
by: Laura Kallmeyer, et al.
Published: (2021-03-01) -
Broad-Coverage Parsing Using Human-Like Memory Constraints
by: William Schuler, et al.
Published: (2021-03-01) -
The Interplay Between Loss Functions and Structural Constraints in Dependency Parsing
by: Robin Kurtz, et al.
Published: (2019-12-01) -
Parsing-Based Recognition of Hierarchical Plans Using the Grammar Constraint
by: Kristýna Pantůčková, et al.
Published: (2023-05-01)