Natural Language Modeling for Phoneme-to-Text Transcription
IEEE Transactions on Pattern Analysis and Machine Intelligence
A general fuzzy-parsing scheme for speech recognition
The NATO Advanced Study Institute on new systems and architectures for automatic speech recognition and synthesis on New systems and architectures for automatic speech recognition and synthesis
Formal languages
Modelling (sub)string-length based constraints through a grammatical inference method
Proc. of the NATO Advanced Study Institute on Pattern recognition theory and applications
Inference of regular grammars via skeletons
IEEE Transactions on Systems, Man and Cybernetics
IEEE Transactions on Pattern Analysis and Machine Intelligence
Approximating grammar probabilities: solution of a conjecture
Journal of the ACM (JACM)
Inference of Reversible Languages
Journal of the ACM (JACM)
Inductive Inference: Theory and Methods
ACM Computing Surveys (CSUR)
Computer Programs for Spelling Correction
Computer Programs for Spelling Correction
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Semantics-Based Inference Algorithms for Adaptive Visual Environments
IEEE Transactions on Software Engineering
Characteristic Sets for Polynomial Grammatical Inference
Machine Learning
Learning Local Languages and Their Application to DNA Sequence Analysis
IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient Error-Correcting Viterbi Parsing
IEEE Transactions on Pattern Analysis and Machine Intelligence
The EuTrans Spoken Language Translation System
Machine Translation
Learning Subsequential Transducers for Pattern Recognition Interpretation Tasks
IEEE Transactions on Pattern Analysis and Machine Intelligence
Even linear simple matrix languages: formal language properties and grammatical inference
Theoretical Computer Science
Inferring Subclasses of Regular Languages Faster Using RPNI and Forbidden Configurations
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Fragmentation: Enhancing Identifiability
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Stochastic k-testable Tree Languages and Applications
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
MLDM '01 Proceedings of the Second International Workshop on Machine Learning and Data Mining in Pattern Recognition
Identification of Function Distinguishable Languages
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
Polynomial-time identification of very simple grammars from positive data
Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
Identification of function distinguishable languages
Theoretical Computer Science
Natural methods for robot task learning: instructive demonstrations, generalization and practice
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Identifying Terminal Distinguishable Languages
Annals of Mathematics and Artificial Intelligence
A fast partial parse of natural language sentences using a connectionist method
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Learning Local Transductions Is Hard
Journal of Logic, Language and Information
Probabilistic Finite-State Machines-Part II
IEEE Transactions on Pattern Analysis and Machine Intelligence
Parsing with Probabilistic Strictly Locally Testable Tree Languages
IEEE Transactions on Pattern Analysis and Machine Intelligence
Identification of biRFSA languages
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Inference of concise DTDs from XML data
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Learning in varieties of the form V*LI from positive data
Theoretical Computer Science
Inferring XML schema definitions from XML data
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Learning deterministic regular expressions for the inference of schemas from XML data
Proceedings of the 17th international conference on World Wide Web
TWO GRAMMATICAL INFERENCE APPLICATIONS IN MUSIC PROCESSING
Applied Artificial Intelligence
Statistical framework for a Spanish spoken dialogue corpus
Speech Communication
Joining linguistic and statistical methods for Spanish-to-Basque speech translation
Speech Communication
Finite State Models for the Generation of Large Corpora of Natural Language Texts
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
An Approach to Estimate Perplexity Values for Language Models Based on Phrase Classes
IbPRIA '09 Proceedings of the 4th Iberian Conference on Pattern Recognition and Image Analysis
Speech-input multi-target machine translation
StatMT '07 Proceedings of the Second Workshop on Statistical Machine Translation
Inference of concise regular expressions and DTDs
ACM Transactions on Database Systems (TODS)
A bibliographical study of grammatical inference
Pattern Recognition
Smoothing and compression with stochastic k-testable tree languages
Pattern Recognition
Segment-based classes for language modeling within the field of CSR
CIARP'07 Proceedings of the Congress on pattern recognition 12th Iberoamerican conference on Progress in pattern recognition, image analysis and applications
A context-free markup language for semi-structured text
PLDI '10 Proceedings of the 2010 ACM SIGPLAN conference on Programming language design and implementation
Learning Deterministic Regular Expressions for the Inference of Schemas from XML Data
ACM Transactions on the Web (TWEB)
Estimating strictly piecewise distributions
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Learning deterministic finite automata from interleaved strings
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Sequences classification by least general generalisations
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Grammatical inference as class discrimination
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Grammatical inference algorithms in MATLAB
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Efficient OCR post-processing combining language, hypothesis and error models
SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition
Rejection threshold estimation for an unknown language model in an OCR task
SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition
Learning finite state machines
FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
A survey of grammatical inference methods for natural language learning
Artificial Intelligence Review
Formal and empirical grammatical inference
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Tutorial Abstracts of ACL 2011
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Using finite state models for the integration of hierarchical LMs into ASR systems
MCPR'11 Proceedings of the Third Mexican conference on Pattern recognition
Malware analysis with tree automata inference
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Aural Pattern Recognition Experiments and the Subregular Hierarchy
Journal of Logic, Language and Information
Towards the improvement of statistical translation models using linguistic features
FinTAL'06 Proceedings of the 5th international conference on Advances in Natural Language Processing
Learning (k,l)-contextual tree languages for information extraction
ECML'05 Proceedings of the 16th European conference on Machine Learning
Learning regular expressions from noisy sequences
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
Estimating the number of segments for improving dialogue act labelling
Natural Language Engineering
Learning analysis by reduction from positive data
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Stochastic K-TSS bi-languages for machine translation
FSMNLP '11 Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing
Learning twig and path queries
Proceedings of the 15th International Conference on Database Theory
Recognizing malicious software behaviors with tree automata inference
Formal Methods in System Design
| Hi-index | 0.15 |
The inductive inference of the class of k-testable languages in the strict sense (k-TSSL) is considered. A k-TSSL is essentially defined by a finite set of substrings of length k that are permitted to appear in the strings of the language. Given a positive sample R of strings of an unknown language, a deterministic finite-state automation that recognizes the smallest k-TSSL containing R is obtained. The inferred automation is shown to have a number of transitions bounded by O(m) where m is the number of substrings defining this k-TSSL, and the inference algorithm works in O(kn log m) where n is the sum of the lengths of all the strings in R. The proposed methods are illustrated through syntactic pattern recognition experiments in which a number of strings generated by ten given (source) non-k-TSSL grammars are used to infer ten k-TSSL stochastic automata, which are further used to classify new strings generated by the same source grammars. The results of these experiments are consistent with the theory and show the ability of (stochastic) k-TSSLs to approach other classes of regular languages.