String Generating Hypergraph Grammars with Word Order Restrictions | Zendy

Martin Riedl | Zendy; Sebastian Seifert | Zendy; Ingrid Fischer | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

String Generating Hypergraph Grammars with Word Order Restrictions

Author(s) -

Martin Riedl,

Sebastian Seifert,

Ingrid Fischer

Publication year - 2006

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-38870-2

DOI - 10.1007/11841883_11

Subject(s) - hypergraph , computer science , rule based machine translation , notation , parsing , l attributed grammar , string (physics) , graph , tree adjoining grammar , formalism (music) , theoretical computer science , context free grammar , programming language , artificial intelligence , discrete mathematics , mathematics , arithmetic , mathematical physics , art , musical , visual arts

Discontinuous constituents and free word order pose constant problems in natural language parsing. String generating hypergraph grammars have been proven useful for handling discontinuous constituents. In this paper we describe a new notation for hypergraph productions that allows on-the-fly interconnection of graph parts with regard to user-defined constraints. These constraints handle the order of nodes within the string hypergraph. The HyperEarley parser for string generating hypergraph grammars [1] is adapted to the new formalism. A German example is used for the explanation of the new notation and algorithms.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research