Search results for "Parsing"

showing 10 items of 46 documents

Testing Grammars for Parsability

1990

In the preceding chapters we have studied in detail the major methods of deterministic context-free parsing: strong LL(k) parsing (Chapter 5), simple precedence parsing (Chapter 5), canonical LR(k) parsing, LALR(k) parsing, and SLR(k) parsing (Chapters 6 and 7), and canonical LL(k) parsing (Chapter 8). Each of these methods induces a class of grammars that are “parsable” using that method, that is, a class of grammars for which a deterministic parser employing that method can be constructed. For example, the LL(k) grammars constitute the class of grammars parsable by the LL(k) parsing method. By definition, a context-free grammar is an LL(k) grammar if and only if its canonical LL(k) parser…

Discrete mathematicsClass (set theory)ParsingFinite-state machineGrammarComputer sciencemedia_common.quotation_subject16. Peace & justicecomputer.software_genreTuring machinesymbols.namesakeRule-based machine translationsymbolsRegular expressionLALR parsercomputermedia_common
researchProduct

On the use of relational expressions in the design of efficient algorithms

2005

Relational expressions have finite binary relations as arguments and the operations are composition (·), closure (*), inverse (−1), and union (U). The efficient computation of the relation denoted by a relational expression is considered, and a tight bound is established on the complexity of the algorithm suggested by Hunt, Szymanski and Ullman. The result implies a unified method for deriving efficient algorithms for many problems in parsing. For example, optimal algorithms are derived for strong LL(1) and strong LL(2) parser construction and an efficient polynomialtime algorithm is derived for determining the inessential error entries in an LR(1) parsing table.

Discrete mathematicsEmpty stringParsingRelation (database)Binary relationTransitive closure0102 computer and information sciences02 engineering and technology16. Peace & justicecomputer.software_genre01 natural sciencesExpression (mathematics)TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESClosure (mathematics)010201 computation theory & mathematics020204 information systems0202 electrical engineering electronic engineering information engineeringTable (database)computerMathematics
researchProduct

WCxf: An exchange format for Wilson coefficients beyond the Standard Model

2018

We define a data exchange format for numerical values of Wilson coefficients of local operators parameterising low-energy effects of physics beyond the Standard Model. The format facilitates interfacing model-specific Wilson coefficient calculators, renormalisation group (RG) runners, and observable calculators. It is designed to be unambiguous (defining a non-redundant set of operators with fixed normalisation in each basis), extensible (allowing the addition of new EFTs or bases by the user), and robust (being based on industry standard file formats with parsers implemented in many programming languages). We have implemented the format for the Standard Model EFT (SMEFT) and for the weak e…

EFTSParsing010308 nuclear & particles physicsComputer scienceProgramming languagePhysics beyond the Standard ModelFOS: Physical sciencesGeneral Physics and AstronomyPython (programming language)computer.software_genreFile format01 natural sciencesPartícules (Física nuclear)High Energy Physics - PhenomenologyHigh Energy Physics - Phenomenology (hep-ph)Hardware and ArchitectureData exchangeInterfacing0103 physical sciencesElectroweak scale010306 general physicscomputercomputer.programming_language
researchProduct

New evidence for chunk-based models in word segmentation.

2014

International audience; : There is large evidence that infants are able to exploit statistical cues to discover the words of their language. However, how they proceed to do so is the object of enduring debates. The prevalent position is that words are extracted from the prior computation of statistics, in particular the transitional probabilities between syllables. As an alternative, chunk-based models posit that the sensitivity to statistics results from other processes, whereby many potential chunks are considered as candidate words, then selected as a function of their relevance. These two classes of models have proven to be difficult to dissociate. We propose here a procedure, which lea…

ExploitComputer scienceFirst languageExperimental and Cognitive Psychologycomputer.software_genreLanguage Development050105 experimental psychology03 medical and health sciences0302 clinical medicineArts and Humanities (miscellaneous)Chunking (psychology)Developmental and Educational PsychologyHumansLearning0501 psychology and cognitive sciencesSegmentationLanguageCommunicationParsingTwo-alternative forced choicebusiness.industry05 social sciencesText segmentationGeneral MedicineModels TheoreticalConstructed language[ SDV.NEU ] Life Sciences [q-bio]/Neurons and Cognition [q-bio.NC][SDV.NEU]Life Sciences [q-bio]/Neurons and Cognition [q-bio.NC]Artificial intelligenceCuesbusinesscomputer030217 neurology & neurosurgeryNatural language processing
researchProduct

RIGA at SemEval-2016 Task 8: Impact of Smatch Extensions and Character-Level Neural Translation on AMR Parsing Accuracy

2016

Two extensions to the AMR smatch scoring script are presented. The first extension com-bines the smatch scoring script with the C6.0 rule-based classifier to produce a human-readable report on the error patterns frequency observed in the scored AMR graphs. This first extension results in 4% gain over the state-of-art CAMR baseline parser by adding to it a manually crafted wrapper fixing the identified CAMR parser errors. The second extension combines a per-sentence smatch with an en-semble method for selecting the best AMR graph among the set of AMR graphs for the same sentence. This second modification au-tomatically yields further 0.4% gain when ap-plied to outputs of two nondeterministic…

