Linear-Time Modeling of Linguistic Structure: An Order-Theoretic Perspective.
EMNLP 2023(2023)
Abstract
Tasks that model the relation between pairs of tokens in a string are a vital part of understanding natural language.
Such tasks, in general, require exhaustive pair-wise comparisons of tokens, thus having a quadratic runtime complexity in the length of the string.
We show that these exhaustive comparisons can be avoided, and, moreover, the complexity of such tasks can be reduced to linear by casting the relation between tokens as a partial order over the string.
Our method predicts real numbers for each token in a string in parallel and sorts the tokens accordingly, resulting in total orders of the tokens in the string.
Each total order implies a set of arcs oriented from smaller to greater tokens, sorted by their predicted numbers.
The intersection of total orders results in a partial order over the set of tokens in the string, which is then decoded into a directed graph representing the desired linguistic structure.
Our experiments on dependency parsing and coreference resolution show that our method achieves state-of-the-art or comparable performance.
Moreover, the linear complexity and parallelism of our method double the speed of graph-based coreference resolution models, and bring a 10-times speed-up over graph-based dependency parsers.
MoreTranslated text
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined