Papers by Andreas Opedal
World Models for Math Story Problems (2023.findings-acl)
Copied to clipboard
| Challenge: | Recent efforts to solve math story problems have lacked accurate representations of mathematical concepts. |
| Approach: | They propose a graph-based semantic formalism for solving math story problems . they combine existing datasets and annotate a corpus of 1,019 problems with MathWorld . |
| Outcome: | The proposed model can be used to solve math story problems with pre-trained language models . the model can also be used for generating new problems by using the model as a design space . |
Prefix Parsing is Just Parsing (2026.acl-short)
Copied to clipboard
| Challenge: | Existing prefix parsers are typically tied to particular parsing algorithms. |
| Approach: | They propose a prefix grammar transformation that reduces prefix parsing to ordinary parsers . they propose enabling prediction of the next token by computing the next-token weight vector . |
| Outcome: | The proposed method reduces prefix parsing to ordinary parsers without modification . the transformed grammar is only a small factor larger than the input . |
On the Role of Context in Reading Time Prediction (2024.emnlp-main)
Copied to clipboard
| Challenge: | a new perspective on how readers integrate context during reading time prediction is presented . a recent study shows that the proportion of variance in reading times explained by context is smaller when context is represented by the orthogonalized predictor. |
| Approach: | They propose a technique where they project surprisal onto the orthogonal complement of frequency. |
| Outcome: | The proposed method shows that the proportion of variance in reading times explained by context is smaller when context is represented by the orthogonalized predictor. |
Slangvolution: A Causal Analysis of Semantic Change and Frequency Dynamics in Slang (2022.acl-long)
Copied to clipboard
| Challenge: | a recent study suggests that language evolution is a diachronic process, but no causal analysis is performed to verify these claims. |
| Approach: | They analyze the semantic change and frequency shift of slang words and compare them to those of standard, nonslang terms. |
| Outcome: | The proposed model shows that slang has smaller semantic change but larger frequency shifts over time. |
On the Intersection of Context-Free and Regular Languages (2023.eacl-main)
Copied to clipboard
| Challenge: | We generalize the Bar-Hillel intersection construction so that the given WFSA may contain -arcs. |
| Approach: | They propose a construction that generalizes the Bar- Hillel in the case the desired automaton has -arcs and generalize the weighted extension so that the given WFSA may contain arcs. |
| Outcome: | The proposed construction can encode the structure of both the input automaton and grammar while retaining the asymptotic size of the original construction. |
A Spatio-Temporal Point Process for Fine-Grained Modeling of Reading Behavior (2025.acl-long)
Copied to clipboard
| Challenge: | Standard models that focus on fixation durations ignore spatial dynamics of reading . authors propose a model that captures how long fixations last, where they land and when . |
| Approach: | They propose a generative model that captures how long fixations last and where they land and when they occur. |
| Outcome: | The proposed model exhibits higher likelihood on held-out reading data than baselines. |
Generalized Measures of Anticipation and Responsivity in Online Language Processing (2024.findings-emnlp)
Copied to clipboard
| Challenge: | a generalization of classical information-theoretic measures of predictive uncertainty is proposed for online language processing . entropy and surprisal are two commonly deployed information- theoretic measure of predictive uncertainties in sentence processing based on the probability distribution of upcoming sequences of linguistic units . |
| Approach: | They propose a generalization of classical information-theoretic measures of predictive uncertainty in online language processing based on simulations of incremental linguistic contexts. |
| Outcome: | The proposed generalization of classical measures of predictive uncertainty in online language processing yields a positive effect on reading times and cloze completion probability. |
An Exploration of Left-Corner Transformations (2023.emnlp-main)
Copied to clipboard
| Challenge: | Fig. 1 shows how left-corner transformations remove left recursion from context-free grammars . a common use case is to remove left-recursed grammars, which is necessary for top-down parsing . |
| Approach: | They generalize left-corner transformations to support semiring-weighted production rules . they also provide finer-grained control over which left corners may be moved . |
| Outcome: | The proposed transformation removes left recursion from context-free grammars . it also provides finer-grained control over which left corners may be moved . |
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. |