
<script type="text/javascript">
<!--
document.write('<div id="oa_widget"></div>');
document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=undefined&type=result"></script>');
-->
</script>doi: 10.22028/d291-25078
Tree Adjoining Grammars (TAGs) - as used in the parsing algorithm of Harbusch - can be improved with respect to compactness and transparency for the task of grammar design. We have combined the two formalisms Tree Adjoining Grammar and Unification in order to benefit from their respective advantages. Our approach is contrasted with the approach of Vijay-Shanker.
ddc:004, Künstliche Intelligenz, 004
ddc:004, Künstliche Intelligenz, 004
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
