Context-Free Grammar & Natural Language Generation


Context-Free Grammar

Wikipedia:

See also:

CFG (Context-free Grammar) ParsersGrammar Parsing & Natural Language GenerationNatural Language & Time Series Prediction 2013PCFG (Probabilistic Context Free Grammar) & Dialog SystemsSemantic Grammars & Dialog Systems


Natural Language Generation with Vocabulary Constraints B Swanson, RI Providence, E Yamangil, E Charniak – ACL 2014, 2014 – acl2014.org … cO2014 Association for Computational Linguistics Natural Language Generation with Vocabulary Constraints Ben Swanson Brown University Providence, RI chonger … This is simply a convenient rephrasing of the Context Free Grammar formalism, and as such the systems we …

Alexander Clark, Chris Fox and Shalom Lappin (eds): Handbook of computational linguistics and natural language processing P Banerjee – Machine Translation, 2012 – Springer … paradigm of structured language models aimed at capturing the complex dependencies inherent in natural language based on probabilistic context-free grammar (PCFG). … The problem of Natural Language Generation (NLG) has been covered in Chapter 20 by Ehud Reiter. … Related articles All 9 versions

Unsupervised concept-to-text generation with hypergraphs I Konstas, M Lapata – Proceedings of the 2012 Conference of the North …, 2012 – dl.acm.org … Rather than breaking up the generation pro- cess into a sequence of local decisions, we de- fine a probabilistic context-free grammar that globally describes the inherent structure of the input (a corpus of database records and text describing some of them). … Cited by 14 Related articles All 6 versions

Concept-to-text generation via discriminative reranking I Konstas, M Lapata – Proceedings of the 50th Annual Meeting of the …, 2012 – dl.acm.org … prob- lem. We define a probabilistic context-free grammar that describes the structure of the in- put (a corpus of database records and text de- scribing some of them) and represent it com- pactly as a weighted hypergraph. The … Cited by 16 Related articles All 5 versions

Planning-Based Models of Natural Language Generation K Garoufi – Language and Linguistics Compass, 2014 – Wiley Online Library … The synergy between communicative and physical act planning becomes most obvious in situated natural language generation, where language unfolds in the … in this hierarchy is that of so-called surface speech acts, which, using a simple context-free grammar, can translate an … Cited by 3 Related articles All 2 versions

Natural language parsing using Fuzzy Simple LR (FSLR) parser SG Kanakaraddi, V Ramaswamy – … Conference (IACC), 2014 …, 2014 – ieeexplore.ieee.org … This paper discusses a procedure for constructing an LR parse table from Fuzzy context free grammar and using this table the input sentence is tested for … NLP is a technology that concerns with natural language generation (NLG) and natural language understanding (NLU). … Related articles

Inducing Document Plans for Concept-to-Text Generation. I Konstas, M Lapata – EMNLP, 2013 – aclweb.org … The input to our model is a set of database records and collocated descriptions, exam- ples of which are shown in Figure 1. Given this input, we define a probabilistic context-free grammar (PCFG) that captures the structure of the database and how it can be verbal- ized. … Cited by 1 Related articles All 2 versions

Describing video contents in natural language MUG Khan, Y Gotoh – Proceedings of the Workshop on Innovative Hybrid …, 2012 – dl.acm.org … 4 Natural Language Generation … These objects are usually helpful for description of background and scene settings. A template filling approach based on context free grammar (CFG) is implemented for sentence generation. … Cited by 6 Related articles All 6 versions

