Searching for "Transforming Projective Bilexical Dependency Grammars into efficiently-parsable CFGs with Unfold-Fold." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

c○2007 Association for Computational Linguistics
by unknown authors — 2007
… . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 160 Transforming Projective Bilexical Dependency Grammars into efficiently-parsable CFGs with Unfold…
Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB