CCG Parsers 2015


Notes:

  • Data-driven parsing
  • Generative CCG parsing
  • Treebanking
  • Unsupervised tagging

Resources:

  • ccgbank .. translation of the penn treebank into a corpus of ccg derivations
  • software .. incomplete list of links to ccg software

Wikipedia:

References:

See also:

CCG Parsers 2014 | Combinatory Categorial Grammar & Natural Language GenerationOpenCCG (OpenNLP CCG Library)


Weakly-Supervised Grammar-Informed Bayesian CCG Parser Learning. D Garrette, C Dyer, J Baldridge, NA Smith – AAAI, 2015 – cs.utexas.edu Abstract Combinatory Categorial Grammar (CCG) is a lexicalized grammar formalism in which words are associated with categories that, in combination with a small universal set of rules, specify the syntactic configurations in which they may occur. Previous work has shown Cited by 9 Related articles All 11 versions

A Supertag-Context Model for Weakly-Supervised CCG Parser Learning D Garrette, C Dyer, J Baldridge, NA Smith – CoNLL 2015, 2015 – aclweb.org Abstract Combinatory Categorial Grammar (CCG) is a lexicalized grammar formalism in which words are associated with categories that specify the syntactic configurations in which they may occur. We present a novel parsing model with the capacity to capture the Cited by 1 Related articles All 15 versions

Comparing attribute classifiers for interactive language grounding Y Yu, A Eshghi, O Lemon – pdfs.semanticscholar.org … A well-known logical semantic parser is the Combinatory Cate- gorial Grammar (CCG) parser, which represents natural language sentences from human tutors in the logical forms. … (Ma- tuszek et al., 2012) are based on a CCG parser or using a CCG lexicon respectively. … Cited by 3 Related articles All 7 versions

Supertagging for a Statistical HPSG Parser for Spanish L Chiruzzo, D Wonsever – International Conference on Statistical …, 2015 – Springer … After this, the technique has been applied successfully to other lexicalized grammars. For example, [3] explores the possibility of allowing the supertagger to output multiple tags in order to improve the performance of a Combinatory Categorial Grammar (CCG) parser. … Related articles All 2 versions

The NL2KR Platform for building Natural Language Translation Systems V Nguyen, A Mitra, C Baral – pdfs.semanticscholar.org … Existing CCG parsers (Curran et al., 2007; Lier- ler and Schüller, 2012) either return a single best parse tree for a given sentence or … NL2KRs CCG parser uses the C&C model (Curran et al., 2007) and constraints from the Stan- ford parser (Socher et al., 2013; Toutanova et al … Related articles All 4 versions

The NL2KR platform for building natural language translation systems NH Vo, A Mitra, C Baral – Association for Computational Linguistics (ACL …, 2015 – aclweb.org … Existing CCG parsers (Curran et al., 2007; Lier- ler and Schüller, 2012) either return a single best parse tree for a given sentence or parse it in all possible ways with no preferential ordering among them. … NL2KRs CCG parser uses the C&C model … Cited by 2 Related articles All 6 versions

Parsing Chinese with a Generalized Categorial Grammar M Duan, W Schuler – ACL-IJCNLP 2015, 2015 – aclweb.org … with the size of the training data, we trained the Chinese CCG parser on both the full training set (ccg. full) and the same training set used for training the Chinese GCG parser (ccg. same). The detailed section divisions are shown in Table 1. For the two CCG parsers, ccg. … Cited by 2 Related articles All 7 versions

Higher-order logical inference with compositional semantics K Mineshima, P Mart?nez-Gómez, Y Miyao… – Proceedings of …, 2015 – aclweb.org … Abstract We present a higher-order inference sys- tem based on a formal compositional semantics and the wide-coverage CCG parser. … Main errors we found are due to various parse errors caused by the CCG parser, including the failure to handle multiwords like a lot of. … Cited by 5 Related articles All 9 versions

Generating Disambiguating Paraphrases for Use in Crowdsourced Judgments of Meaning EA Hill – 2015 – kb.osu.edu … using an explicit set of CCG combinatory rules. OpenCCG provides a CCG parser which can probabilistically produce the most likely … parser. In addition to a CCG parser, OpenCCG also includes a CCG surface realizer. Surface … All 2 versions

A tableau prover for natural logic and language L Abzianidze – proceedings of Empirical Methods in Natural Language …, 2015 – pure.uvt.nl … First, the CCG framework is characterized by a trans- parent interface between syntactic categories and semantic types; second, there exist efficient and robust CCG parsers for wide-coverage texts. During obtaining LLFs, we employ the C&C CCG parser of Clark and Curran … Cited by 6 Related articles All 14 versions

Labeled grammar induction with minimal supervision Y Bisk, C Christodoulopoulos, J Hockenmaier – Volume 2: Short Papers, 2015 – aclweb.org … Specifi- cally, we will provide a labeled evaluation of in- duced CCG parsers against the English (Hock- enmaier and Steedman, 2007) and … Our approach is based on the HDP-CCG parser of Bisk and Hockenmaier (2015) with their extensions to cap- ture lexicalization and … Cited by 5 Related articles All 21 versions

Exploring big educational learner corpora for SLA research: Perspectives on relative clauses T Alexopoulou, J Geertzen, A Korhonen… – … Journal of Learner …, 2015 – ingentaconnect.com … 2013b). Here we use the C&C Combinatory Categorial Grammar (CCG) parser (Clark & Curran 2007), a rich grammar formalism storing much of the grammatical information in the lexicon (Steedman 2000). The C&C CCG parser … Cited by 5 Related articles All 2 versions

Probing the linguistic strengths and limitations of unsupervised grammar induction Y Bisk, J Hockenmaier – … of the 53rd Annual Meeting of …, 2015 – pdfs.semanticscholar.org … This pa- per provides an in-depth analysis of the errors made by unsupervised CCG parsers by evaluating them against the labeled de- pendencies in CCGbank, hinting at new research directions necessary for progress in grammar induction. 1 Introduction … Cited by 4 Related articles All 11 versions

A data-driven, factorization parser for CCG dependency structures Y Du, W Sun, X Wan – … of the 53rd Annual Meeting of the …, 2015 – anthology.aclweb.org … To date, CCG parsers are among the most competitive sys- tems for generating such deep bi-lexical depen- dencies that appropriately encode a … On the other hand, mod- eling these dependencies within a CCG parser has been shown very effective to improve the pars- ing … Cited by 4 Related articles All 7 versions

Structural Repetition in Restricted and Unrestricted Dialogue PGT Healey, M Purver, C Howes – eecs.qmul.ac.uk … Three corpora are used; The British National Corpus (BNC), the Diachronic Corpus of Present-Day Spoken English (DCPSE) and the Switchboard Corpus (SWBD). The syntactic parses for the BNC were obtained automatically using a CCG parser (Clark and Curran, 2007). … Related articles

Learning a compositional semantics for Freebase with an open predicate vocabulary J Krishnamurthy, TM Mitchell – Transactions of the Association …, 2015 – tacl.cs.columbia.edu … The model has two components, shown in Figure 1. The first component is a rule-based semantic parser that uses a syntactic CCG parser and manually-defined rules to map entity-linked texts to logical forms contain- ing predicates derived from the words in the text. … Cited by 10 Related articles All 11 versions

CCG supertagging with a recurrent neural network W Xu, M Auli, S Clark – … of the 53rd Annual Meeting of the …, 2015 – anthology.aclweb.org … This strategy is used in the de facto C&C parser (Curran et al., 2007), and the two-stage CCG parsing pipeline (supertagging and parsing) continues to be the choice for most re- cent CCG parsers (Zhang and Clark, 2011; Auli and … Evaluating a statistical CCG parser on wikipedia … Cited by 25 Related articles All 8 versions

Parser Adaptation to the Biomedical Domain without Re-Training J Mitchell, M Steedman – … INTERNATIONAL WORKSHOP ON …, 2015 – anthology.aclweb.org … techniques usually requires adaptation to new domains. Rimell and Clark (2009), for ex- ample, examine the adaptation of a WSJ-trained CCG parser to the biomedical domain. The diver- gence between these two domains … Related articles All 13 versions

CMUML System for KBP 2015 Cold Start Slot Filling B Kisiel, B McDowell, M Gardner, N Nakashole… – tac.nist.gov … The other is our 2014 joint syntax and semantic CCG parser (Krishnamurthy and Mitchell, 2012; Krishnamurthy and Mitchell, 2014) which was trained to extract NELL(Carlson et al., 2010; Mitchell et al., 2015) relations from text using distant supervision. …

Provably correct reactive control from natural language C Lignos, V Raman, C Finucane, M Marcus… – Autonomous …, 2015 – Springer … Dzifcak et al. (2009) use a combinatorial categorial grammar (CCG) parser with a pre-specified mapping between words or phrases and the matching branching temporal logic and dynamic logic propositions. Another area of … Cited by 12 Related articles All 13 versions

A novel methodology for retrieving infographics utilizing structure and message content Z Li, S Carberry, H Fang, KF McCoy, K Peterson… – Data & Knowledge …, 2015 – Elsevier … This section expands on that work. Given a new query, the system first passes it to a CCG parser to produce a parse tree. The parser we use was developed by Clark and Curran [23] and trained specifically for question sentences. … Cited by 1 Related articles All 4 versions

Question answering via phrasal semantic parsing K Xu, Y Feng, S Huang, D Zhao – … of the Cross-Language Evaluation Forum …, 2015 – Springer … recognize the inten- tion structures more efficiently while making the KB-related component flexible, eg, we can only retrain the second phase when adapting to new KBs, which is similar in sprite with [7], who rely on a combinatory categorial grammar (CCG) parser to produce … Cited by 2 Related articles

Integrating multiple dependency corpora for inducing wide-coverage Japanese CCG resources S Uematsu, T Matsuzaki, H Hanaoka, Y Miyao… – ACM Transactions on …, 2015 – dl.acm.org … representations based on Discourse Represen- tation Theory (DRT) [Kamp and Reyle 1993] by replacing semantic representations of the original CCG parser with discourse … CCG- bank has been used for the development of wide-coverage CCG parsers [Clark and Curran 2007 … Cited by 9 Related articles All 8 versions

Listen, attend, and walk: Neural mapping of navigational instructions to action sequences H Mei, M Bansal, MR Walter – arXiv preprint arXiv:1506.04089, 2015 – arxiv.org … As with Kim and Mooney (2013), they improve upon the accuracy through re-ranking. Artzi, Das, and Petrov (2014) extend their CCG parser learn- ing by using statistics of the corpus to control the size of the lexicon, resulting in improved multi-sentence accuracy. … Cited by 12 Related articles All 8 versions

An exploration of discourse-based sentence spaces for compositional distributional semantics T Polajnar, L Rimell, S Clark – Workshop on Linking Models …, 2015 – anthology.aclweb.org … S and the noun space N. 1 Hence the meaning of a noun or noun phrase, for example people, will be a vector in the noun space: ???? people? N. In order to obtain the meaning of a transitive verb, each slash is re- 1In practice, for example using the CCG parser of Clark and … Cited by 5 Related articles All 11 versions

On The Felicitous Applications Of Natural Language MS Naveed, M Sarim, K Ahsan – sci-int.com … coefficients and nonnegative constraints. Although there are tens of parsers that might be used in this system, however combinatory categorical grammar (CCG) parser is more appropriate for this system. CCG grammar is a … Related articles

An Incremental Algorithm for Transition-based CCG Parsing BR Ambati, T Deoskar, M Johnson… – Proceedings of the …, 2015 – pecorarista.com … (2014)). ? Apply the method to SMT and ASR. 15 Page 42. conclusion ? They designed and implemented an incremental CCG parser by introducing a technique called revealing. ? The parser got high scores in two measures of incrementality: connectedness and waiting time. … Cited by 7 Related articles All 10 versions

Scalable Semantic Parsing with Partial Ontologies ECT Kwiatkowski, L Zettlemoyer – Citeseer … entity-category pairs. 4 Mapping Text to Meaning We adopt a two-stage semantic parsing ap- proach (Kwiatkowski et al., 2013). We first use a CCG parser to define a set CCG(x) of possible logical forms l0. Then we will choose … Related articles All 8 versions

Hiding information in reversible english transforms for a blind receiver S Banawan, I Kamel – Applied Computational Intelligence and Soft …, 2015 – dl.acm.org … web. Also, the modified sen- tence is passed through the combinatory categorial grammar (CCG) parser before and after paraphrasing to check that the words surrounding the paraphrase have not been changed. Synonym … Related articles All 5 versions

Social Media Mining with Natural Language Processing M Abdul-Mageed, M Dickinson – 2015 – scholarworks.iu.edu Page 1. …

Learning to Understand Natural Language with Less Human Effort J Krishnamurthy – 2015 – DTIC Document Page 1. Learning to Understand Natural Language with Less Human Effort Jayant Krishnamurthy CMU-CS-15-110 May 2015 School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 Thesis Committee … Related articles All 11 versions

Open-domain semantic parsing with boxer J Bos – Proceedings of the 20th Nordic Conference of …, 2015 – ep.liu.se … Hockenmaier. 2004. Wide- Coverage Semantic Representations from a CCG Parser. In Proceedings of the 20th International Conference on Computational Linguistics (COLING ’04), pages 1240–1246, Geneva. Johan Bos. 2001. … Cited by 6 Related articles All 11 versions

Introduction to Natural Language Syntax and Parsing Lecture 8: Parsing with CCG S Clark – 2015 – cl.cam.ac.uk … development and 23 for testing. One problem with this approach is that it only allows the comparison of CCG parsers. What if we’d like to know how the C&C parser compares with the Stanford or Berkeley parsers? A proposal was made … Related articles

Incorporating Complementary Annotation to a CCGbank for Improving Derivations for Japanese S Uematsu, Y Miyao – IWPT 2015, 2015 – anthology.aclweb.org … Their method converts the Penn Treebank (Marcus et al., 1993) into CCGbank, which is a collection of CCG derivations, and extracts a wide-coverage lexicon from the derivations. The CCGbank is also used to train a robust CCG parser (Clark and Cur- ran, 2007). … Related articles All 9 versions

From the Language of Legislation to Executable Logic Programs A Wyner – Logic in the Theory and Practice of Lawmaking, 2015 – Springer … C&C/Boxer consists of a combinatory categorial grammar (CCG) parser (Bos 2008) and Boxer, a tool that provides semantic representations in Discourse Representation Structures (DRSs) of Discourse Representation Theory (DRT) (Kamp and Reyle 1993). … Related articles All 3 versions

Calculating projections via type checking D Bekki, M Satoh – Proceedings of TYTLES (to appear), 2015 – academia.edu … We show that the projective contents of (1) are automatically calculated from the semantic representations via the type checking/inference algorithm in Fig- ure 5. In future work, we plan to connect the input of this program to a robust CCG parser, or, independently, to connect the … Cited by 1 Related articles All 2 versions

High-precision abductive mapping of multilingual metaphors J Gordon, JR Hobbs, J May, F Morbini… – NAACL HLT 2015, 2015 – aclweb.org … Hockenmaier. 2004. Wide- coverage semantic representations from a CCG parser. In Proceedings of the 20th International Conference on Computational Linguistics (CO- LING), pages 1240–6. Geneva, Switzerland. Dan Fass. 1991. … Related articles All 17 versions

Identifying Cascading Errors using Constraints in Dependency Parsing D Ng, JR Curran – Proceedings of the 53rd Annual Meeting of the …, 2015 – aclweb.org … features. Supertagging (Clark and Curran, 2007) and chart pruning (Zhang et al., 2010) have been used to constrain the search space of a CCG parser, and to remove unlikely or for- bidden spans from repeated consideration. … Cited by 1 Related articles All 6 versions

Representing meaning with a combination of logical form and vectors I Beltagy, S Roller, P Cheng, K Erk… – arXiv preprint arXiv: …, 2015 – arxiv.org … Handling such coreferences is important to detecting many cases of contradiction. • To reduce the impact of mis-parsing, we combine results from two different CCG parsers. Experiments show that this improves accuracy. The rest of this paper is organized as follows. … Cited by 5 Related articles All 5 versions

Low-rank tensors for verbs in compositional distributional semantics D Fried, T Polajnar, S Clark – … of the 53nd Annual Meeting of …, 2015 – anthology.aclweb.org … This is important for extending the model to many more grammatical types (including those with corresponding tensors of higher order than in- vestigated here) to build a wide-coverage tensor- based semantic system using, for example, the CCG parser of Curran et al. (2007). … Cited by 8 Related articles All 11 versions

Unsupervised grammar induction with Combinatory Categorial Grammars YY Bisk – 2015 – ideals.illinois.edu Page 1. c 2015 by Yonatan Yitzhak Bisk. All rights reserved. Page 2. UNSUPERVISED GRAMMAR INDUCTION WITH COMBINATORY CATEGORIAL GRAMMARS BY YONATAN YITZHAK BISK DISSERTATION Submitted in … Related articles All 3 versions

Broad-coverage ccg semantic parsing with amr Y Artzi, K Lee, L Zettlemoyer – Proceedings of the 2015 …, 2015 – anthology.aclweb.org … p(d|x; ?, ?) = e?·?(x,d) ? d’?GEN(x,?) e?·?(x,d’) , (1) 1703 Page 6. where ?(x, d) ? Rl is a feature vector (Section 7). 5.4 Inference To compute the set of derivations GEN(x,?) we define a two-stage process. We first run the CCG parser to generate underspecified logical forms. … Cited by 36 Related articles All 12 versions

The Java Version of the C&C Parser: Version 0.95 S Clark, D Foong, L Bulat, W Xu – Technical report, University of …, 2015 – cl.cam.ac.uk … knows about practical computing. 1 Page 3. Chapter 1 Introduction The C&C CCG parser [8, 13] was designed with efficiency in mind, with some cost to the readability and usability of the code base. This Java version — referred … Cited by 3 Related articles

Towards modeling natural language inferences with part-whole relations using formal ontology and lexical semantics A Nakamura, K Mineshima… – proceedings of CEUR …, 2015 – pdfs.semanticscholar.org … The entire system of building semantic representa- tions and deriving entailment relations is pictured in Fig. 1. Syntactic tree He runs NP S\NP S CCG parser Text Semantic composition underspecified SR ?c.(run(?1(@ic: [ x: Entity male(x) ] ))) Anaphora resolution … All 2 versions

High-level methodologies for grammar engineering, introduction to the special issue D Duchier, Y Parmentier – Journal of Language Modelling, 2015 – jlm.ipipan.waw.pl … Johan Bos, Stephen Clark, Mark Steedman, James R. Curran, and Julia Hockenmaier (2004), Wide-coverage Semantic Representations from a CCG Parser, in Proceedings of the 20th International Conference on Computational Linguistics, COLING ’04, pp. … Related articles All 4 versions

Towards situated open world reference resolution T Williams, S Schreitter, S Acharya… – AAAI Fall Symposium on …, 2015 – hrilab.tufts.edu … 2007), as implemented in the Agent Development Environment (ADE) (Scheutz 2006; Scheutz et al. 2013). Parsing Trees representing the syntactic structure of incoming utterances are generated using a CCG parser with a de- pendency grammar. … Cited by 2 Related articles All 3 versions

A Linguistics-Driven Approach to Statistical Parsing for Low-Resourced Languages P Boonkwan, T Supnithi – IEICE TRANSACTIONS on Information …, 2015 – search.ieice.org … For English, our method performs almost as well as Boonkwan and Steedman [21], and it outperforms Bisk and Hockenmaier’s[50] unsuper- vised CCG parser (F1 = 71.5%) and Cohn et al.’s [18] un- supervised TSG parser (F1 = 65.9%). 4.3 Learning from Longer Sentences … Related articles All 5 versions

Improving Telugu Dependency Parsing using Combinatory Categorial Grammar Supertags B Kumari, RR Rao – ACM Transactions on Asian and Low-Resource …, 2015 – dl.acm.org … 3:9 are available. We would also like to develop a CCG parser for Telugu using the CCG treebank. Finally, we would like to explore the chart parser of Clark and Curran [2007] and the shift-reduce parser of Zhang and Clark [2011]. … Cited by 3 Related articles

Real robots that pass human tests of self-consciousness S Bringsjord, J Licato, NS Govindarajulu… – Robot and Human …, 2015 – ieeexplore.ieee.org … tools. Prominent systems in this vein include: C&Ctools, which uses Curran and Clark’s CCG Parser [35]; Bos’ computational-semantic Boxer [36]; 3https://dl. dropboxusercontent.com/u/16443685/ NaoBotDemo.mov 502 Page 6. … Cited by 10 Related articles All 4 versions

Plans and the (Predicate Argument) Structure of Behavior M Steedman – 2015 – research.ed.ac.uk Page 1. Edinburgh Research Explorer Plans and the (Predicate Argument) Structure of Behavior Citation for published version: Steedman, M 2015, ‘Plans and the (Predicate Argument) Structure of Behavior’ 2nd International … Related articles All 3 versions

EMNLP versus ACL: Analyzing NLP Research Over Time SD Gollapalli, XL Li – anthology.aclweb.org … Language, Syntactic Structure 3 Evaluation, Evaluation Metrics, Automatic Evaluation, Machine Translation, Human Judgments, Translation Quality 4 Error, Error Correction, Error Types, Spelling Errors, Category, Errors, Lexical Category, Error Rate, Ccg Parser 5 Sentence … Related articles All 10 versions

Two Advances in the Implementations of Extended Syllogistic Logics J Hemann, C Swords, LS Moss – Joint Proceedings of the 2nd …, 2015 – peterschueller.com … Abzianidze’s paper shows that computa- tional systems based on natural logics can be combined with CCG parsers and other NLP tools in order to scale up work in this area. Indeed, he succeeds in handling RTE-like data. … Related articles

A Supervised Semantic Parsing with Lexical Extension and Syntactic Constraint Z Liao, Q Zeng, Q Wang – RECENT ADVANCES IN – anthology.aclweb.org … Zhang, 2013). The algorithm we develop in this paper builds on some previous work on the supervised learning CCG parsers (Kwiatkowski et al., 2010; Kwiatkowski et al., 2011), as described in Section 3.4. Recent research … Related articles All 10 versions

Efficiency in Ambiguity: Two Models of Probabilistic Semantics for Natural Language D Clarke, B Keller – IWCS 2015, 2015 – aclweb.org … Association for Computational Linguistics. Bos, J., S. Clark, M. Steedman, JR Curran, and J. Hockenmaier (2004). Wide-coverage semantic rep- resentations from a ccg parser. In Proceedings of the 20th international conference on Computational Linguistics, pp. 1240. … Cited by 2 Related articles All 8 versions

Lexicalization and generative power in CCG M Kuhlmann, A Koller, G Satta – Computational Linguistics, 2015 – MIT Press … This normal form is used in practical CCG parsers to solve the problem of “spurious ambiguity,” where one and the same semantic interpretation (which in CCG takes the form of a lambda term) has multiple syntactic derivation trees. … Cited by 2 Related articles All 12 versions

Learning Semantic Parsers for Natural Language Understanding P Liang – pdfs.semanticscholar.org Page 1. Learning Semantic Parsers for Natural Language Understanding Percy Liang Computer Science Department Stanford University Stanford, CA pliang@cs.stanford. edu ABSTRACT For building question answering systems … Related articles All 3 versions

Situated Learning and Understanding of Natural Language Y Artzi – 2015 – digital.lib.washington.edu … in such scenarios. Finally, with the goal of studying linguistic phenomena not addressed by existing corpora, we present a broad-coverage CCG parser to recover rich formal representations. Together, our tech- niques lower … Related articles All 4 versions

