Fuzzy context-free languages. II: Recognition and parsing algorithms

DOI10.1016/j.tcs.2005.06.013zbMath1080.68048OpenAlexW2047694269MaRDI QIDQ2576873

Peter R. J. Asveld

Publication date: 29 December 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.06.013

zbMATH Keywords

formal languagerecognition algorithmfuzzy context-free grammarparsing algorithmrobust parsinggrammatical error

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items

Error tolerance for the recognition of faulty strings in a regulated grammar using fuzzy sets, Approximation of fuzzy context-free grammars, On the recognizability of fuzzy languages. I, Fuzzy pushdown automata, Automata theory based on complete residuated lattice-valued logic: Pushdown automata, Fuzzy context-free languages. I: Generalized fuzzy context-free grammars, Fuzzy state grammar and fuzzy deep pushdown automaton, Algebraic aspects of families of fuzzy languages

Cites Work

• Fuzzy grammars and recursively enumerable fuzzy languages
• A recursive ascent Earley parser
• L-fuzzy grammars
• A divide-and-conquer approach to general context-free parsing
• A fuzzy grammar and possibility theory-based natural language user interface for saptial queries
• Algebraic aspects of families of fuzzy languages
• Examples of formal grammars with weights
• Fuzzy context-free languages. I: Generalized fuzzy context-free grammars
• A Supernormal-Form Theorem for Context-Free Grammars
• Time Bounded Random Access Machines with Parallel Processing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item