A Fast Deterministic Parser for Chinese.ppt

A Fast Deterministic Parser for Chinese Mengqiu Wang, Kenji Sagae and Teruko Mitamura Language Technologies Institute School of Computer Science Carnegie Mellon University Outline of the talk Background Deterministic parsing model Classifier and feature selection POS tagging Experiment and results Discussion and future work Conclusion Background Constituency parsing is one of the most fundamental tasks in NLP. State-of-the-art accuracy previously reported in Chinese constituency parsing achieves precision and recall in the lower 80% using automatically generated POS. Most literature in parsing only reports accuracy, efficiency is typically ignored But in reality, parsers are deemed too slow for many NLP applications (e.g. IR, QA, web-based IX) Deterministic Parsing Model Originally developed in [Sagae and Lavie 2005] for English Input Convention in deterministic parsing assumes input sentences (Chinese in our case) are already segmented and POS tagged1. Main Data Structure A queue, to store input word-POS pairs A stack, holds partial parse trees Trees are lexicalized. We used the same head-finding rules as [Bikel 2004] The Parser performs binary Shift-Reduce actions based on classifier decisions. Example … Deterministic Parsing Model Cont. Input sentence: 布朗/NR (Brown/Proper Noun) 访问/VV (Visits/Verb) 上海/NR (Shanghai/Proper Noun) Initial parser state: Stack: Θ Queue: Deterministic Parsing Model Cont. Classifier output 1: Shift Action Parser State: Stack: Queue: Deterministic Parsing Model Cont. Action 2: Reduce the first item on stack to a NP node, with node (NR 布朗) as the head Parser State: Stack: Queue: Deterministic Parsing Model Cont. Action 3: Shift Parser State: Stack: Queue: Deterministic Parsing Model Cont. Action 4: Shift Parser State: Stack: Queue: Θ Deterministic Parsing Model Cont. Action 5: Reduce the top item on stack to a NP node, with node (NR 上海) as the head Parser State: Stack: Queue: