Filters








13,909 Hits in 7.2 sec

Translating regular expression matching into transducers

Yuto Sakuma, Yasuhiko Minamide, Andrei Voronkov
2012 Journal of Applied Logic  
We focus on regular expression matching based on the strategy of Perl and develop a translation from regular expression matching into transducers.  ...  We have implemented the translation and conducted experiments on regular expressions found in several popular PHP programs.  ...  We focus on regular expression matching based on the strategy of Perl and develop a translation from regular expression matching into transducers.  ... 
doi:10.1016/j.jal.2011.11.003 fatcat:6pir66qnonh23cci27q3j3vthe

Checking Time Linearity of Regular Expression Matching Based on Backtracking

Satoshi Sugiyama, Yasuhiko Minamide
2014 IPSJ Online Transactions  
We construct a top-down tree transducer with regular lookahead that translates the input string into a tree corresponding to the execution steps of matching based on backtracking.  ...  The regular expression matching then runs in linear time if the tree transducer is of linear size increase. To check this property of the tree transducer, we apply a result of Engelfriet and Maneth.  ...  We construct a top-down tree transducer with regular lookahead that translates an input string into a tree corresponding to the execution steps of matching based on backtracking.  ... 
doi:10.2197/ipsjtrans.7.82 fatcat:e55skq5uerempaioci36ns6owa

A Flexible Rule Compiler for Speech Synthesis [article]

Wojciech Skut, Stefan Ulrich, Kathrine Hammervold
2004 arXiv   pre-print
The compiler converts a set of rules into a finite-state transducer (FST).  ...  The resulting transducer is guaranteed to realize a function (as opposed to a relation), and therefore can be implemented as a deterministic device (either a deterministic FST or a bimachine).  ...  a regular expression β into a string γ.  ... 
arXiv:cs/0403039v1 fatcat:pt6552ki7raldbbisnp3al4vbi

Tree Transducers, Machine Translation, and Cross-Language Divergences [article]

Alex Rudnick
2012 arXiv   pre-print
Tree transducers are formal automata that transform trees into other trees.  ...  Many varieties of tree transducers have been explored in the automata theory literature, and more recently, in the machine translation literature.  ...  If it is in fact possible to express XDG translation rules as a cascade of transducers, then this would present a clear path for integrating machine learning into the largely rule-based system, making  ... 
arXiv:1203.6136v1 fatcat:2phlkssgqvhohkt33zsbggcoqi

A Novel Machine Translation Method based on Stochastic Finite Automata Model for Spoken English

Huiyan Li
2019 International Journal of Emerging Technologies in Learning (iJET)  
pairs of source and target utterances, our proposed method will produce a series of conventional rules from which a stochastic rational grammar would be inferred, and the grammar is finally converted into  ...  The efficacy and accuracy of our proposed method is evaluated by a large number of English-Chinese and Chinese-English machine translation experi-ments.  ...  for in SFA, the following equation can be gotten: Through stochastic finite-state language transducer , the translation of a source string s can be expressed as follows: The source and target regular languages  ... 
doi:10.3991/ijet.v14i06.10161 fatcat:4osgsbior5fyhfbeod7anrvfuu

A Finite State and Data-Oriented Method for Grapheme to Phoneme Conversion [article]

Gosse Bouma
2000 arXiv   pre-print
A finite-state method, based on leftmost longest-match replacement, is presented for segmenting words into graphemes, and for converting graphemes into phonemes.  ...  The part of FSA's built-in regular expression syntax relevant to this paper, is listed in figure 1.  ...  One particular useful extension of the basic syntax of regular expressions is the replace-operator.  ... 
arXiv:cs/0003074v1 fatcat:heyzhdvo3fcdfklm5xhgybzjp4

A Bimachine Compiler for Ranked Tagging Rules [article]

Wojciech Skut, Stefan Ulrich, Kathrine Hammervold
2004 arXiv   pre-print
The rules are formulated in the framework of regular rewrite operations and allow unrestricted regular expressions in both left and right rule contexts.  ...  This paper describes a novel method of compiling ranked tagging rules into a deterministic finite-state device called a bimachine.  ...  regular expression Σ * λ i ; (c) the substring s k . . . s t matches the regular expression φ i ρ i Σ * .  ... 
arXiv:cs/0407046v1 fatcat:zpoi75dbs5c47hoqzny633ftwi

Accommodating Multiword Expressions in an Arabic LFG Grammar [chapter]

Mohammed A. Attia
2006 Lecture Notes in Computer Science  
Multiword expressions (MWEs) vary in syntactic category, structure, the degree of semantic opaqueness, the ability of one or more constituents to undergo inflection and processes such as passivization,  ...  The expression can be paraphrased by a single word, such as give up which means abandon. 5. Translatability into a single word or into a non-compositional expression.  ...  Building the MWE Transducer A specialized two-sided transducer is build for MWEs using a finite state regular expression (Beesley and Karttunen, 2003) to provide correct analysis on the lexical side  ... 
doi:10.1007/11816508_11 fatcat:udam3e3ybnbejnyjh7u2uo75sq

