CFG (Context-free Grammar) Parsers

Notes:

Context-free grammars (CFGs) are a type of formal grammar that is used to describe the structure of a language. They are called “context-free” because they do not take into account the context in which a particular word or phrase appears, but rather focus on the syntax of the language and the rules that govern how words and phrases can be combined to form sentences.

In contrast, dependency grammars are a type of formal grammar that describe the relationships between words in a sentence, specifically the dependencies between words. In a dependency grammar, each word in a sentence is represented as a node, and the relationships between words are represented as directed edges between nodes. This allows dependency grammars to capture the dependencies between words and to represent the structure of a sentence in a more fine-grained way than is possible with a context-free grammar.

Statistical or probabilistic grammars, such as ngram and skipgram grammars, are another type of grammar that is distinct from both context-free grammars and dependency grammars. These grammars use statistical or probabilistic techniques to model the structure of a language, and they are often used to build natural language processing systems that can handle a wide range of language inputs.

Resources:

Wikipedia:

Context-free Grammar (Phrase Structure Grammar)

Semantic understanding by combining extended CFG parser with HMM model Y Xu, S Seneff, A Li, J Polifroni Spoken Language Technology …, 2010 ieeexplore.ieee.org Abstract This paper presents a method for extracting both syntactic and semantic tags. An extended CFG parser works in conjunction with an HMM model, which handles unknown words and partially known words, to yield a complete syntactic and semantic interpretation … Cited by 2 Related articles All 3 versions

Applying semantic-based probabilistic context-free grammar to medical language processing–A preliminary study on parsing medication sentences H Xu, S AbdelRahman, Y Lu, JC Denny… Journal of Biomedical …, 2011 Elsevier … Our evaluation using a 10-fold cross validation showed that the PCFG parser dramatically improved parsing performance when compared to the CFG parser. Graphical abstract. Highlights. … In all experiments, the PCFG parser performed better than CFG parser. … Related articles All 4 versions

[PDF] from dcu.ie Closing the gap between stochastic and rule-based LFG grammars A Hautli, O Cetinoglu, J van Genabith 2010 doras.dcu.ie … The treebank function label tagger (Chrupala et al., 2007) (also trained on the Penn-II treebank) enriches the bare CFG parser output trees with further information by assigning treebank func- tion labels (where possible), eg adding SBJ to subject noun phrases (NP-SBJ), and … Related articles All 5 versions

A platform for the automatic generation of attribute evaluation hardware systems AC Dimopoulos, C Pavlatos… … Languages, Systems & …, 2010 Elsevier … Concerning the syntactic analysis, one significant factor that can positively influence the performance of the CFG parser is undoubtedly the selected parsing algorithm. … In [17] a highly efficient architecture for the hardware implementation of CFG parsers was presented. … Cited by 1 Related articles All 2 versions

[PDF] from ru.nl [PDF] Quantifying the challenges in parsing patent claims S Verberne, E D’hondt, N Oostdijk… Proceedings of the 1st …, 2010 lands.let.ru.nl … sources: (a) the Penn Treebank [20], (b) the British National Corpus BNC, (c) 79 Million words from the UKWAC webcorpus [3], POS tagged by the treetagger, (d) 7 Million words of patent claims from the CLEFIP [23] corpus parsed with the Connexor CFG parser [16], and (e … Cited by 10 Related articles All 9 versions

[PDF] from bitbucket.org [PDF] Toward an Extensible, Practical parser?-Adaptive Grammars T Davies 2010 bitbucket.org … CFGs and most CFG parsers offer no mechanism to add productions mid-parse which precludes introducing local syntactic changes. 2.3 Ambiguity Many CFGs are ambiguous, which means that there are several valid parse trees for some sequence of input tokens. … Related articles All 2 versions

[PDF] from grupolys.org Dependency parsing schemata and mildly non-projective dependency parsing C Gómez-Rodríguez, J Carroll, D Weir Computational Linguistics, 2011 MIT Press … 2. Dependency Parsing Schemata Although parsing schemata were originally defined for CFG parsers, they have since been adapted to other constituency-based grammar formalisms. This involves finding 542 Page 3. Gómez-Rodriguez, Carroll, and Weir … Cited by 5 Related articles All 12 versions

[PDF] from might.net Parsing with derivatives: a functional pearl M Might, D Darais, D Spiewak ACM SIGPLAN Notices, 2011 dl.acm.org … Categories and Subject Descriptors F.4.3 [Formal Languages]: Operations on languages General Terms Algorithms, Languages, Theory Keywords formal languages, parsing, derivative, regular expressions, context-free grammar, parser combinator … Cited by 4 Related articles All 3 versions

A Grammar Correction Algorithm L Clément, K Gerdes, R Marlet Formal Grammar, 2011 Springer … we present the algorithm at the heart of our system. We show how to detect, locate, and order minimal correction proposals, using a tweaked-up context free grammar parser. This is the central module of the open grammar checker … Related articles

Parsing Sanskrit sentences using Lexical Functional Grammar N Tapaswi, S Jain, V Chourey Systems and Informatics (ICSAI …, 2012 ieeexplore.ieee.org … The most common syntactic parsers today are probabilistic context free grammar parsers, which combine a context free grammar with a probability model which determines the most likely parse out of a large number of syntactic trees consistent with a given utterance. …

Chinese parsing model based on Constraint Dependency Grammar P Li, L Liao … and Networks (CECNet), 2012 2nd International …, 2012 ieeexplore.ieee.org … better than before. Charniak [4] developed a statistical Content-Free Grammar (CFG) parser and then built an effective language model based on it [5], which made a significantly improvement. Constraint Dependency Grammar … Related articles

[HTML] from nih.gov [HTML] An automated approach to calculating the daily dose of tacrolimus in electronic health records H Xu, S Doan, KA Birdwell, JD Cowan… AMIA Summits on …, 2010 ncbi.nlm.nih.gov … The MedEx system consists of a semantic tagger and a context free grammar parser that parses textual sentences into structured forms based on pre-defined semantic patterns. Figure 1 shows the components of MedEx, as well as an example of input and output of MedEx. … Cited by 1 Related articles All 10 versions

Improving Spatial Semantic Analysis by a Combining Model S Li, T Zhao, H Li E-Business and E-Government (ICEE), …, 2010 ieeexplore.ieee.org This paper presents a combination base machine learning approach to spatial semantic analysis in Chinese. The model consists of multiple pre-training classifiers and a gating mechanism for integrating the outputs of these classifiers. Then we use EM algorithm to train the parameters … Related articles All 4 versions

[PDF] from aclweb.org CuteForce: deep deterministic HPSG parsing G Ytrestøl Proceedings of the 12th International Conference on …, 2011 dl.acm.org … art parsers for the language in question.” CFG Sagae and Lavie (2005) present a de- terministic CFG parser grounded in the same classifier-based strategy that was pursued by Maltparser. Given that the search-space of constituent … Related articles All 8 versions

[PDF] from txstate.edu Prime-based mimic functions for the implementation of covert channels W Connell, D Tamir, M Guirguis … , Networking and Information …, 2010 ieeexplore.ieee.org … To increase the strength of this approach, Wayner developed mimic functions that map text into the production rules of a context-free grammar (CFG) and generate text that is accepted by a CFG parser [2]. The generated cover is shown to have theoretical strength, or resistance … Related articles All 3 versions

[PDF] from au.dk [PDF] Typed and Unambiguous Pattern Matching on Strings using Regular Expressions Tech report C Brabrand, JG Thomsen 2010 users-cs.au.dk Page 1. Typed and Unambiguous Pattern Matching on Strings using Regular Expressions Tech report Claus Brabrand IT University of Copenhagen, Denmark brabrand@itu.dk Jakob G. Thomsen* Aarhus University, Denmark jakob.g.thomsen@cs.au.dk June 15, 2010 … Related articles All 3 versions

[PDF] from au.dk Typed and unambiguous pattern matching on strings using regular expressions C Brabrand, JG Thomsen Proceedings of the 12th international ACM …, 2010 dl.acm.org Page 1. Typed and Unambiguous Pattern Matching on Strings using Regular Expressions Claus Brabrand IT University of Copenhagen, Denmark brabrand@itu.dk Jakob G. Thomsen Aarhus University, Denmark jakob.g.thomsen@cs.au.dk … Cited by 6 Related articles All 10 versions

The Research on Reordering Rule of Chinese-Mongolian Statistical Machine Translation SRGL Wang, QT Si, U Nasun Advanced Materials Research, 2011 Trans Tech Publ … Table 1 Sentences and tags of PCFG parser and its corresponding name Chinese phrase marks used the tagset of PCFG (Probabilistic Context Free Grammar) parser (see table 1 ). It is developed by Institute of Computing Technology, Chinese Academy of Sciences. …

[PDF] from tum.edu Putting people’s common sense into knowledge bases of household robots L Kunze, M Tenorth, M Beetz KI 2010: Advances in Artificial Intelligence, 2010 Springer … properties. First, each word is tagged with its syntactic category, and phrases like a verb phrase (VP) or a noun phrase (NP) are identified using the Stanford parser [11], a probabilistic context-free grammar parser. The part … Cited by 9 Related articles All 10 versions

[PDF] from rug.nl [PDF] Initial Experiments with Multilingual Extraction of Rhetoric Figures by means of PERL-compatible Regular Expressions DD Hromada Student Research Workshop, 2011 acl.eldoc.ub.rug.nl … While such a stylometric approach was currently implemented with encouraging results by (Gawryjolek, 2009), his system is operational only when combined with probabilistic context-free grammar parser adapted to English language, and hence 85 Page 2. … Related articles All 8 versions

A Grammar Correction Algorithm D Parsing, M Corrections … , FG 2009, Bordeaux, France, July 25…, 2011 books.google.com … we present the algorithm at the heart of our system. We show how to detect, locate, and order minimal correction proposals, using a tweaked-up context free grammar parser. This is the central module of the open grammar checker … Related articles

Structure-guided supertagger learning Y Zhang, T Matsuzaki, J Tsujii Natural Language …, 2012 Cambridge Univ Press … The search for the optimal supertag sequence is implemented as the best-first CFG parser wherein the score of a constituent is the score of the supertag (sub-)sequence on the fringe of the constituent, which is calculated using the current value of parameters. Page 16. … Related articles All 2 versions

[PDF] from inesc-id.pt Starting to Cook a Coaching Dialogue System in the Olympus framework JP Pardal, NJ Mamede Proceedings of the Paralinguistic Information and …, 2011 Springer … 2. It is based on three main modules provided by the framework: PHOENIX the robust semantic CFG parser; RAVENCLAW an agenda-based dialogue manager, that relies on a task tree and an agenda; ROSETTA an active template language generation system. Fig. … Cited by 1 Related articles All 3 versions

[HTML] from nih.gov [HTML] Modeling drug exposure data in electronic medical records: an application to warfarin M Liu, M Jiang, VK Kawai, CM Stein… AMIA Annual …, 2011 ncbi.nlm.nih.gov … Drug Entity Recognition To identify free text drug mentions in EMRs, we employed the medication extraction system, MedEx, developed by our group at Vanderbilt 6 , 7 . It consists of a semantic tagger and a context-free grammar parser that parses medication sentences using a … Cited by 1 Related articles All 7 versions

[PDF] from arxiv.org A Constraint-Satisfaction parser for Context-Free Grammars L Quesada, F Berzal, FJ Cortijo arXiv preprint arXiv:1110.1470, 2011 arxiv.org … can consider syntactic ambiguities but not lexical ambiguities. The efficiency of these general context-free grammar parsers is O(n3), being n the token sequence length. III. FENCE In this paper, we introduce Fence, an efficient … Related articles All 4 versions

A combined semantic-syntactic sentence analysis for students assessment V Cannella, R Pirrone Human System Interactions (HSI), 2010 …, 2010 ieeexplore.ieee.org … The Stanford group has developed a complete suite for the natural language processing: a probabilistic context-free grammar parser [20], a tree data structure manipulation tool [14], and a name entity recognizer [9]. Freeling [4] is another complete suite for natural language … Related articles

[PDF] from altchi.org Mining whining in support forums with frictionary A Ko Proceedings of the 2012 ACM annual conference …, 2012 dl.acm.org … The text is then segmented into line break separated paragraphs (not shown) and then into sentences and word tokens using the Stanford sentence tokenizer [12]. The sentences are then provided to the Stanford probabilistic context free grammar parser [12]. … Related articles All 4 versions

Research on recognition of the emotional tendencies in web data mining Y Zi-Rong, Z Zhen, C Jing-Hao Business Management and …, 2011 ieeexplore.ieee.org … And the Chinese parser which they designed can provide two factor parsers, two PCFG (Probabilistic ContextFree grammar) parsers and a factor parser which can segment the input continuous charter bunch. We can choose different parser according to different need. … Related articles

Rapid prototyping of application-oriented natural language interfaces T Mészáros, T Dobrowiecki Information Technology Interfaces …, 2010 ieeexplore.ieee.org … Other grammar types could also be investigated in the future. Efficient CFG parsers use the packed forest representation to store the grammar internally [6]. When using this representation several parse trees (a parse forest) could be represented using a single graph. … Related articles All 2 versions

[PDF] from aclweb.org [PDF] Korean Treebank Transformation for parser Training DH Choi, J Park, L Editions, KS Choi ACL 2012, 2012 newdesign.aclweb.org … based Korean treebanks. The methods are applied to Sejong treebank, which is the largest constituent treebank in Korean, and the transformed treebank is used to train and test various probabilistic CFG parsers. The experi … Cited by 1 Related articles All 6 versions

Harvesting Real Time Traffic Information from Twitter R Kosala, E Adi Procedia Engineering, 2012 Elsevier … Jakarta Metropolitan Police (Polda Metro Jaya) (@TMCPoldaMetro). The researchers used the Natural Language Processing (NLP) technique based on context-free grammar (CFG) parser. This study is different from the foregoing …

[PDF] from psu.edu Situated language understanding as filtering perceived affordances P Gorniak, D Roy Cognitive Science, 2010 Wiley Online Library … By making the same context-free assumption in a probabilistic context, namely that rules are expanded independently from each other during the parsing process, a CFG parser can be turned into a … 1, a context free grammar parser would recover the parse tree shown in Fig. 2. … Cited by 31 Related articles All 14 versions

[PDF] from rug.nl Using web-scale N-grams to improve base NP parsing performance E Pitler, S Bergsma, D Lin, K Church Proceedings of the 23rd …, 2010 dl.acm.org … Alternatively, our work could be integrated into a full-sentence parser by using our feature representations directly in a discriminative CFG parser (Finkel et al., 2008), or in a parse re-ranker (Ratnaparkhi et al., 1994; Collins and Koo, 2005; Charniak and Johnson, 2005). … Cited by 7 Related articles All 17 versions

[PDF] from unipi.it HTML validation of context-free languages A ø ller, M Schwarz Foundations of Software Science and Computational …, 2011 Springer Page 1. HTML Validation of Context-Free Languages Anders Møller ? and Mathias Schwarz ? Aarhus University, Denmark {amoeller,schwarz}@cs.au.dk Abstract. We present an algorithm that generalizes HTML validation of … Cited by 5 Related articles All 5 versions

[PDF] from nectec.or.th Forest-guided supertagger training Y Zhang, T Matsuzaki, J Tsujii … of the 23rd International Conference on …, 2010 dl.acm.org … built. It is implemented as a best-first CFG parser wherein the score of a constituent is the score of the supertag (sub-)sequence on the fringe of the constituent, which is calculated using the current value of the parameters. Note … Cited by 1 Related articles All 9 versions

Linguistic measures for automatic machine translation evaluation J Giménez, L Màrquez Machine translation, 2010 Springer … translations, but only the parse of the reference translations. Kahn et al. (2010) used a probabilistic context-free grammar parser and deterministic head-finding rules. Chan and Ng (2008) presented a general framework which … Cited by 5 Related articles All 5 versions

[PDF] from mit.edu [PDF] A Generic Framework for Building Dialogue Games for Language Learning: Application in the Flight Domain Y Xu, S Seneff Speech and Language Technology in …, 2011 groups.csail.mit.edu … For st list of Chinese characters is veform or the typed Pinyin string. parsed by an extended CFG parser rance with a full parse is chosen as converted to a key-value sent to the dialogue manager. type using toned Pinyin strings. the string into a word graph to rrors. … Cited by 1 Related articles All 3 versions

[PDF] from mit.edu On dual decomposition and linear programming relaxations for natural language processing AM Rush, D Sontag, M Collins, T Jaakkola Proceedings of the 2010 …, 2010 dl.acm.org … The parameters ak > 0 for k = 1 …K specify step sizes for each iteration, and are discussed further in the Appendix. The two arg max problems can be solved using dynamic programming. solves the harder optimization problem using an existing CFG parser and trigram tagger. … Cited by 64 Related articles All 28 versions

[PDF] from columbia.edu [PDF] An evaluation framework for natural language understanding in spoken dialogue systems J Gordon, RJ Passonneau Proceedings of Seventh …, 2010 ccls.columbia.edu … This is the approach taken in Let’s Go, and in our baseline version of CheckItOut, both of which are implementations based on the Olympus/RavenClaw framework. Both systems use Phoenix (Ward, 94), a context free grammar (CFG) parser which outputs a semantic frame … Cited by 4 Related articles All 6 versions

Hybrid Semantic Analysis System–ATIS Data Evaluation I Habernal, M Konopík Advanced Data Mining and Applications, 2010 Springer … The algorithm is explained in [11] in details. For the analysis of complicated phrases, such as dates, numbers, time, etc., the LINGVOparser [9] was developed. It is an implementation of a context-free grammar parser. The parser has some features suitable for semantic analysis. … Related articles All 2 versions

[PDF] from uni-kl.de [PDF] An earley-style parser for solving the rna-rna interaction problem S Wild Bachelor thesis, TU Kaiserslautern, 2010 kluedo.ub.uni-kl.de … 69 4.9.7. 4-times-trick . . . . . 70 5. Results 71 5.1. jackRIP— our C++ implementation of a 2D-CFG parser . . . . . 71 5.2. Target Machine . . . . . 71 5.3. Runtime efficiency tests . . . . . … Cited by 2 Related articles All 3 versions

A model-driven parser generator with reference resolution support L Quesada Proceedings of the 27th IEEE/ACM International …, 2012 dl.acm.org … In Proc. ICSOFT’11, volume 1, pages 297–300, 2011. [9] L. Quesada, F. Berzal, and FJ Cortijo. Fence — A context-free grammar parser with constraints for model-driven language specification. In Proc. ICSOFT’12, 2012. (in press). [10] L. Quesada, F. Berzal, and FJ Cortijo. … Related articles

[PDF] from cornell.edu A Computational Model Of Cognitive Constraints In Syntactic Locality MF Boston 2012 ecommons.library.cornell.edu Page 1. A COMPUTATIONAL MODEL OF COGNITIVE CONSTRAINTS IN SYNTACTIC LOCALITY A Dissertation Presented to the Faculty of the Graduate School of Cornell University in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy by … Related articles All 4 versions

A lightweight approach for extracting disease-symptom relation with metamap toward automated generation of disease knowledge base T Okumura, Y Tateisi Health Information Science, 2012 Springer … Cohen et al. [7] describes a system for extracting phenotype from the OMIM Clinical Synopsis. They combine MetaMap and a CFG parser to cluster the expressions for similar phenotype, and negation extraction to decrease the false positive results. … Related articles All 3 versions

[PDF] from aclweb.org [PDF] Lexico-Syntactic Patterns for Automatic Ontology Building C Klaussner, D Zhekova Student Research Workshop, 2011 aclweb.org … basis for the later pattern search. The Stanford parser is a freely available lexicalised PCFG (probabilistic context-free grammar) parser, that allows the user to employ a specific configuration. When extracted, the articles need … Related articles All 8 versions

[PDF] from psu.edu Embedded wizardry RJ Passonneau, SL Epstein, T Ligorio… Proceedings of the …, 2011 dl.acm.org … pseudo-corpus. Phoenix is a context-free grammar (CFG) parser that produces one or more semantic frames per parse. A semantic frame has slots, where each slot is a concept with its own CFG productions (subgrammar). To … Cited by 1 Related articles All 13 versions

Automatically detecting opportunities for Web Service descriptions improvement J Rodriguez, M Crasso, A Zunino, M Campo Software Services for e…, 2010 Springer … phrase>} because it represents a concept [10]. To grammatically analyze the structure of a name, our heuristic applies a probabilistic context free grammar parser [20] to operation and part names. With this kind of parsers, a … Cited by 6 Related articles All 2 versions

[PDF] from dcu.ie LFG without C-structures O Cetinoglu, J Foster, J Nivre, D Hogan, A Cahill… 2010 doras.dcu.ie … ii) Input sentences are parsed with the parsers. iii) The parse trees are passed through the FunTag labeller (Chrupala et al., 2007) which assigns PennII treebank function tags to raw CFG parser output trees. We also carry out the experiment with this step omitted. … Cited by 4 Related articles All 14 versions

