Grammar Parsing & Natural Language Generation


See also:

Construction Grammar & Dialog SystemsCSG (Constraint-Based Synchronous Grammar) | FSG (Finite State Grammar) & Dialog Systems | Grammar Checkers & Dialog Systems | Grammar Compilers & Dialog Systems | Grammar EnginesGrammar Parsers & Dialog Systems | Grammar Processing | Grammar Recognition | Grammar Recognizers | Grammar Transformers | Grammar Trees & Dialog Systems | GRM Library (Grammar Library)GSL (Grammar Specification Language) | HPSG (Head-Driven Phrase Structure Grammar) & Dialog Systems | Link Grammar & Dialog Systems | Modular Grammar & Dialog Systems | XML Grammar & Dialog Systems


DEXTOR: Reduced Effort Authoring for Template-Based Natural Language Generation KS Narayan, CL Isbell, DL Roberts – Seventh Artificial Intelligence and …, 2011 – aaai.org … Unfortunately, many methods for implementing natural language generation (NLG) induce a significant burden on the author, do not scale well, or require specialized … As an initial pass, a link grammar parser (Lafferty, Sleator, and Temperley 1992) is used to determine if a PC is … Related articles All 4 versions

[PDF] from utexas.edu Parsing combinatory categorial grammar via planning in answer set programming Y Lierler, P Schüller – Correct Reasoning, 2012 – Springer Page 1. Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming Yuliya Lierler 1 and Peter Schüller 2 1 Department of Computer Science, University of Kentucky yulia@cs.uky.edu 2 Institut für Informationssysteme … Cited by 1 Related articles All 4 versions

