Building context-sensitive parsers from CF grammars with regular control language

被引：0

作者：

Bravo, C ^{[1
]}

Neto, JJ ^{[1
]}

机构：

[1] Univ Sao Paulo, Escola Politecn, Lab Linguagens & Tecnol Adaptat, BR-05508900 Sao Paulo, Brazil

来源：

IMPLEMENTATION AND APPLICATION OF AUTOMATA, PROCEEDINGS | 2003年 / 2759卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

In this work we propose a method to derive Stack Automata [1] from context-free grammars with regular control languages [3]; by slightly restricting the operation of the machine we obtain a bottom-up parser which operates by reducing instances of the right-hand side of productions in a sentencial form to the corresponding left-hand side; since context-free grammars with regular control languages axe Turing powerful and Stack Automata accept, at least, context-sensitive languages [2], the resulting devices are indeed context-sensitive parsers.

引用

页码：306 / 308

页数：3

共 50 条

[21] Learning of context-sensitive language acceptors through regular inference and constrained induction [J].

Alquezar, R. ;

Sanfeliu, A. ;

Cueva, J. .

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science), 1996, 1147

[22] Context-sensitive Foreign Language Teaching [J].

Cicala, Domenica Elisa .

ARCHIV FUR DAS STUDIUM DER NEUEREN SPRACHEN UND LITERATUREN, 2020, 257 (02) :460-462

[23] Unsupervised Discontinuous Constituency Parsing with Mildly Context-Sensitive Grammars [J].

Yang, Songlin ;

Levy, Roger P. ;

Kim, Yoon .

PROCEEDINGS OF THE 61ST ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, ACL 2023, VOL 1, 2023, :5747-5766

[24] THE RECOGNITION OF IMPERFECT STRINGS GENERATED BY FUZZY CONTEXT-SENSITIVE GRAMMARS [J].

INUI, M ;

SHOAFF, W ;

FAUSETT, L ;

SCHNEIDER, M .

FUZZY SETS AND SYSTEMS, 1994, 62 (01) :21-29

[25] Constructing VEGGE: Machine learning for context-sensitive graph grammars [J].

Ates, Keven ;

Zhang, Kang .

19TH IEEE INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, VOL II, PROCEEDINGS, 2007, :456-463

[26] LANGUAGES GENERATED BY CONTEXT-SENSITIVE GRAMMARS WITH CERTAIN RESTRICTIONS ON DERIVATIONS [J].

IGARASHI, Y ;

HONDA, N .

ELECTRONICS & COMMUNICATIONS IN JAPAN, 1969, 52 (10) :144-&

[27] Y A general parsing algorithm with context matching for context-sensitive graph grammars [J].

Zou, Yang ;

Zeng, Xiaoqin ;

Zhu, Yun .

MULTIMEDIA TOOLS AND APPLICATIONS, 2022, 81 (01) :273-297

[28] Computational Models of Language Within Context and Context-Sensitive Language Understanding [J].

Ito, Noriko ;

Sugimoto, Toru ;

Takahashi, Yusuke ;

Iwashita, Shino ;

Sugeno, Michio .

JOURNAL OF ADVANCED COMPUTATIONAL INTELLIGENCE AND INTELLIGENT INFORMATICS, 2006, 10 (06) :782-790

[29] Context-Sensitive Editing for the MEDFORD Metadata Language [J].

Strand, Liam ;

Powers, Andrew ;

Shpilker, Polina ;

Cowen, Lenore ;

Couch, Alva ;

Daniels, Noah M. .

METADATA AND SEMANTIC RESEARCH, MTSR 2023, 2024, 2048 :278-283

[30] Scaling Synthetic Logical Reasoning Datasets with Context-Sensitive Declarative Grammars [J].

Sileo, Damien .

2024 CONFERENCE ON EMPIRICAL METHODS IN NATURAL LANGUAGE PROCESSING, EMNLP 2024, 2024, :5275-5283

← 1 2 3 4 5 →