[PDF] from 159.226.115.200 Extracting spatial relations from document for geographic information retrieval Y Yuan Geoinformatics, 2011 19th International Conference …, 2011 ieeexplore.ieee.org … Most commonly used geographic entity names can be found in the gazetteer. In the syntactic analysis process, Berkeley parser [18], the state-of-the-art PCFG (Probabilistic Context Free Grammar) parser, is selected to build parser trees. … Cited by 1 Related articles All 3 versions

[PDF] from washington.edu It’s Only Morpho-Logical: Modeling Agreement in Cross-Linguistic Dependency Parsing M Hohensee 2012 digital.lib.washington.edu … Dependency parsers have developed along several lines. The first dependency parsers were based on grammar-driven CFG parsers, such as the CKY (Kasami, 1965; Younger, 1967) and Earley (1970) parsers; probabilistic versions of these were implemented … Cited by 1 Related articles All 3 versions

[PDF] from aclweb.org [PDF] CCG Syntactic Reordering Models for Phrase-based Machine Translation DN Mehay, C Brew Proceedings of WMT-2012, Montreal, Canada, 2012 aclweb.org … 215 Page 7. guage model of of (Shen et al., 2008). (Venugopal et al., 2007) uses a Penn Treebank-trained CFG parser to label target strings and then reworks the CFG parse trees, if needed,x to account for non-traditional constituents. … Related articles All 9 versions

