Incremental Computation of Infix Probabilities for Probabilistic Finite Automata (D18-1)
Copied to clipboard
| Challenge: | Probabilistic finite automata are used to model distributions in natural language processing . a method that computes infix probabilities incrementally is proposed . |
| Approach: | They propose a method that computes infix probabilities incrementally for probabilistic finite automata . they propose to represent all the probabilities of matching strings as a series of transition matrix calculations . |
| Outcome: | The proposed method is theoretically faster than the previous method and better in practice. |
Similar Papers
Online Infix Probability Computation for Probabilistic Finite Automata (P19-1)
Copied to clipboard
| Challenge: | Probabilistic finite automata (PFAs) are statistical language models used in natural language processing. |
| Approach: | They develop an asymptotic algorithm to compute the infix probabilities of each prefix of a string from streaming data. |
| Outcome: | The proposed algorithm improves the infix probabilities of a weighted automata from streaming data. |
A Fast Algorithm for Computing Prefix Probabilities (2023.acl-short)
Copied to clipboard
| Challenge: | Probabilistic context-free grammars are an important formalism in NLP . |
| Approach: | They propose to run a probabilistic context-free grammar in O(n3|N|3 + |N|4), where n is the input length and |N is the number of non-terminals in the grammar. |
| Outcome: | The proposed algorithm runs in O(n3|N|3 + |N|4), where n is the input length and |N | is the number of non-terminals in the grammar. |
The problem with probabilistic DAG automata for semantic graphs (N19-1)
Copied to clipboard
| Challenge: | Abstract Meaning Representation (AMR) annotations are directed acyclic graphs, but most probabilistic models view them as strings or trees. |
| Approach: | They show that some DAG automata cannot be made into useful probabilistic models by assigning weights to transitions. |
| Outcome: | The proposed model can't be made into useful probabilistic models by assigning weights to transitions . the proposed model is not feasible for all variants, but it is problematic for planar variants if they are not rooted . |
How to Compute the Probability of a Word (2024.emnlp-main)
Copied to clipboard
| Challenge: | Language models estimate a probability distribution over strings in a natural language . many recent linguistic studies have been incorrectly computing word probabilities . |
| Approach: | They propose to use the correct method to compute word probabilities . they highlight issues when relying on models that use end-of-word tokenisers . |
| Outcome: | Empirically, correcting the widespread bug affects measured outcomes in sentences and lexical optimisation analyses. |
Proceedings of the First Workshop on Commonsense Inference in Natural Language Processing (D19-60)
Copied to clipboard
| Challenge: | Workshop on Commonsense Inference in Natural Language Processing focuses on commonsense knowledge representation and application in NLP tasks. |
| Approach: | COIN is a workshop on commonsense inference in natural language processing . workshop included two shared tasks on reading comprehension using commonsensense knowledge . |
| Outcome: | the workshop focused on modeling commonsense knowledge and commonsensing in natural language processing tasks. |
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. |
Compound Probabilistic Context-Free Grammars for Grammar Induction (P19-1)
Copied to clipboard
| Challenge: | Existing approaches to grammar induction have resorted to manually-engineered features and auxiliary objectives to induce the desired structures. |
| Approach: | They propose a formalization of the grammar induction problem that models sentences as being generated by a compound probabilistic context free grammar. |
| Outcome: | Experiments on English and Chinese show that the proposed approach is more efficient than other methods. |
Learned Incremental Representations for Parsing (2022.acl-long)
Copied to clipboard
| Challenge: | a new syntactic representation that commits to syntakic choices is proposed for humans . we use a system that uses only incremental processing of a prefix to predict the word in a sentence . |
| Approach: | They propose a syntactic representation that commits to syntakic choices incrementally . they say the system can achieve 93.72 F1 on the Penn Treebank with as few as 5 bits per word . |
| Outcome: | The proposed representation achieves 93.72 F1 on the Penn Treebank with as few as 5 bits per word . the analysis of the representations shows they have interpretable features and deferred resolution of syntactic ambiguities. |
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% . |
Benchmarking Multimodal Regex Synthesis with Complex Structures (2020.acl-main)
Copied to clipboard
| Challenge: | Existing datasets for regex generation from natural language are limited in complexity . Existing regex synthesis datasets are simple and the language used to describe them is not diverse . |
| Approach: | They propose a dataset for regex generation from natural language that generates regexes using a probabilistic grammar and pre-defined macros. |
| Outcome: | The proposed dataset is compared to existing datasets for regex generation from natural language . it generates the regexes using a probabilistic grammar with pre-defined macros observed from real-world StackOverflow posts. |