Notes About a More Aware Dependency Parser

arXiv: Computation and Language(2015)

引用 23|浏览0
暂无评分
摘要
In this paper I explain the reasons that led me to research and conceive a novel technology for dependency parsing, mixing together the strengths of data-driven transition-based and constraint-based approaches. In particular I highlight the problem to infer the reliability of the results of a data-driven transition-based parser, which is extremely important for high-level processes that expect to use correct parsing results. I then briefly introduce a number of notes about a new parser model Iu0027m working on, capable to proceed with the analysis in a aware way, with a more robust concept of robustness.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要