English
Related papers

Related papers: flap: A Deterministic Parser with Fused Lexing

200 papers

This paper aims to improve the performance of large language models by addressing the variable computational demands in inference steps, where some tokens require more computational resources than others. We present HARP, a simple…

Computation and Language · Computer Science 2025-05-27 Romain Storaï , Seung-won Hwang

Tokenization plays a significant role in the process of lexical analysis. Tokens become the input for other natural language processing tasks, like semantic parsing and language modeling. Natural Language Processing in Persian is…

Computation and Language · Computer Science 2022-02-23 Danial Kamali , Behrooz Janfada , Mohammad Ebrahim Shenasa , Behrouz Minaei-Bidgoli

End-to-End Neural Diarization (EEND) systems produce frame-level probabilistic speaker activity estimates, yet since evaluation focuses primarily on Diarization Error Rate (DER), the reliability and calibration of these confidence scores…

We present a novel method - LIBRE - to learn an interpretable classifier, which materializes as a set of Boolean rules. LIBRE uses an ensemble of bottom-up weak learners operating on a random subset of features, which allows for the…

Machine Learning · Computer Science 2019-11-18 Graziano Mita , Paolo Papotti , Maurizio Filippone , Pietro Michiardi

Text classification is an area of research which has been studied over the years in Natural Language Processing (NLP). Adapting NLP to multiple domains has introduced many new challenges for text classification and one of them is long…

Computation and Language · Computer Science 2023-07-20 Damith Premasiri , Tharindu Ranasinghe , Ruslan Mitkov

We present a graph-based approach enriched with lexicons to predict document-level readability in Arabic, developed as part of the Constrained Track of the BAREC Shared Task 2025. Our system models each document as a sentence-level graph,…

Computation and Language · Computer Science 2025-09-30 Passant Elchafei , Mayar Osama , Mohamed Rageh , Mervat Abuelkheir

Large language models (LLMs) call for extension of context to handle many critical applications. However, the existing approaches are prone to expensive costs and inferior quality of context extension. In this work, we propose Extensible…

Computation and Language · Computer Science 2024-02-20 Ninglu Shao , Shitao Xiao , Zheng Liu , Peitian Zhang

Standard transformers entangle all computation in a single residual stream, obscuring which components perform which functions. We introduce the Dual-Stream Transformer, which decomposes the residual stream into two functionally distinct…

Computation and Language · Computer Science 2026-03-10 J. Clayton Kerce , Alexis Fox

Recent years have witnessed increasing interests in prompt-based learning in which models can be trained on only a few annotated instances, making them suitable in low-resource settings. When using prompt-based learning for text…

Computation and Language · Computer Science 2023-05-11 Hongjing Li , Hanqi Yan , Yanran Li , Li Qian , Yulan He , Lin Gui

Prompt learning has propelled vision-language models like CLIP to excel in diverse tasks, making them ideal for federated learning due to computational efficiency. However, conventional approaches that rely solely on final-layer features…

Computer Vision and Pattern Recognition · Computer Science 2025-08-19 Suraj Prasad , Navyansh Mahla , Sunny Gupta , Amit Sethi

Complex classifiers may exhibit "embarassing" failures in cases where humans can easily provide a justified classification. Avoiding such failures is obviously of key importance. In this work, we focus on one such setting, where a label is…

Machine Learning · Computer Science 2019-06-14 Deborah Cohen , Amit Daniely , Amir Globerson , Gal Elidan

Large deep learning models have demonstrated strong ability to solve many tasks across a wide range of applications. Those large models typically require training and inference to be distributed. Tensor parallelism is a common technique…

While transformer-based models achieve strong performance on text classification, we explore whether masking input tokens can further enhance their effectiveness. We propose token masking regularization, a simple yet theoretically motivated…

Computation and Language · Computer Science 2025-05-20 Xianglong Xu , John Bowen , Rojin Taheri

Text semantic segmentation involves partitioning a document into multiple paragraphs with continuous semantics based on the subject matter, contextual information, and document structure. Traditional approaches have typically relied on…

Computation and Language · Computer Science 2025-04-03 Tongke Ni , Yang Fan , Junru Zhou , Xiangping Wu , Qingcai Chen

We propose Fast Language-Audio Pre-training (FLAP), a self-supervised approach that efficiently and effectively learns aligned audio and language representations through masking, contrastive learning and reconstruction. For efficiency, FLAP…

Sound · Computer Science 2023-11-06 Ching-Feng Yeh , Po-Yao Huang , Vasu Sharma , Shang-Wen Li , Gargi Gosh

We introduce a novel parsing concept called local lexing. It integrates the classically separated stages of lexing and parsing by allowing lexing to be dependent upon the parsing progress and by providing a simple mechanism for constraining…

Logic in Computer Science · Computer Science 2017-02-27 Steven Obua , Phil Scott , Jacques Fleuriot

To apply neural sequence models such as the Transformers to music generation tasks, one has to represent a piece of music by a sequence of tokens drawn from a finite set of pre-defined vocabulary. Such a vocabulary usually involves tokens…

Sound · Computer Science 2021-01-08 Wen-Yi Hsiao , Jen-Yu Liu , Yin-Cheng Yeh , Yi-Hsuan Yang

In this paper we propose a new document classification method, bridging discrepancies (so-called semantic gap) between the training set and the application sets of textual data. We demonstrate its superiority over classical text…

Information Retrieval · Computer Science 2017-01-17 Piotr Borkowski , Krzysztof Ciesielski , Mieczysław A. Kłopotek

The ability to fuse sentences is highly attractive for summarization systems because it is an essential step to produce succinct abstracts. However, to date, summarizers can fail on fusing sentences. They tend to produce few summary…

Computation and Language · Computer Science 2020-10-09 Logan Lebanoff , Franck Dernoncourt , Doo Soon Kim , Lidan Wang , Walter Chang , Fei Liu

Traditionally, parsing has been a laborious and error-prone component of compiler development, and most parsers for full industrial programming languages are still written by hand. The author [Zim22] shows that automatic parser generation…

Programming Languages · Computer Science 2022-09-20 Joe Zimmerman
‹ Prev 1 3 4 5 6 7 10 Next ›