APPROXIMATING DEPENDENCY GRAMMARS THROUGH INTERSECTION OF STAR-FREE REGULAR LANGUAGES
From MaRDI portal
Publication:5462124
DOI10.1142/S0129054105003169zbMath1097.68131MaRDI QIDQ5462124
Publication date: 1 August 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
natural language processingregular approximationsstar-free languagesbracketinghomomorphic representationsDependency grammars
Related Items (1)
Cites Work
This page was built for publication: APPROXIMATING DEPENDENCY GRAMMARS THROUGH INTERSECTION OF STAR-FREE REGULAR LANGUAGES