Filters








2,539 Hits in 3.3 sec

Formatted Encryption Beyond Regular Languages

Daniel Luchaup, Thomas Shrimpton, Thomas Ristenpart, Somesh Jha
2014 Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security - CCS '14  
These constructions rely on the ability to efficiently map strings accepted by a regular expression to integers and back, called ranking and unranking, respectively.  ...  We describe a new relaxed ranking method, structural ranking, that naturally accommodates practical CFGs, thereby empowering new FPE and FTE designs.  ...  [14] , here we first map strings in the language to one of their parse trees (chosen deterministically), and then we perform a (strict) ranking of parse trees.  ... 
doi:10.1145/2660267.2660351 dblp:conf/ccs/LuchaupSRJ14 fatcat:pj2r5ilowfbufdanscizfztxf4

Definition of Natural Languages Using Context-free Grammer: In Context of Dari Language

Mahmood Asgharzada
2019 American International Journal of Social Science Research  
Modeling assumptions, using formal languages, we can approximate the languages; and better approximation we do, more complexities of formal languages are resolved.  ...  In overall, our skill to decide the grammar type of natural languages performs a significant role in our capability to parse it.  ...  , 2007) .We can approximate natural languages by formal languages simplifying assumptions; better the approximation we need, less relaxed the assumptions we can make and more complex the formal language  ... 
doi:10.46281/aijssr.v4i2.427 fatcat:ehp43phvdzaz5cpmxatzpbmcm4

Stream Processing using Grammars and Regular Expressions [article]

Ulrik Terp Rasmussen
2017 arXiv   pre-print
In the second part we present Kleenex, a language for expressing high-performance streaming string processing programs as regular grammars with embedded semantic actions, and its compilation to streaming  ...  In this dissertation we study regular expression based parsing and the use of grammatical specifications for the synthesis of fast, streaming string-processing programs.  ...  ensures that the underlying grammar is non-self-embedding [10] , and thus its input language is regular.  ... 
arXiv:1704.08820v1 fatcat:twr3ysgyzzg3nap22n6xvepp5i

Semantic Parsing with Bayesian Tree Transducers

Bevan K. Jones, Mark Johnson, Sharon Goldwater
2012 Annual Meeting of the Association for Computational Linguistics  
Many semantic parsing models use tree transformations to map between natural language and meaning representation.  ...  In particular, this paper further introduces a variational Bayesian inference algorithm that is applicable to a wide class of tree transducers, producing state-of-the-art semantic parsing results while  ...  Acknowledgments We thank Joel Lang, Michael Auli, Stella Frank, Prachya Boonkwan, Christos Christodoulopoulos, Ioannis Konstas, and Tom Kwiatkowski for providing the new translations of GeoQuery.  ... 
dblp:conf/acl/JonesJG12 fatcat:qztfzxs7q5gebjxznawhz7swoi

Favor Short Dependencies: Parsing with Soft and Hard Constraints on Dependency Length [chapter]

Jason Eisner, Noah A. Smith
2010 Text, Speech and Language Technology  
The approach with hard bounds, "vine grammar," accepts only a regular language, even though it happily retains a context-free parameterization and defines meaningful parse trees.  ...  In lexicalized phrase-structure or dependency parses, a word's modifiers tend to fall near it in the string. This fact can be exploited by parsers.  ...  The authors thank Mark Johnson, Eugene Charniak, Charles Schafer, Keith Hall, and John Hale for helpful discussion and Elliott Drábek and Markus Dreyer for insights on (respectively) Chinese and German parsing  ... 
doi:10.1007/978-90-481-9352-3_8 fatcat:n3otracsgzgozi6dwe7bemzdja

XUTools: Unix Commands for Processing Next-Generation Structured Text

Gabriel A. Weaver, Sean W. Smith
2012 USENIX Large Installation Systems Administration Conference  
These language-specific structures quite often lie beyond the regular languages upon which Unix textprocessing tools can practically compute.  ...  However, modern practitioners often want to manipulate files in terms of a variety of language-specific constructs-C functions, Cisco IOS interface blocks, and XML elements, to name a few.  ...  We would like to thank Rakesh Bobba and Edmond Rogers for their work to apply these tools in the domain of the power grid.  ... 
dblp:conf/lisa/WeaverS12 fatcat:sfosfkmnifh7tafq5mhbb663ru

High-Speed Application Protocol Parsing and Extraction for Deep Flow Inspection

Alex X. Liu, Chad R. Meiners, Eric Norige, Eric Torng
2014 IEEE Journal on Selected Areas in Communications  
These additions also facilitate fast and stackless approximate parsing of recursive structures.  ...  We compare FlowSifter against both BinPAC and UltraPAC, which represent the state-of-the-art field extractors.  ...  ACKNOWLEDGMENT We would like to thank Sailesh Kumar for describing the importance of the Layer 7 field extraction problem, and for reviewing an earlier version of this paper.  ... 
doi:10.1109/jsac.2014.2358817 fatcat:kh2xlf2u3fchvf4rmyljfgybla

