Imagen de Portada

Structured Tree Alignment for Evaluation of (Speech) Constituency Parsing

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Shi, Freda, Gimpel, Kevin, Livescu, Karen
Formato:	Preprint
Publicado:	2024
Materias:	Computation and Language Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Parsing Millions of URLs per Second
por: Nizipli, Yagiz, et al.
Publicado: (2023)

Neuro-symbolic Syntactic Parsing: Shaping a Neural Network with the CYK Algorithm
por: Zanzotto, Fabio Massimo, et al.
Publicado: (2026)

Theoretical Analysis of Byte-Pair Encoding
por: Kozma, László, et al.
Publicado: (2024)

Fast Exact Retrieval for Nearest-neighbor Lookup (FERN)
por: Zhu, Richard
Publicado: (2024)

Permutation Matching Under Parikh Budgets: Linear-Time Detection, Packing, and Disjoint Selection
por: Shanto, MD Nazmul Alam, et al.
Publicado: (2026)

On the Complexity of the Matching Problem of Regular Expressions with Backreferences
por: Kumabe, Soh, et al.
Publicado: (2026)

Towards Optimal Multi-draft Speculative Decoding
por: Hu, Zhengmian, et al.
Publicado: (2025)

Flashback: A Reversible Bilateral Run-Peeling Decomposition of Strings
por: Konstantinovsky, Thomas, et al.
Publicado: (2026)

Algorithmically Establishing Trust in Evaluators
por: de Wynter, Adrian
Publicado: (2025)

Language Edit Distance & Scored Parsing: Faster Algorithms & Connection to Fundamental Graph Problems
por: Kociumaka, Tomasz, et al.
Publicado: (2014)

Parsing Millions of DNS Records per Second
por: Koekkoek, Jeroen, et al.
Publicado: (2024)

Automated Expected Amortised Cost Analysis of Probabilistic Data Structures
por: Leutgeb, Lorenz, et al.
Publicado: (2022)

Sequence graphs realizations and ambiguity in language models
por: Khalife, Sammy, et al.
Publicado: (2024)

Implementing Binary Search Trees in GP 2 (Extended Abstract)
por: Alaoui, Ziad Ismaili, et al.
Publicado: (2026)

Declarative Concurrent Data Structures
por: Raza, Aun, et al.
Publicado: (2024)

Tight Static Lower Bounds for Non-Adaptive Data Structures
por: Persiano, Giuseppe, et al.
Publicado: (2020)

Relating Interleaving and Fréchet Distances via Ordered Merge Trees
por: Beurskens, Thijs, et al.
Publicado: (2023)

Self-referential instances of the dominating set problem are irreducible
por: Zhou, Guangyan
Publicado: (2026)

Coupling without Communication and Drafter-Invariant Speculative Decoding
por: Daliri, Majid, et al.
Publicado: (2024)

AiSAQ: All-in-Storage ANNS with Product Quantization for DRAM-free Information Retrieval
por: Tatsuno, Kento, et al.
Publicado: (2024)

Tokenisation over Bounded Alphabets is Hard
por: Kastreva, Violeta, et al.
Publicado: (2025)

Minimum projective linearizations of trees in linear time
por: Alemany-Puig, Lluís, et al.
Publicado: (2021)

Characterizing the Effect of Noise in Language Generation in the Limit
por: Li, Aaron, et al.
Publicado: (2026)

A Partition Cover Approach to Tokenization
por: Lim, Jia Peng, et al.
Publicado: (2025)

Dynamic Boundary Time Warping for Sub-sequence Matching with Few Examples
por: Borchmann, Łukasz, et al.
Publicado: (2020)

Polynomial-Time Almost Log-Space Tree Evaluation by Catalytic Pebbling
por: Asadi, Vahid R., et al.
Publicado: (2026)

Non-Adaptive Evaluation of $k$-of-$n$ Functions: Tight Gap and a Unit-Cost PTAS
por: Nielsen, Mads Anker, et al.
Publicado: (2025)

A Tighter Complexity Analysis of SparseGPT
por: Li, Xiaoyu, et al.
Publicado: (2024)

On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs
por: Kurita, Kazuhiro, et al.
Publicado: (2025)

Diagram Control and Model Order for Sugiyama Layouts
por: Domrös, Sören, et al.
Publicado: (2024)

A Note on Dynamic Bidirected Dyck-Reachability with Cycles
por: Zhang, Qirun
Publicado: (2024)

Optimizations and extensions for fair join pattern matching
por: Karras, Ioannis
Publicado: (2025)

Towards Efficient Hash Maps in Functional Array Languages
por: Due, William Henrich, et al.
Publicado: (2025)

AbsInf: A Lightweight Object to Represent float('inf') in Dijkstra's Algorithm
por: Bellamkonda, Anjan, et al.
Publicado: (2025)

Efficient Dynamic Algorithms to Predict Short Races
por: Zhang, Minjian, et al.
Publicado: (2026)

Tokenisation is NP-Complete
por: Whittington, Philip, et al.
Publicado: (2024)

A Quasi-Monte Carlo Data Structure for Smooth Kernel Evaluations
por: Charikar, Moses, et al.
Publicado: (2024)

Scenario-Based Robust Optimization of Tree Structures
por: Angelopoulos, Spyros, et al.
Publicado: (2024)

Dichotomies for Tree Minor Containment with Structural Parameters
por: Gima, Tatsuya, et al.
Publicado: (2023)

Learning with Structure: Computing Consistent Subsets on Structurally-Regular Graphs
por: Banik, Aritra, et al.
Publicado: (2025)