Introduction to Data-Driven Dependency Parsing
|
|
- Holly Anderson
- 5 years ago
- Views:
Transcription
1 Introduction to Data-Driven Dependency Parsing Introductory Course, ESSLLI 2007 Ryan McDonald 1 Joakim Nivre 2 1 Google Inc., New York, USA ryanmcd@google.com 2 Uppsala University and Växjö University, Sweden nivre@msi.vxu.se Introduction to Data-Driven Dependency Parsing 1(29)
2 Introduction Overview of the Course Dependency parsing (Joakim) Machine learning methods (Ryan) Transition-based models (Joakim) Graph-based models (Ryan) Loose ends (Joakim, Ryan): Other approaches Empirical results Available software Introduction to Data-Driven Dependency Parsing 2(29)
3 Introduction Notation Reminder Sentence x = w 0,w 1,...,w n, with w 0 = root L = {l 1,...,l L } set of permissible arc labels Let G = (V,A) be a dependency graph for sentence x where: V = {0, 1,..., n} is the vertex set A is the arc set, i.e., (i, j, k) A represents a dependency from w i to w j with label l k L By the usual definition, G is a tree Introduction to Data-Driven Dependency Parsing 3(29)
4 Introduction Data-Driven Parsing Goal: Learn a good predictor of dependency graphs Input: x Output: dependency graph/tree G This lecture: Parameterize parsing by transitions Learn to predict transitions given the input and a history Predict new graphs using deterministic parsing algorithm Next lecture: Parameterize parsing by dependency arcs Learn to predict entire graphs given the input Predict new graphs using spanning tree algorithms Introduction to Data-Driven Dependency Parsing 4(29)
5 Introduction Lecture 3: Outline Transition systems Deterministic classifier-based models Parsing algorithm Stack-based and list-based transition systems Classifier-based parsing Pseudo-projective parsing Introduction to Data-Driven Dependency Parsing 5(29)
6 Transitions Systems Transition Systems A transition system for dependency parsing is a quadruple S = (C,T,c s,c t ), where 1. C is a set of configurations, each of which contains a buffer β of (remaining) nodes and a set A of dependency arcs, 2. T is a set of transitions, each of which is a (partial) function t : C C, 3. c s is an initialization function, mapping a sentence x = w 0, w 1,...,w n to a configuration with β = [1,...,n], 4. C t C is a set of terminal configurations. Note: A configuration represents a parser state. A transition represents a parsing action (parser state update). Introduction to Data-Driven Dependency Parsing 6(29)
7 Transitions Systems Transition Sequences Let S = (C,T,c s,c t ) be a transition system. A transition sequence for a sentence x = w 0,w 1,...,w n in S is a sequence C 0,m = (c 0,c 1,...,c m ) of configurations, such that 1. c 0 = c s (x), 2. c m C t, 3. for every i (1 i m), c i = t(c i 1 ) for some t T. The parse assigned to x by C 0,m is the dependency graph G cm = ({0,1,...,n},A cm ), where A cm is the set of dependency arcs in c m. Introduction to Data-Driven Dependency Parsing 7(29)
8 Parsing Algorithm Deterministic Parsing An oracle for a transition system S = (C,T,c s,c t ) is a function o : C T. Given a transition system S = (C,T,c s,c t ) and an oracle o, deterministic parsing can be achieved by the following simple algorithm: Parse(x = (w 0,w 1,...,w n )) 1 c c s (x) 2 while c C t 3 c = [o(c)](c) 4 return G c NB: Oracles can be approximated by classifiers (cf. lecture 2). Introduction to Data-Driven Dependency Parsing 8(29)
9 Stack-Based Transition Systems A stack-based configuration for a sentence x = w 0,w 1,...,w n is a triple c = (σ,β,a), where 1. σ is a stack of tokens i m (for some m n), 2. β is a buffer of tokens j > m, 3. A is a set of dependency arcs such that G = ({0, 1,...,n}, A) is a dependency graph for x. A stack-based transition system is a quadruple S = (C,T,c s,c t ), where 1. C is the set of all stack-based configurations, 2. c s (x = w 0, w 1,... w n ) = ([0], [1,...,n], ), 3. T is a set of transitions, each of which is a function t : C C, 4. C t = {c C c = (σ, [ ], A)}. Notation: σ i = stack with top i ( left-associative) i β = buffer with next token i ( right-associative) Introduction to Data-Driven Dependency Parsing 9(29)
10 Shift-Reduce Dependency Parsing Transitions: Left-Arck : (σ i,j β, A) (σ,j β, A {(j, i,k)}) Right-Arck : (σ i,j β, A) (σ,i β, A {(i, j, k)}) Shift: (σ,i β, A) (σ i, β, A) Preconditions: Left-Arck : [i = 0] i k [(i, i,k ) A] Right-Arck : i k [(i, j,k ) A] Introduction to Data-Driven Dependency Parsing 10(29)
11 Example: Shift-Reduce Parsing [root 0 ] σ [Economic 1 news 2 had 3 little 4 effect 5 on 6 financial 7 markets 8. 9 ] β Introduction to Data-Driven Dependency Parsing 11(29)
12 Example: Shift-Reduce Parsing [root 0 Economic 1 ] σ [news 2 had 3 little 4 effect 5 on 6 financial 7 markets 8. 9 ] β Shift Introduction to Data-Driven Dependency Parsing 11(29)
13 Example: Shift-Reduce Parsing [root 0 ] σ Economic 1 [news 2 had 3 little 4 effect 5 on 6 financial 7 markets 8. 9 ] β Left-Arc Introduction to Data-Driven Dependency Parsing 11(29)
14 Example: Shift-Reduce Parsing [root 0 Economic 1 news 2 ] σ [had 3 little 4 effect 5 on 6 financial 7 markets 8. 9 ] β Shift Introduction to Data-Driven Dependency Parsing 11(29)
15 Example: Shift-Reduce Parsing sbj [root 0 ] σ Economic 1 news 2 [had 3 little 4 effect 5 on 6 financial 7 markets 8. 9 ] β Left-Arc sbj Introduction to Data-Driven Dependency Parsing 11(29)
16 Example: Shift-Reduce Parsing sbj [root 0 Economic 1 news 2 had 3 ] σ [little 4 effect 5 on 6 financial 7 markets 8. 9 ] β Shift Introduction to Data-Driven Dependency Parsing 11(29)
17 Example: Shift-Reduce Parsing sbj [root 0 Economic 1 news 2 had 3 little 4 ] σ [effect 5 on 6 financial 7 markets 8. 9 ] β Shift Introduction to Data-Driven Dependency Parsing 11(29)
18 Example: Shift-Reduce Parsing sbj [root 0 Economic 1 news 2 had 3 ] σ little 4 [effect 5 on 6 financial 7 markets 8. 9 ] β Left-Arc Introduction to Data-Driven Dependency Parsing 11(29)
19 Example: Shift-Reduce Parsing sbj [root 0 Economic 1 news 2 had 3 little 4 effect 5 ] σ [on 6 financial 7 markets 8. 9 ] β Shift Introduction to Data-Driven Dependency Parsing 11(29)
20 Example: Shift-Reduce Parsing sbj [root 0 Economic 1 news 2 had 3 little 4 effect 5 on 6 ] σ [financial 7 markets 8. 9 ] β Shift Introduction to Data-Driven Dependency Parsing 11(29)
21 Example: Shift-Reduce Parsing sbj [root 0 Economic 1 news 2 had 3 little 4 effect 5 on 6 financial 7 ] σ [markets 8. 9 ] β Shift Introduction to Data-Driven Dependency Parsing 11(29)
22 Example: Shift-Reduce Parsing sbj [root 0 Economic 1 news 2 had 3 little 4 effect 5 on 6 ] σ financial 7 [markets 8. 9 ] β Left-Arc Introduction to Data-Driven Dependency Parsing 11(29)
23 Example: Shift-Reduce Parsing pc sbj [root 0 Economic 1 news 2 had 3 little 4 effect 5 ] σ [on 6 financial 7 markets 8. 9 ] β Right-Arc pc Introduction to Data-Driven Dependency Parsing 11(29)
24 Example: Shift-Reduce Parsing pc sbj [root 0 Economic 1 news 2 had 3 ] σ little 4 [effect 5 on 6 financial 7 markets 8. 9 ] β Right-Arc Introduction to Data-Driven Dependency Parsing 11(29)
25 Example: Shift-Reduce Parsing obj pc sbj [root 0 ] σ Economic 1 news 2 [had 3 little 4 effect 5 on 6 financial 7 markets 8. 9 ] β Right-Arc obj Introduction to Data-Driven Dependency Parsing 11(29)
26 Example: Shift-Reduce Parsing pred obj pc sbj [root 0 ] σ Economic 1 news 2 had 3 little 4 effect 5 on 6 financial 7 markets 8 [. 9 ] β Right-Arc pred Introduction to Data-Driven Dependency Parsing 11(29)
27 Example: Shift-Reduce Parsing p pred obj pc sbj [] σ [root 0 ] β Economic 1 news 2 had 3 little 4 effect 5 on 6 financial 7 markets 8. 9 Right-Arc p Introduction to Data-Driven Dependency Parsing 11(29)
28 Example: Shift-Reduce Parsing p pred obj pc sbj [root 0 ] σ [ ] β Economic 1 news 2 had 3 little 4 effect 5 on 6 financial 7 markets 8. 9 Shift Introduction to Data-Driven Dependency Parsing 11(29)
29 Theoretical Results Complexity: Deterministic shift-reduce parsing has time and space complexity O(n), where n is the length of the input sentence. Correctness: For every transition sequence C0,m, G cm is a projective dependency forest (soundness). For every projective dependency forest G, there is a transition sequence C 0,m such that G cm = G (completeness). Note: A dependency forest is (here) a dependency graph satisfying Root, Single-Head, and Acyclicity (but not Connectedness). A dependency forest G = (V, A) can be transformed into a dependency tree by adding arcs of the form (0, i, k) (for some l k L) for every root i V (i 0). Introduction to Data-Driven Dependency Parsing 12(29)
30 Variations on Shift-Reduce Parsing Empty stack initialization: If we can assume that there is only one node i such that (0, i, k) A, then we can reduce ambiguity by starting with an empty stack (and adding the arc (0, i, k) after termination). Iterative parsing [Yamada and Matsumoto 2003]: Same transition system (with empty stack initialization) 1 Given a terminal configuration: (σ,[], A) = ([], σ, A) Terminate when A has not been modified in the last iteration. Modified transition systems: Arc-eager parsing [Nivre 2003] Non-projective parsing [Attardi 2006] 1 NB: Left-Arc Right, Right-Arc Left Introduction to Data-Driven Dependency Parsing 13(29)
31 Arc-Eager Parsing Transitions: Left-Arck : (σ i,j β, A) (σ,j β, A {(j, i,k)}) Right-Arck : (σ i,j β, A) (σ i j, β,a {(i, j, k)}) Reduce: (σ i, β, A) (σ, β, A) Shift: (σ,i β, A) (σ i, β, A) Preconditions: Left-Arck : [i = 0] i k [(i, i,k ) A] Right-Arck : i k [(i, j,k ) A] Reduce: i k [(i,i, k ) A] Introduction to Data-Driven Dependency Parsing 14(29)
32 Example: Arc-Eager Parsing [root 0 ] σ [Economic 1 news 2 had 3 little 4 effect 5 on 6 financial 7 markets 8. 9 ] β Introduction to Data-Driven Dependency Parsing 15(29)
33 Example: Arc-Eager Parsing [root 0 Economic 1 ] σ [news 2 had 3 little 4 effect 5 on 6 financial 7 markets 8. 9 ] β Shift Introduction to Data-Driven Dependency Parsing 15(29)
34 Example: Arc-Eager Parsing [root 0 ] σ Economic 1 [news 2 had 3 little 4 effect 5 on 6 financial 7 markets 8. 9 ] β Left-Arc Introduction to Data-Driven Dependency Parsing 15(29)
35 Example: Arc-Eager Parsing [root 0 Economic 1 news 2 ] σ [had 3 little 4 effect 5 on 6 financial 7 markets 8. 9 ] β Shift Introduction to Data-Driven Dependency Parsing 15(29)
36 Example: Arc-Eager Parsing sbj [root 0 ] σ Economic 1 news 2 [had 3 little 4 effect 5 on 6 financial 7 markets 8. 9 ] β Left-Arc sbj Introduction to Data-Driven Dependency Parsing 15(29)
37 Example: Arc-Eager Parsing pred sbj [root 0 Economic 1 news 2 had 3 ] σ [little 4 effect 5 on 6 financial 7 markets 8. 9 ] β Right-Arc pred Introduction to Data-Driven Dependency Parsing 15(29)
38 Example: Arc-Eager Parsing pred sbj [root 0 Economic 1 news 2 had 3 little 4 ] σ [effect 5 on 6 financial 7 markets 8. 9 ] β Shift Introduction to Data-Driven Dependency Parsing 15(29)
39 Example: Arc-Eager Parsing pred sbj [root 0 Economic 1 news 2 had 3 ] σ little 4 [effect 5 on 6 financial 7 markets 8. 9 ] β Left-Arc Introduction to Data-Driven Dependency Parsing 15(29)
40 Example: Arc-Eager Parsing pred sbj obj [root 0 Economic 1 news 2 had 3 little 4 effect 5 ] σ [on 6 financial 7 markets 8. 9 ] β Right-Arc obj Introduction to Data-Driven Dependency Parsing 15(29)
41 Example: Arc-Eager Parsing pred sbj obj [root 0 Economic 1 news 2 had 3 little 4 effect 5 on 6 ] σ [financial 7 markets 8. 9 ] β Right-Arc Introduction to Data-Driven Dependency Parsing 15(29)
42 Example: Arc-Eager Parsing pred sbj obj [root 0 Economic 1 news 2 had 3 little 4 effect 5 on 6 financial 7 ] σ [markets 8. 9 ] β Shift Introduction to Data-Driven Dependency Parsing 15(29)
43 Example: Arc-Eager Parsing pred obj sbj [root 0 Economic 1 news 2 had 3 little 4 effect 5 on 6 ] σ financial 7 [markets 8. 9 ] β Left-Arc Introduction to Data-Driven Dependency Parsing 15(29)
44 Example: Arc-Eager Parsing pred obj pc sbj [root 0 Economic 1 news 2 had 3 little 4 effect 5 on 6 financial 7 markets 8 ] σ [. 9 ] β Right-Arc pc Introduction to Data-Driven Dependency Parsing 15(29)
45 Example: Arc-Eager Parsing pred obj pc sbj [root 0 Economic 1 news 2 had 3 little 4 effect 5 on 6 ] σ financial 7 markets 8 [. 9 ] β Reduce Introduction to Data-Driven Dependency Parsing 15(29)
46 Example: Arc-Eager Parsing pred obj sbj pc [root 0 Economic 1 news 2 had 3 little 4 effect 5 ] σ on 6 financial 7 markets 8 [. 9 ] β Reduce Introduction to Data-Driven Dependency Parsing 15(29)
47 Example: Arc-Eager Parsing pred obj pc sbj [root 0 Economic 1 news 2 had 3 ] σ little 4 effect 5 on 6 financial 7 markets 8 [. 9 ] β Reduce Introduction to Data-Driven Dependency Parsing 15(29)
48 Example: Arc-Eager Parsing pred obj pc sbj [root 0 ] σ Economic 1 news 2 had 3 little 4 effect 5 on 6 financial 7 markets 8 [. 9 ] β Reduce Introduction to Data-Driven Dependency Parsing 15(29)
49 Example: Arc-Eager Parsing p pred obj pc sbj [root 0 Economic 1 news 2 had 3 little 4 effect 5 on 6 financial 7 markets 8. 9 ] σ [] β Right-Arc p Introduction to Data-Driven Dependency Parsing 15(29)
50 Non-Projective Parsing New transitions: NP-Left-Arck : (σ i i, j β,a) (σ i,j β, A {(j, i,k)}) NP-Right-Arck : (σ i i, j β,a) (σ i, i β,a {(i, j, k)}) Handles most naturally occurring non-projective dependency relations (94% in the Prague Dependency Treebank). root0 AuxK AuxP AuxP Pred Sb Atr AuxZ Z1 nich2 je3 jen4 jedna5 (Out-of them is only one-fem-sg ( Only one of them concerns quality. ) na6 to Adv kvalitu7 quality.8.) More expressive extensions are possible [Attardi 2006]. Introduction to Data-Driven Dependency Parsing 16(29)
51 Comparing Algorithms Expressivity: Arc-standard and arc-eager shift-reduce parsing is limited to projective depedendency graphs. Simple extensions can handle a subset of non-projective dependency graphs. Complexity: Space complexity is O(n) for all deterministic parsers (even with simple extensions). Time complexity is O(n) for single-pass parsers, O(n 2 ) for iterative parsers. More complex extensions to handle non-projective dependency graphs will affect time complexity. Introduction to Data-Driven Dependency Parsing 17(29)
52 List-Based Transition Systems List-Based Transition Systems A list-based configuration for a sentence x = w 0,w 1,...,w n is a quadruple c = (λ 1,λ 2,β,A), where 1. λ 1 is a list of tokens i 1 m 1 (for some m 1 n), 2. λ 2 is a list of tokens i 2 m 2 (for some m 2, m 1 < m 2 n), 3. β is a buffer of tokens j > m 2, 4. A is a set of dependency arcs such that G = ({0, 1,...,n), A) is a dependency graph for x. A list-based transition system is a quadruple S = (C,T,c s,c t ), where 1. C is the set of all list-based configurations, 2. c s (x = w 0, w 1,... w n ) = ([0], [ ], [1,...,n], ), 3. T is a set of transitions, each of which is a function t : C C, 4. C t = {c C c = (λ 1, λ 2, [ ], A)}. Notation: λ1 i = list with head i and tail λ 1 ( left-associative) i λ2 = i and tail λ 2 ( right-associative) Introduction to Data-Driven Dependency Parsing 18(29)
53 List-Based Transition Systems Non-Projective Parsing Transitions: Left-Arck : (λ 1 i, λ 2, j β,a) (λ 1,i λ 2,j β, A {(j, i, k)}) Right-Arck : (λ 1 i, λ 2, j β,a) (λ 1,i λ 2,j β, A {(i, j,k)}) No-Arc: (λ 1 i, λ 2, β,a) (λ 1,i λ 2, β, A) Shift: (λ 1, λ 2, i β, A) (λ 1.λ 2 i, [], β,a) Preconditions: Left-Arc: [i = 0] i k [(i, k,i) A] [i j] A Right-Arc: i k [(i, k,j) A] [j i] A Introduction to Data-Driven Dependency Parsing 19(29)
54 List-Based Transition Systems Projective Parsing Transitions: Left-Arck : (λ 1 i, λ 2, j β,a) (λ 1, λ 2,j β, A {(j, i,k)}) Right-Arck : (λ 1 i, λ 2, j β,a) (λ 1 i j, [], β,a {(i, k,j)}) No-Arc: (λ 1 i, λ 2, β,a) (λ 1,i λ 2, β, A) Shift: (λ 1, λ 2, i β, A) (λ 1.λ 2 i, [], β,a) Preconditions: Left-Arc: [i = 0] i k [(i, k,i) A] Right-Arc: i k [(i, k,j) A] No-Arc: i k[(i,k,i) A] Introduction to Data-Driven Dependency Parsing 20(29)
55 List-Based Transition Systems Theoretical Results Complexity: Deterministic list-based parsing has time complexity O(n 2 ) and space complexity O(n), where n is the length of the input sentence. Correctness: For every transition sequence C0,m, G cm is a (projective) dependency forest (soundness). For every (projective) dependency forest G, there is a transition sequence C 0,m such that G cm = G (completeness). Introduction to Data-Driven Dependency Parsing 21(29)
56 Classifier-Based Parsing Classifier-Based Parsing Data-driven deterministic parsing: Deterministic parsing requires an oracle. An oracle can be approximated by a classifier. A classifier can be trained using treebank data. Learning problem: Approximate a function from configurations (represented by feature vectors) to transitions, given a training set of (gold standard) transition sequences. Three issues: How do we represent configurations by feature vectors? How do we derive training data from treebanks? How do we learn classifiers? Introduction to Data-Driven Dependency Parsing 22(29)
57 Classifier-Based Parsing Feature Representations A feature representation f(c) of a configuration c is a vector of simple features f i (c). Typical features are defined in terms of attributes of nodes in the dependency graph. Nodes: Target nodes (top of σ, head of λ 1, λ 2, β) Linear context (neighbors in σ, λ 1, λ 2, or β) Structural context (parents, children, siblings given A) Attributes: Word form (and/or lemma) Part-of-speech (and morpho-syntactic features) Dependency type (if labeled) Distance (between target tokens) Introduction to Data-Driven Dependency Parsing 23(29)
58 Classifier-Based Parsing A Typical Model [Nivre et al. 2006] h j [... w i w j ] σ [ w k w k+1 w k+2 w k+3...] β l j r j l k FORM LEMMA + + CPOS + + POS FEATS + + DEPREL Introduction to Data-Driven Dependency Parsing 24(29)
59 Classifier-Based Parsing Training Data Training instances have the form (f(c),t), where 1. f(c) is a feature representation of a configuration c, 2. t is the correct transition out of c (i.e., o(c) = t). Given a dependency treebank, we can sample the oracle function o as follows: For each sentence x with (gold standard) dependency graph G x, we construct a transition sequence C 0,m = (c 0, c 1,...,c m ) such that 1. c 0 = c s(x), 2. G cm = G x, For each configuration ci (i < m), we construct a training instance (f(c i ), t i ), where t i (c i ) = c i+1. Introduction to Data-Driven Dependency Parsing 25(29)
60 Classifier-Based Parsing Learning Classifiers Learning methods: Support vector machines (SVM) [Kudo and Matsumoto 2002, Yamada and Matsumoto 2003, Isozaki et al. 2004, Cheng et al. 2004, Nivre et al. 2006] Polynomial kernel (d 2) Different techniques for multiclass classification Training efficiency problematic for large data sets Memory-based learning (MBL) [Nivre et al. 2004, Nivre and Scholz 2004, Attardi 2006] k-nn classification Different distance functions Parsing efficiency problematic for large data sets Maximum entropy modeling (MaxEnt) [Cheng et al. 2005, Attardi 2006] Extremely efficient parsing Slightly less accurate Introduction to Data-Driven Dependency Parsing 26(29)
61 Pseudo-Projective Parsing Pseudo-Projective Parsing Technique for non-projective dependency parsing with a data-driven projective parser [Nivre and Nilsson 2005]. Four steps: 1. Projectivize dependency graphs in training data, encoding information about transformations in augmented arc labels. 2. Train projective parser (as usual). 3. Parse new sentences using projective parser (as usual). 4. Deprojectivize output dependency graphs by heuristic transformations guided by augmented arc labels. Introduction to Data-Driven Dependency Parsing 27(29)
62 Pseudo-Projective Parsing Pseudo-Projective Parsing Projectivize training data: Projective head nearest permissible ancestor of real head Arc label extended with dependency type of real head AuxP AuxK Pred AuxP Atr Sb AuxZ Adv root Z nich je jen jedna na kvalitu. (out-of) (them) (is) (only) (one) (to) (quality) Introduction to Data-Driven Dependency Parsing 28(29)
63 Pseudo-Projective Parsing Pseudo-Projective Parsing Projectivize training data: Projective head nearest permissible ancestor of real head Arc label extended with dependency type of real head AuxP AuxK Pred AuxP Sb Atr AuxP Sb AuxZ Adv root Z nich je jen jedna na kvalitu. (out-of) (them) (is) (only) (one) (to) (quality) Introduction to Data-Driven Dependency Parsing 28(29)
64 Pseudo-Projective Parsing Pseudo-Projective Parsing Deprojectivize parser output: Top-down, breadth-first search for real head Search constrained by extended arc label AuxK Pred AuxP Sb Atr AuxP Sb AuxZ Adv root Z nich je jen jedna na kvalitu. (out-of) (them) (is) (only) (one) (to) (quality) Introduction to Data-Driven Dependency Parsing 28(29)
65 Pseudo-Projective Parsing Pseudo-Projective Parsing Deprojectivize parser output: Top-down, breadth-first search for real head Search constrained by extended arc label AuxP AuxK Pred AuxP Sb Atr AuxP Sb AuxZ Adv root Z nich je jen jedna na kvalitu. (out-of) (them) (is) (only) (one) (to) (quality) Introduction to Data-Driven Dependency Parsing 28(29)
66 Summary Summary Transition-based Methods Transition systems Deterministic classifier-based parsing Parsing algorithm Stack-based and list-based transitions systems Classifier-based parsing Pseudo-projective parsing Introduction to Data-Driven Dependency Parsing 29(29)
67 References and Further Reading References and Further Reading Giuseppe Attardi Experiments with a multilanguage non-projective dependency parser. In Proceedings of the 10th Conference on Computational Natural Language Learning (CoNLL), pages Yuchang Cheng, Masayuki Asahara, and Yuji Matsumoto Deterministic dependency structure analyzer for Chinese. In Proceedings of the First International Joint Conference on Natural Language Processing (IJCNLP), pages Yuchang Cheng, Masayuki Asahara, and Yuji Matsumoto Machine learning-based dependency analyzer for Chinese. In Proceedings of International Conference on Chinese Computing (ICCC), pages Hideki Isozaki, Hideto Kazawa, and Tsutomu Hirao A deterministic word dependency analyzer enhanced with preference learning. In Proceedings of the 20th International Conference on Computational Linguistics (COLING), pages Taku Kudo and Yuji Matsumoto Japanese dependency analysis using cascaded chunking. In Proceedings of the Sixth Workshop on Computational Language Learning (CoNLL), pages Joakim Nivre and Jens Nilsson Introduction to Data-Driven Dependency Parsing 29(29)
68 References and Further Reading Pseudo-projective dependency parsing. In Proceedings of the 43rd Annual Meeting of the Association for Computational Linguistics (ACL), pages Joakim Nivre and Mario Scholz Deterministic dependency parsing of English text. In Proceedings of the 20th International Conference on Computational Linguistics (COLING), pages Joakim Nivre, Johan Hall, and Jens Nilsson Memory-based dependency parsing. In Hwee Tou Ng and Ellen Riloff, editors, Proceedings of the 8th Conference on Computational Natural Language Learning (CoNLL), pages Joakim Nivre, Johan Hall, Jens Nilsson, Gülsen Eryiugit, and Svetoslav Marinov Labeled pseudo-projective dependency parsing with support vector machines. In Proceedings of the Tenth Conference on Computational Natural Language Learning (CoNLL), pages Joakim Nivre An efficient algorithm for projective dependency parsing. In Gertjan Van Noord, editor, Proceedings of the 8th International Workshop on Parsing Technologies (IWPT), pages Hiroyasu Yamada and Yuji Matsumoto Introduction to Data-Driven Dependency Parsing 29(29)
69 References and Further Reading Statistical dependency analysis with support vector machines. In Gertjan Van Noord, editor, Proceedings of the 8th International Workshop on Parsing Technologies (IWPT), pages Introduction to Data-Driven Dependency Parsing 29(29)
Transition-Based Dependency Parsing with MaltParser
Transition-Based Dependency Parsing with MaltParser Joakim Nivre Uppsala University and Växjö University Transition-Based Dependency Parsing 1(13) Introduction Outline Goals of the workshop Transition-based
More informationAgenda for today. Homework questions, issues? Non-projective dependencies Spanning tree algorithm for non-projective parsing
Agenda for today Homework questions, issues? Non-projective dependencies Spanning tree algorithm for non-projective parsing 1 Projective vs non-projective dependencies If we extract dependencies from trees,
More informationSorting Out Dependency Parsing
Sorting Out Dependency Parsing Joakim Nivre Uppsala University and Växjö University Sorting Out Dependency Parsing 1(38) Introduction Introduction Syntactic parsing of natural language: Who does what to
More informationDependency Parsing 2 CMSC 723 / LING 723 / INST 725. Marine Carpuat. Fig credits: Joakim Nivre, Dan Jurafsky & James Martin
Dependency Parsing 2 CMSC 723 / LING 723 / INST 725 Marine Carpuat Fig credits: Joakim Nivre, Dan Jurafsky & James Martin Dependency Parsing Formalizing dependency trees Transition-based dependency parsing
More informationSorting Out Dependency Parsing
Sorting Out Dependency Parsing Joakim Nivre Uppsala University and Växjö University Sorting Out Dependency Parsing 1(38) Introduction Introduction Syntactic parsing of natural language: Who does what to
More informationNon-Projective Dependency Parsing in Expected Linear Time
Non-Projective Dependency Parsing in Expected Linear Time Joakim Nivre Uppsala University, Department of Linguistics and Philology, SE-75126 Uppsala Växjö University, School of Mathematics and Systems
More informationTekniker för storskalig parsning: Dependensparsning 2
Tekniker för storskalig parsning: Dependensparsning 2 Joakim Nivre Uppsala Universitet Institutionen för lingvistik och filologi joakim.nivre@lingfil.uu.se Dependensparsning 2 1(45) Data-Driven Dependency
More informationDependency Parsing CMSC 723 / LING 723 / INST 725. Marine Carpuat. Fig credits: Joakim Nivre, Dan Jurafsky & James Martin
Dependency Parsing CMSC 723 / LING 723 / INST 725 Marine Carpuat Fig credits: Joakim Nivre, Dan Jurafsky & James Martin Dependency Parsing Formalizing dependency trees Transition-based dependency parsing
More informationThe Application of Constraint Rules to Data-driven Parsing
The Application of Constraint Rules to Data-driven Parsing Sardar Jaf The University of Manchester jafs@cs.man.ac.uk Allan Ramsay The University of Manchester ramsaya@cs.man.ac.uk Abstract In this paper,
More informationBasic Parsing with Context-Free Grammars. Some slides adapted from Karl Stratos and from Chris Manning
Basic Parsing with Context-Free Grammars Some slides adapted from Karl Stratos and from Chris Manning 1 Announcements HW 2 out Midterm on 10/19 (see website). Sample ques>ons will be provided. Sign up
More informationA Quick Guide to MaltParser Optimization
A Quick Guide to MaltParser Optimization Joakim Nivre Johan Hall 1 Introduction MaltParser is a system for data-driven dependency parsing, which can be used to induce a parsing model from treebank data
More informationCS395T Project 2: Shift-Reduce Parsing
CS395T Project 2: Shift-Reduce Parsing Due date: Tuesday, October 17 at 9:30am In this project you ll implement a shift-reduce parser. First you ll implement a greedy model, then you ll extend that model
More informationDiscriminative Classifiers for Deterministic Dependency Parsing
Discriminative Classifiers for Deterministic Dependency Parsing Johan Hall Växjö University jni@msi.vxu.se Joakim Nivre Växjö University and Uppsala University nivre@msi.vxu.se Jens Nilsson Växjö University
More informationDependency Parsing L545. With thanks to Joakim Nivre and Sandra Kübler. Dependency Parsing 1(70)
Dependency Parsing L545 With thanks to Joakim Nivre and Sandra Kübler Dependency Parsing 1(70) Introduction Dependency Grammar Not a coherent grammatical framework: wide range of different kinds of dependency
More informationImproving Transition-Based Dependency Parsing with Buffer Transitions
Improving Transition-Based Dependency Parsing with Buffer Transitions Daniel Fernández-González Departamento de Informática Universidade de Vigo Campus As Lagoas, 32004 Ourense, Spain danifg@uvigo.es Carlos
More informationTransition-based dependency parsing
Transition-based dependency parsing Syntactic analysis (5LN455) 2014-12-18 Sara Stymne Department of Linguistics and Philology Based on slides from Marco Kuhlmann Overview Arc-factored dependency parsing
More informationAutomatic Discovery of Feature Sets for Dependency Parsing
Automatic Discovery of Feature Sets for Dependency Parsing Peter Nilsson Pierre Nugues Department of Computer Science Lund University peter.nilsson.lund@telia.com Pierre.Nugues@cs.lth.se Abstract This
More informationCS224n: Natural Language Processing with Deep Learning 1 Lecture Notes: Part IV Dependency Parsing 2 Winter 2019
CS224n: Natural Language Processing with Deep Learning 1 Lecture Notes: Part IV Dependency Parsing 2 Winter 2019 1 Course Instructors: Christopher Manning, Richard Socher 2 Authors: Lisa Wang, Juhi Naik,
More informationOnline Graph Planarisation for Synchronous Parsing of Semantic and Syntactic Dependencies
Online Graph Planarisation for Synchronous Parsing of Semantic and Syntactic Dependencies Ivan Titov University of Illinois at Urbana-Champaign James Henderson, Paola Merlo, Gabriele Musillo University
More informationUndirected Dependency Parsing
Computational Intelligence, Volume 59, Number 000, 2010 Undirected Dependency Parsing CARLOS GÓMEZ-RODRÍGUEZ cgomezr@udc.es Depto. de Computación, Universidade da Coruña. Facultad de Informática, Campus
More informationDependency Parsing domain adaptation using transductive SVM
Dependency Parsing domain adaptation using transductive SVM Antonio Valerio Miceli-Barone University of Pisa, Italy / Largo B. Pontecorvo, 3, Pisa, Italy miceli@di.unipi.it Giuseppe Attardi University
More informationA Transition-Based Dependency Parser Using a Dynamic Parsing Strategy
A Transition-Based Dependency Parser Using a Dynamic Parsing Strategy Francesco Sartorio Department of Information Engineering University of Padua, Italy sartorio@dei.unipd.it Giorgio Satta Department
More informationDependency Parsing. Johan Aulin D03 Department of Computer Science Lund University, Sweden
Dependency Parsing Johan Aulin D03 Department of Computer Science Lund University, Sweden d03jau@student.lth.se Carl-Ola Boketoft ID03 Department of Computing Science Umeå University, Sweden calle_boketoft@hotmail.com
More informationTransition-Based Dependency Parsing with Stack Long Short-Term Memory
Transition-Based Dependency Parsing with Stack Long Short-Term Memory Chris Dyer, Miguel Ballesteros, Wang Ling, Austin Matthews, Noah A. Smith Association for Computational Linguistics (ACL), 2015 Presented
More informationRefresher on Dependency Syntax and the Nivre Algorithm
Refresher on Dependency yntax and Nivre Algorithm Richard Johansson 1 Introduction This document gives more details about some important topics that re discussed very quickly during lecture: dependency
More informationAssignment 4 CSE 517: Natural Language Processing
Assignment 4 CSE 517: Natural Language Processing University of Washington Winter 2016 Due: March 2, 2016, 1:30 pm 1 HMMs and PCFGs Here s the definition of a PCFG given in class on 2/17: A finite set
More informationOptimistic Backtracking A Backtracking Overlay for Deterministic Incremental Parsing
Optimistic Backtracking A Backtracking Overlay for Deterministic Incremental Parsing Gisle Ytrestøl Department of Informatics University of Oslo gisley@ifi.uio.no Abstract This paper describes a backtracking
More informationLet s get parsing! Each component processes the Doc object, then passes it on. doc.is_parsed attribute checks whether a Doc object has been parsed
Let s get parsing! SpaCy default model includes tagger, parser and entity recognizer nlp = spacy.load('en ) tells spacy to use "en" with ["tagger", "parser", "ner"] Each component processes the Doc object,
More informationFast(er) Exact Decoding and Global Training for Transition-Based Dependency Parsing via a Minimal Feature Set
Fast(er) Exact Decoding and Global Training for Transition-Based Dependency Parsing via a Minimal Feature Set Tianze Shi* Liang Huang Lillian Lee* * Cornell University Oregon State University O n 3 O n
More informationTransition-based Dependency Parsing with Rich Non-local Features
Transition-based Dependency Parsing with Rich Non-local Features Yue Zhang University of Cambridge Computer Laboratory yue.zhang@cl.cam.ac.uk Joakim Nivre Uppsala University Department of Linguistics and
More informationStatistical Dependency Parsing
Statistical Dependency Parsing The State of the Art Joakim Nivre Uppsala University Department of Linguistics and Philology joakim.nivre@lingfil.uu.se Statistical Dependency Parsing 1(29) Introduction
More informationA Dynamic Confusion Score for Dependency Arc Labels
A Dynamic Confusion Score for Dependency Arc Labels Sambhav Jain and Bhasha Agrawal Language Technologies Research Center IIIT-Hyderabad, India {sambhav.jain, bhasha.agrawal}@research.iiit.ac.in Abstract
More informationHybrid Combination of Constituency and Dependency Trees into an Ensemble Dependency Parser
Hybrid Combination of Constituency and Dependency Trees into an Ensemble Dependency Parser Nathan David Green and Zdeněk Žabokrtský Charles University in Prague Institute of Formal and Applied Linguistics
More informationDependency Parsing. Ganesh Bhosale Neelamadhav G Nilesh Bhosale Pranav Jawale under the guidance of
Dependency Parsing Ganesh Bhosale - 09305034 Neelamadhav G. - 09305045 Nilesh Bhosale - 09305070 Pranav Jawale - 09307606 under the guidance of Prof. Pushpak Bhattacharyya Department of Computer Science
More informationMaltOptimizer: A System for MaltParser Optimization
MaltOptimizer: A System for MaltParser Optimization Miguel Ballesteros Joakim Nivre Universidad Complutense de Madrid, Spain miballes@fdi.ucm.es Uppsala University, Sweden joakim.nivre@lingfil.uu.se Abstract
More informationManaging a Multilingual Treebank Project
Managing a Multilingual Treebank Project Milan Souček Timo Järvinen Adam LaMontagne Lionbridge Finland {milan.soucek,timo.jarvinen,adam.lamontagne}@lionbridge.com Abstract This paper describes the work
More informationTransition-based Parsing with Neural Nets
CS11-747 Neural Networks for NLP Transition-based Parsing with Neural Nets Graham Neubig Site https://phontron.com/class/nn4nlp2017/ Two Types of Linguistic Structure Dependency: focus on relations between
More informationNLP in practice, an example: Semantic Role Labeling
NLP in practice, an example: Semantic Role Labeling Anders Björkelund Lund University, Dept. of Computer Science anders.bjorkelund@cs.lth.se October 15, 2010 Anders Björkelund NLP in practice, an example:
More informationIncremental Integer Linear Programming for Non-projective Dependency Parsing
Incremental Integer Linear Programming for Non-projective Dependency Parsing Sebastian Riedel James Clarke ICCS, University of Edinburgh 22. July 2006 EMNLP 2006 S. Riedel, J. Clarke (ICCS, Edinburgh)
More informationLearning Latent Linguistic Structure to Optimize End Tasks. David A. Smith with Jason Naradowsky and Xiaoye Tiger Wu
Learning Latent Linguistic Structure to Optimize End Tasks David A. Smith with Jason Naradowsky and Xiaoye Tiger Wu 12 October 2012 Learning Latent Linguistic Structure to Optimize End Tasks David A. Smith
More informationOnline Service for Polish Dependency Parsing and Results Visualisation
Online Service for Polish Dependency Parsing and Results Visualisation Alina Wróblewska and Piotr Sikora Institute of Computer Science, Polish Academy of Sciences, Warsaw, Poland alina@ipipan.waw.pl,piotr.sikora@student.uw.edu.pl
More informationBase Noun Phrase Chunking with Support Vector Machines
Base Noun Phrase Chunking with Support Vector Machines Alex Cheng CS674: Natural Language Processing Final Project Report Cornell University, Ithaca, NY ac327@cornell.edu Abstract We apply Support Vector
More informationOnline Learning of Approximate Dependency Parsing Algorithms
Online Learning of Approximate Dependency Parsing Algorithms Ryan McDonald Fernando Pereira Department of Computer and Information Science University of Pennsylvania Philadelphia, PA 19104 {ryantm,pereira}@cis.upenn.edu
More informationEDAN20 Language Technology Chapter 13: Dependency Parsing
EDAN20 Language Technology http://cs.lth.se/edan20/ Pierre Nugues Lund University Pierre.Nugues@cs.lth.se http://cs.lth.se/pierre_nugues/ September 19, 2016 Pierre Nugues EDAN20 Language Technology http://cs.lth.se/edan20/
More informationHomework 2: Parsing and Machine Learning
Homework 2: Parsing and Machine Learning COMS W4705_001: Natural Language Processing Prof. Kathleen McKeown, Fall 2017 Due: Saturday, October 14th, 2017, 2:00 PM This assignment will consist of tasks in
More informationTransition-Based Parsing of the Chinese Treebank using a Global Discriminative Model
Transition-Based Parsing of the Chinese Treebank using a Global Discriminative Model Yue Zhang Oxford University Computing Laboratory yue.zhang@comlab.ox.ac.uk Stephen Clark Cambridge University Computer
More informationSupplementary A. Built-in transition systems
L. Aufrant, G. Wisniewski PanParser (Supplementary) Supplementary A. Built-in transition systems In the following, we document all transition systems built in PanParser, along with their cost. s and s
More informationDependency Parsing with Undirected Graphs
Dependency Parsing with Undirected Graphs Carlos Gómez-Rodríguez Departamento de Computación Universidade da Coruña Campus de Elviña, 15071 A Coruña, Spain carlos.gomez@udc.es Daniel Fernández-González
More informationarxiv: v1 [cs.cl] 25 Apr 2017
Joint POS Tagging and Dependency Parsing with Transition-based Neural Networks Liner Yang 1, Meishan Zhang 2, Yang Liu 1, Nan Yu 2, Maosong Sun 1, Guohong Fu 2 1 State Key Laboratory of Intelligent Technology
More informationDensity-Driven Cross-Lingual Transfer of Dependency Parsers
Density-Driven Cross-Lingual Transfer of Dependency Parsers Mohammad Sadegh Rasooli Michael Collins rasooli@cs.columbia.edu Presented by Owen Rambow EMNLP 2015 Motivation Availability of treebanks Accurate
More informationAn Integrated Digital Tool for Accessing Language Resources
An Integrated Digital Tool for Accessing Language Resources Anil Kumar Singh, Bharat Ram Ambati Langauge Technologies Research Centre, International Institute of Information Technology Hyderabad, India
More informationDynamic Programming Algorithms for Transition-Based Dependency Parsers
Dynamic Programming Algorithms for Transition-Based Dependency Parsers Marco Kuhlmann Dept. of Linguistics and Philology Uppsala University, Sweden marco.kuhlmann@lingfil.uu.se Carlos Gómez-Rodríguez Departamento
More informationStatistical parsing. Fei Xia Feb 27, 2009 CSE 590A
Statistical parsing Fei Xia Feb 27, 2009 CSE 590A Statistical parsing History-based models (1995-2000) Recent development (2000-present): Supervised learning: reranking and label splitting Semi-supervised
More informationSpanning Tree Methods for Discriminative Training of Dependency Parsers
University of Pennsylvania ScholarlyCommons Technical Reports (CIS) Department of Computer & Information Science January 2006 Spanning Tree Methods for Discriminative Training of Dependency Parsers Ryan
More informationGraph-Based Parsing. Miguel Ballesteros. Algorithms for NLP Course. 7-11
Graph-Based Parsing Miguel Ballesteros Algorithms for NLP Course. 7-11 By using some Joakim Nivre's materials from Uppsala University and Jason Eisner's material from Johns Hopkins University. Outline
More informationsplitsvm: Fast, Space-Efficient, non-heuristic, Polynomial Kernel Computation for NLP Applications
splitsvm: Fast, Space-Efficient, non-heuristic, Polynomial Kernel Computation for NLP Applications Yoav Goldberg Michael Elhadad ACL 2008, Columbus, Ohio Introduction Support Vector Machines SVMs are supervised
More informationSyntax Analysis Part I
Syntax Analysis Part I Chapter 4: Context-Free Grammars Slides adapted from : Robert van Engelen, Florida State University Position of a Parser in the Compiler Model Source Program Lexical Analyzer Token,
More informationUtilizing Dependency Language Models for Graph-based Dependency Parsing Models
Utilizing Dependency Language Models for Graph-based Dependency Parsing Models Wenliang Chen, Min Zhang, and Haizhou Li Human Language Technology, Institute for Infocomm Research, Singapore {wechen, mzhang,
More informationEasy-First POS Tagging and Dependency Parsing with Beam Search
Easy-First POS Tagging and Dependency Parsing with Beam Search Ji Ma JingboZhu Tong Xiao Nan Yang Natrual Language Processing Lab., Northeastern University, Shenyang, China MOE-MS Key Lab of MCC, University
More informationDependency grammar and dependency parsing
Dependency grammar and dependency parsing Syntactic analysis (5LN455) 2016-12-05 Sara Stymne Department of Linguistics and Philology Based on slides from Marco Kuhlmann Activities - dependency parsing
More informationDynamic Feature Selection for Dependency Parsing
Dynamic Feature Selection for Dependency Parsing He He, Hal Daumé III and Jason Eisner EMNLP 2013, Seattle Structured Prediction in NLP Part-of-Speech Tagging Parsing N N V Det N Fruit flies like a banana
More informationAn Empirical Study of Semi-supervised Structured Conditional Models for Dependency Parsing
An Empirical Study of Semi-supervised Structured Conditional Models for Dependency Parsing Jun Suzuki, Hideki Isozaki NTT CS Lab., NTT Corp. Kyoto, 619-0237, Japan jun@cslab.kecl.ntt.co.jp isozaki@cslab.kecl.ntt.co.jp
More informationExploring Automatic Feature Selection for Transition-Based Dependency Parsing
Procesamiento del Lenguaje Natural, Revista nº 51, septiembre de 2013, pp 119-126 recibido 18-04-2013 revisado 16-06-2013 aceptado 21-06-2013 Exploring Automatic Feature Selection for Transition-Based
More informationVoting between Multiple Data Representations for Text Chunking
Voting between Multiple Data Representations for Text Chunking Hong Shen and Anoop Sarkar School of Computing Science Simon Fraser University Burnaby, BC V5A 1S6, Canada {hshen,anoop}@cs.sfu.ca Abstract.
More informationLing/CSE 472: Introduction to Computational Linguistics. 5/4/17 Parsing
Ling/CSE 472: Introduction to Computational Linguistics 5/4/17 Parsing Reminders Revised project plan due tomorrow Assignment 4 is available Overview Syntax v. parsing Earley CKY (briefly) Chart parsing
More informationParsing partially bracketed input
Parsing partially bracketed input Martijn Wieling, Mark-Jan Nederhof and Gertjan van Noord Humanities Computing, University of Groningen Abstract A method is proposed to convert a Context Free Grammar
More informationChunking with Support Vector Machines
Chunking with Support Vector Machines Taku Kudo and Yuji Matsumoto Graduate School of Information Science, Nara Institute of Science and Technology {taku-ku,matsu}@is.aist-nara.ac.jp Abstract We apply
More informationNon-Projective Dependency Parsing with Non-Local Transitions
Non-Projective Dependency Parsing with Non-Local Transitions Daniel Fernández-González and Carlos Gómez-Rodríguez Universidade da Coruña FASTPARSE Lab, LyS Research Group, Departamento de Computación Campus
More informationDependency grammar and dependency parsing
Dependency grammar and dependency parsing Syntactic analysis (5LN455) 2014-12-10 Sara Stymne Department of Linguistics and Philology Based on slides from Marco Kuhlmann Mid-course evaluation Mostly positive
More informationDependency grammar and dependency parsing
Dependency grammar and dependency parsing Syntactic analysis (5LN455) 2015-12-09 Sara Stymne Department of Linguistics and Philology Based on slides from Marco Kuhlmann Activities - dependency parsing
More informationA Transition-based Algorithm for AMR Parsing
A Transition-based Algorithm for AMR Parsing Chuan Wang Brandeis University cwang24@brandeis.edu Nianwen Xue Brandeis University xuen@brandeis.edu Sameer Pradhan Harvard Medical School Sameer.Pradhan@
More informationIncremental Integer Linear Programming for Non-projective Dependency Parsing
Incremental Integer Linear Programming for Non-projective Dependency Parsing Sebastian Riedel and James Clarke School of Informatics, University of Edinburgh 2 Bucclecuch Place, Edinburgh EH8 9LW, UK s.r.riedel@sms.ed.ac.uk,
More informationText Classification and Clustering Using Kernels for Structured Data
Text Mining SVM Conclusion Text Classification and Clustering Using, pgeibel@uos.de DGFS Institut für Kognitionswissenschaft Universität Osnabrück February 2005 Outline Text Mining SVM Conclusion 1 Text
More informationA Deductive Approach to Dependency Parsing
A Deductive Approach to Dependency Parsing Carlos Gómez-Rodríguez Departamento de Computación Universidade da Coruña, Spain cgomezr@udc.es John Carroll and David Weir Department of Informatics University
More informationTrees : Part 1. Section 4.1. Theory and Terminology. A Tree? A Tree? Theory and Terminology. Theory and Terminology
Trees : Part Section. () (2) Preorder, Postorder and Levelorder Traversals Definition: A tree is a connected graph with no cycles Consequences: Between any two vertices, there is exactly one unique path
More informationGraphs. Part I: Basic algorithms. Laura Toma Algorithms (csci2200), Bowdoin College
Laura Toma Algorithms (csci2200), Bowdoin College Undirected graphs Concepts: connectivity, connected components paths (undirected) cycles Basic problems, given undirected graph G: is G connected how many
More informationA Multiclassifier based Approach for Word Sense Disambiguation using Singular Value Decomposition
A Multiclassifier based Approach for Word Sense Disambiguation using Singular Value Decomposition Ana Zelaia, Olatz Arregi and Basilio Sierra Computer Science Faculty University of the Basque Country ana.zelaia@ehu.es
More informationANC2Go: A Web Application for Customized Corpus Creation
ANC2Go: A Web Application for Customized Corpus Creation Nancy Ide, Keith Suderman, Brian Simms Department of Computer Science, Vassar College Poughkeepsie, New York 12604 USA {ide, suderman, brsimms}@cs.vassar.edu
More informationIntroduction to Lexical Analysis
Introduction to Lexical Analysis Outline Informal sketch of lexical analysis Identifies tokens in input string Issues in lexical analysis Lookahead Ambiguities Specifying lexical analyzers (lexers) Regular
More informationShared Task Introduction
Shared Task Introduction Learning Machine Learning Nils Reiter September 26-27, 2018 Nils Reiter (CRETA) Shared Task Introduction September 26-27, 2018 1 / 28 Outline Shared Tasks Data and Annotations
More informationA Multiclassifier based Approach for Word Sense Disambiguation using Singular Value Decomposition
A Multiclassifier based Approach for Word Sense Disambiguation using Singular Value Decomposition Ana Zelaia, Olatz Arregi and Basilio Sierra Computer Science Faculty University of the Basque Country ana.zelaia@ehu.es
More informationLexicalized Semi-Incremental Dependency Parsing
Lexicalized Semi-Incremental Dependency Parsing Hany Hassan, Khalil Sima an and Andy Way Abstract Even leaving aside concerns of cognitive plausibility, incremental parsing is appealing for applications
More informationNon-projective Dependency Parsing using Spanning Tree Algorithms
Non-projective Dependency Parsing using Spanning Tree Algorithms Ryan McDonald Fernando Pereira Department of Computer and Information Science University of Pennsylvania {ryantm,pereira}@cis.upenn.edu
More informationCompiler Design 1. Bottom-UP Parsing. Goutam Biswas. Lect 6
Compiler Design 1 Bottom-UP Parsing Compiler Design 2 The Process The parse tree is built starting from the leaf nodes labeled by the terminals (tokens). The parser tries to discover appropriate reductions,
More informationSyntactic N-grams as Machine Learning. Features for Natural Language Processing. Marvin Gülzow. Basics. Approach. Results.
s Table of Contents s 1 s 2 3 4 5 6 TL;DR s Introduce n-grams Use them for authorship attribution Compare machine learning approaches s J48 (decision tree) SVM + S work well Section 1 s s Definition n-gram:
More informationAT&T: The Tag&Parse Approach to Semantic Parsing of Robot Spatial Commands
AT&T: The Tag&Parse Approach to Semantic Parsing of Robot Spatial Commands Svetlana Stoyanchev, Hyuckchul Jung, John Chen, Srinivas Bangalore AT&T Labs Research 1 AT&T Way Bedminster NJ 07921 {sveta,hjung,jchen,srini}@research.att.com
More informationGraph Algorithms Using Depth First Search
Graph Algorithms Using Depth First Search Analysis of Algorithms Week 8, Lecture 1 Prepared by John Reif, Ph.D. Distinguished Professor of Computer Science Duke University Graph Algorithms Using Depth
More informationLexicalized Semi-Incremental Dependency Parsing
Lexicalized Semi-Incremental Dependency Parsing Hany Hassan Khalil Sima an Andy Way Cairo TDC Language and Computation School of Computing IBM University of Amsterdam Dublin City University Cairo, Egypt
More informationTesting parsing improvements with combination and translation in Evalita 2014
10.12871/clicit201424 Testing parsing improvements with combination and translation in Evalita 2014 Alessandro Mazzei Dipartimento di Informatica Università degli Studi di Torino Corso Svizzera 185, 10149
More informationExam Marco Kuhlmann. This exam consists of three parts:
TDDE09, 729A27 Natural Language Processing (2017) Exam 2017-03-13 Marco Kuhlmann This exam consists of three parts: 1. Part A consists of 5 items, each worth 3 points. These items test your understanding
More informationUninformed Search Methods. Informed Search Methods. Midterm Exam 3/13/18. Thursday, March 15, 7:30 9:30 p.m. room 125 Ag Hall
Midterm Exam Thursday, March 15, 7:30 9:30 p.m. room 125 Ag Hall Covers topics through Decision Trees and Random Forests (does not include constraint satisfaction) Closed book 8.5 x 11 sheet with notes
More informationOctober 19, 2004 Chapter Parsing
October 19, 2004 Chapter 10.3 10.6 Parsing 1 Overview Review: CFGs, basic top-down parser Dynamic programming Earley algorithm (how it works, how it solves the problems) Finite-state parsing 2 Last time
More informationSection A. A grammar that produces more than one parse tree for some sentences is said to be ambiguous.
Section A 1. What do you meant by parser and its types? A parser for grammar G is a program that takes as input a string w and produces as output either a parse tree for w, if w is a sentence of G, or
More informationSearn in Practice. Hal Daumé III, John Langford and Daniel Marcu
Searn in Practice Hal Daumé III, John Langford and Daniel Marcu me@hal3.name,jl@hunch.net,marcu@isi.edu 1 Introduction We recently introduced an algorithm, Searn, for solving hard structured prediction
More informationHC-search for Incremental Parsing
HC-search for Incremental Parsing Yijia Liu, Wanxiang Che, Bing Qin, Ting Liu Research Center for Social Computing and Information Retrieval Harbin Institute of Technology, China {yjliu,car,qinb,tliu}@ir.hit.edu.cn
More informationLangforia: Language Pipelines for Annotating Large Collections of Documents
Langforia: Language Pipelines for Annotating Large Collections of Documents Marcus Klang Lund University Department of Computer Science Lund, Sweden Marcus.Klang@cs.lth.se Pierre Nugues Lund University
More informationMidterm Examination CS 540-2: Introduction to Artificial Intelligence
Midterm Examination CS 54-2: Introduction to Artificial Intelligence March 9, 217 LAST NAME: FIRST NAME: Problem Score Max Score 1 15 2 17 3 12 4 6 5 12 6 14 7 15 8 9 Total 1 1 of 1 Question 1. [15] State
More informationStructured Learning. Jun Zhu
Structured Learning Jun Zhu Supervised learning Given a set of I.I.D. training samples Learn a prediction function b r a c e Supervised learning (cont d) Many different choices Logistic Regression Maximum
More informationWebAnno: a flexible, web-based annotation tool for CLARIN
WebAnno: a flexible, web-based annotation tool for CLARIN Richard Eckart de Castilho, Chris Biemann, Iryna Gurevych, Seid Muhie Yimam #WebAnno This work is licensed under a Attribution-NonCommercial-ShareAlike
More informationWord Lattice Reranking for Chinese Word Segmentation and Part-of-Speech Tagging
Word Lattice Reranking for Chinese Word Segmentation and Part-of-Speech Tagging Wenbin Jiang Haitao Mi Qun Liu Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy
More information