[BOOK] Semantic Modeling of Textual Entailment: Proof-Based Annotation in a Compositional Framework A Toledo – 2015 – dspace.library.uu.nl Page 1. Semantic Modeling of Textual Entailment: Proof-Based Annotation in a Compositional Framework Page 2. Published by LOT phone: +31 30 253 6111 Trans 10 e-mail: lot@uu.nl 3512 JK Utrecht http://www.lotschool.nl The Netherlands … Related articles

Concrete models and empirical evaluations for the categorical compositional distributional model of meaning E Grefenstette, M Sadrzadeh – Computational Linguistics, 2015 – MIT Press Cited by 8 Related articles All 10 versions

Semantic mapping for mobile robotics tasks: A survey I Kostavelis, A Gasteratos – Robotics and Autonomous Systems, 2015 – Elsevier The evolution of contemporary mobile robotics has given thrust to a series of additional conjunct technologies. Of such is the semantic mapping, which provides. Cited by 29 Related articles All 5 versions

Inducing Grammars from Linguistic Universals and Realistic Amounts of Supervision D Garrette – 2015 – cs.utexas.edu Page 1. Inducing Grammars from Linguistic Universals and Realistic Amounts of Supervision by Dan Garrette Dissertation Presented to the Faculty of the Graduate School of The University of Texas at Austin in Partial Fulfillment of the Requirements for the Degree of … Cited by 1 Related articles All 4 versions

