Filters








26,516 Hits in 4.6 sec

Regular Tree Language Recognition with Static Information [chapter]

Alain Frisch
IFIP International Federation for Information Processing  
Formally, we introduce a new kind of deterministic tree automata that can efficiently recognize regular tree languages with static information about the trees and we propose a compilation algorithm to  ...  This paper presents our compilation strategy to produce efficient code for pattern matching in the CDuce compiler, taking into account static information provided by the type system.  ...  If the regular language is given by a tree automaton, a top-down recognition algorithm may have to backtrack, and the recognition time is not linear in the size of the input tree. 2.  ... 
doi:10.1007/1-4020-8141-3_50 dblp:conf/ifipTCS/Frisch04 fatcat:2wwn575rfzccbiouv3nbczxsgm

Morbig: a static parser for POSIX shell

Yann Régis-Gianas, Nicolas Jeannerod, Ralf Treinen
2018 Proceedings of the 11th ACM SIGPLAN International Conference on Software Language Engineering - SLE 2018  
The POSIX shell language defies conventional wisdom of compiler construction on several levels: The shell language was not designed for static parsing, but with an intertwining of syntactic analysis and  ...  Token recognition cannot be specified by regular expressions, lexical analysis depends on the parsing context and the evaluation context, and the shell grammar given in the specification is ambiguous.  ...  It starts with the fact that the POSIX shell language was never designed for being statically analyzed.  ... 
doi:10.1145/3276604.3276615 dblp:conf/sle/Regis-GianasJT18 fatcat:n6mgvlrakjeeta4mbtbv2u5vmi

Learning action verbs with animation

Chih-cheng Lin
2009 The JALT CALL Journal  
In the forest was an oak tree. Under the oak tree was an old well. The young princess loved to play near the old well.  ...  While action verbs can 31 The jalt call Journal 2009: Regular Papers be ideal candidates for dynamic animations, static graphics with L1 textual definitions can provide sufficient  ... 
doi:10.29140/jaltcall.v5n3.84 fatcat:3zezewjcrjgkdaifjhfybphj5i

Typed and unambiguous pattern matching on strings using regular expressions

Claus Brabrand, Jakob G. Thomsen
2010 Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming - PPDP '10  
We show how to achieve typed and unambiguous declarative pattern matching on strings using regular expressions extended with a simple recording operator.  ...  We give a characterization of ambiguity of regular expressions that leads to a sound and complete static analysis.  ...  Furthermore, we show how this type information can be reconciled with the static type systems of modern programming languages (e.g., Java).  ... 
doi:10.1145/1836089.1836120 dblp:conf/ppdp/BrabrandT10 fatcat:6fdrk6nd5ndxdmr6vv2z42byue

Deep Forest-Based Monocular Visual Sign Language Recognition

Qifan Xue, Xuanpeng Li, Dong Wang, Weigong Zhang
2019 Applied Sciences  
Human skeleton action recognition is proposed to express semantic information, including the representation of signs' gestures, using the regularization of body joint features and a deep-forest-based semantic  ...  Sign language recognition (SLR) is a bridge linking the hearing impaired and the general public.  ...  In recent years, along with the rise of depth cameras, e.g., Microsoft's Kinect, many researchers have tried to combine depth information with appearance information.  ... 
doi:10.3390/app9091945 fatcat:62fsen7skjfdxkkawwgajynovy

Tunnel Parsing with counted repetitions

Nikolay Handzhiyski, Elena Somova
2020 Computer Science  
As a result of the parsing, a statically typed concrete syntax tree is built from top to bottom, that accurately reflects the grammar.  ...  The algorithm is applicable mostly for domain-specific languages. In the article, particular attention is paid to the parsing of grammar element repetitions.  ...  Nikolay Handzhiyski performed the tests and (along with Elena Somova) verified the results. The authors discussed the theory and the results and contributed to the final article.  ... 
doi:10.7494/csci.2020.21.4.3753 fatcat:uzzukhm2f5ezvma7vloimheqiy

Automatic Generation of a Custom Corpora for Invoice Analysis and Recognition

Jerome Blanchard, Yolande Belaid, Abdel Belaid
2019 2019 International Conference on Document Analysis and Recognition Workshops (ICDARW)  
Then, to show the interest of the generator, we proposed a system of invoice recognition based on graph convolutional neural network.  ...  The regular expressions can also be conditioned with some generation context's choices, some are dedicated to specific language or country for example.  ...  Fixed based layout Fixed based layout are a simple static based combination of existing elements to produce a "clone" of a real invoice and to use it for the generation of many invoices with various data  ... 
doi:10.1109/icdarw.2019.60121 dblp:conf/icdar/BlanchardBB19 fatcat:r3iszqerlnbxrgajhiytydrfh4

Type-Based Optimization for Regular Patterns [chapter]