Evaluation and Discussion P Kiefer Mobile Intention Recognition, 2012 Springer … one hypothesis, SearchExit (SE). Although this is less ambiguous than I40,SGIS and I40,SCTAG, the result of the SCCFG parser is wrong because, certainly, the customer may decide to drop in Rshelf3. • 42…47: the SCCFG …

[PDF] from mt-archive.info String-to-dependency statistical machine translation L Shen, J Xu, R Weischedel Computational Linguistics, 2010 MIT Press … Given sentence-aligned bilingual training data, we first use GIZA++ (Och and Ney 2003) to generate word level alignment. We use a statistical CFG parser to parse 1 Later in the article, we will introduce label information for NTs. … Cited by 9 Related articles All 13 versions

[PDF] from upenn.edu Null Element Restoration R Gabbard 2010 repository.upenn.edu … out, since these non-local relationships are important for semantics, it is necessary that either a way be found to enrich CFG parser output with this information or else it will be necessary to move to parsers explicitly designed for deeper syntactic … Related articles All 7 versions

[PDF] from omdoc.org Combining source, content, presentation, narration, and relational representation F Horozal, A Iacob, C Jucovschi, M Kohlhase… Intelligent Computer …, 2011 Springer … This compilation level never fails, and its result is an OMDoc file that contains only the spotted structures and lacks any additional information of the content. The CFG parser level uses a simple context-free grammar to parse the source. … Cited by 6 Related articles All 13 versions

