English
Related papers

Related papers: Application-driven automatic subgrammar extraction

200 papers

We propose a new grammar-based language for defining information-extractors from documents (text) that is built upon the well-studied framework of document spanners for extracting structured data from text. While previously studied…

Databases · Computer Science 2023-01-25 Liat Peterfreund

Knowing the precise format of a program's input is a necessary prerequisite for systematic testing. Given a program and a small set of sample inputs, we (1) track the data flow of inputs to aggregate input fragments that share the same data…

Programming Languages · Computer Science 2017-08-30 Matthias Höschele , Alexander Kampmann , Andreas Zeller

Creating a descriptive grammar of a language is an indispensable step for language documentation and preservation. However, at the same time it is a tedious, time-consuming task. In this paper, we take steps towards automating this process…

Computation and Language · Computer Science 2020-10-07 Aditi Chaudhary , Antonios Anastasopoulos , Adithya Pratapa , David R. Mortensen , Zaid Sheikh , Yulia Tsvetkov , Graham Neubig

Macros are building block tasks of our everyday smartphone activity (e.g., "login", or "booking a flight"). Effectively extracting macros is important for understanding mobile interaction and enabling task automation. These macros are…

Human-Computer Interaction · Computer Science 2024-04-17 Forrest Huang , Gang Li , Tao Li , Yang Li

The use of terms from natural and social scientific titles and abstracts is studied from the perspective of sublanguages and their specialized dictionaries. Different notions of sublanguage distinctiveness are explored. Objective methods…

cmp-lg · Computer Science 2008-02-03 Robert M. Losee , Stephanie W. Haas

Ad hoc parsers are everywhere: they appear any time a string is split, looped over, interpreted, transformed, or otherwise processed. Every ad hoc parser gives rise to a language: the possibly infinite set of input strings that the program…

Software Engineering · Computer Science 2022-07-27 Michael Schröder , Jürgen Cito

We show how a general grammar may be automatically adapted for fast parsing of utterances from a specific domain by means of constituent pruning and grammar specialization based on explanation-based learning. These methods together give an…

cmp-lg · Computer Science 2008-02-03 Manny Rayner , David Carter

As one of the fundamental tasks in text analysis, phrase mining aims at extracting quality phrases from a text corpus. Phrase mining is important in various tasks such as information extraction/retrieval, taxonomy construction, and topic…

Computation and Language · Computer Science 2017-03-14 Jingbo Shang , Jialu Liu , Meng Jiang , Xiang Ren , Clare R Voss , Jiawei Han

Indexed languages are a classical notion in formal language theory, which has attracted attention in recent decades due to its role in higher-order model checking: They are precisely the languages accepted by order-2 pushdown automata. The…

Formal Languages and Automata Theory · Computer Science 2026-05-28 Richard Mandel , Corto Mascle , Georg Zetzsche

The project, under industrial funding, presented in this publication aims at the semantic analysis of a normative document describing requirements applicable to electrical appliances. The objective of the project is to build a semantic…

Information Retrieval · Computer Science 2021-12-28 Helene de Ribaupierre , Anne-Francoise Cutting-Decelle , Nathalie Baumier , Serge Blumental

Modern consumer devices must execute multimedia applications that exhibit high resource utilization. In order to efficiently execute these applications, the dynamic memory subsystem needs to be optimized. This complex task can be tackled in…

Hardware Architecture · Computer Science 2024-03-08 José L. Risco-Martín , J. Manuel Colmenar , J. Ignacio Hidalgo , Juan Lanchares , Josefa Díaz

Context-free S grammars are introduced, for arbitrary (storage) type S, as a uniform framework for recursion-based grammars, automata, and transducers, viewed as programs. To each occurrence of a nonterminal of a context-free S grammar an…

Formal Languages and Automata Theory · Computer Science 2014-08-05 Joost Engelfriet

In this paper we summarized a framework for designing grammar-based procedure for the automatic extraction of the semantic content from spoken queries. Starting with a case study and following an approach which combines the notions of…

Computation and Language · Computer Science 2007-05-23 Afzal Ballim , Vincenzo Pallotta

Explanation-based generalization is used to extract a specialized grammar from the original one using a training corpus of parse trees. This allows very much faster parsing and gives a lower error rate, at the price of a small loss in…

cmp-lg · Computer Science 2008-02-03 Christer Samuelsson

We are presenting a set of multilingual text analysis tools that can help analysts in any field to explore large document collections quickly in order to determine whether the documents contain information of interest, and to find the…

Computation and Language · Computer Science 2007-05-23 Camelia Ignat , Bruno Pouliquen , Ralf Steinberger , Tomaz Erjavec

Relating formal grammars is a hard problem that balances between language equivalence (which is known to be undecidable) and grammar identity (which is trivial). In this paper, we investigate several milestones between those two extremes…

Software Engineering · Computer Science 2015-03-31 Vadim Zaytsev

Grammar checking is the task of detection and correction of grammatical errors in the text. English is the dominating language in the field of science and technology. Therefore, the non-native English speakers must be able to use correct…

Computation and Language · Computer Science 2018-04-03 Madhvi Soni , Jitendra Singh Thakur

Prompt learning is an effective paradigm that bridges gaps between the pre-training tasks and the corresponding downstream applications. Approaches based on this paradigm have achieved great transcendent results in various applications.…

Information Retrieval · Computer Science 2022-09-26 Zhigang Kan , Linhui Feng , Zhangyue Yin , Linbo Qiao , Xipeng Qiu , Dongsheng Li

A novel approach to the fully automated, unsupervised extraction of dependency grammars and associated syntax-to-semantic-relationship mappings from large text corpora is described. The suggested approach builds on the authors' prior work…

Computation and Language · Computer Science 2014-01-16 Linas Vepstas , Ben Goertzel

This paper analyzes the correctness of the subsumption algorithm used in CLASSIC, a description logic-based knowledge representation system that is being used in practical applications. In order to deal efficiently with individuals in…

Artificial Intelligence · Computer Science 2009-09-25 A. Borgida , P. F. Patel-Schneider
‹ Prev 1 2 3 10 Next ›