Efficiency of pregroups and the French noun phrase
From MaRDI portal
Publication:2500780
Recommendations
Cites work
- scientific article; zbMATH DE number 1341534 (Why is no real title available?)
- scientific article; zbMATH DE number 1786545 (Why is no real title available?)
- scientific article; zbMATH DE number 1786547 (Why is no real title available?)
- scientific article; zbMATH DE number 1786548 (Why is no real title available?)
- A computational algebraic approach to Latin grammar
- An efficient context-free parsing algorithm
- Recognition and parsing of context-free languages in time n3
- The Mathematics of Sentence Structure
Cited in
(8)- Toward discourse representation via pregroup grammars
- scientific article; zbMATH DE number 2089890 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 1786545 (Why is no real title available?)
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)