[PDF] from 55-works.com Studying the history of ideas using topic models D Hall, D Jurafsky, CD Manning – Proceedings of the Conference on …, 2008 – dl.acm.org … RTE paraphrases paraphrase entailment paraphrasing textual para rte pascal entailed dagan Parsing parsing grammar parser parse rule … 1983) P82-1029 McCoy, Kathleen F. Augmenting A Database Knowl- edge Representation For Natural Language Generation (ACL, 1982 … Cited by 71 Related articles All 24 versions

[PDF] from aclweb.org Incorporating information status into generation ranking A Cahill, A Riester – Proceedings of the Joint Conference of the 47th …, 2009 – dl.acm.org … gram lan- guage model baseline. We take this log-linear model as our starting point.3 2There are some rare instances of the grammar parsing and therefore also generating ungrammatical output. 3Forst (2007) presents a model … Cited by 14 Related articles All 16 versions

[PDF] from aclweb.org [PDF] Towards a Computational History of the ACL: 1980–2008 A Anderson, D McFarland, D Jurafsky – Association for Computational …, 2012 – aclweb.org … belief, proposition, focus, utterance PP Attachment: ambiguity/ies/ous, disambiguation, attachment, preference, preposition Natural Language Generation: generation/ing … People working in the “Automata” cluster (Tree Adjoining Grammar, Parsing, and by this point Finite State … Cited by 2 Related articles All 15 versions

Semantic Network Language Generation based on a Semantic Networks Serialization Grammar Y Dai, S Zhang, J Chen, T Chen, W Zhang – World Wide Web, 2010 – Springer … semantic networks . natural language generation 1 Introduction Natural Language Generation (NLG) is the generation of natural language from other forms of information, such as relational database, object data structure or logical propositions [2, … Related articles All 5 versions

[PDF] from aclweb.org Perceptron reranking for CCG realization M White, R Rajkumar – Proceedings of the 2009 Conference on …, 2009 – dl.acm.org Page 1. Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing, pages 410–419, Singapore, 6-7 August 2009. cO2009 ACL and AFNLP Perceptron Reranking for CCG Realization Michael … Cited by 17 Related articles All 14 versions

[PDF] from chalmers.se [BOOK] Grammatical Framework: Programming with Multilingual Grammars A Ranta – 2011 – csmisc14.cs.chalmers.se … brary (RGL) Page 27. Linear parsing in the RGL Page 28. GF resource grammar parsing speed msec/token (by Krasimir An- gelov). Slowest: Finnish, German, Italian; fastest: Scandinavian lan- guages, English. Page 29. Multilinguality … Cited by 42 Related articles All 5 versions

[PDF] from calpoly.edu A system for natural language unmarked clausal transformations in text-to-text applications D Miller – 2009 – digitalcommons.calpoly.edu … main task, unique to each implementation. One effort to split this task is the application of surface realization–generating the final text from a discourse plan–in natural language generation (NLG) to text-to-text tasks like summarization and machine translation. In NLG, … Cited by 1 Related articles All 6 versions

[PDF] from jhu.edu [PDF] Creating robust supervised classifiers via web-scale N-gram data S Bergsma, E Pitler, D Lin – … of the 48th Annual Meeting of the …, 2010 – old-site.clsp.jhu.edu … Adjective ordering is also needed in Natural Language Generation systems that pro- duce information from databases; for example, to convey information (in sentences) about medical patients (Shaw and Hatzivassiloglou, 1999). … Cited by 13 Related articles All 19 versions

[PDF] from patternsinthevoid.net Sentence generation for artificial brains: A glocal similarity-matching approach R Lian, B Goertzel, R Liu, M Ross, M Queiroz… – Neurocomputing, 2010 – Elsevier … The dependency extractor component carries out dependency grammar parsing via a customized version of the open-source Sleator and Temperley’s link parser [21]. … There currently do not exist any authoritative evaluation criteria for Natural Language Generation systems. … Cited by 2 Related articles All 3 versions

NATURAL LANGUAGE TEXT INSTRUCTIONS R Bergman, A Lenedev, O Barkol, A Pnueli… – US Patent App. 12/ …, 2010 – Google Patents Page 1. US 20110276944Al (19) United States (12) Patent Application Publication (10) Pub. No.: US 2011/0276944 A1 Bergman et al. (43) Pub. Date: NOV. 10, 2011 (54) NATURAL LANGUAGE TEXT Publication Classi?cation … All 2 versions

[PDF] from aclweb.org Training tree transducers J Graehl, K Knight, J May – Computational Linguistics, 2008 – MIT Press … for machine translation (Wu 1997; Alshawi, Bangalore, and Douglas 2000; Yamada and Knight 2001; Eisner 2003; Gildea 2003), but also for summarization (Knight and Marcu 2002), paraphrasing (Pang, Knight, and Marcu 2003), natural language generation (Langkilde and … Cited by 69 Related articles All 32 versions

[PDF] from upenn.edu [PDF] GLEU: Automatic evaluation of sentence-level fluency A Mutton, M Dras, S Wan, R Dale – ANNUAL MEETING- …, 2007 – acl.ldc.upenn.edu … In evaluating the output of language tech- nology applications—MT, natural language generation, summarisation—automatic eval- uation techniques generally … chosen were the Connexor parser,2 the Collins parser (Collins, 1999), and the Link Grammar parser (Grinberg et al … Cited by 27 Related articles BL Direct All 40 versions

[PDF] from google.com Natural language watermarking and robust hashing based on presuppositional analysis O Vybornova, B Macq – … Reuse and Integration, 2007. IRI 2007. …, 2007 – ieeexplore.ieee.org … of the text including presupposition triggers detection and presupposed information processing we use the CCG (Combinatory Categorial Grammar) parser [6] that has … However, such an approach requires automatic natural language generation which is a big challenge for now. … Cited by 15 Related articles All 2 versions

A Novel Approach for Refinement of Corpus in the Field of Opinion Mining D Bhattacharyya, P Das, K Mitra… – Future Networks, …, 2009 – ieeexplore.ieee.org … Natural-language-generation systems convert information from computer databases into normal-sounding human language. … Parsing is also an earlier term for the diagramming of sentences of natural languages, and is still used for the diagramming of inflected languages, … Related articles All 3 versions

[PDF] from sersc.org [PDF] An Approach of XML-ifying the Crude Corpus in the Field of Opinion Mining D Bhattacharyya, K Mitra, M Choi, RJ Robles… – International Journal of …, 2009 – sersc.org … Natural-language-generation systems convert information from computer databases into normal-sounding human language. … Parsing is also an earlier term for the diagramming of sentences of natural languages, and is still used for the diagramming of inflected languages, … Cited by 1 Related articles All 2 versions

[PDF] from nectec.or.th A learnable constraint-based grammar formalism S Muresan – Proceedings of the 23rd International Conference on …, 2010 – dl.acm.org … Following Shieber (1995), we present the Lexical- ized Well-Founded Grammar parser as a deduc- tive proof system in Table 1. The items of the logic are of the form [i, j, sij,A ? a • ßFA], where A ? aß: FA is a grammar rule, FA — the constraints corresponding to the grammar … Cited by 2 Related articles All 9 versions

[PDF] from aueb.gr [PDF] Paraphrase and Textual Entailment Recognition and Generation P Malakasiotis – 2011 – aueb.gr … from additional training data. Finally, we present three in vitro studies of how para- phrase generation can be used in question answering, natural language generation, and Web advertisements. Page 4. … 113 5.3 Paraphrasing for natural language generation . . . . . … Cited by 2 Related articles All 6 versions

[PDF] from ucsc.edu [PDF] Sharing Authoring with Algorithms AA Reed – 2012 – games.soe.ucsc.edu … 2. Grammar Parser. … Like- wise, natural language generation (NLG) techniques could help ensure grammatical and semantic accuracy in generated sentences, a process currently hand-managed by the author through careful construction of expansion grammars. …

[PDF] from ilsp.gr A CORPUS BASED TECHNIQUE FOR REPAIRING ILL-FORMED SENTENCES WITH WORD ORDER ERRORS USING CO-OCCURRENCES OF N-GRAMS T Athanaselis, K Mamouras, S Bakamidis… – … Journal on Artificial …, 2011 – World Scientific … The use of statistical language models in natural language generation is very significant for many applications eg man-machine interface, automatic translation, text … Many techniques have been developed in the past to cope with this problem using a grammar parser and rules. … Cited by 1 Related articles All 5 versions

[PDF] from uni-magdeburg.de Modular grammar engineering in GF A Ranta – Research on Language & Computation, 2007 – Springer Page 1. Res Lang Comput (2007) 5:133–158 DOI 10.1007/s11168-007-9030-6 Modular Grammar Engineering in GF Aarne Ranta Received: 10 May 2007 / Accepted: 10 May 2007 / Published online: 22 August 2007 © Springer Science+Business Media BV 2007 … Cited by 27 Related articles BL Direct All 12 versions

[BOOK] Natural Language Processing E Kumar – 2011 – books.google.com … This chapter deals with various aspects of natural language generation. … Grammar 74 4.2.3 Definite Clause Grammar (DCG) 77 4.2.4 Generalized Phrase Structure Grammar (GPSG) 79 4.3 Parsing Integration and Unification 81 4.4 Prolog Grammar Parser Generator 82 4.5 … Cited by 1 Related articles

Guided natural language interface system and method PN Pazandak, C Thompson – US Patent 7,027,975, 2006 – Google Patents … search engines, 20 such as Google™); question answering from databases, knowledgebases, or text (for example, linguistically moti- vated techniques using grammars and lexicons but also pattern-based techniques); natural language generation; natural language translation … Cited by 99 Related articles All 2 versions

[PDF] from researchgateway.ac.nz Performance Evaluation for Universal Grammar Engine S Cao – 2011 – aut.researchgateway.ac.nz … NNPS Noun, proper, plural According to De Marneffe, MacCartney and Manning (2006), there are two phases to parse a sentence: dependency extraction (parsing by phrase structure grammar parser) and dependency typing (label the extraction with a grammatical relation). … Related articles

Enhanced semantic question answering system for e-learning environment YH Wang, WN Wang, CC Huang – … Information Networking and …, 2007 – ieeexplore.ieee.org … Firstly, this research uses Link Grammar Parser to analyze the syntactic information from the input sentence … As we know there are some kinds of complicated designed systems can achieve these goals such as: (1) Natural language generation systems which convert information … Cited by 11 Related articles All 5 versions

[PDF] from upenn.edu [PDF] Machine translation using probabilistic synchronous dependency insertion grammars Y Ding, M Palmer – ANNUAL MEETING-ASSOCIATION FOR …, 2005 – acl.ldc.upenn.edu … Eisner (2003) pro- posed viewing the MT problem as a probabilistic synchronous tree substitution grammar parsing 541 Page 2. problem. Melamed (2003, 2004) formalized the MT problem as synchronous parsing based on multitext grammars. … Cited by 129 Related articles BL Direct All 28 versions

[PDF] from arxiv.org A survey of paraphrasing and textual entailment methods I Androutsopoulos, P Malakasiotis – arXiv preprint arXiv:0912.3747, 2009 – arxiv.org … In natural language generation (Reiter & Dale, 2000; Bateman & Zock, 2003), for example when producing texts describing the entities of a … hierarchically the syntactic constituents (eg, noun phrases, verb phrases) of a sentence, the output of a dependency grammar parser is a … Cited by 79 Related articles All 12 versions

[PDF] from usyd.edu.au [PDF] Hat Categories: Representing Form and Function Simultaneously in Combinatory Categorial Grammar M Honnibal – 2010 – it.usyd.edu.au … C&C parser (Clark and Curran, 2007b), which we will use for our experiments in Chapter 6. We briefly review other prominent applications of CCG in natural language processing; for semantic analysis, natural language generation, and machine translation. … Cited by 1 Related articles All 2 versions

Automatic argumentative analysis for interaction mining V Pallotta, R Delmonte – Argument & Computation, 2011 – Taylor & Francis Cited by 2 Related articles

[PDF] from sydney.edu.au [PDF] Improved Evaluation and Parse Reranking for Combinatory Categorial Grammar D NG – 2010 – sydney.edu.au … We assess a new style of parser evaluation for the C&C Combinatory Categorial Grammar parser, demonstrating … Parsers such as the C&C Combinatory Categorial Grammar parser (Clark and Curran, 2007b) will read input sentences and then produce an analysis that could be … Related articles All 2 versions

Clumsy, awkward or having a peculiar propriety? Prescriptive judgements and language change in the 19th century L Anderwald – Language Sciences, 2012 – Elsevier This paper relates comments in British and American prescriptive grammars over the course of the 19th century to actual developments in language change of the t. Related articles All 2 versions

[PDF] from ffzg.hr [PDF] Summarization and Visualization of Digital Conversations V Pallotta, R Delmonte, M Ailomaa – Information Management SPIM …, 2010 – hnk.ffzg.hr … Computational Linguistic Text Processing–Lexicon, Grammar, Parsing and Anaphora Resolution, Nova Science Publishers, New York. … In Proceedings of the 11th European Workshop on Natural Language Generation (ENLG07), June 17th-20th, 2007, Dagstuhl, Germany Mani I … Cited by 1 Related articles All 5 versions

[PDF] from upenn.edu CCGbank: a corpus of CCG derivations and dependency structures extracted from the Penn Treebank J Hockenmaier, M Steedman – Computational Linguistics, 2007 – MIT Press Page 1. CCGbank: A Corpus of CCG Derivations and Dependency Structures Extracted from the Penn Treebank Julia Hockenmaier * University of Pennsylvania Mark Steedman ** University of Edinburgh This article presents … Cited by 134 Related articles BL Direct All 24 versions

[PDF] from rochester.edu [PDF] Syntax-based language models for statistical machine translation MJ Post – 2010 – cs.rochester.edu Page 1. Syntax-based Language Models for Statistical Machine Translation by Matthew John Post Submitted in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy Supervised by Professor Daniel J. Gildea … Cited by 2 Related articles All 3 versions

[PDF] from open.ac.uk [PDF] Constraint-based natural language generation: A survey P Piwek, K Van Deemter – 2006 – users.mct.open.ac.uk Page 1. Technical Report N o 2006/03 Constraint-based Natural Language Generation: A Survey Paul Piwek … March 2006 Page 3. Abstract This paper contains a survey of 25 papers that deal with constraint-based approaches to Natural Language Generation (nlg). … Cited by 7 Related articles All 6 versions

Sentence-level Evaluation Using Co-occurences of N-grams T Athanaselis, S Bakamidis, K Mamouras… – Artificial Neural Networks …, 2008 – Springer … Bag generation is one of the natural language generation meth- ods. … However, the question is how it can be achieved without knowing the POS tag of each word. Many techniques have been developed in the past to cope with this problem using a grammar parser and rules. … Related articles All 4 versions

[PDF] from civilengineering4life.com [PDF] Corpus Linguistics and Language Learning ES Atwell – 2008 – civilengineering4life.com … Page 11. – 4 – I experimented with Transforming a Parsed Corpus into a Corpus Parser by a different approach: machine-learning context-free grammar/parser rules from a parsed corpus [26] (Atwell 1988). The learning system extracted a set of context-free … All 3 versions

Method and apparatus for semiotic correlation WR Gray, RS Shah – US Patent 7,912,701, 2011 – Google Patents Page 1. Illllllllllllllllllllllllllllllllllllllllllllllllll US007912701B1 (12) United States Patent Gray et al. (io) Patent No.: (45) Date of Patent: US 7,912,701 Bl Mar. 22, 2011 (54) METHOD AND APPARATUS FOR SEMIOTIC CORRELATION … Cited by 1 Related articles All 3 versions

[PDF] from benhachey.info Datasets for generic relation extraction B Hachey, C Grover, R Tobin – Natural Language …, 2012 – Cambridge Univ Press Page 1. Natural Language Engineering 18 (1): 21–59. c Cambridge University Press 2011 doi:10.1017/S1351324911000106 21 Datasets for generic relation extraction * B. HACHEY1, C. GROVER2 and R. TOBIN2 1Language … Cited by 2 Related articles All 5 versions

[PDF] from archives-ouvertes.fr Spotting overgeneration suspects C Gardent, E Kow – … Workshop on Natural Language Generation, 2007 – dl.acm.org … Given a large scale symbolic grammar, parsing will often yield several hundreds of parses many of them are probably incorrect. … In Proceedings of the 10th European Workshop on Natural Language Generation, Aberdeen, Scotland, 2005. M. Kay. Chart Generation. … Cited by 7 Related articles All 19 versions

[PDF] from psu.edu [PDF] Preliminary results of the C-STAR project at IRST B Angelini, M Cettolo, A Corazza, D Falavigna… – mouth, 2007 – Citeseer … Section 4 describes the IF format used so far, Section 5 the syntactic analyzer, Section 6 the semantic classi er and, nally, Section 7 the work done at IRST about natural language generation. … Bi-Directional Context-Free Grammar Parsing for Natural Language Processing. … Cited by 2 Related articles All 9 versions

A link grammar parser for Arabic W Casbeer, J Dehdari, D Lonsdale – AMSTERDAM STUDIES IN …, 2007 – books.google.com … PARSER FOR ARABIC WARREN CASBEER, JON DEHDARI & DERYLE LONSDALE Brigham Young University 1. Introduction A parsing system is critical to many natural language processing tasks. Applications such as information extraction, natural language generation, … Cited by 1 Related articles BL Direct

[PDF] from jhu.edu [PDF] Unsupervised Acquisition of Lexical Knowledge From N-grams: Final Report of the 2009 JHU CLSP Workshop D Lin, K Church, H Ji, S Sekine, D Yarowsky… – 2010 – old-site.clsp.jhu.edu Page 1. Unsupervised Acquisition of Lexical Knowledge From N-grams: Final Report of the 2009 JHU CLSP Workshop Dekang Lin, * Kenneth Church, † Heng Ji, ? Satoshi Sekine, ? David Yarowsky, † Shane Bergsma, ‡ Kailash Patil, † … Related articles All 6 versions

[PDF] from ucsc.edu [PDF] AUTOMATIC STYLISTIC PROCESSING FOR CLASSIFICATION AND TRANSFORMATION OF NATURAL LANGUAGE TEXT F Khosmood – 2008 – style.soe.ucsc.edu … 32 2.3.2 LINK GRAMMAR PARSER 33 … 6 However, some loosely related concepts and technologies exist in artificial intelligence and natural language processing which will be helpful to us. Natural Language Generation (NLG) can perhaps be considered “half” the problem. … Related articles All 2 versions

[BOOK] Advanced methods for detection of adverse drug events in clinical notes S Phansalkar – 2007 – books.google.com Page 1. ADVANCED METHODS FOR DETECTION OF ADVERSE DRUG EVENTS IN CLINICAL NOTES by Shobha Phansalkar A dissertation submitted to the faculty of The University of Utah in partial fulfillment of the requirement … All 4 versions

[PDF] from archives-ouvertes.fr A morphological lexicon for the Persian language B Sagot, G Walther – 7th international conference on …, 2010 – hal.archives-ouvertes.fr … Most Natural Language Processing (NLP) tasks such as part-of-speech tagging, shallow or deep parsing and natural language generation, as well as most NLP applications such as data mining, information extraction, or automatic translation … A link grammar parser for Persian. … Cited by 8 Related articles All 16 versions

[PDF] from sepln.org [PDF] Bringing Role and Reference Grammar to natural language understanding CP Pascual, RM Usón – Revisores adicionales, 2009 – sepln.org Page 273. Bringing Role and Reference Grammar to natural language understanding aproximación de la Gramática del Papel y la Referencia a la comprensión del lenguaje natural Carlos Periñán Pascual Universidad Cat?lica … Cited by 13 Related articles All 14 versions

[PDF] from dcu.ie Detecting grammatical errors with treebank-induced, probabilistic parsers J Wagner – 2012 – doras.dcu.ie Page 1. Detecting Grammatical Errors with Treebank-Induced, Probabilistic Parsers Joachim Wagner Magister Artium A dissertation submitted in partial fulfilment of the requirements for the award of Doctor of Philosophy to the Dublin City University School of Computing … Cited by 1 Related articles All 3 versions

[CITATION] An efficient probabilistic syntactic analysis algorithm for Chinese XH Chen, YY Zhou, CF Yuan, GS Wu – Application Research of …, 2006 – en.cnki.com.cn … University of China,Beijing 100024,China);Design and analysis of the Chinese link grammar parsing[J];Journal … Shanghai Jiaotong University, Shanghai 200030);THE PRE-MAPPING SENTENCE PLANNER IN MULTILINGUAL NATURAL LANGUAGE GENERATION SYSTEM[ … Cited by 2 Related articles

[PDF] from archives-ouvertes.fr Une approche paresseuse de l’analyse sémantique ou comment construire une interface syntaxe-sémantique à partir d’exemples FR Chaumartin, S Kahane – TALN, 2010 – hal.archives-ouvertes.fr … Figure 3. Calcul de la règle du progressif : exemple de départ (à gauche) et règles obtenues pour le Stanford Parser (au centre) et pour Link Grammar Parser (à droite) … Actes du Workshop on Natural Language Generation, ACL 2001, Toulouse. … Cited by 1 Related articles All 8 versions

[PDF] from psu.edu Parser evaluation J Carroll, G Minnen, T Briscoe – Treebanks, 2003 – Springer … once (Charniak, 1996). This makes it very difficult to accurately map the struc- tures assigned by an independently-developed grammar/parser onto the struc- tures that appear (or should appear) in the treebank. A further problem … Cited by 57 Related articles All 8 versions

[PDF] from sun.ac.za The South African sign language machine translation project: issues on non-manual sign generation L Van Zijl, A Combrink – Proceedings of the 2006 annual research …, 2006 – dl.acm.org … Sign Language Machine Translation project, and more specifically on our experience in extending a synchronous tree-adjoining grammar parser approach in … A survey and critique of American Sign Language natural language generation and machine translation sys- tems. … Cited by 2 Related articles All 7 versions

[PDF] from diva-portal.org GeneTUC: Natural Language Understanding in Medical Text R Sætre – 2006 – ntnu.diva-portal.org … Such a system will then be a hybrid between plain text searching and strict grammar parsing. … NLP includes Speech synthesis, Speech recognition, Natural Language Under- standing (NLU), Natural language generation and Machine Translation (MT). … Cited by 3 Related articles All 11 versions

Coping with Alternate Formulations of Questions and Answers B Grau, O Ferret, M Hurault-Plantet… – Advances in Open …, 2006 – Springer … semantic content. Generating paraphrases is useful in Natural Language Generation (Robin, 1994; Barzilay and McKeown, 2001) because it offers the possibility to use different formulations depending on the context. In Information … Cited by 4 Related articles All 6 versions

[PDF] from mt-archive.info [PDF] Better learning and decoding for syntax based SMT using PSDIG Y Ding, M Palmer – Proceedings of AMTA 2006, 2006 – mt-archive.info … Synchronous Tree Adjoining Grammars was proposed by (Shie- ber and Schabes, 1990). Eisner (2003) proposed viewing the MT as synchronous tree substitution grammar parsing. Melamed (2003) formalized the MT as synchronous parsing based on multi-text grammars. … Cited by 3 Related articles All 7 versions

[TXT] from sun.ac.za A prototype system for machine translation from English to South African Sign Language using synchronous tree adjoining grammars J Welgemoed – 2007 – scholar.sun.ac.za … 12 3 Tree Adjoining Grammar Parsing 15 … The ViSiCAST system consists of various stages. The first stage takes English input and parses it using a link grammar formalism [39]. For this the Carnegie Mellon University (CMU) link grammar parser [21] was used. … Related articles All 4 versions

[PDF] from vt.edu Using concept maps as a tool for cross-language relevance determination R Richardson – 2007 – scholar.lib.vt.edu Page 1. Using Concept Maps as a Tool for Cross-Language Relevance Determination Ryan Richardson Dissertation submitted to the faculty of the Virginia Polytechnic Institute and State University in partial fulfillment of the requirements for the degree of … Cited by 2 Related articles All 9 versions

[PDF] from utexas.edu [BOOK] Learning for semantic parsing with kernels under various forms of supervision RJ Kate – 2007 – books.google.com Page 1. Copyright by Rohit Jaivant Kate 2007 Page 2. The Dissertation Committee for Rohit Jaivant Kate certi?es that this is the approved version of the following dissertation: Learning for Semantic Parsing with Kernels under … Cited by 2 Related articles All 23 versions

Parsing model for answer extraction in Chinese question answering system C Yuan, C Wang – … Engineering, 2005. IEEE NLP-KE’05. …, 2005 – ieeexplore.ieee.org … An extended lexicalized context-free grammar parser is used for question and answer understanding, the exact answer is … for a specific question needs deeper understanding of the dialog context and more complicated techniques about natural language generation, and even … Cited by 3 Related articles

[PDF] from cmu.edu Heterogeneous multi-robot dialogues for search tasks TK Harris, S Banerjee, AI Rudnicky – 2005 – repository.cmu.edu … recognition, Phoenix (Ward, 1994) for context- free grammar parsing, Helios (Bohus & Rudnicky, 2002) for confidence annotation, Ravenclaw (Bohus & Rudnicky, 2003) for dialogue management, ROSETTA (Oh & Rud- nicky, 2000) for natural language generation, and Festival … Cited by 7 Related articles All 7 versions

[PDF] from upenn.edu [PDF] Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics J Bilmes, J Chu-Carroll, M Sanderson – 2006 – acl.ldc.upenn.edu … 136 Partial Training for a Lexicalized-Grammar Parser Stephen Clark and James Curran . . . . . … 351 Aggregation via Set Partitioning for Natural Language Generation Regina Barzilay and Mirella Lapata . . . . . … All 22 versions

[PDF] from mq.edu.au [PDF] Evaluation of sentence grammaticality using Parsers and a Support Vector Machine A Mutton – 2006 – comp.mq.edu.au … 30 3.11 Link Grammar Parser output showing a violation ratio . . … 2.1 Overview This chapter will first present an overview of natural language generation (NLG) techniques. These will be used as the basis for the generation tech- niques that will produce text to be evaluated later. … Cited by 2 Related articles All 3 versions

[PDF] from uni.lu [PDF] Deep analysis for an interactive question answering system M Slavkovik – Master’s thesis, Free University of Bozen-Bolzano, 2007 – icr.uni.lu … The natural language sentences of the story are parsed with the Link Grammar Parser. … a unit which will be able to translate the extracted semantic representation of the requested specific information back into natural language ie it needs to contain a natural language generator. … Cited by 3 Related articles All 4 versions

[PDF] from psu.edu [PDF] Combining shallow and deep processing for a robust, fast, deep-linguistic dependency parser G Schneider – ESSLLI 2004 Workshop on Combining Shallow and …, 2004 – Citeseer … 2. Typical formal grammar parser complexity is much higher than the O(n3) for CFG [15]. … The chunk to word relation is 1.52 for Treebank section 0. In a test with a toy NP and verb-group grammar parsing was about 4 times slower when using the unchunked section 0 as input. … Cited by 5 Related articles All 21 versions

[PDF] from upenn.edu A low-complexity, broad-coverage probabilistic Dependency Parser for English G Schneider – Proceedings of the 2003 Conference of the North …, 2003 – dl.acm.org … The chunk to word relation is 1.52 for Treebank section 0. In a test with a toy NP and verb-group grammar parsing was about 4 times slower when using unchunked … In Proceedings of the 1st International Natural Language Generation Conference (INLG), Mitzpe Ramon, Israel. … Cited by 11 Related articles All 44 versions

[PDF] from cmu.edu A research platform for multi-agent dialogue dynamics TK Harris, S Banerjee, AI Rudnicky… – Robot and Human …, 2004 – ieeexplore.ieee.org … recognition, Phoenix (Ward, 1994) for context-free grammar parsing, Helios (Bohus S: Rudnicky, 2002) for confidence annotation, Ravenclaw (Bohus tk Rudnicky, 2003) for dialogue management, ROSETTA (Oh 8~ Rudnicky, 2000) for natural language generation, and Festival … Cited by 8 Related articles All 7 versions

Increasing profitability: Voice-based browsing to recommendation system web services H Macedo, J Robin – Advances in Web Intelligence, 2005 – Springer … We show how computational linguistics technologies, such as domain and linguistic knowledge based Natural Language Generation (NLG) [6] and … complex, low-level computational linguistic technologies such as ASR, TTS and domain-specific grammar parsing [4]. However … Cited by 1 Related articles All 5 versions

[PDF] from uu.se [PDF] The impact of lemmatization in word alignment P Strömbäck – 2005 – stp.ling.uu.se … An important system for morphological analysis involving Swedish was con- structed by Karlsson (1990); a constraint grammar parser which includes a morpho- logical analysis step for Swedish, English and Finnish, designed according to Ko- skenniemi’s (1983) two-level … Cited by 2 Related articles All 10 versions

[PDF] from aucegypt.edu Frequently asked questions web pages automatic text summarization YM Shaalan – 2011 – dar.aucegypt.edu Page 1. The American University in Cairo School of Sciences and Engineering FREQUENTLY ASKED QUESTIONS WEB PAGES AUTOMATIC TEXT SUMMARIZATION A Thesis submitted to Department of Computer Science and Engineering … Related articles All 4 versions

[PDF] from google.com [PDF] Machine translation using probabilistic synchronous dependency insertion grammars Y Ding – 2006 – sites.google.com … [Eisner 2003] proposed viewing the MT problem as a probabilistic synchronous tree substitution grammar parsing problem. [Melamed 2003, 2004] … [Eisner 2003] proposed viewing the MT problem as a probabilistic synchronous tree substitution grammar parsing problem. … Cited by 7 Related articles All 9 versions

Web engineering meets natural language processing: a vocal interface generation practice H Macedo, J Robin, R Barros – … of the 11th Brazilian Symposium on …, 2005 – dl.acm.org … DRIVEN INTERFACE VoiceXML allows voice web application developers to reuse as black-box components encapsulating complex, low-level computational linguistic technologies such as ASR, TTS and domain-specific grammar parsing. A Natural Language Generator is one … Related articles All 2 versions

[CITATION] Article/Book List J Welgemoed – 2005 Related articles

[PDF] from sun.ac.za [PDF] A prototype machine translation system J Welgemoed – 2006 – cs.sun.ac.za … 12 3 Tree Adjoining Grammar Parsing 14 … 8 The ViSiCAST system consists of various stages. The first stage takes English input and parses it using a link grammar formalism [36]. For this the Carnegie Mellon University (CMU) link grammar parser [21] was used. … Cited by 2 Related articles All 3 versions

[PDF] from uni-saarland.de [PDF] Intrinsic and Extrinsic Approaches to Recognizing Textual Entailment DP der Philosophischen – 2011 – coli.uni-saarland.de Page 1. Intrinsic and Extrinsic Approaches to Recognizing Textual Entailment Dissertation zur Erlangung des akademischen Grades eines Doktors der Philosophie der Philosophischen Fakultäten der Universität des Saarlandes vorgelegt von Rui Wang March, 2011 Page 2. … Related articles All 2 versions

Automated category discovery for a terminological knowledge base J Powers, J Conklin – US Patent 6,513,027, 2003 – Google Patents … A * 8/1995 Takanashi et al 707/1 5,689,716 A * 11/1997 Chen 707/500 5,832,494 A * 11/1998 Egger et al 707/102 6,199,034 Bl * 3/2001 Wical 704/9 OTHER PUBLICATIONS Wang Weiwei; Lin Biqin; Chen Fang; Yuan Baozong, A natural language generation system based on … Cited by 29 Related articles All 2 versions

[HTML] from linguistik-online.de [HTML] Learning to disambiguate syntactic relations G Schneider – Linguistik online, 2003 – linguistik-online.de … Typical formal grammar parser complexity is about O(n 5 ), which means that parsing time for an exhaustive parse is constant to the fifth power of the number of words in a sentence. … In: Proceedings of the 1st International Natural Language Generation Conference (INLG 2000). … Cited by 6 Related articles All 19 versions

[PDF] from inria.fr ANTELOPE-Une plateforme industrielle de traitement linguistique FR Chaumartin – TAL: traitement automatique des langues: revue …, 2008 – hal.inria.fr … allemande, chinoise, arabe). Il produit une forêt d’arbres de constituants, et sait les traduire en arbres de dépendances orientées, – le Link Grammar Parser (Sleator et Temperley, 1991), codé en C, repose sur des règles. Il produit … Cited by 3 Related articles All 8 versions

[PDF] from unitn.it [PDF] Computational models of anaphora resolution: A survey M Poesio, S Ponzetto, Y Versley – Linguistic Issues in Language …, 2011 – clic.cimec.unitn.it Page 1. Computational Models of Anaphora Resolution: A Survey Massimo Poesio (University of Essex), Simone Paolo Ponzetto (University of Heidelberg), Yannick Versley (University of Tübingen) August 25, 2010 Abstract … Cited by 3 Related articles All 2 versions

[PDF] from uni-bielefeld.de [PDF] Literature review on patient-friendly documentation systems H Åhlfeldt, L Borin, N Grabar, C Hallett, D Hardcastle… – 2006 – pub.uni-bielefeld.de … 39 4.9.2 Acquisition of multilingual lexicon . . . . . 42 5 Survey of Natural Language Generation systems aimed at Patients or Doctors 43 5.1 Alphabetical list of systems with brief descriptions . . . . . 43 5.1.1 BabyTalk . . . . . … Cited by 4 Related articles All 15 versions

Fuzzy based natural speech concept system J Sun, OA Basir, F Karray – US Patent App. 10/733,168, 2003 – Google Patents … to the detected meanings, one or more deploy- ment aspects of the conversation system, such as the natural language generation and TTS … relies solely on a pre-defined grammar cannot account for false recognitions due to the non-robustness of rule-based grammar parsing. … Cited by 1 Related articles All 2 versions

[PDF] from tu-darmstadt.de Modelling Proactive Behaviour of Conversational Interfaces M L’Abbate – 2007 – tuprints.ulb.tu-darmstadt.de … This can be achieved by rather simple context-free grammar parsing algorithms or by more elaborate recursive transition networks. … A natural language generator is responsible for providing textual feedback to the user in response to requests and instructions. … Cited by 1 Related articles All 3 versions

[PDF] from utwente.nl Surface-marker-based dialog modelling: A progress report on the MAREDI project S Delisle, B Moulin, T Copeck – Natural Language …, 2003 – Cambridge Univ Press Page 1. Natural Language Engineering 9 (4): 325–363. c 2003 Cambridge University Press DOI: 10.1017/S1351324903003231 Printed in the United Kingdom 325 Surface-marker- based dialog modelling: A progress report on the MAREDI project … Cited by 1 Related articles BL Direct All 8 versions

[PDF] from delph-in.net [PDF] Stephan Oepen, Dan Flickinger H Uszkoreit, J Tsujii – 2003 – delph-in.net … De- partment of Linguistics, he was engaged in an extension to ale (called trale) that integrates a restricted amount of constraint resolution of general implicational con- straints at run-time from ConTroll into an efficient logic programming and grammar parsing and generation … Related articles All 5 versions

Apparatus and method of processing natural language speech data LS Huang, JL Shen – US Patent App. 10/739,150, 2003 – Google Patents … 40- 50- 402 404 406 speech II recognizer grammar database -508 acoustic model database •410 ¦502 grammar parser keyword analyzer ¦504 ¦506 semantic frame manager 60- 602 information manager l_. natural language generator ¦604 ¦606 TTS composer ^-70 … All 2 versions

[PDF] from aclweb.org [PDF] Bilingual collocation extraction based on syntactic and statistical analyses CC Wu, JS Chang – Computational Linguistics and Chinese Language …, 2004 – aclweb.org … Therefore, automatic extraction of monolingual and bilingual collocations is important for many applications, including natural language generation, word sense disambiguation, machine translation, lexicography, and cross language information retrieval. … Cited by 20 Related articles All 20 versions

[PDF] from liu.se [PDF] Iterative development of an information-providing dialogue system P Johansson, L Degerstedt, A Jönsson – Proceedings of 7th ERCIM …, 2002 – ida.liu.se … feature structures, grammar formalisms and parsing, knowledge representation and natural language generation. Chapter 3 Problem Statement develops the purpose stated above … Finally, natural language generation is described in section 2.6 Natural Language Generation. … Cited by 13 Related articles All 18 versions

[PDF] from unitn.it [PDF] Nuove acquisizioni 16-31 marzo 2011 A Acero, I Aleksander – 2011 – unitn.it Page 1. Sistema Bibliotecario di Ateneo Biblioteca Polo Facoltà di Scienze Sommarive, 14 – 38100 Povo (Trento), Italy – Tel. +39 0461/881510, Fax +39 0461/882050 Biblioteca di Scienze Nuove acquisizioni 16-31 marzo 2011 … Related articles All 3 versions

[PDF] from psu.edu [PDF] Recent Developments in Human Language Technology W Winiwarter – 2002 – Citeseer … For integrating natural language generation and VoiceXML there is no serious technical difficulty. … The first task of the parsing component is to build a graph representation of the query. In our implementation we use the Link Grammar Parser (LGP) [10, 14] for this task. … Related articles All 10 versions

[PDF] from mit.edu Using analogy to acquire commonsense knowledge from human contributors T Chklovski – 2003 – dspace.mit.edu … 139 A Link Grammar Parser 147 B FramerD 149 C Natural Language Generation 150 D Deriving the Amount of Correlation Due to Chance 153 8 Page 10. List of Figures 2.1 Screenshot of acquiring knowledge about “newspaper.” . 27 … Cited by 28 Related articles All 26 versions

[PDF] from holger-wunsch.de [PDF] Annotation Grammars and their compilation into Annotation Transducers M im Fach, AS und Nebenfacher, H Wunsch – 2003 – holger-wunsch.de … be capable of automatically generating the presentation itself. The results of a very sophisticated IE system could be fed into a natural language generator, that creates a new text based on the IE data in a different language, a way to build automatic translation tools. … Related articles All 7 versions

[PDF] from uottawa.ca [PDF] Automatic summarization of short fiction A Kazantseva – 2006 – site.uottawa.ca … The first stage is the similar for both abstractive and extractive summarizers. The second stage is unique to abstracting, but it is closer to Natural Language Generation than to text summarization. This is why I omit abstracting in this review. … Related articles All 4 versions

[PDF] from ipc.pt [PDF] Relaçoes Lexicais na Geraçao de Lingua Natural MD Mendes – 2004 – estgoh.ipc.pt … conjunto alargado de frases, ou mesmo uma frase de diferentes maneiras 1John Bateman e Michael Zock (2003) List of Natural Language Generation Systems, em http://www.fb10.uni- bremen.de/anglistik/langpro/NLG-table/ (em 30 de Julho de 2003). 8 Page 26. … Cited by 1 Related articles All 2 versions