Terminology finite-state preprocessing for computational LFG

Caroline Brun
1998 Proceedings of the 36th annual meeting on Association for Computational Linguistics -  
We present here how we build the transducers to take terminology into account. We tested the method by parsing a small corpus with and without this treatment of multiword terms.  ...  treats multiword terms as single tokens by modifying the preprocessing stage of the grammar (tokenization and morphological analysis), which consists of a cascade of two-level finite-state automata (transducers  ...  It recognizes these expressions and marks them as units. When more than one expression in the list matches the input, the longest matching expression is marked.  ... 
doi:10.3115/980845.980877 dblp:conf/acl/Brun98 fatcat:mwmjb3rwlzecnmglabrhvy6kta

On the Semantics of Regular Expression Parsing in the Wild [chapter]

Martin Berglund, Brink van der Merwe
2015 Lecture Notes in Computer Science  
We introduce prioritized transducers to formalize capturing groups in regular expression matching in a way that permits straightforward modelling of and comparison with real-world regular expression matching  ...  The broader questions of parsing semantics and performance are discussed, and also the complexity of deciding equivalence of regular expressions with capturing groups.  ...  A regular expression to transducer construction is done in [9] , but it is remarked that translating regular expression matching directly into transducers is highly non-trivial.  ... 
doi:10.1007/978-3-319-22360-5_24 fatcat:4vesfueltbcevea6xr6bavjqay

On the semantics of regular expression parsing in the wild

Martin Berglund, Brink van der Merwe
2017 Theoretical Computer Science  
We introduce prioritized transducers to formalize capturing groups in regular expression matching in a way that permits straightforward modelling of and comparison with real-world regular expression matching  ...  The broader questions of parsing semantics and performance are discussed, and also the complexity of deciding equivalence of regular expressions with capturing groups.  ...  A regular expression to transducer construction is done in [9] , but it is remarked that translating regular expression matching directly into transducers is highly non-trivial.  ... 
doi:10.1016/j.tcs.2016.09.006 fatcat:o5junztigvc57ln7riou46pike

Using HFST for Creating Computational Linguistic Applications [chapter]

Krister Lindén, Erik Axelson, Senka Drobac, Sam Hardwick, Miikka Silfverberg, Tommi A. Pirinen
2013 Studies in Computational Intelligence  
HFST currently collects some of the most important finite-state tools for creating morphologies and spellcheckers into one open-source platform and supports extending and improving the descriptions with  ...  In twolc syntax, prohibition rules such as x:y /<= C1 _ C2 ; can be used to forbid a pair x:y in a context where the left context matches the regular expression C1 and the right context matches C2.  ...  Replace rules can be compiled into a transducer using hfst-regexp2fst. This tool takes a regular expresion as input and gives a corresponding transducer written in a binary file as output.  ... 
doi:10.1007/978-3-642-34399-5_1 fatcat:eclpb2pvw5cmbaeq4vf2sicf6i

Tree Transducers and Formal Methods (Dagstuhl Seminar 13192)

Sebastian Maneth, Helmut Seidl, Marc Herbstritt
2013 Dagstuhl Reports  
These points were addressed in particular: Expressiveness versus Complexity: Which transducers offer the best trade-offs between expressiveness and complexity?  ...  Tree transducers are a classical formalism in computer science, dating back to the early days of compilers and syntax-directed translation.  ...  -Tree Transducers and Formal Methods On the Translations Produced by Multi Bottom-Up Tree Transducers Higher-Order Tree Transducers and Their Expressive Power On the other hand, pushed by the recent  ... 
doi:10.4230/dagrep.3.5.1 dblp:journals/dagstuhl-reports/ManethS13 fatcat:xxotqpzgnzc3zdlkk4zxsdot5i

From Pāṇinian Sandhi to Finite State Calculus [chapter]

Malcolm D. Hyman
2009 Lecture Notes in Computer Science  
Although Pān . ini's notation potentially exceeds a finite state grammar in power, individual rules do not rewrite their own output, and thus they may be automatically translated into a rule cascade from  ...  which a finite state transducer can be compiled.  ...  A rule compiler, however, is described here that translates Pān . inian rules expressed in the XML formalism into rewrite rules that can be automatically compiled into an FST using standard algorithms.  ... 
doi:10.1007/978-3-642-00155-0_10 fatcat:mqwjsxqdtbduhlope7i5iyo3wa

Semantics and algorithms for data-dependent grammars

Trevor Jim, Yitzhak Mandelbaum, David Walker
2010 SIGPLAN notices  
In particular, our new parsing engine handles (1) full scannerless context-free grammars with (2) regular expressions as right-hand sides for defining nonterminals.  ...  We prove the correctness of our translation of data-dependent grammars into these new automata and then show how to implement the automata efficiently using a variation of Earley's parsing algorithm.  ...  Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the NSF or Google.  ... 
doi:10.1145/1707801.1706347 fatcat:m6i5ex3hwnbztjchbizg7wtwkm
« Previous Showing results 1 — 15 out of 13,909 results