• DocumentCode
    2407367
  • Title

    The Cocke-Younger-Kasami algorithm for cyclic strings

  • Author

    Oncina, Jose

  • Author_Institution
    Dept. de Lenguajes Sistemas Inf., Alicante Univ., Spain
  • Volume
    2
  • fYear
    1996
  • fDate
    25-29 Aug 1996
  • Firstpage
    413
  • Abstract
    The chain-code representation of contours is widely used in syntactic shape recognition. However the ignorance of a starting point makes the time complexity of traditional parsers increase in one order. This paper describes a technique for adapting, any Cocke-Younger-Kasami context-free parser in order to use it with cyclic strings. The parsers obtained with this technique have the same time and space complexity as the original one (usually O(n3))
  • Keywords
    computational complexity; context-free grammars; pattern recognition; Cocke-Younger-Kasami algorithm; Cocke-Younger-Kasami context-free parser; O(n3); chain-code representation; contours; cyclic strings; space complexit; syntactic shape recognition; time complexity; Computer vision; Contracts; Pattern recognition; Production; Shape; Testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Pattern Recognition, 1996., Proceedings of the 13th International Conference on
  • Conference_Location
    Vienna
  • ISSN
    1051-4651
  • Print_ISBN
    0-8186-7282-X
  • Type

    conf

  • DOI
    10.1109/ICPR.1996.546859
  • Filename
    546859
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2407367