A type-logical treebank for French R Moot – Journal of Language Modelling, 2015 – jlm.ipipan.waw.pl Page 1. A type-logical treebank for French Richard Moot CNRS (LaBRI), Bordeaux University abstract Keywords: type-logical grammar, categorial grammar, semi-automatic grammar extraction This paper describes the TLGbank … Cited by 5 Related articles All 7 versions

Evaluating Parsers with Dependency Constraints D Ng – 2015 – ses.library.usyd.edu.au Page 1. Copyright and use of this thesis This thesis must be used in accordance with the provisions of the Copyright Act 1968. Reproduction of material protected by copyright may be an infringement of copyright and copyright … Related articles All 2 versions

Talking to Robots: Learning to Ground Human Language in Perception and Execution C Matuszek – 2015 – dlib.lib.washington.edu … robot control systems [Dzifcak et al. 2009]. This research builds on work on weakly supervised induction of CCG parsers [Kwiatkowksi et al. 2010; Kwiatkowski et al. 2011], which have been used to support other forms of contextual language learning. … Related articles All 3 versions

Data-driven deep-syntactic dependency parsing M BALLESTEROS, B BOHNET… – Natural Language …, 2015 – Cambridge Univ Press Page 1. Natural Language Engineering: page 1 of 36. c Cambridge University Press 2015 doi:10.1017/S1351324915000285 1 Data-driven deep-syntactic dependency parsing† MIGUEL BALLESTEROS1, BERND BOHNET2 … Cited by 4 Related articles All 3 versions

