Towards Robustness in Parsing -- Fuzzifying Context-Free Language Recognition

P.R.J. Asveld

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    17 Downloads (Pure)

    Abstract

    We discuss the concept of robustness with respect to parsing or recognizing a context-free language. Our approach is based on the notions of fuzzy language, (generalized) fuzzy context-free grammar, and parser/recognizer for fuzzy languages. As concrete examples we consider a robust version of Cocke-Youger-Kasami's algorithm and a robust kind of recursive descent recognizer. Keywords and phrases: fuzzy language, fuzzy context-free grammar, fuzzy context-free $K$-grammar, grammatical error, parsing/recognition of fuzzy languages, Cocke-Youger-Kasami's algorithm, recursive descent.
    Original languageUndefined
    Title of host publicationDevelopments in Language Theory II -- At the Crossroads of Mathematics, Computer Science and Biology
    EditorsJ. Dassow, G. Rozenberg, A. Salomaa
    Place of PublicationSingapore
    PublisherWorld Scientific
    Pages443-453
    Number of pages11
    ISBN (Print)981-02-2682-9
    Publication statusPublished - 1996

    Publication series

    Name
    PublisherWorld Scientific

    Keywords

    • EWI-2755
    • MSC-68Q52
    • IR-18777
    • MSC-03E72
    • METIS-119299
    • HMI-SLT: Speech and Language Technology

    Access to Document

      Cite this

      Asveld, P. R. J. (1996). Towards Robustness in Parsing -- Fuzzifying Context-Free Language Recognition. In J. Dassow, G. Rozenberg, & A. Salomaa (Eds.), Developments in Language Theory II -- At the Crossroads of Mathematics, Computer Science and Biology (pp. 443-453). Singapore: World Scientific.