The optimal dependency tree that satisfies this 1-Endpoint-Crossing property can be found with an O(n4) parsing algorithm that recursively combines forests over ...

2013/03/01 · The optimal dependency tree that satisfies this 1-Endpoint-Crossing property can be found with an O(n4) parsing algorithm that recursively ...

2013/03/01 · The optimal dependency tree that satisfies this 1-Endpoint-Crossing property can be found with an O(n^4) parsing algorithm that recursively ...

This thesis shows that models and features compatible with how conjunctions are represented in treebanks yield a parser with state-of-the-art overall ...

Finding Optimal 1-Endpoint-Crossing Trees (2013) Pitler, Emily and Kannan, Sampath and Marcus, Mitchell.

In this paper, we conduct a corpus study for a group of 38 languages, which were either Subject-Verb-Object (SVO) or Subject-Object-Verb (SOV), in order to ...

The optimal dependency tree that satisfies this 1-Endpoint-Crossing property can be found with an O( n 4) parsing algorithm that recursively combines forests ...

Finding Optimal 1-Endpoint-Crossing Trees ... More information about the publishing system, Platform and Workflow by OJS/PKP. ×.

Finding optimal 1-endpoint-crossing trees. Transactions of the Association for. Computational Linguistics (TACL). ▷ Emily Pitler. 2014. A crossing-sensitive ...

This thesis provides exact dynamic programming algorithms that find the optimal 1-Endpoint-Crossing tree under either an edge-factored model or this crossing ...