Bilexical Dependencies as an Intermedium for Data-Driven and HPSG-Based Parsing A Ivanova – 2015 – duo.uio.no Page 1. Bilexical Dependencies as an Intermedium for Data-Driven and HPSG-Based Parsing Doctoral Dissertation by Angelina Ivanova Department of Informatics Faculty of Mathematics and Natural Sciences University of Oslo Submitted for the degree of Philosophiae Doctor … Related articles

Discriminative syntax-based word ordering for text generation Y Zhang, S Clark – Computational Linguistics, 2015 – dl.acm.org Page 1. Discriminative Syntax-Based Word Ordering for Text Generation Yue Zhang ? Singapore University of Technology and Design Stephen Clark ?? University of Cambridge Word ordering is a fundamental problem in text generation. … Cited by 7 Related articles All 9 versions

CCG Parsing and Multiword Expressions M De Lhoneux – arXiv preprint arXiv:1505.04420, 2015 – arxiv.org Page 1. CCG Parsing and Multiword Expressions Miryam de Lhoneux T H E U NIVER S I T Y O F E DI NBU R G H Master of Science Artificial Intelligence School of Informatics University of Edinburgh 2014 arXiv:1505.04420v1 [cs.CL] 17 May 2015 Page 2. Abstract … Cited by 2 Related articles All 8 versions

Automated Coherence Detection With Term-Distance Path Extraction Of The Co-Occurrence Matrix Of A Document H AGIN – 2015 – etd.lib.metu.edu.tr Page 1. Page 2. AUTOMATED COHERENCE DETECTION WITH TERM-DISTANCE PATH EXTRACTION OF THE CO-OCCURRENCE MATRIX OF A DOCUMENT A THESIS SUBMITTED TO THE GRADUATE SCHOOL OF INFORMATICS …

Referential grounding towards mediating shared perceptual basis in situated dialogue C Liu – 2015 – cse.msu.edu Page 1. REFERENTIAL GROUNDING TOWARDS MEDIATING SHARED PERCEPTUAL BASIS IN SITUATED DIALOGUE By Changsong Liu A DISSERTATION Submitted to Michigan State University in partial fulfillment of the requirements for the degree of … Related articles All 2 versions