A State-Transition Grammar for Data-Oriented Parsing

1995/02/27 by David Tugwell, Tugwell, David
Arts and Humanities · Computer Science · #Computation and Language (cs.CL) #FOS: Computer and information sciences #Natural Language Processing Techniques #Syntax, Semantics, Linguistic Variation #Topic Modeling #cmp-lg #cs.CL

paper · pdf · doi:10.48550/arxiv.cmp-lg/9502037

Latex 2e, 6 pages, EACL 95 student session

arxiv created 1995/02/27 · openalex publication_date 1995/02/27 · arxiv updated 2016/08/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This paper presents a grammar formalism designed for use in data-oriented approaches to language processing. The formalism is best described as a right-linear indexed grammar extended in linguistically interesting ways. The paper goes on to investigate how a corpus pre-parsed with this formalism may be processed to provide a probabilistic language model for use in the parsing of fresh texts.

Related

• Three Generative, Lexicalised Models for Statistical Parsing
• Data Language Specification via Terminal Attribution
• Robust stochastic parsing using the inside-outside algorithm
• Parsing with Principles and Probabilities
• Probabilistic top-down parsing and language modeling