Parsing Free Word-Order Languages in Polynomial Time

Add code
Nov 03, 1994
Tilman Becker, Owen Rambow
Figure 1 for Parsing Free Word-Order Languages in Polynomial Time
Figure 2 for Parsing Free Word-Order Languages in Polynomial Time
Figure 3 for Parsing Free Word-Order Languages in Polynomial Time

Share this with someone who'll enjoy it:

Twitter IconFacebook IconLinkedin IconWhatsapp IconMessenger Icon

We present a parsing algorithm with polynomial time complexity for a large subset of V-TAG languages. V-TAG, a variant of multi-component TAG, can handle free-word order phenomena which are beyond the class LCFRS (which includes regular TAG). Our algorithm is based on a CYK-style parser for TAGs.

* In {\em 3e Colloque International sur les Grammaires d'Arbres Adjoints (TAG+3)}  * 4 pages, uuencoded compressed ps file  
View paper onarxiv icon

Share this with someone who'll enjoy it:

Twitter IconFacebook IconLinkedin IconWhatsapp IconMessenger Icon