Enhancing practical TAG parsing efficiency by capturing redundancy

DOI10.1007/978-3-319-40946-7_26zbMATH Open1475.68144OpenAlexW2344928727MaRDI QIDQ2830232FDOQ2830232

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

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

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)

Cites Work

• Directed hypergraphs and applications
• An efficient context-free parsing algorithm
• Parsing Beyond Context-Free Grammars
• Title not available (Why is that?)
• 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)