Abstract
We consider the problem of grammatical inference (GI) for classes of structured documents like summaries, dictionaries, bibliographic data basis, encyclopaedias and so on. The inference is based on examples of individual sample of these documents. In this paper, we present an algebraic framework of the GI in which rewrite rules will define the process of generalisation. The implementation algorithm discussed here is used in a document handling project in which paper documents are typographically tagged and then recognised. One of the current applications in this project is to translate paper documents into machine readable form
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
S. Tayeb-Bey, A. S. Saidi “Grammatical Formalism for Document Understanding system:: From Document towards HTML Text”. BSDIA97, November 1497, Brasilia.
E.M.GoId,“Languange identification in the limit”, Information and Control, 10(5). 1967.
HS, Fu and T. Booth: “Grammatical Inference. Introduction and Survey”. parts 1 & 2 IEEE Trans. Sys. man and Cybe.SMC-5:95–11
R. C. Gonzalez and M. G. Thomason “Syntactic Pattern Recognition, an Introduction”. Addison Wesley. Reading Mass1978
H.S. Fu. “Syntactic Pattern Recognition and Applications”. Prentice hall, N.Y. 1982.
L. Miclet. “Grammmatical Inference”. syntactic and Structural Pattern Recognition. H. Bunk and San Feliu eds. World Scientific
J. Orica, P. Garcia. “Inferring regular Languages in Polynomial Update time”. Pattern Recognition and Analysis. 1992.
P. Dupont, L. Miclet & E. Vidal. “What is the search space of Regular Inference?”. ICGI 94 Grammatical Inference and Applications. Springer-Verlag-94.
L. Fribourg, M. V. Peixoto. “Automates concurrents Contraintes”. TSL.13(6), 1994.
J. A. Goguen, J. W. Tatcher, E. G. Wagner, J. B. Wright. “Initial Algebra Semantics and Continues Algebra”, JACM 24(1), 1977.
A. S. Saidi: “Extensions Grammaticales de la Programmation Logique”, PhD. 1992.
A. S. Saidi. “On the unification of phrases”. IFIP-94.
H. Ehrig, B. Mahr. “Fundamentals of Algebraic Specification”. Vol-1&2. Springer-Verlag 1985.
E.M. Gold. “Complexity of automaton identification from given data”. Information and Control, 37-1978.
J.E. Hopcroft, J.D. Ullmann. “Formal Languages and their Relation to Automata”, Addison-Wesley 1969.
F.Bancilhon & all. “Magic Sets and Other Strange Ways to Implement Logic Programs”, Proc. ACM Symp. on principles of Databses Systems, Boston 1986.
F. Coste, J. Nicols: “Regular Inference as a graph coloring Problem”. ICML'97.1997.
K.R. Apt, M.H. Van Emden: “Contribution to the Theory of Logic Programming”. JACM.29(3o), 1982.
R.S. Michalski & all. “Machine Learning” An Artificial Intelligence Approach”, vol. 1 & 2 Springer-Verlag 1984 and Morgan Kaufmann 1986.
H. Ahohen, H. Mannila. “Forming Grammars for structured documents”. Research report. University of Helsinki, 1994.
P. Frankhauser, Y. Xu. “MarkitUP! an incremental approach to document structure recognition". Electronic Publishing-Organisation Dissemination and Design, 6(4), 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Saidi, A.S., Tayeb-bey, S. (1998). Algebraic view of grammatical inference. In: Amin, A., Dori, D., Pudil, P., Freeman, H. (eds) Advances in Pattern Recognition. SSPR /SPR 1998. Lecture Notes in Computer Science, vol 1451. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0033261
Download citation
DOI: https://doi.org/10.1007/BFb0033261
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64858-1
Online ISBN: 978-3-540-68526-5
eBook Packages: Springer Book Archive