Generating grammars for SGML tagged texts lacking DTD

DOI10.1016/S0895-7177(97)00100-3zbMath0894.68166OpenAlexW2033176220MaRDI QIDQ1381728

D. Massart

Publication date: 1 April 1998

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0895-7177(97)00100-3

zbMATH Keywords

machine learningfinite-state automatacontext free grammarstructured documents

Mathematics Subject Classification ID

Computing methodologies for text processing; mathematical typography (68U15)

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient learning of context-free grammars from positive structural examples
• Inference of Reversible Languages
• On the Synthesis of Finite-State Machines from Samples of Their Behavior
• Language identification in the limit

This page was built for publication: Generating grammars for SGML tagged texts lacking DTD