Cortical neurocomputation, language and cognition RW Kentridge – Connectionist Models of Memory and Language ( …, 2014 – books.google.com … In other words, if we can only meaningfully interpret a code produced by an unknown machine with a context-free grammar then we … It is reasonably certain that natural language generation requires computational power above the lowest level of the hierarchy, regular grammar. … Related articles

Hesitant fuzzy linguistic term sets for decision making RM Rodriguez, L Martinez… – Fuzzy Systems, IEEE …, 2012 – ieeexplore.ieee.org … This decision model manages such linguistic expressions by means of its representation using Hesitant Fuzzy Linguistic Term Sets. Index Terms— Hesitant fuzzy sets, linguistic information, fuzzy linguistic approach, context-free grammar, linguistic decision making. … Cited by 170 Related articles All 6 versions

[BOOK] Speech and Language Processing D Jurafsky, JH Martin – 2014 – cs.colorado.edu … This includes the context-free grammar, first defined by Chomsky (1956) for natural languages but independently discovered by Backus (1959) and Naur et al. … This period also saw considerable work on natural language generation. 1.6.5 The Field Comes Together: 1994–1999 … Cited by 31 Related articles All 18 versions

Incremental Structured Prediction Using a Global Learning and Beam-Search Framework Y Zhang, M Zhang, T Liu – ACL 2014, 2014 – ling.uni-potsdam.de … Overview 2.2 Word segmentation 2.3 Joint segmentation and POS-tagging 2.4 Dependency parsing 2.5 Context free grammar parsing 2.6 … Dr Zhang’s research interest includes natural language pars- ing, natural language generation, machine trans- lation and machine learning …

A Global Model for Concept-to-Text Generation. I Konstas, M Lapata – J. Artif. Intell. Res.(JAIR), 2013 – jair.org … Rather than breaking up the generation process into a sequence of local decisions, we define a probabilis- tic context-free grammar that globally describes the inherent structure of the input (a corpus of database records and text describing some of them). … Cited by 1 Related articles All 3 versions

LFG generation by grammar specialization J Wedekind, RM Kaplan – Computational Linguistics, 2012 – MIT Press … we observe that the edges of a generation chart can be interpreted as rules of a specialized context-free grammar, just as in … for linguistic analysis (Kaplan and Bresnan 1982), this restriction does not seem to limit the applicability of our algorithm for natural language generation. … Cited by 2 Related articles All 7 versions

Constituent structure representation of Pashto Endoclitics A Din, B Ranaivo-Malancon, MGA Malik – … of the Fifth Workshop on South …, 2014 – aclweb.org … Page numbers and proceedings footer are added by the organisers. Licence details: http://creativecommons. org/licenses/by/4.0/ 74 Page 87. ment of Context Free Grammar (CFG) rules for endoclitic generation in natural language generation systems. …

Optimising incremental dialogue decisions using information density for interactive systems N Dethlefs, H Hastie, V Rieser, O Lemon – Proceedings of the 2012 Joint …, 2012 – dl.acm.org … 2000). This algorithm takes a set of strings as input and computes a context-free grammar as output by align- ing strings based on Minimum Edit Distance. We use the n?gram language models trained earlier to 88 Page 8. Attribute … Cited by 14 Related articles All 7 versions

DiSeg 1.0: The first system for Spanish discourse segmentation I Da Cunha, E San Juan, JM Torres-Moreno… – Expert Systems with …, 2012 – Elsevier … The FreeLing chunker is a bottom-up parser based on Hidden Markov Model (HMM) classifiers, which uses a Context Free Grammar (CFG) and provides shallow parsed trees or chunks with relative depth. The implemented algorithm assigns a priority to each chunk. … Cited by 13 Related articles All 8 versions

Communication Aspects: How Landmarks Enrich the Communication Between Human and Machine KF Richter, S Winter – Landmarks, 2014 – Springer … there have been several attempts of breaking up these monotonous directions with more variation, using methods from natural language generation (NLG … With pCRU, these variations can be formalized in a context-free grammar, 2 and each possible variation can be assigned a … Related articles

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 6 Related articles All 12 versions

A Probabilistic Approach to Text Generation of Human Motions extracted from Kinect Videos M Kobayashi, I Kobayashi, H Asoh… – Proceedings of World …, 2013 – iaeng.org … representation in which both the meaning representation and natural language are encoded in a tree, and showed their model performs better than a previous state-of-the-art natural language generation model. … [12], [13] define a probabilistic context-free grammar that globally … Related articles

Intelligent CALL M Schulze, T Heift – Contemporary Computer-Assisted Language …, 2012 – books.google.com … for German for elementary-school children, The Sentence Fairy, which deploys natural language generation technology to … separating tokensforlaterlinguistic analysis) andamorphologicalanalysis, and parses the sentential input syntactically using a context-free grammar. … Related articles All 2 versions