Functional grouping of natural language requirements for assistance in architectural software design A Casamayor, D Godoy, M Campo Knowledge-Based Systems, 2011 Elsevier Cited by 1 Related articles All 2 versions

[PDF] from msu.ac.th Extracting product features and opinions from product reviews using dependency analysis G Somprasertsri, P Lalitrojwong Fuzzy Systems and …, 2010 ieeexplore.ieee.org … Lexical and Syntactic Features. In Proc. IEEE Int. Conf. Information Reuse and Integration, 2008, pp.250–255. [15] Stanford Lexicalized parser a probabilistic lexicalized NL CFG parser, 2006. http://nlp.stanford.edu/downloads … Related articles All 2 versions

[PDF] from rug.nl [PDF] Hierarchical joint learning: Improving joint parsing and named entity recognition with non-jointly labeled data JR Finkel, CD Manning Proceedings of ACL, 2010 acl.eldoc.ub.rug.nl … For each section of the data (ABC, MNB, NBC, PRI, VOA) we ran experiments training a linear-chain CRF on only the named entity information, a CRF-CFG parser on only the parse information, a joint parser and named entity recognizer, and our hierarchical model. … Cited by 12 Related articles All 20 versions

[PDF] from mit.edu A collective data generation method for speech language models S Liu, S Seneff, J Glass Spoken Language Technology …, 2010 ieeexplore.ieee.org … SIGDial, 2005. [11] A. Cucchiarelli, “Semantic tagging of unknown proper nouns,” Natural Language Engineering, 1999. [12] Y. Xu and S. Seneff, “Semantic understanding by combining extended cfg parser with hmm model,” Submitted to These Proceedings, 2010. … Cited by 1 Related articles All 4 versions

CFG extension for META framework Z Tóth, L Kovacs … 2012 IEEE 16th International Conference on, 2012 ieeexplore.ieee.org … In our recent work we showed that META is flexible and extensible enough for us to implement CFG induction methods in it. A CFG parser and two GA based and another CFG induction methods have been implemented into META framework as a CFG extension. … Related articles

[PDF] from rug.nl [PDF] Shift-reduce ccg parsing Y Zhang, S Clark Proceedings of the 49th Meeting of the …, 2011 acl.eldoc.ub.rug.nl … The last two rows in the table show the accuracies of Fowler and Penn (2010) (F&P), who applied the CFG parser of Petrov and Klein (2007) to CCG, and the corresponding accuracies for the C&C parser on the same test sentences. … Cited by 4 Related articles All 14 versions

Deterministic shift-reduce parsing for unification-based grammars T Ninomiya, T Matsuzaki, N Shimizu… Natural Language …, 2011 Cambridge Univ Press … large number of local and global features. Its current accuracy is competitive with that of state-of-the-art CFG parsers, and it is one of the most promising methodologies thus far. These techniques, however, cannot simply be … Cited by 2 Related articles All 4 versions

A computational grammar of sinhala C Liyanage, R Pushpananda, D Herath… … and Intelligent Text …, 2012 Springer … as ‘??????’. Owing to this, it is desirable to have a word segmentation algorithm to check whether the text is in a normalized form before the CFG parser is employed. Page 12. A Computational Grammar of Sinhala 199 Non … Related articles All 2 versions

[HTML] from scielo.edu.uy [HTML] The EasySOC project: a rich catalog of best practices for developing web service applications JM Rodriguez, M Crasso, C Mateos, A Zunino… CLEI Electronic …, 2011 scielo.edu.uy … In addition, our heuristic concerns name structure, ie message part names should be nouns or noun phrases, while operations should be named with a verb plus a noun. This is verified by using a probabilistic context free grammar parser [13]. … Cited by 2 Related articles All 6 versions

[PDF] from mit.edu Good grief, I can speak it! preliminary experiments in audio restaurant reviews J Polifroni, S Seneff, SRK Branavan… … (SLT), 2010 IEEE, 2010 ieeexplore.ieee.org … of the IEEE/ACL 2006 Workshop on Spoken Language Technology, 2006, pp. 58–61. [22] Yushi Xu, Stephanie Seneff, Alice Li, and Joseph Polifroni, “Semantic understanding by combining extended CFG parser with HMM model,” in submitted to these proceedings, 2010. … Cited by 3 Related articles All 3 versions

[PDF] from uni-konstanz.de [PDF] Input and Output with XQuery and XML Databases R Shadura 2012 kops.ub.uni-konstanz.de Page 1. Input and Output with XQuery and XML Databases Rositsa Shadura Master Thesis in fulfillment of the requirements for the degree of Master of Science (M.Sc.) Submitted to the Department of Computer and Information Science at the University of Konstanz … Related articles All 2 versions

