Enhancing practical TAG parsing efficiency by capturing redundancy

DOI10.1007/978-3-319-40946-7_26MaRDI QIDQ2830232zbMATH OpenOpenAlexFDO

Authors Jakub Waszczuk, Agata Savary, Yannick Parmentier

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

finite-state automatahypergraphsparsinggrammar compressiontree-adjoining grammars

Mathematics Subject Classification ID

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

Recommendations

• Parallel parsing of tree adjoining grammars on the connection machine
• New developments in parsing technology. Selected papers based on the contribution to the 6th international workshop on parsing technology, IWPT 2000, Trento, Italy, February 23--25, 2000, and the 7th international workshop on parsing technology, IWPT 2001, Beijing, China, October 17--19, 2001.
• scientific article; zbMATH DE number 1974076
• An Optimal Linear-Time Parallel Parser for Tree Adjoining Languages
• Tree-Adjoining Language Parsing in $O(n^6 )$ Time

Cites work

• scientific article; zbMATH DE number 475427 (Why is no real title available?)
• An efficient context-free parsing algorithm
• Directed hypergraphs and applications
• Parsing beyond context-free grammars
• Principles and implementation of deductive parsing

Cited in

(1)

• Towards a reduced commitment, D-theory style TAG parser

This page was built for publication: Enhancing practical TAG parsing efficiency by capturing redundancy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2830232)