Better Syntactic Parsing with Lexical-Semantic Features from Auto-parsed Data
|
|
- Gyles Lawrence
- 6 years ago
- Views:
Transcription
1 Better Syntactic Parsing with Lexical-Semantic Features from Auto-parsed Data Yoav Goldberg (actual work by Eliyahu Kiperwasser) ICRI-CI Retreat, May 2015
2 Language
3 Language People use language to communicate
4 Language People use language to communicate Language is Everywhere
5 Language People use language to communicate Language is Everywhere Conversations Newspapers Scientific articles Medicine (patient records) Patents Law Product reviews Blogs Facebook, Twitter...
6 A lot of text. Need to understand what s being said. this is where we come in.
7 NLP text meaning
8 NLP text meaning What does it mean to understand?
9 NLP text meaning What does it mean to understand? I focus on the building blocks
10 This talk is about syntactic parsing
11 Syntactic Parsing Sentences in natural language have structure
12 Syntactic Parsing Sentences in natural language have structure Linguists create theories defining these structures
13 Syntactic Parsing Sentences in natural language have structure Linguists create theories defining these structures the mainstream theory can be quite convoluted
14 Syntactic Parsing Sentences in natural language have structure Linguists create theories defining these structures the mainstream theory can be quite convoluted countless debates regarding many corner cases
15 Syntactic Parsing Sentences in natural language have structure Linguists create theories defining these structures the mainstream theory can be quite convoluted countless debates regarding many corner cases most linguists agree on the basics ( the boring stuff )
16 Syntactic Parsing Sentences in natural language have structure Linguists create theories defining these structures the mainstream theory can be quite convoluted countless debates regarding many corner cases most linguists agree on the basics ( the boring stuff ) the boring stuff is actually very useful
17 This talk - Dependency Structures A syntactic representation in which Every word is a node in a tree A Single ROOT node No non-word nodes other than root
18 Syntactic Parsing The soup, which I expected to be good, was bad
19 Syntactic Parsing subj root rcmod rel xcomp det subj aux acomp acomp The soup, which I expected to be good, was bad
20 Syntactic Parsing subj root rcmod rel xcomp det subj aux acomp acomp The soup, which I expected to be good, was bad
21 Syntactic Parsing The gromp, which I furpled to be drogby, was spujky
22 Syntactic Parsing subj root rcmod rel xcomp det subj aux acomp acomp The gromp, which I furpled to be drogby, was spujky
23
24 Can go a long way without the words based on structural cues.
25 Syntactic Parsing But sometimes words do matter
26 Syntactic Parsing But sometimes words do matter compare: I ate pizza with olives
27 Syntactic Parsing But sometimes words do matter compare: I ate pizza with olives I ate pizza with friends correct analysis depends on words
28 Parers are created using machine learning. Based on a training set of (sentence,trees) pairs. In English, we have 40, 000 such pairs.
29 Parers are created using machine learning. Based on a training set of (sentence,trees) pairs. In English, we have 40, 000 such pairs. Too small to learn word-word interactions.
30 Parers are created using machine learning. Based on a training set of (sentence,trees) pairs. In English, we have 40, 000 such pairs. Too small to learn word-word interactions. Semi-supervised learning Unannotated data is cheap. Use a lot of unannotated data to improve lexical coverage.
31 This talk Improve parsing accuracy using a lot of unannotated text
32 Prior Semi-supervised parsing State-of-the-art Simple Semi-supervised Dependency Parsing (Koo et al, 2008) Take a large amount of unannotated text. Use a word clustering algorithm to learn word clusters. Now each word is associated with a cluster. Use clusters identities as additional features in a supervised parser.
33 Prior Semi-supervised parsing State-of-the-art Simple Semi-supervised Dependency Parsing (Koo et al, 2008) Take a large amount of unannotated text. Use a word clustering algorithm to learn word clusters. Now each word is associated with a cluster. Use clusters identities as additional features in a supervised parser. When using the Brown clustering algorithm
34 Prior Semi-supervised parsing State-of-the-art Simple Semi-supervised Dependency Parsing (Koo et al, 2008) Take a large amount of unannotated text. Use a word clustering algorithm to learn word clusters. Now each word is associated with a cluster. Use clusters identities as additional features in a supervised parser. When using the Brown clustering algorithm With a good set of cluster-based features
35 Prior Semi-supervised parsing State-of-the-art Simple Semi-supervised Dependency Parsing (Koo et al, 2008) Take a large amount of unannotated text. Use a word clustering algorithm to learn word clusters. Now each word is associated with a cluster. Use clusters identities as additional features in a supervised parser. When using the Brown clustering algorithm With a good set of cluster-based features This produces state-of-the-art results
36 Note: the clustering metric is not related to the parsing task. We take a different approach
37 Auto-Parsed Data Parsed Data
38 Auto-Parsed Data Parsed Data Train Model
39 Auto-Parsed Data Parsed Data Train Model Predict Test Set Annotations Predict Auto-Parsed Data
40 Auto-Parsed Data Parsed Data Train Model Predict Test Set Annotations Predict Auto-Parsed Features Extract Features Auto-Parsed Data
41 Auto-Parsed Data Parsed Data Train Model Predict Test Set Annotations Train Predict Auto-Parsed Features Extract Features Auto-Parsed Data
42 Graph-based Parsing parse(sent) = score(sent, tree) = part tree argmax score(sent, tree) tree Trees(sent) w φ(sent, part)
43 Graph-based Parsing parse(sent) = score(sent, tree) = part tree argmax score(sent, tree) tree Trees(sent) w φ(sent, part) + (h,m) tree assoc(h, m) we add a term for each head-modifier word pair in the tree
44 Auto-Parsed Features m... h the black fox... will jump over DET ADJ NN AUX VERB PREP
45 Auto-Parsed Features m... h the black fox... will jump over DET ADJ NN AUX VERB PREP assoc(h, m) = w φ lex (h, m)
46 Auto-Parsed Features m... h the black fox... will jump over DET ADJ NN AUX VERB PREP assoc(h, m) = w φ lex (h, m) Features in φ lex (h, m) bin(s(h, m)) bin(s(h, m)) dist(h,m) bin(s(h, m)) pos(h) pos(m) bin(s(h, m)) pos(h) pos(m) dist(h,m) The term S(h,m) measures how well h and m fit together.
47 Auto-Parsed Features S(h,m) example (officer, chief) (well, as) (year, last) (ate, pizza) (dog, the) (ate, dog) (dog, thirsty)... (dog, professional) (dog, ate) (USD, 1999)
48 Estimating S(h,m)
49 Estimating S(h,m) Method 1: Rank Percentile Let D be a list of (h,m) pairs, sorted according to their frequency. Let R(h, m) be the index of (h,m) in the list. S Rank (h, m) = R(h, m) D
50 Estimating S(h,m) Method 1: Rank Percentile Let D be a list of (h,m) pairs, sorted according to their frequency. Let R(h, m) be the index of (h,m) in the list. S Rank (h, m) = R(h, m) D Cons Need to store all observed pairs. Does not generalize to new pairs. Is this really a good metric?
51 Estimating S(h,m) Method 2: word-vectors Log-bilinear embedding model: ln (σ (v m v h )) m,h D m D m h D h ln (σ (v m v h )) (this is the negative-sampling model from word2vec (Mikolov et al 2013) ) Represent each head-word h and modifier word m as a vector. Dot-products of compatible pairs receive high scores. Dot-products of bad pairs receive low scores.
52 Estimating S(h,m) Method 2: word-vectors Log-bilinear embedding model: ln (σ (v m v h )) m,h D m D m h D h ln (σ (v m v h )) (this is the negative-sampling model from word2vec (Mikolov et al 2013) ) Represent each head-word h and modifier word m as a vector. Dot-products of compatible pairs receive high scores. Dot-products of bad pairs receive low scores. S Vec (h, m) = σ(v h v m )
53 Estimating S(h,m) Method 3: sigmoid-pmi Levy and Goldberg (2014) show that the optimal solution for the negative-sampling embedding model of Mikolov et al is achieved when: v h v m = PMI (h, m) Use this as our metric.
54 Estimating S(h,m) Method 3: sigmoid-pmi Levy and Goldberg (2014) show that the optimal solution for the negative-sampling embedding model of Mikolov et al is achieved when: v h v m = PMI (h, m) Use this as our metric. S PMI (h, m) = σ(pmi (h, m)) = p(h, m) p(h, m) + p(h)p(m)
55 Results (1) Dev Test Baseline Base + HM(S Rank ) Base + HM(S Vec ) Base + HM(S PMI )
56 Results (1) Dev Test Baseline Base + HM(S Rank ) Base + HM(S Vec ) Base + HM(S PMI ) Base + Brown
57 Results (1) Dev Test Baseline Base + HM(S Rank ) Base + HM(S Vec ) Base + HM(S PMI ) Base + Brown Base + Brown + HM(S PMI )
58 We can do better use more context
59 Auto-Parsed Features (Context) Instead of word pairs, we look at relations between word-triplets m 1 m 0 m h 1 h 0 h +1 the black fox... will jump over
60 Auto-Parsed Features (Context) Instead of word pairs, we look at relations between word-triplets m 1 m 0 m h 1 h 0 h +1 the black fox... will jump over Problem: Gather reliable statistics over pairs of trigrams requires an enormous annotated corpus.
61 Auto-Parsed Features (Context) Instead of word pairs, we look at relations between word-triplets m 1 m 0 m h 1 h 0 h +1 the black fox... will jump over Problem: Gather reliable statistics over pairs of trigrams requires an enormous annotated corpus. Solution: Decompose the structure into smaller parts
62 Decomposition Idea from vector-space models Represent each (word,position) pair as a vector: v h0, v h1, v h 1, v m0, v m1, v m 1
63 Decomposition Idea from vector-space models Represent each (word,position) pair as a vector: v h0, v h1, v h 1, v m0, v m1, v m 1 Model a triplet as a sum: (v h 1 + v h0 + v h1 ) (v m 1 + v m0 + v m1 )
64 Decomposition Idea from vector-space models Represent each (word,position) pair as a vector: v h0, v h1, v h 1, v m0, v m1, v m 1 Model a triplet as a sum: (v h 1 + v h0 + v h1 ) (v m 1 + v m0 + v m1 ) Expanding the terms, we get: assoc(h 1 h 0 h +1, m 1 m 0 m +1 ) = 1 1 α ij assoc ij (h i, m j ) i= 1 j= 1
65 Auto-Parsed Features (Context) m 1 m 0 m h 1 h 0 h +1 the black fox... will jump over assoc(h 1 h 0 h +1, m 1 m 0 m +1 ) = α 1, 1 assoc 1, 1 (the, will) + α 1,0 assoc 1,0 (the, jump) + α 1,1 assoc 1,1 (the, over)+ α 0, 1assoc 0, 1 (black, will) + α 0,0 assoc 0,0 (black, jump) + α 0,1 assoc 0,1 (black, over)+ α 1, 1 assoc 1, 1 (fox, will) + α 1,0 assoc 1,0 (fox, jump) + α 1,1 assoc 1,1 (fox, over)
66 assoc ij (h, m) = w ij φ ij lex (h, m)
67 assoc ij (h, m) = w ij φ ij lex (h, m) Features in φ ij lex (h, m) bin(s ij (h, m)) bin(s ij (h, m)) dist(h,m) bin(s ij (h, m)) pos(h) pos(m) bin(s ij (h, m)) pos(h) pos(m) dist(h,m) The terms S ij (h, m) are estimated like before.
68 Results (2) Dev Test Baseline Base + HM(S Rank ) Base + HM(S Vec ) Base + HM(S PMI ) Base + Brown Base + Brown + HM(S PMI )
69 Results (2) Dev Test Baseline Base + HM(S Rank ) Base + HM(S Vec ) Base + HM(S PMI ) Base + Brown Base + Brown + HM(S PMI ) Base + TRIP(S Rank )
70 Results (2) Dev Test Baseline Base + HM(S Rank ) Base + HM(S Vec ) Base + HM(S PMI ) Base + Brown Base + Brown + HM(S PMI ) Base + TRIP(S Rank ) Base + TRIP(S Vec ) Base + TRIP(S PMI )
71 Results (2) Dev Test Baseline Base + HM(S Rank ) Base + HM(S Vec ) Base + HM(S PMI ) Base + Brown Base + Brown + HM(S PMI ) Base + TRIP(S Rank ) Base + TRIP(S Vec ) Base + TRIP(S PMI ) Base + Brown + TRIP(S PMI )
72 Results (2) Dev Test Baseline Base + HM(S Rank ) Base + HM(S Vec ) Base + HM(S PMI ) Base + Brown Base + Brown + HM(S PMI ) Base + TRIP(S Rank ) Base + TRIP(S Vec ) Base + TRIP(S PMI ) Base + Brown + TRIP(S PMI ) Large improvement in accuracy First method to improve over brown-clusters State-of-the-art results for first order model
73 To summarize Semi-supervised dependency parsing Features from auto-parsed data Modeling interaction between word triplets
74 To summarize Semi-supervised dependency parsing Features from auto-parsed data Modeling interaction between word triplets Ideas inspired by word-embeddings... but explicit counts work better for us
75 To summarize Semi-supervised dependency parsing Features from auto-parsed data Modeling interaction between word triplets Ideas inspired by word-embeddings... but explicit counts work better for us State of the art results First method to improve over brown-clusters
76 Thank You
Enhancing Unlexicalized Parsing Performance using a Wide Coverage Lexicon, Fuzzy Tag-set Mapping, and EM-HMM-based Lexical Probabilities
Enhancing Unlexicalized Parsing Performance using a Wide Coverage Lexicon, Fuzzy Tag-set Mapping, and EM-HMM-based Lexical Probabilities Yoav Goldberg Reut Tsarfaty Meni Adler Michael Elhadad Ben Gurion
More informationBasic Parsing with Context-Free Grammars. Some slides adapted from Julia Hirschberg and Dan Jurafsky 1
Basic Parsing with Context-Free Grammars Some slides adapted from Julia Hirschberg and Dan Jurafsky 1 Announcements HW 2 to go out today. Next Tuesday most important for background to assignment Sign up
More informationA Graph Based Authorship Identification Approach
A Graph Based Authorship Identification Approach Notebook for PAN at CLEF 2015 Helena Gómez-Adorno 1, Grigori Sidorov 1, David Pinto 2, and Ilia Markov 1 1 Center for Computing Research, Instituto Politécnico
More informationCS 598 Natural Language Processing
CS 598 Natural Language Processing Natural language is everywhere Natural language is everywhere Natural language is everywhere Natural language is everywhere!"#$%&'&()*+,-./012 34*5665756638/9:;< =>?@ABCDEFGHIJ5KL@
More informationSyntax Parsing 1. Grammars and parsing 2. Top-down and bottom-up parsing 3. Chart parsers 4. Bottom-up chart parsing 5. The Earley Algorithm
Syntax Parsing 1. Grammars and parsing 2. Top-down and bottom-up parsing 3. Chart parsers 4. Bottom-up chart parsing 5. The Earley Algorithm syntax: from the Greek syntaxis, meaning setting out together
More informationLanguage Acquisition Fall 2010/Winter Lexical Categories. Afra Alishahi, Heiner Drenhaus
Language Acquisition Fall 2010/Winter 2011 Lexical Categories Afra Alishahi, Heiner Drenhaus Computational Linguistics and Phonetics Saarland University Children s Sensitivity to Lexical Categories Look,
More information11/29/2010. Statistical Parsing. Statistical Parsing. Simple PCFG for ATIS English. Syntactic Disambiguation
tatistical Parsing (Following slides are modified from Prof. Raymond Mooney s slides.) tatistical Parsing tatistical parsing uses a probabilistic model of syntax in order to assign probabilities to each
More informationPrediction of Maximal Projection for Semantic Role Labeling
Prediction of Maximal Projection for Semantic Role Labeling Weiwei Sun, Zhifang Sui Institute of Computational Linguistics Peking University Beijing, 100871, China {ws, szf}@pku.edu.cn Haifeng Wang Toshiba
More information(Sub)Gradient Descent
(Sub)Gradient Descent CMSC 422 MARINE CARPUAT marine@cs.umd.edu Figures credit: Piyush Rai Logistics Midterm is on Thursday 3/24 during class time closed book/internet/etc, one page of notes. will include
More informationBeyond the Pipeline: Discrete Optimization in NLP
Beyond the Pipeline: Discrete Optimization in NLP Tomasz Marciniak and Michael Strube EML Research ggmbh Schloss-Wolfsbrunnenweg 33 69118 Heidelberg, Germany http://www.eml-research.de/nlp Abstract We
More informationA deep architecture for non-projective dependency parsing
Universidade de São Paulo Biblioteca Digital da Produção Intelectual - BDPI Departamento de Ciências de Computação - ICMC/SCC Comunicações em Eventos - ICMC/SCC 2015-06 A deep architecture for non-projective
More informationModeling Attachment Decisions with a Probabilistic Parser: The Case of Head Final Structures
Modeling Attachment Decisions with a Probabilistic Parser: The Case of Head Final Structures Ulrike Baldewein (ulrike@coli.uni-sb.de) Computational Psycholinguistics, Saarland University D-66041 Saarbrücken,
More informationPOS tagging of Chinese Buddhist texts using Recurrent Neural Networks
POS tagging of Chinese Buddhist texts using Recurrent Neural Networks Longlu Qin Department of East Asian Languages and Cultures longlu@stanford.edu Abstract Chinese POS tagging, as one of the most important
More informationEnsemble Technique Utilization for Indonesian Dependency Parser
Ensemble Technique Utilization for Indonesian Dependency Parser Arief Rahman Institut Teknologi Bandung Indonesia 23516008@std.stei.itb.ac.id Ayu Purwarianti Institut Teknologi Bandung Indonesia ayu@stei.itb.ac.id
More informationLearning Methods in Multilingual Speech Recognition
Learning Methods in Multilingual Speech Recognition Hui Lin Department of Electrical Engineering University of Washington Seattle, WA 98125 linhui@u.washington.edu Li Deng, Jasha Droppo, Dong Yu, and Alex
More informationCS Machine Learning
CS 478 - Machine Learning Projects Data Representation Basic testing and evaluation schemes CS 478 Data and Testing 1 Programming Issues l Program in any platform you want l Realize that you will be doing
More informationParsing of part-of-speech tagged Assamese Texts
IJCSI International Journal of Computer Science Issues, Vol. 6, No. 1, 2009 ISSN (Online): 1694-0784 ISSN (Print): 1694-0814 28 Parsing of part-of-speech tagged Assamese Texts Mirzanur Rahman 1, Sufal
More informationSemantic Inference at the Lexical-Syntactic Level for Textual Entailment Recognition
Semantic Inference at the Lexical-Syntactic Level for Textual Entailment Recognition Roy Bar-Haim,Ido Dagan, Iddo Greental, Idan Szpektor and Moshe Friedman Computer Science Department, Bar-Ilan University,
More informationLearning Structural Correspondences Across Different Linguistic Domains with Synchronous Neural Language Models
Learning Structural Correspondences Across Different Linguistic Domains with Synchronous Neural Language Models Stephan Gouws and GJ van Rooyen MIH Medialab, Stellenbosch University SOUTH AFRICA {stephan,gvrooyen}@ml.sun.ac.za
More informationGraph Alignment for Semi-Supervised Semantic Role Labeling
Graph Alignment for Semi-Supervised Semantic Role Labeling Hagen Fürstenau Dept. of Computational Linguistics Saarland University Saarbrücken, Germany hagenf@coli.uni-saarland.de Mirella Lapata School
More information2/15/13. POS Tagging Problem. Part-of-Speech Tagging. Example English Part-of-Speech Tagsets. More Details of the Problem. Typical Problem Cases
POS Tagging Problem Part-of-Speech Tagging L545 Spring 203 Given a sentence W Wn and a tagset of lexical categories, find the most likely tag T..Tn for each word in the sentence Example Secretariat/P is/vbz
More informationAQUA: An Ontology-Driven Question Answering System
AQUA: An Ontology-Driven Question Answering System Maria Vargas-Vera, Enrico Motta and John Domingue Knowledge Media Institute (KMI) The Open University, Walton Hall, Milton Keynes, MK7 6AA, United Kingdom.
More informationMultilingual Sentiment and Subjectivity Analysis
Multilingual Sentiment and Subjectivity Analysis Carmen Banea and Rada Mihalcea Department of Computer Science University of North Texas rada@cs.unt.edu, carmen.banea@gmail.com Janyce Wiebe Department
More informationThe Smart/Empire TIPSTER IR System
The Smart/Empire TIPSTER IR System Chris Buckley, Janet Walz Sabir Research, Gaithersburg, MD chrisb,walz@sabir.com Claire Cardie, Scott Mardis, Mandar Mitra, David Pierce, Kiri Wagstaff Department of
More informationA Comparison of Two Text Representations for Sentiment Analysis
010 International Conference on Computer Application and System Modeling (ICCASM 010) A Comparison of Two Text Representations for Sentiment Analysis Jianxiong Wang School of Computer Science & Educational
More informationLTAG-spinal and the Treebank
LTAG-spinal and the Treebank a new resource for incremental, dependency and semantic parsing Libin Shen (lshen@bbn.com) BBN Technologies, 10 Moulton Street, Cambridge, MA 02138, USA Lucas Champollion (champoll@ling.upenn.edu)
More informationTowards a Machine-Learning Architecture for Lexical Functional Grammar Parsing. Grzegorz Chrupa la
Towards a Machine-Learning Architecture for Lexical Functional Grammar Parsing Grzegorz Chrupa la A dissertation submitted in fulfilment of the requirements for the award of Doctor of Philosophy (Ph.D.)
More informationSemi-supervised methods of text processing, and an application to medical concept extraction. Yacine Jernite Text-as-Data series September 17.
Semi-supervised methods of text processing, and an application to medical concept extraction Yacine Jernite Text-as-Data series September 17. 2015 What do we want from text? 1. Extract information 2. Link
More informationProbabilistic Latent Semantic Analysis
Probabilistic Latent Semantic Analysis Thomas Hofmann Presentation by Ioannis Pavlopoulos & Andreas Damianou for the course of Data Mining & Exploration 1 Outline Latent Semantic Analysis o Need o Overview
More informationLinking Task: Identifying authors and book titles in verbose queries
Linking Task: Identifying authors and book titles in verbose queries Anaïs Ollagnier, Sébastien Fournier, and Patrice Bellot Aix-Marseille University, CNRS, ENSAM, University of Toulon, LSIS UMR 7296,
More informationMulti-Lingual Text Leveling
Multi-Lingual Text Leveling Salim Roukos, Jerome Quin, and Todd Ward IBM T. J. Watson Research Center, Yorktown Heights, NY 10598 {roukos,jlquinn,tward}@us.ibm.com Abstract. Determining the language proficiency
More informationThe stages of event extraction
The stages of event extraction David Ahn Intelligent Systems Lab Amsterdam University of Amsterdam ahn@science.uva.nl Abstract Event detection and recognition is a complex task consisting of multiple sub-tasks
More informationGrammars & Parsing, Part 1:
Grammars & Parsing, Part 1: Rules, representations, and transformations- oh my! Sentence VP The teacher Verb gave the lecture 2015-02-12 CS 562/662: Natural Language Processing Game plan for today: Review
More informationUNIVERSITY OF OSLO Department of Informatics. Dialog Act Recognition using Dependency Features. Master s thesis. Sindre Wetjen
UNIVERSITY OF OSLO Department of Informatics Dialog Act Recognition using Dependency Features Master s thesis Sindre Wetjen November 15, 2013 Acknowledgments First I want to thank my supervisors Lilja
More informationUsing dialogue context to improve parsing performance in dialogue systems
Using dialogue context to improve parsing performance in dialogue systems Ivan Meza-Ruiz and Oliver Lemon School of Informatics, Edinburgh University 2 Buccleuch Place, Edinburgh I.V.Meza-Ruiz@sms.ed.ac.uk,
More informationDeveloping a TT-MCTAG for German with an RCG-based Parser
Developing a TT-MCTAG for German with an RCG-based Parser Laura Kallmeyer, Timm Lichte, Wolfgang Maier, Yannick Parmentier, Johannes Dellert University of Tübingen, Germany CNRS-LORIA, France LREC 2008,
More informationChinese Language Parsing with Maximum-Entropy-Inspired Parser
Chinese Language Parsing with Maximum-Entropy-Inspired Parser Heng Lian Brown University Abstract The Chinese language has many special characteristics that make parsing difficult. The performance of state-of-the-art
More informationSpecification and Evaluation of Machine Translation Toy Systems - Criteria for laboratory assignments
Specification and Evaluation of Machine Translation Toy Systems - Criteria for laboratory assignments Cristina Vertan, Walther v. Hahn University of Hamburg, Natural Language Systems Division Hamburg,
More informationBuilding a Semantic Role Labelling System for Vietnamese
Building a emantic Role Labelling ystem for Vietnamese Thai-Hoang Pham FPT University hoangpt@fpt.edu.vn Xuan-Khoai Pham FPT University khoaipxse02933@fpt.edu.vn Phuong Le-Hong Hanoi University of cience
More informationThe Role of Semantic and Discourse Information in Learning the Structure of Surgical Procedures
2015 International Conference on Healthcare Informatics The Role of Semantic and Discourse Information in Learning the Structure of Surgical Procedures Ramon Maldonado, Travis Goodwin and Sanda M. Harabagiu
More informationChunk Parsing for Base Noun Phrases using Regular Expressions. Let s first let the variable s0 be the sentence tree of the first sentence.
NLP Lab Session Week 8 October 15, 2014 Noun Phrase Chunking and WordNet in NLTK Getting Started In this lab session, we will work together through a series of small examples using the IDLE window and
More informationarxiv: v1 [cs.cl] 2 Apr 2017
Word-Alignment-Based Segment-Level Machine Translation Evaluation using Word Embeddings Junki Matsuo and Mamoru Komachi Graduate School of System Design, Tokyo Metropolitan University, Japan matsuo-junki@ed.tmu.ac.jp,
More informationarxiv: v1 [cs.cv] 10 May 2017
Inferring and Executing Programs for Visual Reasoning Justin Johnson 1 Bharath Hariharan 2 Laurens van der Maaten 2 Judy Hoffman 1 Li Fei-Fei 1 C. Lawrence Zitnick 2 Ross Girshick 2 1 Stanford University
More informationCROSS-LANGUAGE INFORMATION RETRIEVAL USING PARAFAC2
1 CROSS-LANGUAGE INFORMATION RETRIEVAL USING PARAFAC2 Peter A. Chew, Brett W. Bader, Ahmed Abdelali Proceedings of the 13 th SIGKDD, 2007 Tiago Luís Outline 2 Cross-Language IR (CLIR) Latent Semantic Analysis
More informationarxiv: v2 [cs.cv] 3 Aug 2017
Visual Relationship Detection with Internal and External Linguistic Knowledge Distillation Ruichi Yu, Ang Li, Vlad I. Morariu, Larry S. Davis University of Maryland, College Park Abstract Linguistic Knowledge
More informationA Dataset of Syntactic-Ngrams over Time from a Very Large Corpus of English Books
A Dataset of Syntactic-Ngrams over Time from a Very Large Corpus of English Books Yoav Goldberg Bar Ilan University yoav.goldberg@gmail.com Jon Orwant Google Inc. orwant@google.com Abstract We created
More informationA Domain Ontology Development Environment Using a MRD and Text Corpus
A Domain Ontology Development Environment Using a MRD and Text Corpus Naomi Nakaya 1 and Masaki Kurematsu 2 and Takahira Yamaguchi 1 1 Faculty of Information, Shizuoka University 3-5-1 Johoku Hamamatsu
More informationThe Role of the Head in the Interpretation of English Deverbal Compounds
The Role of the Head in the Interpretation of English Deverbal Compounds Gianina Iordăchioaia i, Lonneke van der Plas ii, Glorianna Jagfeld i (Universität Stuttgart i, University of Malta ii ) Wen wurmt
More informationProject in the framework of the AIM-WEST project Annotation of MWEs for translation
Project in the framework of the AIM-WEST project Annotation of MWEs for translation 1 Agnès Tutin LIDILEM/LIG Université Grenoble Alpes 30 october 2014 Outline 2 Why annotate MWEs in corpora? A first experiment
More informationAutoencoder and selectional preference Aki-Juhani Kyröläinen, Juhani Luotolahti, Filip Ginter
ESUKA JEFUL 2017, 8 2: 93 125 Autoencoder and selectional preference Aki-Juhani Kyröläinen, Juhani Luotolahti, Filip Ginter AN AUTOENCODER-BASED NEURAL NETWORK MODEL FOR SELECTIONAL PREFERENCE: EVIDENCE
More informationA JOINT MANY-TASK MODEL: GROWING A NEURAL NETWORK FOR MULTIPLE NLP TASKS
A JOINT MANY-TASK MODEL: GROWING A NEURAL NETWORK FOR MULTIPLE NLP TASKS Kazuma Hashimoto, Caiming Xiong, Yoshimasa Tsuruoka & Richard Socher The University of Tokyo {hassy, tsuruoka}@logos.t.u-tokyo.ac.jp
More informationSome Principles of Automated Natural Language Information Extraction
Some Principles of Automated Natural Language Information Extraction Gregers Koch Department of Computer Science, Copenhagen University DIKU, Universitetsparken 1, DK-2100 Copenhagen, Denmark Abstract
More informationГлубокие рекуррентные нейронные сети для аспектно-ориентированного анализа тональности отзывов пользователей на различных языках
Глубокие рекуррентные нейронные сети для аспектно-ориентированного анализа тональности отзывов пользователей на различных языках Тарасов Д. С. (dtarasov3@gmail.com) Интернет-портал reviewdot.ru, Казань,
More informationENGBG1 ENGBL1 Campus Linguistics. Meeting 2. Chapter 7 (Morphology) and chapter 9 (Syntax) Pia Sundqvist
Meeting 2 Chapter 7 (Morphology) and chapter 9 (Syntax) Today s agenda Repetition of meeting 1 Mini-lecture on morphology Seminar on chapter 7, worksheet Mini-lecture on syntax Seminar on chapter 9, worksheet
More informationChapter 4: Valence & Agreement CSLI Publications
Chapter 4: Valence & Agreement Reminder: Where We Are Simple CFG doesn t allow us to cross-classify categories, e.g., verbs can be grouped by transitivity (deny vs. disappear) or by number (deny vs. denies).
More informationSINGLE DOCUMENT AUTOMATIC TEXT SUMMARIZATION USING TERM FREQUENCY-INVERSE DOCUMENT FREQUENCY (TF-IDF)
SINGLE DOCUMENT AUTOMATIC TEXT SUMMARIZATION USING TERM FREQUENCY-INVERSE DOCUMENT FREQUENCY (TF-IDF) Hans Christian 1 ; Mikhael Pramodana Agus 2 ; Derwin Suhartono 3 1,2,3 Computer Science Department,
More informationHyperedge Replacement and Nonprojective Dependency Structures
Hyperedge Replacement and Nonprojective Dependency Structures Daniel Bauer and Owen Rambow Columbia University New York, NY 10027, USA {bauer,rambow}@cs.columbia.edu Abstract Synchronous Hyperedge Replacement
More informationA relational approach to translation
A relational approach to translation Rémi Zajac Project POLYGLOSS* University of Stuttgart IMS-CL /IfI-AIS, KeplerstraBe 17 7000 Stuttgart 1, West-Germany zajac@is.informatik.uni-stuttgart.dbp.de Abstract.
More informationLeveraging Sentiment to Compute Word Similarity
Leveraging Sentiment to Compute Word Similarity Balamurali A.R., Subhabrata Mukherjee, Akshat Malu and Pushpak Bhattacharyya Dept. of Computer Science and Engineering, IIT Bombay 6th International Global
More informationThe presence of interpretable but ungrammatical sentences corresponds to mismatches between interpretive and productive parsing.
Lecture 4: OT Syntax Sources: Kager 1999, Section 8; Legendre et al. 1998; Grimshaw 1997; Barbosa et al. 1998, Introduction; Bresnan 1998; Fanselow et al. 1999; Gibson & Broihier 1998. OT is not a theory
More informationMeasuring the relative compositionality of verb-noun (V-N) collocations by integrating features
Measuring the relative compositionality of verb-noun (V-N) collocations by integrating features Sriram Venkatapathy Language Technologies Research Centre, International Institute of Information Technology
More informationTruth Inference in Crowdsourcing: Is the Problem Solved?
Truth Inference in Crowdsourcing: Is the Problem Solved? Yudian Zheng, Guoliang Li #, Yuanbing Li #, Caihua Shan, Reynold Cheng # Department of Computer Science, Tsinghua University Department of Computer
More informationA Vector Space Approach for Aspect-Based Sentiment Analysis
A Vector Space Approach for Aspect-Based Sentiment Analysis by Abdulaziz Alghunaim B.S., Massachusetts Institute of Technology (2015) Submitted to the Department of Electrical Engineering and Computer
More informationModule 12. Machine Learning. Version 2 CSE IIT, Kharagpur
Module 12 Machine Learning 12.1 Instructional Objective The students should understand the concept of learning systems Students should learn about different aspects of a learning system Students should
More informationExperiments with a Higher-Order Projective Dependency Parser
Experiments with a Higher-Order Projective Dependency Parser Xavier Carreras Massachusetts Institute of Technology (MIT) Computer Science and Artificial Intelligence Laboratory (CSAIL) 32 Vassar St., Cambridge,
More informationConstruction Grammar. University of Jena.
Construction Grammar Holger Diessel University of Jena holger.diessel@uni-jena.de http://www.holger-diessel.de/ Words seem to have a prototype structure; but language does not only consist of words. What
More informationThe Internet as a Normative Corpus: Grammar Checking with a Search Engine
The Internet as a Normative Corpus: Grammar Checking with a Search Engine Jonas Sjöbergh KTH Nada SE-100 44 Stockholm, Sweden jsh@nada.kth.se Abstract In this paper some methods using the Internet as a
More informationhave to be modeled) or isolated words. Output of the system is a grapheme-tophoneme conversion system which takes as its input the spelling of words,
A Language-Independent, Data-Oriented Architecture for Grapheme-to-Phoneme Conversion Walter Daelemans and Antal van den Bosch Proceedings ESCA-IEEE speech synthesis conference, New York, September 1994
More informationSession 2B From understanding perspectives to informing public policy the potential and challenges for Q findings to inform survey design
Session 2B From understanding perspectives to informing public policy the potential and challenges for Q findings to inform survey design Paper #3 Five Q-to-survey approaches: did they work? Job van Exel
More informationApplications of memory-based natural language processing
Applications of memory-based natural language processing Antal van den Bosch and Roser Morante ILK Research Group Tilburg University Prague, June 24, 2007 Current ILK members Principal investigator: Antal
More informationIntroduction to HPSG. Introduction. Historical Overview. The HPSG architecture. Signature. Linguistic Objects. Descriptions.
to as a linguistic theory to to a member of the family of linguistic frameworks that are called generative grammars a grammar which is formalized to a high degree and thus makes exact predictions about
More informationLEARNING A SEMANTIC PARSER FROM SPOKEN UTTERANCES. Judith Gaspers and Philipp Cimiano
LEARNING A SEMANTIC PARSER FROM SPOKEN UTTERANCES Judith Gaspers and Philipp Cimiano Semantic Computing Group, CITEC, Bielefeld University {jgaspers cimiano}@cit-ec.uni-bielefeld.de ABSTRACT Semantic parsers
More informationA Semantic Similarity Measure Based on Lexico-Syntactic Patterns
A Semantic Similarity Measure Based on Lexico-Syntactic Patterns Alexander Panchenko, Olga Morozova and Hubert Naets Center for Natural Language Processing (CENTAL) Université catholique de Louvain Belgium
More informationSystem Implementation for SemEval-2017 Task 4 Subtask A Based on Interpolated Deep Neural Networks
System Implementation for SemEval-2017 Task 4 Subtask A Based on Interpolated Deep Neural Networks 1 Tzu-Hsuan Yang, 2 Tzu-Hsuan Tseng, and 3 Chia-Ping Chen Department of Computer Science and Engineering
More informationAccuracy (%) # features
Question Terminology and Representation for Question Type Classication Noriko Tomuro DePaul University School of Computer Science, Telecommunications and Information Systems 243 S. Wabash Ave. Chicago,
More informationSpoken Language Parsing Using Phrase-Level Grammars and Trainable Classifiers
Spoken Language Parsing Using Phrase-Level Grammars and Trainable Classifiers Chad Langley, Alon Lavie, Lori Levin, Dorcas Wallace, Donna Gates, and Kay Peterson Language Technologies Institute Carnegie
More informationAnalysis of Probabilistic Parsing in NLP
Analysis of Probabilistic Parsing in NLP Krishna Karoo, Dr.Girish Katkar Research Scholar, Department of Electronics & Computer Science, R.T.M. Nagpur University, Nagpur, India Head of Department, Department
More informationAdapting Stochastic Output for Rule-Based Semantics
Adapting Stochastic Output for Rule-Based Semantics Wissenschaftliche Arbeit zur Erlangung des Grades eines Diplom-Handelslehrers im Fachbereich Wirtschaftswissenschaften der Universität Konstanz Februar
More informationEdIt: A Broad-Coverage Grammar Checker Using Pattern Grammar
EdIt: A Broad-Coverage Grammar Checker Using Pattern Grammar Chung-Chi Huang Mei-Hua Chen Shih-Ting Huang Jason S. Chang Institute of Information Systems and Applications, National Tsing Hua University,
More informationMatching Similarity for Keyword-Based Clustering
Matching Similarity for Keyword-Based Clustering Mohammad Rezaei and Pasi Fränti University of Eastern Finland {rezaei,franti}@cs.uef.fi Abstract. Semantic clustering of objects such as documents, web
More informationExtracting Opinion Expressions and Their Polarities Exploration of Pipelines and Joint Models
Extracting Opinion Expressions and Their Polarities Exploration of Pipelines and Joint Models Richard Johansson and Alessandro Moschitti DISI, University of Trento Via Sommarive 14, 38123 Trento (TN),
More informationTextGraphs: Graph-based algorithms for Natural Language Processing
HLT-NAACL 06 TextGraphs: Graph-based algorithms for Natural Language Processing Proceedings of the Workshop Production and Manufacturing by Omnipress Inc. 2600 Anderson Street Madison, WI 53704 c 2006
More informationSemantic Inference at the Lexical-Syntactic Level
Semantic Inference at the Lexical-Syntactic Level Roy Bar-Haim Department of Computer Science Ph.D. Thesis Submitted to the Senate of Bar Ilan University Ramat Gan, Israel January 2010 This work was carried
More informationSTUDENTS' RATINGS ON TEACHER
STUDENTS' RATINGS ON TEACHER Faculty Member: CHEW TECK MENG IVAN Module: Activity Type: DATA STRUCTURES AND ALGORITHMS I CS1020 LABORATORY Class Size/Response Size/Response Rate : 21 / 14 / 66.67% Contact
More informationUsing Web Searches on Important Words to Create Background Sets for LSI Classification
Using Web Searches on Important Words to Create Background Sets for LSI Classification Sarah Zelikovitz and Marina Kogan College of Staten Island of CUNY 2800 Victory Blvd Staten Island, NY 11314 Abstract
More informationTarget Language Preposition Selection an Experiment with Transformation-Based Learning and Aligned Bilingual Data
Target Language Preposition Selection an Experiment with Transformation-Based Learning and Aligned Bilingual Data Ebba Gustavii Department of Linguistics and Philology, Uppsala University, Sweden ebbag@stp.ling.uu.se
More informationText-mining the Estonian National Electronic Health Record
Text-mining the Estonian National Electronic Health Record Raul Sirel rsirel@ut.ee 13.11.2015 Outline Electronic Health Records & Text Mining De-identifying the Texts Resolving the Abbreviations Terminology
More informationImproved Effects of Word-Retrieval Treatments Subsequent to Addition of the Orthographic Form
Orthographic Form 1 Improved Effects of Word-Retrieval Treatments Subsequent to Addition of the Orthographic Form The development and testing of word-retrieval treatments for aphasia has generally focused
More informationCross Language Information Retrieval
Cross Language Information Retrieval RAFFAELLA BERNARDI UNIVERSITÀ DEGLI STUDI DI TRENTO P.ZZA VENEZIA, ROOM: 2.05, E-MAIL: BERNARDI@DISI.UNITN.IT Contents 1 Acknowledgment.............................................
More informationThe Strong Minimalist Thesis and Bounded Optimality
The Strong Minimalist Thesis and Bounded Optimality DRAFT-IN-PROGRESS; SEND COMMENTS TO RICKL@UMICH.EDU Richard L. Lewis Department of Psychology University of Michigan 27 March 2010 1 Purpose of this
More informationTHE VERB ARGUMENT BROWSER
THE VERB ARGUMENT BROWSER Bálint Sass sass.balint@itk.ppke.hu Péter Pázmány Catholic University, Budapest, Hungary 11 th International Conference on Text, Speech and Dialog 8-12 September 2008, Brno PREVIEW
More informationBasic Syntax. Doug Arnold We review some basic grammatical ideas and terminology, and look at some common constructions in English.
Basic Syntax Doug Arnold doug@essex.ac.uk We review some basic grammatical ideas and terminology, and look at some common constructions in English. 1 Categories 1.1 Word level (lexical and functional)
More informationAssignment 1: Predicting Amazon Review Ratings
Assignment 1: Predicting Amazon Review Ratings 1 Dataset Analysis Richard Park r2park@acsmail.ucsd.edu February 23, 2015 The dataset selected for this assignment comes from the set of Amazon reviews for
More informationMining Topic-level Opinion Influence in Microblog
Mining Topic-level Opinion Influence in Microblog Daifeng Li Dept. of Computer Science and Technology Tsinghua University ldf3824@yahoo.com.cn Jie Tang Dept. of Computer Science and Technology Tsinghua
More informationDiscriminative Learning of Beam-Search Heuristics for Planning
Discriminative Learning of Beam-Search Heuristics for Planning Yuehua Xu School of EECS Oregon State University Corvallis,OR 97331 xuyu@eecs.oregonstate.edu Alan Fern School of EECS Oregon State University
More informationOCR for Arabic using SIFT Descriptors With Online Failure Prediction
OCR for Arabic using SIFT Descriptors With Online Failure Prediction Andrey Stolyarenko, Nachum Dershowitz The Blavatnik School of Computer Science Tel Aviv University Tel Aviv, Israel Email: stloyare@tau.ac.il,
More informationSecond Exam: Natural Language Parsing with Neural Networks
Second Exam: Natural Language Parsing with Neural Networks James Cross May 21, 2015 Abstract With the advent of deep learning, there has been a recent resurgence of interest in the use of artificial neural
More informationProceedings of the 19th COLING, , 2002.
Crosslinguistic Transfer in Automatic Verb Classication Vivian Tsang Computer Science University of Toronto vyctsang@cs.toronto.edu Suzanne Stevenson Computer Science University of Toronto suzanne@cs.toronto.edu
More informationA New Perspective on Combining GMM and DNN Frameworks for Speaker Adaptation
A New Perspective on Combining GMM and DNN Frameworks for Speaker Adaptation SLSP-2016 October 11-12 Natalia Tomashenko 1,2,3 natalia.tomashenko@univ-lemans.fr Yuri Khokhlov 3 khokhlov@speechpro.com Yannick
More informationLQVSumm: A Corpus of Linguistic Quality Violations in Multi-Document Summarization
LQVSumm: A Corpus of Linguistic Quality Violations in Multi-Document Summarization Annemarie Friedrich, Marina Valeeva and Alexis Palmer COMPUTATIONAL LINGUISTICS & PHONETICS SAARLAND UNIVERSITY, GERMANY
More information