Results 51 to 60 of about 133,940 (200)
2020 25th International Conference on Pattern Recognition (ICPR), 2021 [EN] We consider hypergraphs as a tool obtained with bidimensional Probabilistic Context-Free Grammars to compactly represent the result of the n-best parse trees for an input image that represents a mathematical expression. More specifically, in this paper we propose: i) an algorithm to compute the N-best parse trees from a 2D-PCFGs, ii) an algorithm ...
Noya, Ernesto +2 more
openaire +2 more sources
Approximating Procedural Models of 3D Shapes with Neural Networks
Computer Graphics Forum, EarlyView.Abstract Procedural modeling is a popular technique for 3D content creation and offers a number of advantages over alternative techniques for modeling 3D shapes. However, given a procedural model, predicting the procedural parameters of existing data provided in different modalities can be challenging.
Ishtiaque Hossain +2 more
wiley +1 more source
Accessible Text Descriptions for UpSet Plots
Computer Graphics Forum, EarlyView.Abstract Data visualizations are typically not accessible to blind and low‐vision (BLV) users. Automatically generating text descriptions offers an enticing mechanism for democratizing access to the information held in complex scientific charts, yet appropriate procedures for generating those texts remain elusive. Pursuing this issue, we study a single
A. McNutt +8 more
wiley +1 more source
MatplotAlt: A Python Library for Adding Alt Text to Matplotlib Figures in Computational Notebooks
Computer Graphics Forum, EarlyView.Abstract We present MatplotAlt, an open‐source Python package for easily adding alternative text to Matplotlib figures. MatplotAlt equips Jupyter notebook authors to automatically generate and surface chart descriptions with a single line of code or command, and supports a range of options that allow users to customize the generation and display of ...
Kai Nylund +2 more
wiley +1 more source
Probabilistic Parsing Strategies
, 2002 We present new results on the relation between purely symbolic context-free parsing strategies and their probabilistic counter-parts. Such parsing strategies are seen as constructions of push-down devices from grammars.
Nederhof, Mark-Jan, Satta, Giorgio
core +2 more sources
Parsing Expression Grammar and Packrat Parsing – A Review
Journal of University of Shanghai for Science and Technology, 2020 Bryan Ford presented Parsing Expression Grammars (PEGs) as an alternative to specify rules for programming language, along with a Packrat parser, based on an idea of memoization. The idea proposed by B. Ford guarantees parsing of grammar written using PEGs in linear time in spite of backtracking. The primary aim of the paper is to highlight the details
Nikhil Mangrulkar S +3 more
openaire +1 more source
Interactive Discovery and Exploration of Visual Bias in Generative Text‐to‐Image Models
Computer Graphics Forum, EarlyView.Abstract Bias in generative Text‐to‐Image (T2I) models is a known issue, yet systematically analyzing such models' outputs to uncover it remains challenging. We introduce the Visual Bias Explorer (ViBEx) to interactively explore the output space of T2I models to support the discovery of visual bias.
Johannes Eschner +3 more
wiley +1 more source
Pika parsing: reformulating packrat parsing as a dynamic programming algorithm solves the left recursion and error recovery problems [PDF]
arXiv, 2020 A recursive descent parser is built from a set of mutually-recursive functions, where each function directly implements one of the nonterminals of a grammar. A packrat parser uses memoization to reduce the time complexity for recursive descent parsing from exponential to linear in the length of the input.
arxiv
The German Quarterly, EarlyView.Abstract This essay explores the disturbing presence of anti‐Black language and tropes in Emine Sevgi Özdamar's recent, celebrated novel Ein von Schatten begrenzter Raum. Drawing on Toni Morrison's classic analysis in Playing in the Dark, I argue Özdamar's anti‐Blackness is characterized by a double‐valence: on one hand, Özdamar's anti‐Blackness ...
Barbara N. Nagel
wiley +1 more source
Alignment Elimination from Adams' Grammars [PDF]
arXiv, 2017 Adams' extension of parsing expression grammars enables specifying indentation sensitivity using two non-standard grammar constructs --- indentation by a binary relation and alignment. This paper proposes a step-by-step transformation of well-formed Adams' grammars for elimination of the alignment construct from the grammar.
arxiv