| Challenge: | Existing dynamic programming algorithms for PDAs often resort to a PDA-to-CFG conversion. |
| Approach: | They propose to use a pushdown automaton to reduce the space requirements by a factor of |Gamma| or the runtime by reducing the number of states. |
| Outcome: | The proposed algorithms reduce the space requirements by a factor of |Gamma| or reduce the runtime by fewer states. |
Similar Papers
Efficient Algorithms for Recognizing Weighted Tree-Adjoining Languages (2023.emnlp-main)
Copied to clipboard
| Challenge: | a class of tree-adjoining languages can be characterized by various two-level formalisms controlled by semiring-weighted CFGs and PDAs. |
| Approach: | They propose semiring-weighted versions of controllable CFGs and PDAs . they also introduce a WPDA normal form that is analogous to Chomsky's normal form for CFG . |
| Outcome: | The proposed algorithms are more time-efficient than the previous ones for LIG, PAA, and EPDA. |
Algorithms for Acyclic Weighted Finite-State Automata with Failure Arcs (2022.emnlp-main)
Copied to clipboard
| Challenge: | Weighted finite-state automata (WSFAs) are common formalisms in NLP. |
| Approach: | They propose an algorithm for semiring-weighted WFSAs with av-erage out symbol fractions . |
| Outcome: | The proposed algorithms are faster than the standard methods for weighted finite-state automata. |
An L* Algorithm for Deterministic Weighted Regular Languages (2024.emnlp-main)
Copied to clipboard
| Challenge: | Angluin (1987) introduced the active learning scheme L , where the learner interacts with an oracle by asking it queries. |
| Approach: | They propose a weighted variant of Angluin's (1987) L* algorithm for learning finite state automatas from black-box models. |
| Outcome: | The proposed algorithm learns aminimal automaton for the target language. |
Convergence and Diversity in the Control Hierarchy (2023.acl-long)
Copied to clipboard
| Challenge: | Weir has defined a hierarchy of language classes whose second member (L2) is generated by tree-adjoining grammars (TAG), linear indexed grammars, combinatory categorial grammars and head grammars. |
| Approach: | They propose to extend Weir's mechanism of control to give a definition of controllable pushdown automata (PDAs) they propose to use a stricter notion of equivalence to allow for finer-grained comparisons than weak equvalence. |
| Outcome: | The proposed language classes are d-weakly equivalent to Weir's original two-level grammar, but not d strongly equivalent. |
Dynamic Oracles for Top-Down and In-Order Shift-Reduce Constituent Parsing (D18-1)
Copied to clipboard
| Challenge: | Top-down and in-order shift-reduce constituent parsers are the most accurate known shift-reducing algorithms for constituent paring. |
| Approach: | They propose to use dynamic oracles to train two of the most accurate shift-reduce algorithms for constituent parsing. |
| Outcome: | The proposed top-down and in-order shift-reduce parsers improve on the WSJ benchmark. |
Efficient Semiring-Weighted Earley Parsing (2023.acl-long)
Copied to clipboard
| Challenge: | Using Earley's context-free parsing algorithm, we show that the speed-ups are effective in practice. |
| Approach: | They propose a context-free parsing algorithm with various known and new speed-ups that improve Earley's (1970) O(N3|G||R|) They also propose 'a binarized version' that achieves runtime of O(M| |G| when the grammar is represented compactly as a single finite-state automaton M. |
| Outcome: | The proposed algorithm can be used to reduce the complexity of CKY on a binarized version of the grammar G. |
Enhancing Computation Efficiency in Large Language Models through Weight and Activation Quantization (2023.emnlp-main)
Copied to clipboard
| Challenge: | Large language models (LLMs) are proficient in natural language processing tasks, but their deployment is limited by extensive parameter sizes and computational demands. |
| Approach: | They propose a method to enhance computational efficiency in large language models by 4-bit weight and 8-bit activation quantization. |
| Outcome: | The proposed techniques significantly boost task accuracies to levels comparable with full-precision models. |
Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing: System Demonstrations (2021.acl-demo)
Copied to clipboard
| Challenge: | ACL-IJCNLP 2021 will be an online conference . submissions range from early prototypes to mature production-ready systems . |
| Approach: | the ACL-IJCNLP 2021 will be an online conference . the system demonstration track invites submissions ranging from early prototypes to mature production-ready systems. |
| Outcome: | the ACL-IJCNLP 2021 system demonstration track received 133 submissions . the submission rate was 32.3% . |
LRQ: Optimizing Post-Training Quantization for Large Language Models by Learning Low-Rank Weight-Scaling Matrices (2025.naacl-long)
Copied to clipboard
| Challenge: | Existing methods for quantizing weights and activations of large language models suffer from non-negligible accuracy drops, especially on massive multitask language understanding. |
| Approach: | They propose a weight-activation quantization method that reconstructs the outputs of an intermediate Transformer block by leveraging low-rank weight-scaling matrices. |
| Outcome: | The proposed method reduces the complexity of the weight-activation quantization techniques while achieving high throughput and reducing inference costs. |
Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics: System Demonstrations (2020.acl-demos)
Copied to clipboard
| Challenge: | the 58th Annual Meeting of the Association for Computational Linguistics will be held online in a virtual environment. |
| Approach: | the online conference will be held in london from July 5-10, 2020 . the demonstrations track invites submissions ranging from early prototypes to mature production-ready systems . |
| Outcome: | the ACL 2020 demonstrations track received 122 submissions this year . the demonstrations paper talks are pre-recorded (12 minutes) and will be presented during live Q&A sessions . |