Filters








26,262 Hits in 2.2 sec

Automating grammar comparison

Ravichandhran Madhavan, Mikaël Mayer, Sumit Gulwani, Viktor Kuncak
2015 Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications - OOPSLA 2015  
Furthermore, we propose an algorithm for proving equivalence of context-free grammars that is complete for LL grammars, yet can be invoked on any context-free grammar, including ambiguous grammars.  ...  time random access to words belonging to the grammar.  ...  Comparison with Previous SAT Solving Approach.  ... 
doi:10.1145/2814270.2814304 dblp:conf/oopsla/MadhavanMGK15 fatcat:gbgiwqvvkza7nascsaw5644o3q

Automating grammar comparison

Ravichandhran Madhavan, Mikaël Mayer, Sumit Gulwani, Viktor Kuncak
2015 SIGPLAN notices  
Furthermore, we propose an algorithm for proving equivalence of context-free grammars that is complete for LL grammars, yet can be invoked on any context-free grammar, including ambiguous grammars.  ...  time random access to words belonging to the grammar.  ...  Comparison with Previous SAT Solving Approach.  ... 
doi:10.1145/2858965.2814304 fatcat:rbiz4rui4ve4rpzv2ldqkbrjbe

Graphic and Functional Algorithms of Sequence of Tenses in English Grammar for the Effective Education and Automated Systems of Text Synthesis and Editing

Lyudmila Kozlova, Nadejda Trubochkina
2015 Journal of Language and Education  
To achieve this goal, the authors used a graphic algorithmization of the English grammar and visualization of grammar rules, as well as the comparative monitoring of the knowledge gained.  ...  The article describes the optimal graphic language of presenting and studying English grammar using information technology.  ...  Introduction Results and discussion Comparison of basic and graphic language methods of teaching English Integrated assessment of quality indicators improvement Q for different types of audiences  ... 
doi:10.17323/2411-7390-2015-1-4-15-25 fatcat:qxnljxsy5befdiup7vwc43zj54

Page 1988 of Linguistics and Language Behavior Abstracts: LLBA Vol. 28, Issue 4 [page]

1994 Linguistics and Language Behavior Abstracts: LLBA  
use; 9408677 Computer Software automated hearing testing, threshold-seeking algorithm use; 9409337 automated language proficiency test assembly system effectiveness; English comprehension level tests;  ...  ; 9409276 fictional characters’ psychological point-of-view tracking algorithm; 9408698 Functional Grammar Processor computer program’s text analysis, in- dividual clauses, M.  ... 

Page 1435 of Linguistics and Language Behavior Abstracts: LLBA Vol. 28, Issue 3 [page]

1994 Linguistics and Language Behavior Abstracts: LLBA  
expression generation system, knowledge sources integration; 9405834 automated text generation systems, computational modeling’s research role; 9405882 automated text-processing/machine translation polyfunctional  ...  ’’-“register” comparisons, human-computer interactions, J.  ... 

Page 1391 of Linguistics and Language Behavior Abstracts: LLBA Vol. 29, Issue 3 [page]

1995 Linguistics and Language Behavior Abstracts: LLBA  
text processing, sample size/recall/exclusion/linguistic variation problems; 9505962 automated word recognition system, linear transformation, LMR- transform evaluation; 9506604 automatic speech recognition  ...  neural network basis; 9506022 computational parsing system, Mandarin Chinese multisegmental sen- tences, machine translation application; 9505970 computer/humanities articles bibliography, 1989-1993, automated  ... 

Enhancing Best Analysis Selection and Parser Comparison [chapter]

Aleš Horák, Vladimír Kadlec, Pavel Smrž
2002 Lecture Notes in Computer Science  
The effectivity of the enhanced parser is demonstrated by results of intersystem parser comparison.  ...  The test were run on the standard evaluation grammars (ATIS, CT and PT), our system outperforms the referential implementations.  ...  Running Time Comparison The best results reported on standard data sets (ATIS, CT and PT grammars) until today are the comparison data by Robert C. Moore [1] .  ... 
doi:10.1007/3-540-46154-x_66 fatcat:pq7w5tk55fbh7j5s2rfa7sw3tq

Language Convergence Infrastructure [chapter]

