TAG – CYK Parsing (Deduktion) (erfolgreicher Trace)

Extra mit zwei Adjunktionen an der “gleichen” Stelle, um die Funktionsweise klarzumachen. Die Definitionen der Regeln findet ihr in den Handouts eures Professors. Playlist PBCFG: Quellen: Kallmeyer, Laura: Parsing beyond context-free grammars. Heidelberg : Springer, 2010 (Cognitive technologies). — ISBN 978-3-642-14845-3, S. 77 ff. Vijay-Shankar, K. ; Joshi, Aravind K.: Some computational properties of tree adjoining grammars. In: Proceedings of the workshop on Strategic computing natural language. Stroudsburg, PA, USA : Association for Computational Linguistics, 1986 (HLT ’86), S. 216 ff.

It's only fair to share...Tweet about this on TwitterShare on FacebookShare on TumblrShare on Google+Digg thisShare on LinkedInPin on PinterestShare on VKShare on RedditPrint this pageEmail this to someone
Flattr the authorShare on StumbleUponShare on YummlyBuffer this page

Leave a Reply

Your email address will not be published. Required fields are marked *