Week5-7Dependency parsing
来源:互联网 发布:s7 200 编程电缆 原装 编辑:程序博客网 时间:2024/06/04 18:33
Dependency structure
- blue
- modifier, dependent, child, subordinate
- house
- head, governor, parent, regent
- Phrase structure
- Dependency structure
Dependency grammar
- Characteristics
- lexical/syntactic dependencies between words
- top-level predicate of the sentence is the root
- simpler to parse than CFG
- particularly useful for free word order languages(Latin)
How to identify the head
- H=head, M=modifier
- H determines the syntactic category of the construct
- H determines the semantic category of the construct
- H is required, M can be skipped( house is a must, but blue can be skipped)
- Fixed linear position of M with respect to H
Head rules from Collins
Techniques
- Dynamic Programming
- CKY - similar to lexicalized PCFG,
O(n3)
- CKY - similar to lexicalized PCFG,
- Constraint based methods
- Maruyama 1990, Karlsson 1990
- NP complete problem; heuristics need
- Constraint Graph
- Deterministic Parsing
- Covington 2001
- Maltparser by Nivre
- Similar to shift-reduce parser
- Graph based methods
- Maximum spanning trees(MCDonald et al.)
Non-projectivity
If you allow your parse tree to have crossings as shown at the bottom of the sentence, the parse tree is non-projective parse tree.
Dependency parsing
- Background
- McDonald et al. 2005
- Projectivity
- English dependency trees are mostly projective (can be drawn without crossing dependencies)
- Idea
- Dependency parsing is equivalent to search for a maximum spanning tree in a directed graph.
MaltParser
- It includes following components
- a stack
- a buffer
- set of dependencies (arcs)
- There is also arc-eager parser having different actions
Example
- There is no search, the next action is chosen using a classifier.
- The final list of arcs is returned as the dependency tree.
Evaluation metric
- Labelled dependency accuracy
- # correct deps / # deps
Complexity
- Projective (CKY)
O(n5) - Projective (Eisner)
O(n3) - Non-projective (MST- Chu-Liu-Edmonds)
O(n2) - Projective (Malt)
O(n)
Application
Use in Information Extraction
Dependency kernels
Decides how similar 2 sentences are based on how similar their dependency structures are.
0 0
- Week5-7Dependency parsing
- Week5-1Parsing Recap
- Week5-8Alternative Parsing Formalisms
- Week5-3The exponential problem in parsing
- Week5-1Syntactic structure: Constituency vs Dependency
- constituency parsing and dependency parsing 的区别
- Constituent Parsing & Dependency Parsing 句法分析简介
- Week5-2Empirical/data driven approach to parsing
- 【segmentation & parsing & dependency parsing】nltk调用stanford NLP工具包
- CoNLL Multi-lingual Dependency Parsing 格式
- week5
- [ICLR2017]Deep Biaffine Attention for Neural Dependency Parsing
- Ubuntu apt 出错解决办法: Problem parsing dependency Depends
- Dependency
- POMM-week5
- No5.week5
- Leetcode Week5
- leetcode week5
- Redis的订阅发布机制
- 变(2)
- [ACM]判断正多边形
- Xcode 及 iOS 常用宏和常量
- 微服务架构在云端的应用
- Week5-7Dependency parsing
- hdu 5596GTW likes gt(最好倒着思考)
- Service Intent must be explitict
- android开发之SnackBar的使用
- 领域驱动设计整理——概念&架构
- C#之显示
- #递归 解决ABCDE 5人分鱼问题鱼,
- JAVA 解析excel兼容2003和2007以后的版本
- TortoiseGit安装与配置02