Pith. sign in

REVIEW 1 cited by

Formal Language Theory Meets Modern NLP

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2102.10094 v3 pith:U37B2QMT submitted 2021-02-19 cs.CL

classification cs.CL
keywords formalmodernlanguagelanguagesrecentanalysisarguablyback
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

NLP is deeply intertwined with the formal study of language, both conceptually and historically. Arguably, this connection goes all the way back to Chomsky's Syntactic Structures in 1957. It also still holds true today, with a strand of recent works building formal analysis of modern neural networks methods in terms of formal languages. In this document, I aim to explain background about formal languages as they relate to this recent work. I will by necessity ignore large parts of the rich history of this field, instead focusing on concepts connecting to modern deep learning-based NLP.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Never Reset Again: A Mathematical Framework for Continual Inference in Recurrent Neural Networks

    cs.LG 2024-12 conditional novelty 5.0 of 10

    A dual cross-entropy and KL-divergence loss lets recurrent networks maintain stable accuracy over very long streams without hidden-state resets, matching and sometimes slightly beating periodic reset baselines.

Pith tools