Michael Y. Levin, Benjamin C. Pierce
2005 Lecture Notes in Computer Science  
Pattern matching mechanisms based on regular expressions feature in a number of recent languages for processing XML.  ...  We describe work in progress on a compilation method based on matching automata, a form of tree automata specialized for pattern compilation [9] , in which we use the schema of the value flowing into a  ...  The work described here aims to integrate type-based optimization techniques with a (high-performance but, so-far, type-insensitive) compilation method for regular patterns based on a flexible tree recognition  ... 
doi:10.1007/11601524_12 fatcat:zb2xa7stgrdifgp55vb6kxpcge

Language Design for Meta-programming in the Software Composition Domain [chapter]

Paul Klint, Jurgen Vinju, Tijs van der Storm
2009 Lecture Notes in Computer Science  
How would a language look like that is specially designed for solving meta-programming problems in the software composition domain?  ...  We present requirements for and design of Rascal, a new language for solving meta-programming problems that fit the Extract-Analyze-SYnthesize (EASY) paradigm.  ...  We start with the original components and extract information from them and record this in an internal representation.  ... 
doi:10.1007/978-3-642-02655-3_1 fatcat:ndrgmk5dprcnxer3zsphvftkom

Automata for XML—A survey

Thomas Schwentick
2007 Journal of computer and system sciences (Print)  
Most parallel models are equivalent with respect to their language recognition power, giving rise to the regular tree languages.  ...  Further, languages definable by restrained-competition extended DTDs can be characterized similarly but with ancestor-sibling strings (giving the information about the ancestors of a node together with  ... 
doi:10.1016/j.jcss.2006.10.003 fatcat:rhcckietinczlgoglqehlg2gza

Hand Gesture Vocalizer for Dumb and Deaf People

Sanish Manandhar, Sushana Bajracharya, Sanjeev Karki, Ashish Kumar Jha
2019 SCITECH Nepal  
A wearable glove controller is design with fl ex sensors attached on each finger, which allows the system to sense the finger movements, and aGy-61 accelerometer, which are uses to sense the hand movement  ...  to describe the information of the image.  ...  Sign Language Recognition System [3] [4] Yang Quan, a Chinese student, defi ned a Basic Sign Language Recognition system that is able to translate a sequence of signs into the commonly used speech language  ... 
doi:10.3126/scitech.v14i1.25530 fatcat:eo6delwdvvaozjauo22hzgjakq

ANTLRWorks: an ANTLR grammar development environment

Jean Bovet, Terence Parr
2008 Software, Practice & Experience  
This AST is then passed between multiple tree walkers to glean information or modify the AST.  ...  The fourth section describes ANTLRWorks' debugger including information on its socket protocol, single stepping and breakpoints, dynamic AST display, and tree parser debugging.  ...  with a context-free lookahead language rather than the weaker regular lookahead language used by LL( * ).  ... 
doi:10.1002/spe.872 fatcat:uxibu66p6vhadoow7git3oy26y

Convolutional Neural Networks for Sentence Classification

Yoon Kim
2014 Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP)  
We show that a simple CNN with little hyperparameter tuning and static vectors achieves excellent results on multiple benchmarks.  ...  We additionally propose a simple modification to the architecture to allow for the use of both task-specific and static vectors.  ...  Tree-CRF: Dependency tree with Conditional Random Fields (Nakagawa et al., 2010) . CRF-PR: Conditional Random Fields with Posterior Regularization (Yang and Cardie, 2014) .  ... 
doi:10.3115/v1/d14-1181 dblp:conf/emnlp/Kim14 fatcat:j6sq43lbz5h3db3ngtl342k66u

DACTYL ALPHABET GESTURE RECOGNITION IN A VIDEO SEQUENCE USING MICROSOFT KINECT

S. G. Artyukhin, L. M. Mestetskiy
2015 The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences  
The experiments were carried out with the developed algorithm on the example of the American Sign Language.  ...  This paper presents an efficient framework for solving the problem of static gesture recognition based on data obtained from the web cameras and depth sensor Kinect (RGB-D - data).  ...  Dactyl sign language -is the language in which each letter and number corresponds to a gesture usually static.  ... 
doi:10.5194/isprsarchives-xl-5-w6-83-2015 fatcat:7cf653swxjgwrjz5533kfyj5q4

Towards Machine Mind Evolution

Ján Kollár, Michal Sičák, Milan Spišiak
2015 Proceedings of the 2015 Federated Conference on Computer Science and Information Systems  
Instead of accumulating acquired information, they are dissolved in the language of a mind. Vice versa, the information can be reconstructed from this language.  ...  We present process of higher order regular abstraction and state automata acceptance as possible machine reality realization mechanism.  ...  We deal with symbolization just marginally in this paper, more information can be found in [11] .  ... 
doi:10.15439/2015f210 dblp:conf/fedcsis/KollarSS15 fatcat:fv3ihudldfdddcykyzvrckqymm
« Previous Showing results 1 — 15 out of 26,516 results