Repository landing page
Risteämättömien verkkojen perheiden yleinen aksiomatisointi dependenssijäsentämisessä
Abstract
We present a simple encoding for unlabeled noncrossing graphs and show how its latent counterpart helps us to represent several families of directed and undirected graphs used in syntactic and semantic parsing of natural language as context-free languages. The families are separated purely on the basis of forbidden patterns in latent encoding, eliminating the need to differentiate the families of non-crossing graphs in inference algorithms: one algorithm works for all when the search space can be controlled in parser input.We present a simple encoding for unlabeled noncrossing graphs and show how its latent counterpart helps us to represent several families of directed and undirected graphs used in syntactic and semantic parsing of natural language as context-free languages. The families are separated purely on the basis of forbidden patterns in latent encoding, eliminating the need to differentiate the families of non-crossing graphs in inference algorithms: one algorithm works for all when the search space can be controlled in parser input.Peer reviewe- Conference contribution
- publishedVersion
- 6121 Languages
- dependency graphs
- semantic graphs
- ambiguity
- 113 Computer and information sciences
- homomorphic representations of languages
- context-free parsing
- constrained inference
- dependency graphs
- acyclicity
- connectivity
- ambiguity
- monadic second-order logic
- Courcelle's theorem
- 111 Mathematics
- integer sequences
- OEIS
- enumerative graph theory