Furthermore, the manually annotated treebanks that these parsers rely on are highly expensive to create.
developing dependency parsing algorithms that can be easily ported from one domain to another-say, from a resource-rich domain to a resource-poor domain-is of great importance.