arXiv (All)
open access
Certified Split Points for Parallel Lexing: Exact and Modulo Discarded Tokens
Table-driven DFA lexing is sequential: each transition depends on the previous byte's state. Scanning one input in parallel needs each chunk's entry state, which existing methods recover by simulation, speculation, prescanning, or overlap. We give two conditions under which none is needed. For a lon
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Exploring the lexis-grammar interface#470382
- Multi-Task Learning by using Contextualized Word Representations for Syntactic Parsing of a Morphologically Rich Language#1077782
- Corpus earthling#63323
- DataAtlas: automatic generation of data dictionaries using large language models.#320606
- Dictionary-Constrained Grapheme-to-Phoneme for Unsegmented Languages from LLM-Annotated Data#1014389
Record · ID 1013202
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive