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

P.R.J. Asveld

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

22 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 language	Undefined
Title of host publication	Developments in Language Theory II -- At the Crossroads of Mathematics, Computer Science and Biology
Editors	J. Dassow, G. Rozenberg, A. Salomaa
Place of Publication	Singapore
Publisher	World Scientific
Pages	443-453
Number of pages	11
ISBN (Print)	981-02-2682-9
Publication status	Published - 1996
Event	Developments in Language Theory II -- At the Crossroads of Mathematics, Computer Science and Biology - Magdeburg, Germany Duration: 17 Jul 1995 → 21 Jul 1995

Publication series

Name
Publisher	World Scientific

Conference

Conference	Developments in Language Theory II -- At the Crossroads of Mathematics, Computer Science and Biology
Period	17/07/95 → 21/07/95
Other	17-21 July 1995

Keywords

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

Access to Document

Cite this

@inproceedings{2c80f9ada60a455997555826378b2517,

title = "Towards Robustness in Parsing -- Fuzzifying Context-Free Language Recognition",

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.",

keywords = "EWI-2755, MSC-68Q52, IR-18777, MSC-03E72, METIS-119299, HMI-SLT: Speech and Language Technology",

author = "P.R.J. Asveld",

year = "1996",

language = "Undefined",

isbn = "981-02-2682-9",

publisher = "World Scientific",

pages = "443--453",

editor = "J. Dassow and G. Rozenberg and A. Salomaa",

booktitle = "Developments in Language Theory II -- At the Crossroads of Mathematics, Computer Science and Biology",

address = "United States",

note = "null ; Conference date: 17-07-1995 Through 21-07-1995",

}

Asveld, PRJ 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. World Scientific, Singapore, pp. 443-453, Developments in Language Theory II -- At the Crossroads of Mathematics, Computer Science and Biology, 17/07/95.

Towards Robustness in Parsing -- Fuzzifying Context-Free Language Recognition. / Asveld, P.R.J.

Developments in Language Theory II -- At the Crossroads of Mathematics, Computer Science and Biology. ed. / J. Dassow; G. Rozenberg; A. Salomaa. Singapore : World Scientific, 1996. p. 443-453.

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

TY - GEN

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

AU - Asveld, P.R.J.

PY - 1996

Y1 - 1996

N2 - 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.

AB - 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.

KW - EWI-2755

KW - MSC-68Q52

KW - IR-18777

KW - MSC-03E72

KW - METIS-119299

KW - HMI-SLT: Speech and Language Technology

M3 - Conference contribution

SN - 981-02-2682-9

SP - 443

EP - 453

BT - Developments in Language Theory II -- At the Crossroads of Mathematics, Computer Science and Biology

A2 - Dassow, J.

A2 - Rozenberg, G.

A2 - Salomaa, A.

PB - World Scientific

CY - Singapore

Y2 - 17 July 1995 through 21 July 1995

ER -