Tree-Adjoining Language Parsing in $O(n^6 )$ Time
From MaRDI portal
Publication:4895833
DOI10.1137/S009753979326009XzbMath0855.68055MaRDI QIDQ4895833
Publication date: 9 December 1996
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Theory of compilers and interpreters (68N20) Computing methodologies and applications (68U99) Parallel algorithms in computer science (68W10) Natural language processing (68T50) Distributed algorithms (68W15)
Related Items (2)
Linearity and nondeletion on monadic context-free tree grammars ⋮ TAL recognition in \(O(M(n^2))\) time
This page was built for publication: Tree-Adjoining Language Parsing in $O(n^6 )$ Time
