Efficiency of pregroups and the French noun phrase

DOI10.1007/S10849-005-1242-2zbMATH Open1103.03030OpenAlexW2016191112MaRDI QIDQ2500780FDOQ2500780

Authors: Sylvain Degeilh, Anne Preller 

Publication date: 18 August 2006

Published in: Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-00105318

Recommendations

• Linear processing with pregroups
• scientific article; zbMATH DE number 1786547
• From word to sentence. A computational algebraic approach to grammar
• Parsing pregroup grammars with letter promotions in polynomial time
• Pregroup Grammars with Letter Promotions

zbMATH Keywords

decision procedurerecognition algorithmalgorithmic complexitycategorial grammarspregroupsFrench noun phrase

Mathematics Subject Classification ID

Logic of natural languages (03B65) Natural language processing (68T50) Linguistics (91F20)

Cites Work

• An efficient context-free parsing algorithm
• Title not available (Why is that?)
• Recognition and parsing of context-free languages in time n3
• The Mathematics of Sentence Structure
• Title not available (Why is that?)
• A computational algebraic approach to Latin grammar
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (8)

• Toward discourse representation via pregroup grammars
• Title not available (Why is that?)
• Linear processing with pregroups
• A Savateev-style parsing algorithm for pregroup grammars
• Parsing pregroup grammars with letter promotions in polynomial time
• Exploring feature agreement in French with parallel pregroup computations
• A computational algebraic analysis of Hindi syntax
• Title not available (Why is that?)

This page was built for publication: Efficiency of pregroups and the French noun phrase

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