Polynomially parsable unification grammars

DOI10.1093/LOGCOM/EXT013zbMath1323.68535OpenAlexW2117290112MaRDI QIDQ3450205

Hadas Peled, Shuly Wintner

Publication date: 3 November 2015

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/ext013

zbMATH Keywords

parsingrange concatenation grammarunification grammarsuniversal recognition problem

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Natural language processing (68T50) Linguistics (91F20)

This page was built for publication: Polynomially parsable unification grammars