Enhancing Practical TAG Parsing Efficiency by Capturing Redundancy

DOI10.1007/978-3-319-40946-7_26zbMath1475.68144OpenAlexW2344928727MaRDI QIDQ2830232

Jakub Waszczuk, Yannick Parmentier, Agata Savary

Publication date: 9 November 2016

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-40946-7_26

zbMATH Keywords

hypergraphsfinite-state automataparsinggrammar compressiontree-adjoining grammars

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Natural language processing (68T50)

Cites Work

• Unnamed Item
• Directed hypergraphs and applications
• Parsing Beyond Context-Free Grammars
• Principles and implementation of deductive parsing
• An efficient context-free parsing algorithm

This page was built for publication: Enhancing Practical TAG Parsing Efficiency by Capturing Redundancy