Linear processing with pregroups

DOI10.1007/S11225-007-9087-0zbMATH Open1132.03011OpenAlexW1967503629MaRDI QIDQ2467216FDOQ2467216

Anne Preller

Publication date: 21 January 2008

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-00184257/file/LinearProcessingWithPregroups.pdf

zbMATH Keywords

pregroup grammarsalgorithmic complexitycategorial grammarscoordinate structuresdistant constituentslinear parsing

Mathematics Subject Classification ID

Logic of natural languages (03B65) Grammars and rewriting systems (68Q42) Natural language processing (68T50)

Cites Work

• An efficient context-free parsing algorithm
• Free compact 2-categories
• Title not available (Why is that?)
• Recognition and parsing of context-free languages in time n3
• Toward discourse representation via pregroup grammars
• Title not available (Why is that?)
• Efficiency of pregroups and the French noun phrase

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Quantum natural language processing on near-term quantum computers

   Recommendations

• Title not available (Why is that?) 👍 👎
• Linear groups and computation 👍 👎
• Preconditioning Parametrized Linear Systems 👍 👎
• Preconditioning linearized equations 👍 👎
• Randomized preprocessing of homogeneous linear systems of equations 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A robust linear grouping algorithm 👍 👎

This page was built for publication: Linear processing with pregroups

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