BRANCH AND BOUND ALGORITHM FOR PHRASE LEVEL PATTERN MATCHING BY USING DETERMINISTIC CONTEXT-FREE GRAMMAR.

被引:0
|
作者
Kimura, Takahisa [1 ]
机构
[1] Fujitsu Ltd, Numazu, Jpn, Fujitsu Ltd, Numazu, Jpn
关键词
D O I
暂无
中图分类号
学科分类号
摘要
17
引用
收藏
页码:146 / 153
相关论文
共 50 条
  • [1] A Multiple String and Pattern Matching Algorithm Using Context-Free Grammar
    Kumar, Sarvesh
    Singh, Sonali
    Khatoon, Arfiha
    Agarwal, Swati
    EMERGING TRENDS IN EXPERT APPLICATIONS AND SECURITY, 2019, 841 : 97 - 102
  • [2] A Fast Multiple Pattern Matching Algorithm using Context Free Grammar and Tree Model
    Phanindra, G.
    Shankar, K. V. V. N. Ravi
    Sreenivas, P. Deepak
    INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2007, 7 (09): : 231 - 234
  • [3] Molecular query language (MQL) -: A context-free grammar for substructure matching
    Proschak, Ewgenij
    Wegner, Joerg K.
    Schueller, Andreas
    Schneider, Gisbert
    Fechner, Uli
    JOURNAL OF CHEMICAL INFORMATION AND MODELING, 2007, 47 (02) : 295 - 301
  • [4] Human behavior recognition using a context-free grammar
    Rosani, Andrea
    Conci, Nicola
    De Natale, Francesco G. B.
    JOURNAL OF ELECTRONIC IMAGING, 2014, 23 (03)
  • [5] ENCODING OF LINGUISTIC INFORMATION GENERATED BY A MARKOV CHAIN WHICH IS ASSOCIATED WITH A STOCHASTIC CONTEXT-FREE GRAMMAR.
    Ozeki, Kazuhiko
    1600, (06):
  • [6] Pattern matching compilation of functions defined in context-free languages
    Haiming Chen
    Yunmei Dong
    Journal of Computer Science and Technology, 2001, 16 : 159 - 167
  • [7] Pattern matching compilation of functions defined in context-free languages
    Chen, HM
    Dong, YM
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2001, 16 (02) : 159 - 167
  • [8] Pattern Matching Compilation of Functions Definedin Context-Free Languages
    陈海明
    董韫美
    JournalofComputerScienceandTechnology, 2001, (02) : 159 - 167
  • [9] A corpus-driven context-free approximation of head-driven phrase structure grammar
    Krieger, HU
    GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, PROCEEDINGS, 2004, 3264 : 199 - 210
  • [10] Approximate matching between a context-free grammar and a finite-state automaton
    Ko, Sang-Ki
    Han, Yo-Sub
    Salomaa, Kai
    INFORMATION AND COMPUTATION, 2016, 247 : 278 - 289