acl acl2010 acl2010-260 knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Julia Hockenmaier ; Yusuke Miyao ; Josef van Genabith
Abstract: unkown-abstract
Reference: text
sentIndex sentText sentNum sentScore
1 Wide-coverage NLP with Linguistically Expressive Grammars Julia Hockenmaier Department of Computer Science, University of Illinois j uliahmr@ i l l inoi s . [sent-1, score-0.1]
2 edu Yusuke Miyao National Institute of Informatics yusuke @ nii ac . [sent-2, score-0.3]
3 Josef van Genabith Centre for Next Generation Localisation, School of Computing, Dublin City University j o s e f@ comput ing . [sent-4, score-0.155]
4 But although many young researchers in natural language processing are very well trained in machine learning and statistical methods, they often lack the necessary background to understand the linguistic motivation behind these formalisms. [sent-7, score-0.375]
5 Furthermore, in many linguistics departments, syntax is still taught from a purely Chomskian perspective. [sent-8, score-0.148]
6 Additionally, research on these formalisms often takes place within tightly-knit, formalism- specific subcommunities. [sent-9, score-0.407]
7 It is therefore often difficult for outsiders as well as experts to grasp the commonalities of and differences between these formalisms. [sent-10, score-0.286]
8 2 Content Overview This tutorial overviews basic ideas of TAG/ CCG/LFG/HPSG, and provides attendees with a comparison of these formalisms from a linguistic and computational point of view. [sent-11, score-0.749]
9 We start from stating the motivation behind using these expressive grammar formalisms for NLP, contrasting them with shallow formalisms like contextfree grammars. [sent-12, score-1.523]
10 In the 1 second half of the tutorial, we explain two key technologies for wide-coverage NLP with these grammar formalisms: grammar acquisition and parsing models. [sent-14, score-0.322]
11 Finally, we show NLP applications where these expressive grammar formalisms provide additional benefits. [sent-15, score-0.796]
12 Summary References parsing with expressive Aoife Cahill, Michael Burke, Ruth O’Donovan, Stefan Riezler, Josef van Genabith and Andy Way. [sent-25, score-0.486]
wordName wordTfidf (topN-words)
[('expressive', 0.372), ('formalisms', 0.338), ('grammars', 0.316), ('yusuke', 0.208), ('hpsg', 0.196), ('ccg', 0.191), ('genabith', 0.163), ('lfg', 0.149), ('miyao', 0.144), ('tutorial', 0.143), ('hockenmaier', 0.135), ('julia', 0.127), ('grasp', 0.1), ('taught', 0.1), ('inoi', 0.1), ('overviews', 0.092), ('nii', 0.092), ('attendees', 0.092), ('scrambling', 0.092), ('aoife', 0.092), ('burke', 0.092), ('donovan', 0.092), ('departments', 0.092), ('josef', 0.089), ('reuse', 0.086), ('dcu', 0.086), ('comput', 0.086), ('localisation', 0.086), ('cahill', 0.086), ('grammar', 0.086), ('linguistically', 0.082), ('ccgbank', 0.082), ('asscolcia', 0.082), ('cgeom', 0.082), ('jtuulytor', 0.082), ('dublin', 0.082), ('commonalities', 0.082), ('ruth', 0.078), ('nlp', 0.078), ('motivation', 0.076), ('pra', 0.075), ('behind', 0.072), ('stating', 0.072), ('contrasting', 0.072), ('illustrating', 0.069), ('experts', 0.069), ('mit', 0.069), ('van', 0.069), ('illinois', 0.067), ('unbounded', 0.067), ('sweden', 0.067), ('riezler', 0.065), ('uppsala', 0.065), ('combinatory', 0.064), ('andy', 0.062), ('coordination', 0.06), ('contextfree', 0.06), ('ichi', 0.059), ('af', 0.059), ('bounded', 0.058), ('categorial', 0.058), ('tag', 0.056), ('outline', 0.055), ('forest', 0.055), ('centre', 0.055), ('jp', 0.054), ('sc', 0.054), ('informatics', 0.054), ('constructions', 0.051), ('stefan', 0.05), ('formalism', 0.05), ('arise', 0.049), ('young', 0.049), ('purely', 0.048), ('jun', 0.048), ('ideas', 0.046), ('inducing', 0.045), ('mappings', 0.045), ('parsing', 0.045), ('lot', 0.045), ('deep', 0.044), ('derivations', 0.043), ('introducing', 0.042), ('city', 0.042), ('dependency', 0.038), ('linguistic', 0.038), ('explain', 0.037), ('understand', 0.037), ('shallow', 0.037), ('half', 0.037), ('school', 0.036), ('fo', 0.036), ('often', 0.035), ('background', 0.035), ('place', 0.034), ('researchers', 0.033), ('summary', 0.033), ('additionally', 0.032), ('penn', 0.032), ('acquisition', 0.031)]
simIndex simValue paperId paperTitle
same-paper 1 0.99999988 260 acl-2010-Wide-Coverage NLP with Linguistically Expressive Grammars
Author: Julia Hockenmaier ; Yusuke Miyao ; Josef van Genabith
Abstract: unkown-abstract
2 0.23250388 228 acl-2010-The Importance of Rule Restrictions in CCG
Author: Marco Kuhlmann ; Alexander Koller ; Giorgio Satta
Abstract: Combinatory Categorial Grammar (CCG) is generally construed as a fully lexicalized formalism, where all grammars use one and the same universal set of rules, and crosslinguistic variation is isolated in the lexicon. In this paper, we show that the weak generative capacity of this ‘pure’ form of CCG is strictly smaller than that of CCG with grammar-specific rules, and of other mildly context-sensitive grammar formalisms, including Tree Adjoining Grammar (TAG). Our result also carries over to a multi-modal extension of CCG.
3 0.1846631 23 acl-2010-Accurate Context-Free Parsing with Combinatory Categorial Grammar
Author: Timothy A. D. Fowler ; Gerald Penn
Abstract: The definition of combinatory categorial grammar (CCG) in the literature varies quite a bit from author to author. However, the differences between the definitions are important in terms of the language classes of each CCG. We prove that a wide range of CCGs are strongly context-free, including the CCG of CCGbank and of the parser of Clark and Curran (2007). In light of these new results, we train the PCFG parser of Petrov and Klein (2007) on CCGbank and achieve state of the art results in supertagging accuracy, PARSEVAL measures and dependency accuracy.
4 0.17933327 203 acl-2010-Rebanking CCGbank for Improved NP Interpretation
Author: Matthew Honnibal ; James R. Curran ; Johan Bos
Abstract: Once released, treebanks tend to remain unchanged despite any shortcomings in their depth of linguistic analysis or coverage of specific phenomena. Instead, separate resources are created to address such problems. In this paper we show how to improve the quality of a treebank, by integrating resources and implementing improved analyses for specific constructions. We demonstrate this rebanking process by creating an updated version of CCGbank that includes the predicate-argument structure of both verbs and nouns, baseNP brackets, verb-particle constructions, and restrictive and non-restrictive nominal modifiers; and evaluate the impact of these changes on a statistical parser.
5 0.13509609 182 acl-2010-On the Computational Complexity of Dominance Links in Grammatical Formalisms
Author: Sylvain Schmitz
Abstract: Dominance links were introduced in grammars to model long distance scrambling phenomena, motivating the definition of multiset-valued linear indexed grammars (MLIGs) by Rambow (1994b), and inspiring quite a few recent formalisms. It turns out that MLIGs have since been rediscovered and reused in a variety of contexts, and that the complexity of their emptiness problem has become the key to several open questions in computer science. We survey complexity results and open issues on MLIGs and related formalisms, and provide new complexity bounds for some linguistically motivated restrictions.
6 0.13179165 118 acl-2010-Fine-Grained Tree-to-String Translation Rule Extraction
7 0.12620902 206 acl-2010-Semantic Parsing: The Task, the State of the Art and the Future
8 0.12399004 130 acl-2010-Hard Constraints for Grammatical Function Labelling
9 0.10966939 172 acl-2010-Minimized Models and Grammar-Informed Initialization for Supertagging with Highly Ambiguous Lexicons
10 0.10215866 128 acl-2010-Grammar Prototyping and Testing with the LinGO Grammar Matrix Customization System
11 0.10162408 243 acl-2010-Tree-Based and Forest-Based Translation
12 0.095719613 31 acl-2010-Annotation
13 0.092681609 86 acl-2010-Discourse Structure: Theory, Practice and Use
14 0.080143854 114 acl-2010-Faster Parsing by Supertagger Adaptation
15 0.073524855 162 acl-2010-Learning Common Grammar from Multilingual Corpus
16 0.066603489 46 acl-2010-Bayesian Synchronous Tree-Substitution Grammar Induction and Its Application to Sentence Compression
17 0.057615533 190 acl-2010-P10-5005 k2opt.pdf
18 0.05115293 235 acl-2010-Tools for Multilingual Grammar-Based Translation on the Web
19 0.050786339 211 acl-2010-Simple, Accurate Parsing with an All-Fragments Grammar
20 0.048601802 131 acl-2010-Hierarchical A* Parsing with Bridge Outside Scores
topicId topicWeight
[(0, -0.116), (1, -0.031), (2, 0.088), (3, -0.043), (4, -0.125), (5, -0.137), (6, 0.176), (7, 0.038), (8, 0.096), (9, -0.029), (10, 0.22), (11, 0.041), (12, -0.18), (13, 0.139), (14, -0.054), (15, 0.079), (16, -0.027), (17, -0.064), (18, -0.024), (19, -0.07), (20, 0.039), (21, -0.069), (22, -0.133), (23, -0.052), (24, -0.061), (25, -0.044), (26, -0.009), (27, 0.143), (28, 0.063), (29, -0.036), (30, -0.003), (31, -0.059), (32, -0.102), (33, -0.026), (34, -0.054), (35, 0.011), (36, -0.081), (37, -0.01), (38, 0.054), (39, -0.01), (40, -0.133), (41, -0.017), (42, 0.117), (43, -0.005), (44, -0.052), (45, 0.005), (46, 0.005), (47, -0.03), (48, 0.033), (49, -0.118)]
simIndex simValue paperId paperTitle
same-paper 1 0.97899836 260 acl-2010-Wide-Coverage NLP with Linguistically Expressive Grammars
Author: Julia Hockenmaier ; Yusuke Miyao ; Josef van Genabith
Abstract: unkown-abstract
2 0.72397709 228 acl-2010-The Importance of Rule Restrictions in CCG
Author: Marco Kuhlmann ; Alexander Koller ; Giorgio Satta
Abstract: Combinatory Categorial Grammar (CCG) is generally construed as a fully lexicalized formalism, where all grammars use one and the same universal set of rules, and crosslinguistic variation is isolated in the lexicon. In this paper, we show that the weak generative capacity of this ‘pure’ form of CCG is strictly smaller than that of CCG with grammar-specific rules, and of other mildly context-sensitive grammar formalisms, including Tree Adjoining Grammar (TAG). Our result also carries over to a multi-modal extension of CCG.
3 0.6480062 23 acl-2010-Accurate Context-Free Parsing with Combinatory Categorial Grammar
Author: Timothy A. D. Fowler ; Gerald Penn
Abstract: The definition of combinatory categorial grammar (CCG) in the literature varies quite a bit from author to author. However, the differences between the definitions are important in terms of the language classes of each CCG. We prove that a wide range of CCGs are strongly context-free, including the CCG of CCGbank and of the parser of Clark and Curran (2007). In light of these new results, we train the PCFG parser of Petrov and Klein (2007) on CCGbank and achieve state of the art results in supertagging accuracy, PARSEVAL measures and dependency accuracy.
4 0.59071416 182 acl-2010-On the Computational Complexity of Dominance Links in Grammatical Formalisms
Author: Sylvain Schmitz
Abstract: Dominance links were introduced in grammars to model long distance scrambling phenomena, motivating the definition of multiset-valued linear indexed grammars (MLIGs) by Rambow (1994b), and inspiring quite a few recent formalisms. It turns out that MLIGs have since been rediscovered and reused in a variety of contexts, and that the complexity of their emptiness problem has become the key to several open questions in computer science. We survey complexity results and open issues on MLIGs and related formalisms, and provide new complexity bounds for some linguistically motivated restrictions.
5 0.55423707 128 acl-2010-Grammar Prototyping and Testing with the LinGO Grammar Matrix Customization System
Author: Emily M. Bender ; Scott Drellishak ; Antske Fokkens ; Michael Wayne Goodman ; Daniel P. Mills ; Laurie Poulson ; Safiyyah Saleem
Abstract: This demonstration presents the LinGO Grammar Matrix grammar customization system: a repository of distilled linguistic knowledge and a web-based service which elicits a typological description of a language from the user and yields a customized grammar fragment ready for sustained development into a broad-coverage grammar. We describe the implementation of this repository with an emphasis on how the information is made available to users, including in-browser testing capabilities.
6 0.53449512 203 acl-2010-Rebanking CCGbank for Improved NP Interpretation
7 0.45614639 235 acl-2010-Tools for Multilingual Grammar-Based Translation on the Web
8 0.4343791 206 acl-2010-Semantic Parsing: The Task, the State of the Art and the Future
9 0.39667219 172 acl-2010-Minimized Models and Grammar-Informed Initialization for Supertagging with Highly Ambiguous Lexicons
10 0.3919408 67 acl-2010-Computing Weakest Readings
11 0.37642407 114 acl-2010-Faster Parsing by Supertagger Adaptation
12 0.37476212 190 acl-2010-P10-5005 k2opt.pdf
13 0.34767708 211 acl-2010-Simple, Accurate Parsing with an All-Fragments Grammar
14 0.33795631 243 acl-2010-Tree-Based and Forest-Based Translation
15 0.31447208 222 acl-2010-SystemT: An Algebraic Approach to Declarative Information Extraction
16 0.30306157 130 acl-2010-Hard Constraints for Grammatical Function Labelling
17 0.30085739 162 acl-2010-Learning Common Grammar from Multilingual Corpus
18 0.28479803 64 acl-2010-Complexity Assumptions in Ontology Verbalisation
19 0.28074768 118 acl-2010-Fine-Grained Tree-to-String Translation Rule Extraction
20 0.27014324 12 acl-2010-A Probabilistic Generative Model for an Intermediate Constituency-Dependency Representation
topicId topicWeight
[(14, 0.017), (25, 0.093), (42, 0.021), (44, 0.081), (47, 0.39), (59, 0.035), (73, 0.056), (78, 0.047), (80, 0.019), (83, 0.042), (84, 0.022), (98, 0.09)]
simIndex simValue paperId paperTitle
same-paper 1 0.83950168 260 acl-2010-Wide-Coverage NLP with Linguistically Expressive Grammars
Author: Julia Hockenmaier ; Yusuke Miyao ; Josef van Genabith
Abstract: unkown-abstract
2 0.50345308 245 acl-2010-Understanding the Semantic Structure of Noun Phrase Queries
Author: Xiao Li
Abstract: Determining the semantic intent of web queries not only involves identifying their semantic class, which is a primary focus of previous works, but also understanding their semantic structure. In this work, we formally define the semantic structure of noun phrase queries as comprised of intent heads and intent modifiers. We present methods that automatically identify these constituents as well as their semantic roles based on Markov and semi-Markov conditional random fields. We show that the use of semantic features and syntactic features significantly contribute to improving the understanding performance.
3 0.37481469 165 acl-2010-Learning Script Knowledge with Web Experiments
Author: Michaela Regneri ; Alexander Koller ; Manfred Pinkal
Abstract: We describe a novel approach to unsupervised learning of the events that make up a script, along with constraints on their temporal ordering. We collect naturallanguage descriptions of script-specific event sequences from volunteers over the Internet. Then we compute a graph representation of the script’s temporal structure using a multiple sequence alignment algorithm. The evaluation of our system shows that we outperform two informed baselines.
4 0.36420557 243 acl-2010-Tree-Based and Forest-Based Translation
Author: Yang Liu ; Liang Huang
Abstract: unkown-abstract
5 0.35745293 210 acl-2010-Sentiment Translation through Lexicon Induction
Author: Christian Scheible
Abstract: The translation of sentiment information is a task from which sentiment analysis systems can benefit. We present a novel, graph-based approach using SimRank, a well-established vertex similarity algorithm to transfer sentiment information between a source language and a target language graph. We evaluate this method in comparison with SO-PMI.
6 0.35400462 71 acl-2010-Convolution Kernel over Packed Parse Forest
7 0.35375547 130 acl-2010-Hard Constraints for Grammatical Function Labelling
8 0.35283226 69 acl-2010-Constituency to Dependency Translation with Forests
9 0.35221887 23 acl-2010-Accurate Context-Free Parsing with Combinatory Categorial Grammar
10 0.35043001 118 acl-2010-Fine-Grained Tree-to-String Translation Rule Extraction
11 0.3454091 89 acl-2010-Distributional Similarity vs. PU Learning for Entity Set Expansion
12 0.34052181 128 acl-2010-Grammar Prototyping and Testing with the LinGO Grammar Matrix Customization System
13 0.33988014 191 acl-2010-PCFGs, Topic Models, Adaptor Grammars and Learning Topical Collocations and the Structure of Proper Names
14 0.33876872 203 acl-2010-Rebanking CCGbank for Improved NP Interpretation
15 0.33709946 237 acl-2010-Topic Models for Word Sense Disambiguation and Token-Based Idiom Detection
16 0.33510107 121 acl-2010-Generating Entailment Rules from FrameNet
17 0.33491567 17 acl-2010-A Structured Model for Joint Learning of Argument Roles and Predicate Senses
18 0.33478805 224 acl-2010-Talking NPCs in a Virtual Game World
19 0.33425617 248 acl-2010-Unsupervised Ontology Induction from Text
20 0.33303893 53 acl-2010-Blocked Inference in Bayesian Tree Substitution Grammars