Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
string recognition
Description:
The computational task of identifying or classifying sequences of symbols, often using algorithms or formal language models.
Primary topic:
semigroups and automata theory (49%)
Related topics:
semigroups and automata theory (49%),
Handwritten Text Recognition Techniques (8%),
Algorithms and Data Compression (8%),
Neural Networks and Applications (8%)
OpenAlex ID:
keywords/string-recognition
Recognition and parsing of context-free languages in time n3
1967
·
Daniel H. Younger
·
Information and Control
·
1,149
General context-free recognition in less than cubic time
1975
·
Leslie G. Valiant
·
Journal of Computer and System Sciences
·
428
PDF
Induction of Finite-State Languages Using Second-Order Recurrent Networks
1992
·
Raymond L. Watrous
, Gary M. Kuhn
·
Neural Computation
·
152
Fuzzy finite-state automata can be deterministically encoded into recurrent neural networks
1998
·
C.W. Omlin
, K.K. Thornber
, et al.
·
IEEE Transactions on Fuzzy Systems
·
103
Syntax-directed least-errors analysis for context-free languages: a practical approach
1974
·
Gordon Lyon
·
Communications of the ACM
·
96
PDF
Error-tolerant finite-state recognition with applications to morphological analysis and spelling correction
1996
·
OflazerKemal
·
Computational Linguistics
·
94
Parallel Parsing on a One-Way Array of Finite-State Machines
1987
·
Jik H. Chang
, Oscar H. Ibarra
, et al.
·
IEEE Transactions on Computers
·
75
Linear Time Recognition of Squarefree Strings
1985
·
Michael G. Main
, Richard J. Lorentz
·
Springer eBooks
·
66
Generating Optimal Repertoire of Antibody Strings in an Artificial Immune System
2000
·
Sławomir T. Wierzchoń
·
Intelligent Information Systems
·
51
Stochastic Context-Free Grammar Induction with a Genetic Algorithm Using Local Search.
1996
·
Thomas E. Kammeyer
, Richard K. Belew
·
47
The Neural Network Pushdown Automaton: Model, Stack and Learning Simulations
2017
·
Sun, G. Z.
, Giles, C. L.
, et al.
·
arXiv (Cornell University)
·
43
PDF
Theory of neuromata
1998
·
Jiří Šíma
, Jiří Wiedermann
·
Journal of the ACM
·
39
PDF
Parallel time O(log n) recognition of unambiguous context-free languages
1987
·
Wojciech Rytter
·
Information and Computation
·
29
PCoL automata: recognizing strings with P colonies
2010
·
Luděk Cienciala
, Lucie Ciencialová
, et al.
·
Deposito de Investigacion Universidad de Sevilla (University of Seville)
·
27
Deformed fuzzy automata for correcting imperfect strings of fuzzy symbols
2003
·
J. Ramon Garitagoitia
, J.R. Gonzalez de Mendivil
, et al.
·
IEEE Transactions on Fuzzy Systems
·
27
Probabilistic Pattern Matching and the Evolution of Stochastic Regular Expressions
2000
·
Brian J. Ross
·
Applied Intelligence
·
26
Context-free language processing in time n3
1966
·
Daniel H. Younger
·
Annual Symposium on Switching & Automata Theory
·
25
The utilization of fuzzy sets in the recognition of imperfect strings
1992
·
M. Schneider
, H. Lim
, et al.
·
Fuzzy Sets and Systems
·
23
High performance connected digit recognition using maximum mutual information estimation
1991
·
R. Cardin
, Y. Normandin
, et al.
·
IEEE International Conference on Acoustics Speech and Signal Processing
·
23
Effects of Font- and Letter-Specific Experience on the Perceptual Processing of Letters
1992
·
Thomas Sanocki
·
The American Journal of Psychology
·
22
StrCombo: combination of string recognizers
2002
·
Xiangyun Ye
, Mohamed Cheriet
, et al.
·
Pattern Recognition Letters
·
21
VLSI architectures for high speed recognition of context-free languages and finite-state languages
1982
·
King-Hang Chu
, King-Sun Fu
·
ACM SIGARCH Computer Architecture News
·
21
On the complexity of general context-free language parsing and recognition: Extended abstract
1979
·
Walter L. Ruzzo
·
Lecture notes in computer science
·
21
A Method to Reduce Errors of String Recognition Based on Combination of Several Recognition Results with Per-Character Alternatives
2019
·
K.B. Bulatov
, Computer Science and Control"
·
Bulletin of the South Ural State University Series Mathematical Modelling Programming and Computer Software
·
19
PDF
Whale Calf, a parser generator for conjunctive grammars
·
Alexander Okhotin
·
18
Show more works
View as search
Works count:
177
Citation count:
3,045
Year
Topic
Type