FOS: Computer and information sciencesParsingComputer Science - Computation and LanguageComputer sciencebusiness.industry02 engineering and technologyExtension (predicate logic)computer.software_genreSemEvalSet (abstract data type)Nondeterministic algorithm020204 information systemsTest setClassifier (linguistics)0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingArtificial intelligencebusinesscomputerComputation and Language (cs.CL)Natural language processingSentence
researchProduct

How Do Viewers Spontaneously Segment Animated Diagrams of Mechanical and Biological Subject Matter?

2012

A challenges for learning from animated diagrams is to first parse the continuous flow of information into discrete event units. Inadequacies in this parsing process can prejudice the quality of the mental model constructed from the depiction. One approach that has been proposed for ameliorating such problems is for the designer to pre-segment the animation. However, the pre-segmentation techniques used tend to be either intuitive or based on an expert's understanding of the subject matter. Neither of these approaches takes proper account of the psychological processing that must occur for an external animation to be properly internalized. This poster reports a study of the processes that l…

Identification (information)ParsingMultimediaComputer scienceHuman–computer interactionProcess (engineering)Event (computing)DepictionSegmentationAnimationMacrocomputer.software_genrecomputer
researchProduct

An Extended Data Object-driven Approach to Data Quality Evaluation: Contextual Data Quality Analysis

2019

This research is an extension of a data object-driven approach to data quality evaluation allowing to analyse data object quality in scope of multiple data objects. Previously presented approach was used to analyse one particular data object, mainly focusing on syntactic analysis. It means that the primary data object quality can be analysed against secondary data objects of unlimited number. This opportunity allows making more comprehensive, in-depth contextual data object analysis. The given analysis was applied to open data sets, making comparison between previously obtained results and results of application of the extended approach, underlying importance and benefits of the given exten…

Information retrievalParsingComputer sciencemedia_common.quotation_subjectExtension (predicate logic)computer.software_genreObject (computer science)Open dataContextual designData qualityQuality (business)computerScope (computer science)media_commonProceedings of the 21st International Conference on Enterprise Information Systems
researchProduct

FrameNet CNL: A Knowledge Representation and Information Extraction Language

2014

The paper presents a FrameNet-based information extraction and knowledge representation framework, called FrameNet-CNL. The framework is used on natural language documents and represents the extracted knowledge in a tailor-made Frame-ontology from which unambiguous FrameNet-CNL paraphrase text can be generated automatically in multiple languages. This approach brings together the fields of information extraction and CNL, because a source text can be considered belonging to FrameNet-CNL, if information extraction parser produces the correct knowledge representation as a result. We describe a state-of-the-art information extraction parser used by a national news agency and speculate that Fram…

Information retrievalParsingKnowledge representation and reasoningbusiness.industryComputer scienceAgency (philosophy)computer.software_genreParaphraseInformation extractionArtificial intelligenceSource textFrameNetbusinesscomputerNatural language processingNatural language
researchProduct

Rigotrio At Semeval-2017 Task 9: Combining Machine Learning And Grammar Engineering For Amr Parsing And Generation

2017

By addressing both text-to-AMR parsing and AMR-to-text generation, SemEval-2017 Task 9 established AMR as a powerful semantic interlingua. We strengthen the interlingual aspect of AMR by applying the multilingual Grammatical Framework (GF) for AMR-to-text generation. Our current rule-based GF approach completely covered only 12.3% of the test AMRs, therefore we combined it with state-of-the-art JAMR Generator to see if the combination increases or decreases the overall performance. The combined system achieved the automatic BLEU score of 18.82 and the human Trueskill score of 107.2, to be compared to the plain JAMR Generator results. As for AMR parsing, we added NER extensions to our SemEva…

InterlinguaGenerator (computer programming)Parsingbusiness.industryComputer scienceSpeech recognitionGrammatical Framework02 engineering and technologycomputer.software_genreComputer scienceSemEvallanguage.human_languageTask (project management)020204 information systems0202 electrical engineering electronic engineering information engineeringlanguage020201 artificial intelligence & image processingGrammar engineeringArtificial intelligencebusinesscomputerNatural language processingBLEU
researchProduct

SAP UI5 lietotņu pirmkoda automatizētas pārstrādes rīka izstrāde

2018

Kvalifikācijas darbā tika izstrādāts rīks SAP UI5 lietotņu pirmkoda automatizētai pārveidei, kas veic SAP UI5 JavaScript koda analīzi un aizvieto novecojušās un mazāk efektīvās sinhronās moduļu ielādes metodes ar aktuālajām un tīmekļa kontekstā efektīvākām asinhronajām moduļu ielādes metodēm, kā arī veic koda izmaiņas, kuru nepieciešamība izriet no iepriekšminētās metožu aizvietošanas. Izstrādātā rīka mērķis ir padarīt automātisku, ātru un pabeigtu, bez cilvēciskām kļūdām, šādas pārstrādes procesu tām lietotnēm un projektiem, kuru izstrāde ir aizsākusies pietiekami sen, lai kodu būtu nepieciešams šādi aktualizēt. Rīks tika izstrādāts izmantojot SAP UI5 ietvaru lietotāja saskarnes pusē, Node…

JavaScriptSAP UI5Datorzinātnecode parsingAST treeRefactoring automation tool
researchProduct