Fu, King-Sun and Taylor L. Booth. 1975b. Grammatical Inference: Introduction and Survey --- Part II. IEEE Transaction on Systems, Man, and Cybernetics, SMC-5(4):408--423.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....w i into several letters enables us to organize the dependencies of a particular label A n in a tree like structure with probabilities at each node (see Fig. 3 and 5 for examples) We call such a structure tree grammar in accordance with linguistics [7] and its application in information science [8]. As we depict in Fig. 2, the relationship between elements of W and W is specified by a set of probabilities p(w i jA n ) that can be inferred to by supervised learning. With these probabilities an arbitrary image window D can be assigned the probability p(A n jD) of being of cover type A n . ....

King-Sun Fu and Taylor L. Booth. Grammatical inference: Introduction and survey---part II. IEEE Tr. on Systems, Man, and Cybernetics, SMC-5(4):409--423, July 1975.

.... recognition is based on the concepts from formal language theory, the origin of which can be traced to the middle of 1950s with the development of mathematical models of grammars by Noam Chomsky [43] 44] 6] Grammatical inference has been used for solving many pattern recognition problems [45] [46] by finding a specific grammar to describe a certain class of patterns. Its application to document image analysis is summarized in [3] A language L(G) is generated by a grammar G by using a set of permissible symbols S. Conventionally, S represents image primitives which are derived by an ....

K. S. Fu and T. Booth, "Grammatical inference: Introduction and survey--part ii," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 8, pp. 360--375, May 1986.

.... recognition is based on the concepts from formal language theory, the origin of which can be traced to the middle of 1950s with the development of mathematical models of grammars by Noam Chomsky [43] 44] 6] Grammatical inference has been used for solving many pattern recognition problems [45] [46] by finding a specific grammar to describe a certain class of patterns. Its application to document image analysis is summarized in [3] A language L(G) is generated by a grammar G by using a set of permissible symbols S. Conventionally, S represents image primitives which are derived by an ....

K. S. Fu and T. Booth, "Grammatical inference: Introduction and survey--part i," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 8, pp. 343--358, May 1986.

....a major influence in the development of the subject. Grammatical inference is a concept that goes back to Gold s work [5] and is defined as the method by which a system tries to guess general rules from examples. Since then much work as been done, which can be found in several excellent surveys [6 8]. II. THE DRIVE SYSTEM The drive system considered here is shown in Fig. 1. It is composed of a squirrel cage induction motor driven by a three phase PWM power inverter. These systems are usually modelled using the electromechanical power conversion theory [9] Considering, for command ....

....inference process the drive system is assumed to be a linguistic source capable, of generating a language, characterised by a certain grammar. The grammar, denoted by G, defines the structural features of the words produced by the linguistic source and, in this way, models the source itself [6]. G is a 4 tuple (4) where the terminal alphabet T consists of the symbols that make up the words, the non terminal alphabet N has the symbols that are used to generate the patterns, the start symbol S is a special non terminal symbol used to begin the generation of words, and the set of ....

Fu,K.S.; Booth,T.L.; "Grammatical inference: Introduction and Survey -- Part I", IEEE Trans. on SMC, vol 5, No. 1, Jan. 1975.

....the years on building grammars and transducers. Most of the algorithms developed are deterministic, and use a corpus only to incrementally modify a set of rules. While they are corpus driven, they are not statistical approaches. For a good survey of Grammatical Inference, consult the survey by Fu[22]. 20 In a recent paper[15] a CFG is induced, where rules are added not to cover the observed training data, but to instead maximize the likelihood of the grammar to produce the data. That is, rules are examined, and the grammar trained using the Inside Outside algorithm[3] No search ....

K. Fu and T. Booth. Grammatical inference: Introduction and survey - part i and ii. IEEE Transactions on Systems, Man, and Cybernetics, 5:95--111,409--423, 1975. 197

....over time (Naumann and Schrepp 1993) Merging methods also enlarge the language monotonically. They begin with a maximal grammar and successively merge pairs of non terminals into one; learning is thus viewed as a process of erasing grammatical distinctions that are deemed to be insignificant. Fu and Booth (1975) construct a canonical definite finite state grammar , representing a given positive sample of strings, and then form a derived grammar by merging non terminals. Lang (1992) and Corb et al. 1993) construct a prefix tree acceptor (a tree like automaton that accepts precisely the positive ....

Fu, K.-S., and Booth, T.L., 1975, Grammatical inference: introduction and survey, parts I & II. IEEE Transactions on Systems, Man, and Cybernetics, SMC-5: 95--111 & 409--423.

....nite sample is consistent with an in nite number of languages, L cannot be identi ed uniquely from D . the best we can hope to do is to infer a grammar that will describe the strings in D and predict other strings that in some sense are of the same nature as those contained in D . (Fu and Booth, 1986, p. 345) To constrain the set of possible languages L, the inferred grammar is often required to be as small as possible. However, the problem of nding a minimal grammar consistent with a given sample D was shown to be NP hard by Gold (1978) Li Vazirani (1988) Kearns Valiant (1989) and ....

K. S. Fu and T. L. Booth. 1986. Grammatical inference: introduction and survey. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-8:343-375.

....order relation denoted by . The transitive closure for this relation is denoted by . M M 0 means that M 0 is a C FSA derived from M . The partially ordered set of C FSA derived from M is a lattice that we shall denote by Lat(M ) The language inclusion property for automata derivation [10] applied to each language of a C FSA leads to the following proposition. Proposition 1 Let M 0 be a C FSA accepting the C tuple of language hL 0 c i c2 Gamma such that M 0 is derived from a C FSA M accepting hL c i c2 Gamma , then 8c 2 Gamma; L c L 0 c . PI n1250 8 Francois Coste 3. ....

K. S. Fu and T. L. Booth. Grammatical inference: Introduction and survey --- part I and II. IEEETransactions on Systems, Man and Cybernetics, 5:95--111 and 409--423, 1975.

....phase be on line could be forfeited. Finally, as we brie y illustrate at the end of this paper, the study and implementation of macro schemes of the kind considered here may be of some interest in the germane eld of inference of hierarchical structures or grammars for sequences (see, e.g. 13] [14], 15] The idea that some of the polarity or greediness inherent to LZ schemes could be traded in for increased compression is intuitively appealing and not new. In [16] 17] 18] for instance, the authors discuss variations such as, e.g. relaxing the longest match criterion in determining ....

