Narrowness, pathwidth and their application in natural language processing

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

[img] 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.

Item Type: ISI Article
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Depositing User: EPrints Admin
Date Deposited: 11 Dec 2012 12:37
Last Modified: 26 Aug 2014 14:47
URI: http://eprints.sztaki.hu/id/eprint/108

Update Item Update Item