Inducing and Using Alignments for Transition-based AMR Parsing [article]

Andrew Drozdov, Jiawei Zhou, Radu Florian, Andrew McCallum, Tahira Naseem, Yoon Kim, Ramon Fernandez Astudillo
2022 arXiv   pre-print
Parsers also train on a point-estimate of the alignment pipeline, neglecting the uncertainty due to the inherent ambiguity of alignment.  ...  We attain a new state-of-the art for gold-only trained models, matching silver-trained performance without the need for beam search on AMR3.0.  ...  Acknowledgements We are grateful to our colleagues for their help and advice, and to the anonymous reviewers at ACL Rolling Review for their feedback on drafts of this work.  ... 
arXiv:2205.01464v1 fatcat:mcsjxf4z2fcupggwwc75cq7atq

A survey of grammatical inference in software engineering

Andrew Stevenson, James R. Cordy
2014 Science of Computer Programming  
examining the sentences of an unknown language.  ...  Grammatical inference -used successfully in a variety of fields such as pattern recognition, computational biology and natural language processing -is the process of automatically inferring a grammar by  ...  This relaxed merging rule leads to a higher generalization of the final state machine.  ... 
doi:10.1016/j.scico.2014.05.008 fatcat:xwasotc745ekbhaoq2n43vrufm

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  ...  There exist many techniques for imprecise manipulation of source code (robust parsing, error repair, lexical analysis, etc), mostly relying on heuristic-based tolerance.  ...  [20] : parsing of well-defined islands is triggered by feature tokens; • iterative syntactic analysis: an approximate structure is obtained first, then refined; • grammar relaxation [1] : the grammar  ... 
doi:10.1109/csmr-wcre.2014.6747184 dblp:conf/csmr/Zaytsev14 fatcat:ynyggy46c5e2pogabh2rnfstbu

Natural and Flexible Error Recovery for Generated Modular Language Environments

Maartje de Jonge, Lennart C. L. Kats, Eelco Visser, Emma Söderberg
2012 ACM Transactions on Programming Languages and Systems  
Unlike conventional parsing algorithms, scannerless generalized-LR parsing supports the full set of context-free grammars, which is closed under composition, and hence can parse languages composed from  ...  Our approach is language-independent, and relies on automatic derivation of recovery rules from grammars.  ...  Natural and Flexible Error Recovery for Generated Modular Language Environments Acknowledgments.  ... 
doi:10.1145/2400676.2400678 fatcat:t6ur76u545bj7aei37w2lzo6qm

Grammatical Inference in Software Engineering: An Overview of the State of the Art [chapter]

Andrew Stevenson, James R. Cordy
2013 Lecture Notes in Computer Science  
examining the sentences of an unknown language.  ...  Grammatical inference -used successfully in a variety of fields such as pattern recognition, computational biology and natural language processing -is the process of automatically inferring a grammar by  ...  is possible to identify a regular language in polynomial time [3] .  ... 
doi:10.1007/978-3-642-36089-3_12 fatcat:3qp3xzhhqjgwdhguesrjnvotra

Error correction using utterance disambiguation techniques

Peter Vlugter, Edwin van der Ham, Alistair Knott
2006 Australasian Language Technology Association Workshop  
This paper describes a mechanism for identifying errors made by a student during a computer-aided language learning dialogue.  ...  The mechanism generates a set of 'perturbations' of the student's original typed utterance, each of which embodies a hypothesis about an error made by the student.  ...  The relaxation which results in a successful parse provides information about the type of error which has occurred.  ... 
dblp:conf/acl-alta/VlugterHK06 fatcat:ow6xxzkkmnh4pnd6za5qzj76xe

Dependency parsing with an extended finite state approach

Kemal Oflazer
1999 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics -  
A work along the lines of Abney's is that of Kokkinakis and Kokkinakis (1999) for parsing Swedish.  ...  We have applied the parser to dependency parsing of Turkish. for filtering them.  ...  Mercan Karahan, currently of Purdue University, helped substantially with the implementation of the parser and with the experimentation.  ... 
doi:10.3115/1034678.1034722 dblp:conf/acl/Oflazer99 fatcat:xomsyjwatvcvjkh4j3qjiq45di

Dependency Parsing with an Extended Finite-State Approach

Kemal Oflazer
2003 Computational Linguistics  
A work along the lines of Abney's is that of Kokkinakis and Kokkinakis (1999) for parsing Swedish.  ...  We have applied the parser to dependency parsing of Turkish. for filtering them.  ...  Mercan Karahan, currently of Purdue University, helped substantially with the implementation of the parser and with the experimentation.  ... 
doi:10.1162/089120103322753338 fatcat:2k4du3xy7jahbed5oflene5qye
« Previous Showing results 1 — 15 out of 2,539 results