In formal language theory the concept of simplifying words is considered in connection with the deciphering delay of codes (cf. BP, Section II.8], LP]). In this paper we show that transferring a deenition from the theory of iterated function systems (IFS) sheds some new light on simplifying words.: Formal languages may be considered as IFS in the Cantor space of innnite strings over a nite alph...

We present a system to translate natural language sentences to formulas in a formal or a knowledge representation language. Our system uses two inverse λ-calculus operators and using them can take as input the semantic representation of some words, phrases and sentences and from that derive the semantic representation of other words and phrases. Our inverse λ operator works on many formal langu...

openings and closings are words or expressions that speakers use to start or end a dialog. ‘hello’ or ‘hi’ are typical examples of an opening, and ‘goodbye’ or ‘bye’ represent a usual closing. some expressions like ‘happy birthday’ or ‘merry new year’ are of other examples which function as opening or ending words. the corpus of this study included six textbooks for teaching persian to non-pers...

This work is aimed at finding interesting patterns in knowledge discovery applications. We first apply formal concept analysis methods for deriving concepts from particular data sets. We also investigate concepts stabilities by removing attributes from the same data set. Another way to search for interesting patterns is to build nested lattices and compare the obtained concepts with the ones re...

This paper proposes an encoding a background-implying problem in attribute exploration of manyvalued context into a SAT problem. A background-implying problem is whether an attribute implication is implied by some other attribute implications and is also compatible with background knowledge. In the case of manyvalued context, the background knowledge will be its scales which are also formal con...