K. S. Fu and T. L. Booth, \Grammatical inference: Introduction and survey { Part II," IEEE Trans. on Systems, Man and Cybernetics, vol. 5, pp. 112-127, 1975.

....this phase be on line could be forfeited. Finally, as we brie y illustrate at the end of this paper, the study and implementation of macro schemes of the kind considered here may be of some interest in the germane eld of inference of hierarchical structures or grammars for sequences (see, e.g. [13], 14] 15] The idea that some of the polarity or greediness inherent to LZ schemes could be traded in for increased compression is intuitively appealing and not new. In [16] 17] 18] for instance, the authors discuss variations such as, e.g. relaxing the longest match criterion in ....

K. S. Fu and T. L. Booth, \Grammatical inference: Introduction and survey { Part I," IEEE Trans. on Systems, Man and Cybernetics, vol. 5, pp. 95-111, 1975.

No context found.

Fu, King-Sun and Taylor L. Booth. 1975b. Grammatical Inference: Introduction and Survey --- Part II. IEEE Transaction on Systems, Man, and Cybernetics, SMC-5(4):408--423.

No context found.

Fu, King-Sun and Taylor L. Booth. 1975a. Grammatical Inference: Introduction and Survey --- Part I. IEEE Transaction on Systems, Man, and Cybernetics, SMC-5(1):95--111.

No context found.

K.S. Fu and T.L. Booth. Grammatical inference: Introduction and survey. Part II. IEEE P.A.M.I, 8(3):360--375, 1986.

No context found.

K.S. Fu and T.L. Booth. Grammatical inference: Introduction and survey. Part I. IEEE P.A.M.I, 8(3):343--359, 1986.

No context found.

K. S. Fu and T. L. Booth, "Grammatical inference: Introduction and survey. part I and II," IEEE Transactions on System Man and Cybernetics, vol. 5, pp. 59--72 and 409--423, 1975.

No context found.

K.S. Fu and T.L. Booth, "Grammatical inference: introduction and survey---Part II," IEEE Transactions on Systems, Man, and Cybernetics, vol. 5, no. 4, pp. 409--423, July 1975.

No context found.

K.S. Fu and T.L. Booth, "Grammatical inference: introduction and survey---Part I," IEEE Transactions on Systems, Man, and Cybernetics, vol. 5, no. 1, pp. 95--111, January 1975.

No context found.

FU, K.S.; BOOTH, T.L. Grammatical Inference: Introduction and Survey - Part I, IEEE Transactions on Systems, Man, and Cybernetics, v.5, n.1, pp.95-111, 1975; Part II, v.5, n.4, pp.409-423, 1975.

No context found.

Fu,K.S.; Booth,T.L.; "Grammatical inference: Introduction and Survey -- Part II", IEEE Trans. on SMC, vol 5, No. 4, Jul. 1975.

No context found.

K. S. Fu and T. L. Booth. Grammatical inference: Introduction and survey --- Part II. IEEE Transactions on Systems, Man and Cybernetics, 5:112--127, 1975.

No context found.

K. S. Fu and T. L. Booth. Grammatical inference: Introduction and survey -- Part I. IEEE Transactions on Systems, Man and Cybernetics, 5:95--111, 1975.

No context found.

K. Fu and T. Booth, (1975) Grammatical inference : introduction and survey. IEEE Transactions on SMC-5, No. 1, 1975, pp. 95--111.

No context found.

Fu, King-Sun and Taylor L. Booth. 1975b. Grammatical Inference: Introduction and Survey --- Part II. IEEE Transaction on Systems, Man, and Cybernetics, SMC-5(4):408--423.

No context found.

Fu, King-Sun and Taylor L. Booth. 1975a. Grammatical Inference: Introduction and Survey --- Part I. IEEE Transaction on Systems, Man, and Cybernetics, SMC-5(1):95--111.

No context found.

) K.S. Fu and T.L. Booth. Grammatical Inference: Introduction and Survey -- Part I. IEEE Transactions on Systems, Man, and Cybernetics, 5(1):95--111, January 1975.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC