Finite State Temporality and Context-Free Languages
Citation:
Kelleher, Derek and Carl Vogel, Finite State Temporality and Context-Free Languages, 10th International Conference on Computational Semantics (IWCS 2013), Association for Computational Linguistics, 2013, 335--339Download Item:
W13-0206.pdf (PDF) 143.9Kb
Abstract:
In the finite-state temporality approach, events in natural language semantics have been characterized in regular languages, with strings representing sequences of temporal observations. We extend this approach to natural language constructions which are not regular. Context-free constructions are detailed and discussed. Superposition, the key operator in the finite-state temporality approach is investigated for context-free languages. The set of context-free languages is found to not be closed under superposition. However, as with intersection, the superposition of a context-free language and a regular language results in a context-free language. Previous work on subsumption and entailment is inapplicable to context-free languages, due to the undecidability of the subset relation for context-free languages.
Author's Homepage:
http://people.tcd.ie/vogelDescription:
PUBLISHED
Author: VOGEL, CARL
Other Titles:
10th International Conference on Computational Semantics (IWCS 2013)Publisher:
Association for Computational LinguisticsType of material:
Conference PaperCollections:
Availability:
Full text availableKeywords:
finite state automata, regular languages, context free languages, expressivity, temporality, aspectSubject (TCD):
Digital Humanities , Intelligent Content & Communications , Computational linguisticsLicences: