We demonstrate the novel and compact implementation of literal gates with one literal window and two literal windows using only resonant tunneling diodes (RTDs). The proposed circuit consists of only three RTDs and one resistor for one literal window and four RTDs and one resistor for two literal windows, with the configuration of a series-connected RTD pair and a series-connected RTD and a res...

IMAP4 non-synchronizing literals Status of this Memo This document specifies an Internet standards track protocol for the Internet community, and requests discussion and suggestions for improvements. Please refer to the current edition of the "Internet Official Protocol Standards" (STD 1) for the standardization state and status of this protocol. Distribution of this memo is unlimited. 1. Abstr...

The debate on literal meaning in theories of natural language processing has focused on two main issues: (1) Are there conditions by which the literal meaning of a sentence can be appropriately identified?; and (2) Is there some evaluation of literal meaning during the interpretation of natural language utterances? My article, “Literal meaning and psychological theory,” (Gibbs, 1984) attempted ...

Event-related brain potentials (ERPs) were recorded from 18 normal adults as they read sentences that ended with words used literally, metaphorically, or in an intermediate literal mapping condition. In the latter condition, the literal sense of the word was used in a way that prompted readers to map conceptual structure from a different domain. ERPs measured from 300 to 500 msec after the onse...

This paper provides a binary, token-based classification of German particle verbs (PVs) into literal vs. non-literal usage. A random forest improving standard features (e.g., bagof-words; affective ratings) with PV-specific information and abstraction over common nouns significantly outperforms the majority baseline. In addition, PV-specific classification experiments demonstrate the role of sh...

A boolean formula in conjunctive normal form (CNF) F is refuted by literal–once resolution if the empty clause is inferred from F by resolving on each literal of F at most once. Literal–once resolution refutations can be found nondeterministically in polynomial time, though this restricted system is not complete. We show that despite of the weakness of literal–once resolution, the recognition o...