English
Related papers

Related papers: PRINCIPAR---An Efficient, Broad-coverage, Principl…

200 papers

This paper presents a syntactic lexicon for English that was originally derived from the Oxford Advanced Learner's Dictionary and the Oxford Dictionary of Current Idiomatic English, and then modified and augmented by hand. There are more…

cmp-lg · Computer Science 2008-02-03 Dania Egedi , Patrick Martin

This paper presents a programming language which includes paradigms that are usually associated with declarative languages, such as sets, rules and search, into an imperative (functional) language. Although these paradigms are separately…

Programming Languages · Computer Science 2007-05-23 Yves Caseau , Francois-Xavier Josset , Francois Laburthe

ProSper is a python library containing probabilistic algorithms to learn dictionaries. Given a set of data points, the implemented algorithms seek to learn the elementary components that have generated the data. The library widens the scope…

Signal Processing · Electrical Eng. & Systems 2019-08-20 Georgios Exarchakis , Jörg Bornschein , Abdul-Saboor Sheikh , Zhenwen Dai , Marc Henniges , Jakob Drefs , Jörg Lücke

We describe an implemented system for robust domain-independent syntactic parsing of English, using a unification-based grammar of part-of-speech and punctuation labels coupled with a probabilistic LR parser. We present evaluations of the…

cmp-lg · Computer Science 2008-02-03 John Carroll , Ted Briscoe

We present CRISNER (Conditional & Relative Importance Statement Network PrEference Reasoner), a tool that provides practically efficient as well as exact reasoning about qualitative preferences in popular ceteris paribus preference…

Artificial Intelligence · Computer Science 2015-07-31 Ganesh Ram Santhanam , Samik Basu , Vasant Honavar

This paper presents a morphological lexicon for English that handles more than 317000 inflected forms derived from over 90000 stems. The lexicon is available in two formats. The first can be used by an implementation of a two-level…

cmp-lg · Computer Science 2008-02-03 Daniel Karp , Yves Schabes , Martin Zaidel , Dania Egedi

We develop a formal grammatical system called a link grammar, show how English grammar can be encoded in such a system, and give algorithms for efficiently parsing with a link grammar. Although the expressive power of link grammars is…

cmp-lg · Computer Science 2008-02-03 Daniel D. K. Sleator , Davy Temperley

Efficient code retrieval is critical for developer productivity, yet existing benchmarks largely focus on Python and rarely stress-test robustness beyond superficial lexical cues. To address the gap, we introduce an automated pipeline for…

Software Engineering · Computer Science 2026-03-06 Kaicheng Wang , Liyan Huang , Weike Fang , Weihang Wang

We describe a parser of English effectuated by biologically plausible neurons and synapses, and implemented through the Assembly Calculus, a recently proposed computational framework for cognitive function. We demonstrate that this device…

Computation and Language · Computer Science 2021-08-05 Daniel Mitropolsky , Michael J. Collins , Christos H. Papadimitriou

We describe the design of Comlex Syntax, a computational lexicon providing detailed syntactic information for approximately 38,000 English headwords. We consider the types of errors which arise in creating such a lexicon, and how such…

cmp-lg · Computer Science 2009-09-25 Ralph Grishman , Catherine Macleod , Adam Meyers

SYNTAGMA is a rule-based parsing system, structured on two levels: a general parsing engine and a language specific grammar. The parsing engine is a language independent program, while grammar and language specific rules and resources are…

Computation and Language · Computer Science 2016-01-22 Daniel Christen

Comprehending meaning from natural language is a primary objective of Natural Language Processing (NLP), and text comprehension is the cornerstone for achieving this objective upon which all other problems like chat bots, language…

Computation and Language · Computer Science 2018-03-06 Long-Huei Chen , Kshitiz Tripathi

Parsing is a fundamental building block in modern compilers, and for industrial programming languages, it is a surprisingly involved task. There are known approaches to generate parsers automatically, but the prevailing consensus is that…

Formal Languages and Automata Theory · Computer Science 2022-09-20 Joe Zimmerman

Sentence splitting is a major simplification operator. Here we present a simple and efficient splitting algorithm based on an automatic semantic parser. After splitting, the text is amenable for further fine-tuned simplification operations.…

Computation and Language · Computer Science 2018-10-12 Elior Sulem , Omri Abend , Ari Rappoport

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

CPL here stands for a computer programming language conceived and developed by the author since 1993, but published for the first time in 2020. It was born as a Compiled Programming Language, designed together with its compiler and…

Programming Languages · Computer Science 2021-11-19 Paolo Luchini

Semantic parsing, i.e., the automatic derivation of meaning representation such as an instantiated predicate-argument structure for a sentence, plays a critical role in deep processing of natural language. Unlike all other top systems of…

Computation and Language · Computer Science 2014-01-25 Hai Zhao , Xiaotian Zhang , Chunyu Kit

We present 1-Pager the first system that answers a question and retrieves evidence using a single Transformer-based model and decoding process. 1-Pager incrementally partitions the retrieval corpus using constrained decoding to select a…

Computation and Language · Computer Science 2023-10-26 Palak Jain , Livio Baldini Soares , Tom Kwiatkowski

LeoPARD supports the implementation of knowledge representation and reasoning tools for higher-order logic(s). It combines a sophisticated data structure layer (polymorphically typed {\lambda}-calculus with nameless spine notation, explicit…

Logic in Computer Science · Computer Science 2015-05-08 Max Wisniewski , Alexander Steen , Christoph Benzmüller

This paper is an attempt to bring together two approaches to language analysis. The possible use of probabilistic information in principle-based grammars and parsers is considered, including discussion on some theoretical and computational…

cmp-lg · Computer Science 2008-02-03 Andrew Fordham , Matthew Crocker
‹ Prev 1 2 3 10 Next ›