Quasi-Isometric Reductions Between Infinite Strings.
Karen Frilya CelineZiyuan GaoSanjay JainRyan LouFrank StephanGuohua WuPublished in: MFCS (2024)
Keyphrases
- regular languages
- manifold learning
- edit distance
- finite automata
- database
- regular expressions
- context free languages
- decision problems
- euclidean space
- neural network
- feature selection
- information systems
- efficient computation
- context free grammars
- string matching
- grammatical inference
- finite alphabet
- levenshtein distance
- variable length
- finite sets
- approximate string matching
- hamming distance
- low dimensional
- high dimensional
- databases