[PDF] from rochester.edu [PDF] Optimal head-driven parsing complexity for linear context-free rewriting systems P Crescenzi, D Gildea, A Marino, G Rossi, G Satta Proc. of ACL, 2011 cs.rochester.edu Page 1. Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems Pierluigi Crescenzi Dip. di Sistemi e Informatica Universit`a di Firenze Daniel Gildea Computer Science Dept. University of Rochester Andrea Marino Dip. … Cited by 2 Related articles All 9 versions

[PDF] from diva-portal.org Probability as readability: A new machine learning approach to readability assessment for written Swedish J Sjöholm 2012 liu.diva-portal.org … used by Schwarm and Ostendorf [2005]. Heilman et al. [2008] went further and used patterns of subtrees of different depths based on application of context-free grammar parsers as features. This could perhaps be considered a … Related articles

[PDF] from mit.edu Efficient Lagrangian relaxation algorithms for exact inference in natural language tasks AM Rush 2011 dspace.mit.edu Page 1. Efficient Lagrangian Relaxation Algorithms for Exact Inference in Natural Language Tasks by Alexander M. Rush Submitted to the Department of Electrical Engineering and Computer Science in partial fulfillment of the requirements for the degree of … Related articles All 2 versions

[PDF] from upenn.edu Are Very Large Context-Free Grammars Tractable? P Boullier, B Sagot Trends in Parsing Technology, 2011 Springer Page 1. Chapter 12 Are Very Large Context-Free Grammars Tractable? Pierre Boullier and Benoît Sagot 12.1 Introduction More and more often, in real-word natural language processing (NLP) applications based upon grammars … Cited by 2 Related articles All 41 versions

[PDF] from uwaterloo.ca A new approach for recognizing handwritten mathematics using relational grammars and fuzzy sets S MacLean, G Labahn International Journal on Document Analysis and …, 2012 Springer Page 1. IJDAR DOI 10.1007/s10032-012-0184-x ORIGINAL PAPER A new approach for recognizing handwritten mathematics using relational grammars and fuzzy sets Scott MacLean • George Labahn Received: 21 July 2010 … Cited by 1 Related articles All 6 versions

[PDF] from diva-portal.org Semantic Search with Information Integration Y Xian, L Zhang 2011 lnu.diva-portal.org Page 1. Degree project Semantic Search with Information Integration Author: Yikun Xian & Liu Zhang Date: 2011-08-18 Subject: Computer Science Level: Bachelor Course code: 2DV00E Page 2. i Abstract Since the search engine …

[PDF] from arxiv.org Natural Language Processing-A Survey K Mote arXiv preprint arXiv:1209.6238, 2012 arxiv.org Page 1. 0 Page 2. 1 INTRODUCTION: “WHY CAN’T COMPUTERS UNDERSTAND PLAIN ENGLISH?” … 1 1. THE PURPOSE: …. 3 1.1 FOUNDATION …

[PDF] from aclweb.org Modality and negation in simt use of modality and negation in semantically-informed syntactic mt K Baker, M Bloodgood, BJ Dorr… Computational …, 2012 MIT Press Cited by 3 Related articles All 7 versions

Best practices for describing, consuming, and discovering web services: a comprehensive toolset JM Rodriguez, M Crasso, C Mateos… Software: Practice and …, 2012 Wiley Online Library Page 1. SOFTWARE – PRACTICE AND EXPERIENCE Softw. Pract. Exper. (2012) Published online in Wiley Online Library (wileyonlinelibrary.com). DOI: 10.1002/spe.2123 Best practices for describing, consuming, and discovering web services: a comprehensive toolset … Related articles

[PDF] from umanitoba.ca Development of a Graphics Ontology for Natural Language Interfaces M Niknam 2010 mspace.lib.umanitoba.ca Page 1. Development of a Graphics Ontology for Natural Language Interfaces by Mehdi Niknam A Thesis submitted to the Faculty of Graduate Studies of The University of Manitoba in partial fulfillment of the requirements of the degree of MASTER OF SCIENCE … Cited by 1 Related articles All 3 versions

Reconstructing Readability: Recent Developments and Recommendations in the Analysis of Text Difficulty RG Benjamin Educational Psychology Review, 2012 Springer Page 1. REVIEW Reconstructing Readability: Recent Developments and Recommendations in the Analysis of Text Difficulty Rebekah George Benjamin © Springer Science+Business Media, LLC 2011 Abstract Largely due to … Cited by 3 Related articles All 3 versions

[PDF] from umass.edu [PDF] Query Representation and Understanding B Croft, M Bendersky, H Li, G Xu … of the 1st Workshop on query …, 2010 ciir.cs.umass.edu Page 1. SIGIR 2010 Geneva, Switzerland July 19-23, 2010 Query Representation and Understanding Workshop of the 33 rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval Organized by … Related articles All 2 versions

[PDF] from ogi.edu [PDF] Prioritization and Pruning: Efficient Inference with Weighted Context-Free Grammars NM Bodenstab 2012 cslu.ogi.edu Page 1. Prioritization and Pruning: Efficient Inference with Weighted Context-Free Grammars Nathan Matthew Bodenstab BA, George Fox University, 2004 MS, Oregon Health & Science University, 2006 Presented to the Center for Spoken Language Understanding … Related articles All 2 versions

Mobile Intention Recognition with Spatially Constrained Grammars P Kiefer Mobile Intention Recognition, 2012 Springer Page 1. Chapter 4 Mobile Intention Recognition with Spatially Constrained Grammars Extending the idea of spatially grounded grammars of section 3.4.2, this chapter introduces two new spatial grammars which extend SGISs …

[PDF] from uwaterloo.ca [PDF] Recognizing handwritten mathematics via fuzzy parsing S MacLean, G Labahn 2010 cs.uwaterloo.ca Page 1. Recognizing handwritten mathematics via fuzzy parsing Scott MacLean smaclean@uwaterloo.ca George Labahn glabahn@uwaterloo.ca David R. Cheriton School of Computer Science, University of Waterloo Technical Report CS-2010-13 June 12, 2010 Abstract … Cited by 2 Related articles All 7 versions

[PDF] from jhu.edu [PDF] Models for Synchronous Grammar Induction P Blunsom, C Callison-Burch, T Cohn, C Dyer, J Graehl… 2010 cs.jhu.edu Page 1. Final Report of the 2010 Language Engineering Workshop Models for Synchronous Grammar Induction http://www.clsp.jhu.edu/workshops/ws10/groups/msgismt/ Johns Hopkins University Center for Speech and Language Processing … Related articles

[PDF] from mit.edu [PDF] Language Technologies in Speech-Enabled Second Language Learning Games: From Reading to Dialogue Y Xu 2012 groups.csail.mit.edu Page 1. Language Technologies in Speech-Enabled Second Language Learning Games: From Reading to Dialogue By Yushi Xu SM in Electrical Engineering and Computer Science (2008) Massachusetts Institute of Technology … Related articles

[PDF] from grupocole.org [PDF] Error-repair parsing schemata C Gómez-Rodriguez, MA Alonso… Theoretical Computer …, 2010 grupocole.org Page 1. NOTICE: This is the author’s version of a work accepted for publication by Elsevier. Changes resulting from the publishing process, including peer review, editing, corrections, structural formatting and other quality control … Cited by 1 Related articles

[PDF] from 18.7.29.232 Advances in discriminative dependency parsing M Collins, T Koo 2010 18.7.29.232 Page 1. Advances in Discriminative Dependency Parsing by Terry Koo Submitted to the Department of Electrical Engineering and Computer Science in partial fulfillment of the requirements for the degree of Doctor of Philosophy at the … Related articles

[PDF] from volokh.de [PDF] Advances in discriminative dependency parsing T Koo 2010 alexander.volokh.de Page 1. Advances in Discriminative Dependency Parsing by Terry Koo Submitted to the Department of Electrical Engineering and Computer Science in partial fulfillment of the requirements for the degree of Doctor of Philosophy at the … Cited by 3 Related articles All 8 versions

[PDF] from ohiolink.edu [PDF] Bean Soup Translation: Flexible, Linguistically-motivated Syntax for Machine Translation DN Mehay 2012 etd.ohiolink.edu Related articles All 3 versions

[PDF] from digns.com [PDF] DISI-University of Trento N Piotto 2011 static.digns.com Page 1. PhD Dissertation International Doctorate School in Information and Communication Technologies DISI University of Trento Trajectory Analysis for Event Detection in Ambient Intelligence Applications Nicola Piotto Advisor: Prof. Francesco GB De Natale … Related articles

[PDF] from neu.edu Static semantics for syntax objects D Fisher 2010 iris.lib.neu.edu Page 1. Northeastern University Computer Science Dissertations College of Computer and Information Science January 01, 2010 Static semantics for syntax objects David Fisher Northeastern University This work is available open access, hosted by Northeastern University. … Cited by 2 Related articles All 3 versions

[PDF] from hbz-nrw.de Automatic Induction of Lexical Features P Jäger 2010 ubm.opus.hbz-nrw.de Page 1. Automatic Induction of Lexical Features Inauguraldissertation zur Erlangung des Akademischen Grades eines Dr. phil., vorgelegt dem Fachbereich 05 Philosophie und Philologie der Johannes Gutenberg-Universität Mainz von Peter Jäger aus Wiesbaden Peter Jäger … Related articles