Vadim Zaytsev
2011 Lecture Notes in Computer Science  
The paper describes a DSL and the infrastructure behind it that automates the convergence process, hides negligible back-end details, aids development/debugging and enables application of grammar convergence  ...  The process of grammar convergence involves grammar extraction and transformation for structural equivalence and contains a range of technical challenges.  ...  The result of such comparison can possibly be suggestive enough for automated generation of transformation scripts-this is our future work in progress at the moment.  ... 
doi:10.1007/978-3-642-18023-1_16 fatcat:irwm4pyqdnesllraudxlcwq35e

Page 787 of Automation and Remote Control Vol. 37, Issue 5 [page]

1976 Automation and Remote Control  
Two instructions—a comparison instruction in order to make a comparison with the queueing symbols, the code groupof queueing symbols, with the code of the last symbol is a possible deduc- tion sequence  ...  Let us assume that some row s in a given configurational grammar has the two canoni- cal deductions 787  ... 

Formal foundations for semi-parsing

Vadim Zaytsev
2014 2014 Software Evolution Week - IEEE Conference on Software Maintenance, Reengineering, and Reverse Engineering (CSMR-WCRE)  
With a combination of recently developed formal methods such as Boolean grammars and parsing schemata, we can model different tolerant methods of modelling software and formally argue about relationships  ...  Another result we are aiming at, is to provide automated and semi-automated means of converting any baseline grammar into a Boolean grammar with explicitly encoded level of tolerance.  ...  ; • gap parsing [4] : automated recognition of gaps with water; • noise skipping [19] : a minimum number of unrecognised tokens is skipped; • bridge grammars [27] : semi-automated construction of bridges  ... 
doi:10.1109/csmr-wcre.2014.6747184 dblp:conf/csmr/Zaytsev14 fatcat:ynyggy46c5e2pogabh2rnfstbu

A Comparison Of Team Performances Using Four Scenarios Of Feedback

Charles Mohundro, Charles McDonald, Jr., David Reavis
2011 International Journal of Management & Information Systems  
The second type is an automated process for giving grammar and style feedback.  ...  The automated grammar software (Edit Assist) checks the student paper for numerous grammar and style errors, then automatically inserts comments that identify problems.  ...  The effect of automated editing feedback concerning writing performance will be explored by analyzing the number of grammar and style errors identified in the analyses versus the case grade.  ... 
doi:10.19030/ijmis.v14i1.818 fatcat:o3v2tybd7fac5dtcdlwpfazqky

LinGO Redwoods

Stephan Oepen, Dan Flickinger, Kristina Toutanova, Christopher D. Manning
2004 Research on Language and Computation  
, John Beavers, and Kathryn Campbell-Kibler all have participated in our regular tree conferences, helping annotators select parses and offering productive critiques on analyses provided by the LinGO grammar  ...  (i) seeding lexical selection from a part-of-speech (POS) tagger and (ii) automated inter-annotator comparison and assisted resolution of conflicts.  ...  The project will explore two approaches to automating the disambigutation task, viz.  ... 
doi:10.1007/s11168-004-7430-4 fatcat:rolcjiohqjgyhnh6tmotg6x6tm

Stop! Grammar time: University students' perceptions of the automated feedback program Grammarly

Ruth ONeill, Alex Russell
2018 Australasian Journal of Educational Technology  
methods sequential explanatory design, the study compared one group of students' responses to the feedback they received from Grammarly (n = 54) with another group's responses to the traditional non-automated  ...  grammar feedback they received from the Academic Learning Centre at CQUniversity (n = 42).  ...  Automated feedback programs Automated feedback programs could reconcile the differences between ALAs' and students' attitudes to grammar feedback, by providing students with the amount of grammar feedback  ... 
doi:10.14742/ajet.3795 fatcat:jz2belexhrcqpp77fgs2usgecy

A Task-driven Grammar Refactoring Algorithm

Ivan Halupka, Ján Kollár, Emília Pietriková
2012 Acta Polytechnica  
This paper presents our proposal and the implementation of an algorithm for automated refactoring of context-free grammars.  ...  of the overall significance of grammar refactoring.  ...  As such, a state function is a tool for qualitative comparison of two or more equivalent context-free grammars.  ... 
doaj:2b419cae30d444a0819ea08bf3c02a52 fatcat:oyykgfowm5hpnc2xbgel4mn27q

Page 4864 of Mathematical Reviews Vol. , Issue 2004f [page]

2004 Mathematical Reviews  
A comparison between the set covering machine and the support vector machine is presented.  ...  (English summary) Descriptional complexity of automata, grammars and related structures (Vienna, 2001). J. Autom. Lang. Comb. 7 (2002), no. 4, 433—446.  ... 
« Previous Showing results 1 — 15 out of 26,262 results