Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Rational series and their languages
Rational series and their languages
Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
Computational Linguistics - Special issue on computational phonology
Automata, Languages, and Machines
Automata, Languages, and Machines
Semirings, Automata and Languages
Semirings, Automata and Languages
Mathematical Theory of L Systems
Mathematical Theory of L Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Automata: Theoretic Aspects of Formal Power Series
Automata: Theoretic Aspects of Formal Power Series
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Compact representations by finite-state transducers
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Weighted rational transductions and their application to human language processing
HLT '94 Proceedings of the workshop on Human Language Technology
Compressed Storage of Sparse Finite-State Transducers
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Applications of Finite-State Transducers in Natural Language Processing
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Multitiered nonlinear morphology using multitape finite automata: a case study on Syriac and Arabic
Computational Linguistics - Special issue on finite-state methods in NLP
Finite-state transducers in language and speech processing
Computational Linguistics
Finite state methods in natural language processing
Natural Language Engineering
On some applications of finite-state automata theory to natural language processing
Natural Language Engineering
Multilingual text analysis for text-to-speech synthesis
Natural Language Engineering
Transducers from rewrite rules with backreferences
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
Compiling regular formalisms with rule features into finite-state automata
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Dynamic compilation of weighted context-free grammars
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Compilation of weighted finite-state transducers from decision trees
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
A Generic Finite State Compiler for Tagging Rules
Machine Translation
Static approximation of dynamically generated Web pages
WWW '05 Proceedings of the 14th international conference on World Wide Web
Parameter estimation for probabilistic finite-state transducers
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Re-engineering letter-to-sound rules
NAACL '01 Proceedings of the second meeting of the North American Chapter of the Association for Computational Linguistics on Language technologies
Generalized algorithms for constructing statistical language models
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Compiling boostexter rules into a finite-state transducer
ACLdemo '04 Proceedings of the ACL 2004 on Interactive poster and demonstration sessions
A bimachine compiler for ranked tagging rules
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Sound and precise analysis of web applications for injection vulnerabilities
Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Efficient dictionary-based text rewriting using subsequential transducers†
Natural Language Engineering
Static detection of cross-site scripting vulnerabilities
Proceedings of the 30th international conference on Software engineering
A UNIFIED APPROACH TO GRAPHEME-TO-PHONEME CONVERSION FOR THE PLATTOS SLOVENIAN TEXT-TO-SPEECH SYSTEM
Applied Artificial Intelligence
Symbolic String Verification: An Automata-Based Approach
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
From Pāninian Sandhi to Finite State Calculus
Sanskrit Computational Linguistics
The Kleene Language for Weighted Finite-State Programming
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
Regular Expressions and Predicate Logic in Finite-State Language Processing
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
xfst2fsa: comparing two finite-state toolboxes
Software '05 Proceedings of the Workshop on Software
Edit-distance of weighted automata
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
From Portuguese to Mirandese: fast porting of a letter-to-sound module using FSTs
PROPOR'03 Proceedings of the 6th international conference on Computational processing of the Portuguese language
A new method for compiling parallel replacement rules
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Embodied conversational agents in Wizard-of-Oz and multimodal interaction applications
COST 2102'07 Proceedings of the 2007 COST action 2102 international conference on Verbal and nonverbal communication behaviours
Rewriting the orthography of sms messages
Natural Language Engineering
Expected sequence similarity maximization
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
A hybrid rule/model-based finite-state framework for normalizing SMS messages
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Mix and match replacement rules
AdaptLRTtoND '09 Proceedings of the Workshop on Adaptation of Language Resources and Technology to New Domains
Formal parameters of phonology: from government phonology to SPE
ESSLLI'08/09 Proceedings of the 2008 international conference on Interfaces: explorations in logic, language and computation
The OpenGrm open-source finite-state grammar software libraries
ACL '12 Proceedings of the ACL 2012 System Demonstrations
| Hi-index | 0.00 |
Context-dependent rewrite rules are used in many areas of natural language and speech processing. Work in computational phonology has demonstrated that, given certain conditions, such rewrite rules can be represented as finite-state transducers (FSTs). We describe a new algorithm for compiling rewrite rules into FSTs. We show the algorithm to be simpler and more efficient than existing algorithms. Further, many of our applications demand the ability to compile weighted rules into weighted FSTs, transducers generalized by providing transitions with weights. We have extended the algorithm to allow for this.