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

DOI10.1016/j.tcs.2005.06.013zbMath1080.68048MaRDI 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 language; recognition algorithm; fuzzy context-free grammar; parsing algorithm; robust parsing; grammatical error

Mathematics Subject Classification ID

68W05: Nonnumerical algorithms

68Q45: Formal languages and automata

68Q42: Grammars and rewriting systems

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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