Abstract
Logic grammars such as Definite Clause Grammars — linguistic formalisms closely associated with the Prolog language — are powerful and highly versatile systems for specifying and detecting patterns not only in natural language, but in any suitably organized string, signal, or image. This paper reviews several such prototypes we have developed, which demonstrate the characteristics that make logic grammars a good vehicle for many Syntactic Pattern Recognition applications.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
H. Abramson. Metarules and an approach to conjunction in Definite Clause Translation Grammars: Some aspects of grammatical metaprogramming. In Logic Programming: Proc. of the Fifth Int. Conf. and Symposium, pages 233–248, 1988.
W.H. Abdulla, A.O.M. Salleh, and A.H. Morad. A preprocessing algorithm for hand-written character recognition. Pattern Recognition, 7: 13–18, 1988.
I. Bratko. Prolog Programming for Artificial Intelligence. Addison-Wesley, 1986.
J.M. Brady and B.J. Wielinga. Reading the writing on the wall. In A.R. Hanson and E. Riseman, editors, Computer Vision Systems, pages 283–299. Academic Press, New York, 1979.
V. Dahl and H. Abramson. On Gapping Grammars. Proc. of the Int. Conf. on Logic Programming, 2: 77–88, 1984.
K.S. Fu. Syntactic Pattern Recognition and Applications. Prentice-Hall, Englewood Cliffs, New Jersey, 1982.
L. Hirschman, W.C. Hopkins, and R. C. Smith. Or-parallel speed-up in natural language processing: A case study. In Logic Programming: Proc. of the Fifth International Conf. and Symposium. MIT Press, 1988.
L. Hirschman. Conjunction in meta-restriction grammar. Journal of Logic Programming, 3: 299–328, 1986.
L. Hirschman. A meta-treatment of wh-constructions in English. Proc. of META ’88, Meta-Programming in Logic Programming, 1988.
L. Hirschman and K. Puder. Restriction grammar: a Prolog implementation. In M Van Caneghem and DHD Warren, editors, Logic Programming and Its Applications, pages 244–261. Ablex Publishing, Norwood NJ, 1986.
L. Hirschman, M. Palmer, J. Dowding, M. Linebarger, R. Passonneau, F-M Lang, C. Ball, and C. Weir. The PUNDIT natural language processing system. In Proc. of the IEEE 1989 AI Systems in Government Conf., 1989.
J.J. Hull. Character recognition: The reading of text by computer. In S.C. Shapiro, editor, Encyclopedia of Artificial Intelligence, pages 82–88. Wiley-Interscience, New York, 1987.
A. Kundu, Y. He, and P. Bahl. Recognition of handwritten word: First and second order hidden Markov model based approach. Pattern Recognition, 22 (3): 283–297, March 1989.
J.B. Kruskal. An overview of sequence comparison. In D. Sankoff and J.B. Kruskal, editors, Time Warps, String Edits, and Macromolecules: The Theory and Practice of String Comparison, pages 1–44. Addison-Wesley, 1983.
E.L. Lusk, R. Butler, T. Disz, R. Overbeek, R. Stevens, D.H.D. Warren, A. Calderwood, P. Szeredi, S. Haridi, P. Brand, and M. Carlsson. The Aurora OR-parallel Prolog system. Proc. of the Intl. Conf. on Fifth Generation Computer Systems, pages 819–830, 1988.
F. Pereira. Extraposition Grammars. Computational Linguistics, 7:243–256, 1981.
Specification for postal numeric encoding technique (POSTNET), August 1985.
F. Pereira and S.M. Shieber. Prolog and Natural Language Analysis. Center for the Study of Language and Information, Stanford University, Stanford, Ca., 1987.
F.C.N. Pereira and D. Warren. Definite Clause Grammars for language analysis - A survey of the fomalism and a comparison with augmented transition networks. Artificial Intelligence, 13: 231–278, 1980.
D.B. Searls. Representing genetic information with formal grammars. Proc. of the National Conf. of the American Assoc. for Artificial Intelligence, 7: 386–391, 1988.
D.B. Searls. Investigating the linguistics of DNA with Definite Clause Grammars. Proc. of the North American Conf. on Logic Programming, 1: 189–208, 1989.
D. Searls. Signal processing with logic grammars. Intelligent Systems Review, l(4): 67–88, 1990.
D. Searls and M. Noordeweir. Pattern-matching search of DNA sequences using logic grammars, to be published in Proc. of the 7th IEEE Conf. on Artificial Intelligence Applications, 1991.
E.P. Stabler, Jr. Restricting logic grammars with government-binding theory. Computational Linguistics, 13: 1–10, 1987.
T.Y. Zhang and C.U. Suen. A fast parallel algorithm for thinning digital patterns. Comm. of the ACM, 27 (3): 236–239, 1984.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Searls, D.B., Taylor, S.L. (1992). Document Image Analysis Using Logic-Grammar-Based Syntactic Pattern Recognition. In: Baird, H.S., Bunke, H., Yamamoto, K. (eds) Structured Document Image Analysis. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-77281-8_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-77281-8_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-77283-2
Online ISBN: 978-3-642-77281-8
eBook Packages: Springer Book Archive