Using genetic algorithms to create meaningful poetic text R Manurung, G Ritchie, H Thompson – Journal of Experimental & …, 2012 – Taylor & Francis … A context-free grammar guides exhaustive search for phrases that match the semantic items, with chart generation (Kay 199622 … Poetry generation can be viewed as a specialised instance of natural language generation, or NLG, a subfield of artificial intelligence that focuses on … Cited by 16 Related articles All 4 versions

Implementation of semantic analyzer in Indonesian text-understanding evaluation system F Ferdian, A Purwarianti – Computational Intelligence and …, 2012 – ieeexplore.ieee.org … Pergi VBT Transitive Verb Membeli The syntactic parser employed is Afif’s parser which uses probabilistic context free grammar as formal … Technique in this natural language generation task is template filling, which generate sentences based on certain template rule [6]. This … Cited by 6 Related articles

Question Answering of InformativeWeb Pages: How Summarisation Technology Helps J De Belder, D de Kok, G van Noord, F Nauze… – Essential Speech and …, 2013 – Springer … of this project that in a way limits the range of possibilities for sentence compression algorithms, is that Dutch is not a context free language, which means that we can’t make use of the large number of methods for English that build on a Probabilistic Context Free Grammar (eg [8 … Cited by 1 Related articles All 3 versions

An eye-tracking evaluation of some parser complexity metrics MJ Green – Proceedings of the 3rd Workshop on Predicting and …, 2014 – aclweb.org … k+ 1. So the prefix probability of word wk+ 1 with respect to a probabilistic context free grammar (PCFG) de- noted G is given by the sum of the probability of all … An investiga- tion into the validity of some metrics for automat- ically evaluating natural language generation sys- tems. … Cited by 2 Related articles All 2 versions

Hierarchical multiagent reinforcement learning for coordinating verbal and non-verbal actions in robots H Cuayáhuitl, N Dethlefs – ECAI Workshop on Machine Learning for …, 2012 – lirmm.fr … sition from state s to state s;(e) a language L that is represented as a context-free grammar (CFG) to … [7] N. Dethlefs and H. Cuayáhuitl,’Hierarchical Reinforcement Learning for Adaptive Text Generation’, in International Conference on Natural Language Generation (INLG), Dublin … Cited by 8 Related articles All 7 versions

Flexible Combinatory Categorial Grammar Parsing Using the CYK Algorithm and Answer Set Programming P Schüller – Logic Programming and Nonmonotonic Reasoning, 2013 – Springer … The CYK algorithm was originally proposed for parsing Context Free Grammar in Chomsky Normal Form [12, 19, 33], ie, grammars with rules of the form A ? BC (corresponding to binary CCG combinators) and A ? c (corresponding to application of the function f) only, where A … Related articles All 6 versions

Seeing What You’re Told: Sentence-Guided Activity Recognition In Video N Siddharth, A Barbu, JM Siskind – arXiv preprint arXiv:1308.4189, 2013 – arxiv.org … generation One can take a video D as input and systematically search the space of all possible ? that correspond to sentences that can be generated by a context-free grammar and find that sentence that corresponds to the ?? for which (??,Z?) = S(D, ??) yields the maximal ? … Cited by 2 Related articles All 5 versions

Towards Object Descriptions in Natural Language from Qualitative Models. Z Falomir, LM Cabedo, P Ródenas, I Sanz – CCIA, 2012 – books.google.com … 6. Conclusions and Future Work A context-free grammar G (QODNL) is de?ned in this paper for obtaining a narrative description of the shape and colour of the objects within digital … In Proceedings of the Fifth International Natural Language Generation Conference (INLG ’08). … Cited by 1 Related articles All 6 versions

Basic Classes of Grammars with Prohibition M Burgin – arXiv preprint arXiv:1302.5181, 2013 – arxiv.org … As a result, the principal limitation of existing programs that perform natural language generation is that they … A grammar G that belongs to G12 is called context-sensitive\context- free grammar and the corresponding language L(G) is called … Related articles All 2 versions

A semi supervised learning model for mapping sentences to logical forms with ambiguous supervision M Le Nguyen, A Shimazu – Data & Knowledge Engineering, 2014 – Elsevier … We assume that all MRLs are defined by a deterministic context-free grammar (we call MRL grammar) which ensures that every MR will have a … Natural language generation: P(w|e) models the probability of w from the MR event e. Similar to [19], we applied a generative model … Related articles All 4 versions

Spoken Question Answering using Tree-structured Conditional Random Fields and Two-layer Random Walk SR Shiang, H Lee, L Lee – Fifteenth Annual Conference of the …, 2014 – 193.6.4.39 … From the parse trees, ordered and well-structured probabilistic context-free grammar information regarding the input word sequence can be obtained, including the part-of-speech (POS) tags … [15] Wei Lu, Hwee Tou Ng and Wee Sun Lee, Natural Language Generation with Tree …

Combining visual recognition and computational linguistics: linguistic knowledge for visual recognition and natural language descriptions of visual content M Rohrbach – 2014 – scidok.sulb.uni-saarland.de … 25 2.3.2 Grounding linguistic expressions in images or videos . . . . . 27 2.3.3 Natural language generation from images and video . . . . . 29 2.3.4 Relations to our work . . . . . … 138 9.2.2 Natural language generation from images and video . . . . . … Related articles

Evaluating Syntactic Sentence Compression for Text Summarisation P Perera, L Kosseim – Natural Language Processing and Information …, 2013 – Springer … Their model was designed considering two key features: preserving grammaticality and preserving useful information. In order to calculate the probabilities, they have used context free grammar parses of sentences and a word based bi-gram estimation model. … Cited by 2 Related articles All 4 versions

Efficient latent structural perceptron with hybrid trees for semantic parsing J Zhou, J Xu, W Qu – Proceedings of the Twenty-Third international joint …, 2013 – dl.acm.org … 2246 Page 2. and Mooney, 2007] learns a synchronous context-free grammar (SCFG) for semantic parsing based on machine translation techniques. [Kate and Mooney, 2006] introduce a semantic parser called KRISP based on string kernels. … Cited by 1 Related articles All 4 versions

[BOOK] Natural language in business process models H Leopold – 2013 – Springer … NA No-Action Style NL Natural Language NLG Natural Language Generation NLP Natural Language Processing NP Noun Phrase OANC Open American National Corpus ORM Object-Role Modeling PCFG Probabilistic Context Free Grammar PM Process Model PQ Participle … Cited by 2 Related articles

Towards creation of a corpus for argumentation mining the biomedical genetics research literature NL Green – ACL 2014, 2014 – ling.uni-potsdam.de … Statistical techniques were used for the first three stages, while manually constructed context-free grammar rules were used for argumentation … Analysis of communication of un certainty in genetic counseling patient letters for design of a natural language generation system. … Cited by 2

Understandability of Generated Database Query Descriptions A Johansson, H Hägglund – 2014 – diva-portal.org … C-Phrase include both a natural language processing (NLP) part and natural language generation part. … A-SCFG, (semantic context free grammar) is used to define lexical rules, for every named relation the system generates a few default rules, these rules are modifiable in the …

MyProLang-My Programming Language: A Template-Driven Automatic Natural Programming Language Y Bassil, A Barbar – arXiv preprint arXiv:1204.0221, 2012 – arxiv.org … An automatic programming language can exploit natural language generation techniques with the purpose of producing natural source-code instead of … source-to-source compiler is composed of a lexical analyzer, recursive-descent parser of context-free grammar, a semantic … Cited by 3 Related articles All 9 versions

Semantic research in computational linguistics A Koller, M Pinkal – 2012 – ling.uni-potsdam.de … This is the inference problem. Analogous problems occur in natural language generation. Early research in artificial intelligence (AI) focused on approaches to these problems that were largely disconnected from linguistics. … Cited by 1 Related articles All 2 versions

Joint models for concept-to-text generation I Konstas – 2014 – era.lib.ed.ac.uk … in a uniform joint manner. Rather than breaking up the generation process into a se- quence of local decisions, we define a probabilistic context-free grammar that glob- … We construct a syntactic probabilistic context-free grammar that globally captures the conceptual input … Related articles

[BOOK] Language Production and Interpretation: Linguistics meets Cognition H Zeevat – 2014 – books.google.com … Important at that same time were talks of and discussions with Robert Dale on natural language generation which convinced me that pronouns should be looked at from the production perspective in order to get a com- prehensible theoretical picture. … Cited by 2 Related articles All 2 versions

Context Awareness and Personalization in Dialogue Planning RWH Fisher – 2014 – cs.cmu.edu … Recently there has been growing interest in natural language generation and dialogue plan- ning using machine learning techniques. … The Stanford Parser Probabilistic Context-Free Grammar (PCFG) suite is used to extract syn- tactic information from the input sentence[38]. … Related articles All 2 versions

Dialogue Control Technique Based On Confidence Confirmation Algorithm In Automatic Speech Recognition System CCA IN – Journal of Theoretical and Applied Information …, 2012 – jatit.org … Together with advances in robust parsing techniques, natural language generation algorithms, and the advent of high-quality speech synthesis systems … This is done with natural language system which parses from a context free grammar augmented with feature unification and … Related articles All 2 versions

Design for a Voice-Based Recipe Book-From a Communicative Perspective X Chen – 2013 – gupea.ub.gu.se … Structural approaches are derived from either a computational background or a linguistic background, which can be represented by a finite-state automation or a CFG (context-free grammar). They assume that in all dialogues or interactions, there are regularly structured … Related articles

Text to Speech in New Languages without a Standardized Orthography S Sitaram, GK Anumanchipalli, J Chiu… – Proceedings of 8th …, 2013 – parlikar.com … using a phonetic form to represent the speech to be generated, and produce a string of phones from the natural language generation model in the … A stochastic context free grammar is trained on such parses of accent groups, so as to allow prediction of accent groups for unseen … Cited by 3 Related articles All 3 versions

Toward Semantic Machine Translation J Andreas – 2012 – academiccommons.columbia.edu … representation language, Wong and Mooney’s wasp [WM06] which learns a synchronous context free grammar over logical expressions and natural language representations, and … related to the parsing problem. Early natural language generation systems, like their coun- … Related articles

Morpho-Syntactic Analysis Framework for Tone Language Text-to-Speech Systems M Ekpenyong, EO Udoh – Computer and Information Science, 2012 – ccsenet.org … One method of providing such knowledge to the parser is to write a grammar of the language – a set of rules for syntactic analysis. The grammar rules of a language for instance, can be written using a context-free grammar (CFG) (Sipser, 2006; Flajolet, 1987). … Cited by 1 Related articles All 2 versions

Controlled Syntax for Thai Software Requirements Specification K Thongglin, S Cardey… – Tools with Artificial …, 2012 – ieeexplore.ieee.org … Backus Naur Form is a formal notation for specifying the production rules of a syntax devised by John Backus and Peter Naur. It is the technique used for context-free grammar [49, 50]. … [9] F. Chantree, “Ambiguity management in natural language generation”. … Cited by 1 Related articles All 2 versions

Stylometric analysis of scientific articles S Bergsma, M Post, D Yarowsky – … of the 2012 Conference of the North …, 2012 – dl.acm.org … 6.2). CFG Rules: We include a feature for every unique, single-level context-free- grammar (CFG) rule appli- cation in a paper (following Baayen et al. (1996), Gamon (2004), Hirst and Feiguina (2007), Wong and Dras (2011)). … Cited by 29 Related articles All 7 versions

Combining graph connectivity and genetic clustering to improve biomedical summarization HD Menéndez, L Plaza… – … Computation (CEC), 2014 …, 2014 – ieeexplore.ieee.org … Ab- stractive approaches require complex semantic representation, inference and natural language generation, which have not still reached a mature stage nowadays [16]. … The genotype is a context- free grammar whose fitness is evaluated on the basis of how well it covers a …

Real-World Semi-Supervised Learning of POS-Taggers for Low-Resource Languages. D Garrette, J Mielens, J Baldridge – ACL (1), 2013 – cs.utexas.edu … Our approach involves building a probabilistic context-free grammar for each author and using this grammar as a language … Learning for Semantic Parsing and Natural Language Generation Using Statistical Machine Translation Techniques [Details] Yuk Wah Wong PhD … Cited by 5 Related articles All 7 versions

Natural Language Descriptions for Video Streams MUG Khan – 2012 – etheses.whiterose.ac.uk … Such resource can also be used to evaluate automatic natural language generation systems for videos. 3 Page 15. … These features are converted into natural language descriptions using context free grammar. Contribution 3: Dealing with Missing and Erroneous Data … Related articles All 7 versions

[BOOK] Taking scope: The natural semantics of quantifiers M Steedman – 2012 – books.google.com Page 1. TAKING SCOPE The Natural Semantics of Quanti?ers J MARK STEEDMAN Page 2. Taking Scope Page 3. Page 4. Taking Scope Mark Steedman The Natural Semantics of Quantifiers The MIT Press Cambridge, Massachusetts London, England Page 5. … Cited by 28 Related articles All 2 versions

Gerald Penn DG Hays – Philosophy of Linguistics, 2012 – books.google.com … less portable across language pairs. Statistical approaches to surface realization and other problems in natural language generation came relatively later than in pars- ing, but their value is now also clear. In this later work, we … Related articles All 2 versions

Supertagging With Combinatory Categorial Grammar For Dependency Parsing BK AKKUS – 2014 – ceng.metu.edu.tr … of Ajdukiewicz [1] and Bar-Hillel [7].CG is equivalent to Context Free Grammar. CCG provides a transparent interface between surface syntax and underlying seman- … and Steedman [27], Clark and Curran [18]), natural language generation (White and …

Grounded language learning models for ambiguous supervision JH Kim – 2013 – repositories.lib.utexas.edu … 34 3.5 Natural language generation (surface realization) results (BLEU score). . . . … Next, we present two unsupervised probabilistic context-free grammar (PCFG) induction models evaluated on the navigation task previously inves- tigated by Chen and Mooney (2011). … Related articles All 3 versions

[BOOK] Multilingual text generation from structured formal representations D Dannélls – 2013 – gupea.ub.gu.se … ABSTRACT This thesis aims to identify the optimal ways in which natural language generation techniques can be brought to bear upon the problem of pro- cessing a structured body of information in order to devise a coherent presentation of text content in multiple languages. … Related articles All 2 versions

On Applying Controlled Natural Languages for Ontology Authoring and Semantic Annotation BP Davis – 2013 – vmserver14.nuigalway.ie … The reversal of the CNL authoring process involves generation of the controlled language from an existing ontology using Natural Language Generation (NLG) techniques, which results in a round … 40 2.5 Natural Language Generation . . . . . … Cited by 1 Related articles All 2 versions

Towards abstractive speech summarization: Exploring unsupervised and supervised approaches for spoken utterance compression F Liu, Y Liu – Audio, Speech, and Language Processing, IEEE …, 2013 – ieeexplore.ieee.org … [26], [27] applied the noisy-channel framework to predict the possibilities of translating a sentence to a shorter word sequence. [28] extended the noisy-channel approach and proposed a Markovization formulation of the synchronous context-free grammar (SCFG). [29], [30] … Cited by 5 Related articles All 2 versions

Automating Dictionary Mappings for Translating Natural Language Descriptions to Domain Specific Language Programs V Hingorani – 2014 – static.cse.iitk.ac.in … in our case is a more formal language with context-free-grammar that can also be used as a computer language. … a Dictionary and a Benchmark Suite. 1. DSL Definition: It includes a Context Free Grammar G which in turn contains terminals that …

UniSpaCh: A text-based data hiding method using Unicode space characters L Yee, KS Wong, KO Chee – Journal of Systems and Software, 2012 – Elsevier … Probabilistic context-free grammar, synonym substitution, natural language generation, text paraphrasing, and sentence tree structure manipulation are some of the common techniques in NLP-based data embedding (Topkara et al., 2005). … Cited by 19 Related articles All 9 versions

Multiway Tensor Factorization for Unsupervised Lexical Acquisition T Van de Cruys, L Rimell… – … of COLING 2012: …, 2012 – halshs.archives-ouvertes.fr … application to SCF acquisition remains limited. Carroll and Rooth (1996) combined a head-lexicalized context-free grammar with an expectation-maximization (EM) algorithm to acquire an SCF lexicon. D?ebowski (2009) used a … Cited by 14 Related articles All 15 versions

A Rhetorical Analysis Approach to Natural Language Processing B Englard – arXiv preprint arXiv:1301.3547, 2013 – arxiv.org … This algorithm ends up producing writing with a Context-Free Grammar, writing generated by applying a set of recursive productions to an initial non-terminal, until a final goal is reached [10]. The next goal of the Natural Language Generation system was to develop a method by … Related articles All 2 versions

Domain-And Language-Adaptive Natural Language Controlling Framework P Barabás – 2013 – iit.uni-miskolc.hu Page 1. UNIVERSITY OF MISKOLC FACULTY OF MECHANICAL ENGINEERING AND INFORMATICS DOMAIN- AND LANGUAGE-ADAPTIVE NATURAL LANGUAGE CONTROLLING FRAMEWORK Ph.D Dissertation AUTHOR: Péter Barabás MSc in Information Engineering … Related articles All 4 versions

Natural Language Processing-A Survey K Mote – arXiv preprint arXiv:1209.6238, 2012 – arxiv.org … have to be capable of interacting with humans via language, which includes understanding humans via speech recognition and natural language understanding (and, of course, lip-reading), and of communicating with humans via natural language generation and speech … Related articles All 2 versions

Automatic abstractive summarization of meeting conversations T Oya – 2014 – elk.library.ubc.ca … It first maps specific information onto conversation ontologies and then generates summaries by using an existing natural language generation tool. … sentence compression. This channel model was created from stochastic context-free grammar. …

Probabilistic grammar induction from sentences and structured meanings TM Kwiatkowski – 2012 – era.lib.ed.ac.uk Page 1. This thesis has been submitted in fulfilment of the requirements for a postgraduate degree (eg PhD, MPhil, DClinPsychol) at the University of Edinburgh. Please note the following terms and conditions of use: • This work … Cited by 1 Related articles All 2 versions

Statistical machine translation for speech: A perspective on structures, learning, and decoding B Zhou – Proceedings of the IEEE, 2013 – ieeexplore.ieee.org … In Section IV, we further inspect the synchronous context-free grammar (SCFG)-based formalism that includes both hierarchical phrase-based and many linguistically syntax-based models. SCFG is a more general formalism than FST. … Cited by 3 Related articles All 4 versions

Harvesting and summarizing user-generated content for advanced speech-based human-computer interaction J Liu – 2012 – dspace.mit.edu Page 1. Harvesting and Summarizing User-Generated Content for Advanced Speech-Based Human-Computer Interaction by Jingjing Liu Submitted to the Department of Electrical Engineering and Computer Science in partial fulfillment of the requirements for the degree of … Cited by 1 Related articles All 4 versions

LFG parse disambiguation for Wolof CMB Dione – Journal of Language Modelling, 2014 – jlm.ipipan.waw.pl … The parsing phase covers the topics of the formal encoding of noun class indeterminacy via under- specification, the application of syntactic constraints, lexical specifi- cations and the use of a probabilistic context-free grammar. …

Automatic question generation: a syntactical approach to the sentence-to-question generation case HDAD Ali – 2012 – uleth.ca … Thus, Question Generation (QG) and Question Answering (QA) became the two major challenges for the Natural Language Processing (NLP), Natural Language Generation (NLG), Intelligent Tutoring System, and Information Retrieval (IR) communities, recently. … Related articles All 3 versions

Refining translation grammars through paraphrase clustering E Garmash – 2012 – illc.uva.nl … another language. On the other hand, the output of translation has to be well-formed from the perspective of the structure of the output language. Thus, MT also subsumes the problem of natural language generation. Further, as … Related articles All 4 versions

Voice in the User Interface A Breen, HH Bui, R Crouch, K Farrell… – Interactive Displays: …, 2014 – books.google.com … extracting the desired information from either structured or unstructured data sources, constructing an answer by applying natural language generation (NLG), and … recognized by a grammar is described by a formal grammar, eg a finite-state machine, or a context-free grammar. …

A music search engine based on a contextual related semantic model A GALLO – 2014 – politesi.polimi.it … songs, computed with [3] . . . . 33 3.9 Tempo Detection for two songs, computed with [3] . . . . 34 3.10 The 2D Valence-Arousal emotion plane, with some mood terms approximately mapped [4] . . . . 35 3.11 Parse tree example of a context-free grammar derivation … Related articles All 2 versions

[BOOK] Introducing Spoken Dialogue Systems into Intelligent Environments T Heinroth, W Minker – 2012 – books.google.com Page 1. Tobias Heinroth – Wolfgang Minker Introducing Spoken Dialogue Systems into Intelligent Environments ‘a Springer Page 2. Introducing Spoken Dialogue Systems into Intelligent Environments Page 3. Page 4. Tobias Heinroth … Cited by 10 Related articles All 8 versions

Technologies and Tools for Lexical Acquisition L Rimell, A Korhonen, V Quochi, N Bel, T Caselli… – 2014 – repositori.upf.edu … Ersan and Charniak (1996) incorporated statistical information for verbs, nouns, and adjectives into a probabilistic context- free grammar (PCFG) parser, followed by an analysis of the PCFG rules to determine … Natural language generation in the context of machine translation. … Related articles All 6 versions

A Proposed Software Description Language for Representing Program Logic in XML K Mahmoud – 2012 – content.grin.com … 7 2-2 Context Free Grammar Types 8 … Page 24. 8 Phrase-structure grammars have four types; type 3 (regular grammar), type 2 (context free grammar), type 1 (context sensitive grammar) and type 0 (Rosen, 2011). Those types differ in the way productions are written. … Related articles

Nonstrict Hierarchical Reinforcement Learning for Interactive Systems and Robots H Cuayáhuitl, I Kruijff-Korbayová… – ACM Transactions on …, 2014 – dl.acm.org Page 1. 15 Nonstrict Hierarchical Reinforcement Learning for Interactive Systems and Robots HERIBERTO CUAY ´AHUITL, Heriot-Watt University, United Kingdom IVANA KRUIJFF-KORBAYOV ´A, German Research Centre … Cited by 1

A Proposed Software Description Language for Representing Program Logic in XML KZ Mahmoud – 2012 – meu.edu.jo … 7 2-2 Context Free Grammar Types 8 … Page 22. 8 Phrase-structure grammars have four types; type 3 (regular grammar), type 2 (context free grammar), type 1 (context sensitive grammar) and type 0 (Rosen, 2011). Those types differ in the way productions are written. … Related articles All 2 versions

Speech-centric information processing: An optimization-oriented approach X He, L Deng – Proceedings of the IEEE, 2013 – ieeexplore.ieee.org … The latter includes gener- ative models/methods of hidden Markov model (HMM) and composite HMM/context-free grammar (CFG) and … Further additions of natural language generation, text-to-speech synthesis, and user modeling components will complete the full, closed-loop … Cited by 14 Related articles All 11 versions

Enriching Models for Statistical Machine Translation and Predicting their Accuracies P Kolachina – 2012 – web2py.iiit.ac.in … channel model used in SMT. In the case of syntax-directed models, parallel corpora annotated with syntactic information is used to extract a synchronous context-free grammar for a specific language pair. The decoder constructs a … Related articles

Style-Specific Phrasing in Speech Synthesis A Parlikar – 2013 – lti.cs.cmu.edu Page 1. Style-Specific Phrasing in Speech Synthesis Alok Parlikar CMU-LTI-13-012 Language Technologies Institute School of Computer Science Carnegie Mellon University 5000 Forbes Avenue Pittsburgh, PA 15213 Thesis Committee Alan W Black Carnegie Mellon … Cited by 3 Related articles All 5 versions

Identification of Events in Use Cases J Jurkiewicz – 2013 – fcm.put.poznan.pl … Non-functional Requirement NLP Natural Language Processing NLG Natural Language Generation NRMSD Normalized Root Mean Squared Deviation O OMG Object Management Group Page 12. List of Abbreviations VI P PCFG Probabilistic Context Free Grammar POS Part … Related articles All 4 versions

Detecting Grammatical Errors with Treebank-Induced, Probabilistic Parsers J Wagner – 2012 – core.kmi.open.ac.uk 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 5 Related articles All 7 versions

End-to-End Discourse Parsing with Cascaded Structured Prediction S Ghosh – 2012 – eprints-phd.biblio.unitn.it … 18 1.1.4.4 Summarization . . . . . 19 1.1.4.5 Question Answering . . . . . 20 1.1.4.6 Natural Language Generation . . . . . 21 1.1.4.7 Statistical Machine Translation . . . . . 21 1.1.4.8 Misc. . . . . 22 1.2 Corpora . . . . . … Cited by 2 Related articles

A Chatbot Dialogue Manager-Chatbots and Dialogue Systems: A Hybrid Approach A Woudenberg – 2014 – dspace.learningnetworks.org … 18 3.4.2 Text-to-speech synthesis . . . . . 19 3.4.3 Natural language understanding . . . . . 19 3.4.4 Natural language generation . . . . . 21 3.4.5 Dialogue manager . . . . . 21 iv Page 8. 3.4.6 Task manager . . . . . …

Lexical Cohesion Analysis For Topic Segmentation, Summarization And Keyphrase Extraction G Ercan – 2012 – thesis.bilkent.edu.tr … computational model and the Natural Language Generation (NLG) component maps the computational model to natural language. For both NLG and NLU, we … Building abstracts usually involves natural language generation from a model, transformation or compression of the …

An overview of computational challenges in online advertising RE Chatwin – American Control Conference (ACC), 2013, 2013 – ieeexplore.ieee.org Page 1. An Overview of Computational Challenges in Online Advertising Richard E. Chatwin1 Abstract— Online advertising is a large and rapidly growing business. The major players in the space, namely advertis- ers, publishers … Cited by 2 Related articles

Blog Mining and Emotion Argumentation Argumentation SBSBS Bandyopadhyay – 2012 – dspace.jdvu.ac.in Page 1. Blog Mining and Emotion Argumentation Argumentation Thesis submitted to the Faculty of Engineering & Technology, Jadavpur University In partial fulfillment of the requirements for the Degree Of Master of Computer … Related articles All 2 versions

Improved Integrated Mining of Heterogeneous Data in Decision Support Systems IT Fatudimu – 2012 – core.kmi.open.ac.uk Page 1. IMPROVED INTEGRATED MINING OF HETEROGENEOUS DATA IN DECISION SUPPORT SYSTEMS BY FATUDIMU, Ibukun Tolulope ( CUGP050145) B.Sc (Hons) Engineering Physics (Obafemi Awolowo University … Related articles All 3 versions

Statistical Dialog Management for Health Interventions U Yasavur – 2014 – digitalcommons.fiu.edu … strategy. The output module consists of a Natural Language Generation (NLG) system and a Text-To-Speech (TTS) engine. Depending on the domain of interest 8 Page 20. … 15 Page 27. • A statistical planning approach to natural language generation for Information …

Lost and Found in Translation: Cross-Lingual Question Answering with Result Translation K Parton – 2012 – cs.columbia.edu Page 1. Lost and Found in Translation: Cross-Lingual Question Answering with Result Translation Kristen Parton Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Graduate School of Arts and Sciences COLUMBIA UNIVERSITY … Related articles All 4 versions