2 resultados para Query Languages
em Brock University, Canada
Resumo:
The major hypothesis of this paper is that any deviance in syntax present in oral language will be evident in oral r eading behaviour. Using Lee and Canter's Developmental i 1 Sentence Scoring technique (1971) and Y. Goodman and Burke's Reading Miscue Inventory (1972) linguistic competence was established in t hree male children. ages 10 to 11. patterns of strengths and weaknesses in reading were determined. and the relationships t hat were established, were examined. Results of the study i ndicate that oral language behaviour is closely tied to oral r eading behaviour. This type of approach can be used as a basis for a diagnosis of a reading difficulty and then a prescription for language and reading skills.
Resumo:
Lattice valued fuzziness is more general than crispness or fuzziness based on the unit interval. In this work, we present a query language for a lattice based fuzzy database. We define a Lattice Fuzzy Structured Query Language (LFSQL) taking its membership values from an arbitrary lattice L. LFSQL can handle, manage and represent crisp values, linear ordered membership degrees and also allows membership degrees from lattices with non-comparable values. This gives richer membership degrees, and hence makes LFSQL more flexible than FSQL or SQL. In order to handle vagueness or imprecise information, every entry into an L-fuzzy database is an L-fuzzy set instead of crisp values. All of this makes LFSQL an ideal query language to handle imprecise data where some factors are non-comparable. After defining the syntax of the language formally, we provide its semantics using L-fuzzy sets and relations. The semantics can be used in future work to investigate concepts such as functional dependencies. Last but not least, we present a parser for LFSQL implemented in Haskell.