An efficient context-free parsing algorithm
Communications of the ACM
Transition network grammars for natural language analysis
Communications of the ACM
Introduction to Formal Language Theory
Introduction to Formal Language Theory
A Rational Design for a Weighted Finite-State Transducer Library
WIA '97 Revised Papers from the Second International Workshop on Implementing Automata
Approximating context-free grammars with a finite-state calculus
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
Finite-state approximation of constraint-based grammars using left-corner grammar transforms
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Finite-state approximation of phrase structure grammars
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Precise n-gram probabilities from stochastic context-free grammars
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Left-corner parsing and psychological plausibility
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
Context-free parsing through regular approximation
FSMNLP '09 Proceedings of the International Workshop on Finite State Methods in Natural Language Processing
Stochastic Finite-State Models for Spoken Language MachineTranslation
Machine Translation
An efficient incremental DFA minimization algorithm
Natural Language Engineering
Probabilistic Finite-State Machines-Part II
IEEE Transactions on Pattern Analysis and Machine Intelligence
Creating a finite-state parser with application semantics
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 2
Guided parsing of range concatenation languages
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Parameter estimation for probabilistic finite-state transducers
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
A finite-state approach to machine translation
NAACL '01 Proceedings of the second meeting of the North American Chapter of the Association for Computational Linguistics on Language technologies
Compounding and derivational morphology in a finite-state setting
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Dependency Parsing with an Extended Finite-State Approach
Computational Linguistics
A General Technique to Train Language Models on Language Models
Computational Linguistics
Approximating context-free by rational transduction for example-based MT
DMMT '01 Proceedings of the workshop on Data-driven methods in machine translation - Volume 14
A context-free superset approximation of unification-based grammars
New developments in parsing technology
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
On the existence of regular approximations
Theoretical Computer Science
From ubgs to cfgs a practical corpus-driven approach
Natural Language Engineering
ANTLRWorks: an ANTLR grammar development environment
Software—Practice & Experience
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Parsing with soft and hard constraints on dependency length
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
A natural language interface for a 2D networked game
HCI'07 Proceedings of the 12th international conference on Human-computer interaction: applications and services
Computational linguistics and natural language processing
CICLing'11 Proceedings of the 12th international conference on Computational linguistics and intelligent text processing - Volume Part I
LL(*): the foundation of the ANTLR parser generator
Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
Regular approximation of link grammar
FinTAL'06 Proceedings of the 5th international conference on Advances in Natural Language Processing
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
An extension of complex role inclusion axioms in the description logic SROIQ
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Unsupervised learning on an approximate corpus
NAACL HLT '12 Proceedings of the 2012 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies
A general technique to train language models on language models
Computational Linguistics
| Hi-index | 0.00 |
Several methods are discussed that construct a finite automaton given a context-free grammar, including both methods that lead to subsets and those that lead to supersets of the original context-free language. Some of these methods of regular approximation are new, and some others are presented here in a more refined form with respect to existing literature. Practical experiments with the different methods of regular approximation are performed for spoken-language input: hypotheses from a speech recognizer are filtered through a finite automaton.