Pages that link to "Item:Q5652221"

The following pages link to A Minimum Distance Error-Correcting Parser for Context-Free Languages (Q5652221):

Displaying 22 items.

• Approximate matching between a context-free grammar and a finite-state automaton (Q259082) (← links)
• The intractability of computing the Hamming distance (Q557834) (← links)
• Approximately matching context-free languages (Q673469) (← links)
• Syntactic error repair using repair patterns (Q689620) (← links)
• Technical analysis for portofolio trading by syntactic pattern recognition (Q810353) (← links)
• Regular algebra applied to language problems (Q817577) (← links)
• Fundamental methodological issues of syntactic pattern recognition (Q903109) (← links)
• A note on some tree similarity measures (Q1166933) (← links)
• The utilization of fuzzy sets in the recognition of imperfect strings (Q1311809) (← links)
• How hard is computing the edit distance? (Q1854409) (← links)
• Edit Distance for Pushdown Automata (Q3449470) (← links)
• A scheme for lr(<i>k</i>) parsing with error recovery part iii: error correction (Q3898041) (← links)
• Hierarchic syntax error repair for LR grammars (Q3959456) (← links)
• If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser (Q4562283) (← links)
• Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product (Q4634027) (← links)
• Incremental parsing in language-based editors: user needs and how to meet them (Q4791067) (← links)
• How hard is to compute the edit distance (Q5055912) (← links)
• Visibly Pushdown Transducers for Approximate Validation of Streaming XML (Q5445303) (← links)
• Input-driven pushdown automata for edit distance neighborhood (Q5918675) (← links)
• Edit distance neighbourhoods of input-driven pushdown automata (Q5920061) (← links)
• Edit distance neighbourhoods of input-driven pushdown automata (Q5920214) (← links)
• String editing under pattern constraints (Q6646447) (← links)