David Lewis (1986) criticizes moderate views of composition on the grounds that a restriction on composition must be vague, and vague composition leads, via a precisificational theory of vagueness, to an absurd vagueness of existence. I show how to resist this argument. Unlike the usual resistance, however, I do not jettison precisificational views of vagueness. Instead, I blur the connection b...

Speakers often refer to context only implicitly when using language. The utterance “it’s warm outside” could signal it’s warm relative to other days of the year or just relative to the current season (e.g., it’s warm for winter). Warm vaguely conveys that the temperature is high relative to some contextual comparison class, but little is known about how a listener decides upon such a standard o...

In this paper the authors propose a new method of intelligent search using the vague set theory of Gau and Buehrer. Copyright c © 2006 Yang’s Scientific Research Institute, LLC. All rights reserved.

We describe algorithms that directly infer regular expressions from positive data and characterize the regular language classes that can be learned this way.

We consider the factorization problem of regular hedge languages. This problem is strongly related to the type checking problem in rule based transformations of valid XML documents. We propose the representation of regular hedge languages by reduced, complete, and deterministic linear hedge automata, and indicate algorithms for the computation of right factors and factor matrix.

Many of the processing steps in natural language engineering can be performed using nite state transducers An optimal way to create such transducers is to compile them from regular expressions This paper is an introduction to the regular expression calculus extended with certain operators that have proved very useful in natural language appli cations ranging from tokenization to light parsing T...

Even the fastest SMT solvers have performance problems with regular expressions from real programs. Because these performance issues often arise from the problem representation (e.g. non-deterministic finite automata get determinized and regular expressions get unrolled), we revisit Boolean finite automata, which allow for the direct and natural representation of any Boolean combination of regu...