Kornai, András and Tuza, Zsolt (1992) Narrowness, pathwidth and their application in natural language processing. DISCRETE APPLIED MATHEMATICS, 36 (1). pp. 87-92. ISSN 0166-218X

Text Kornai_159565_ny.pdf Download (138kB)

Abstract

In the syntactic theory of Tesnière (1959) the structural description of sentences are given as graphs. We discuss how the graph-theoretic concept of pathwidth is relevant in this approach. In particular, we point out the importance of graphs with pathwidth ≤6 in connection with natural language processing, and give a short proof of the characterization theorem of trees with pathwidth k. © 1992.

Update Item