Representing and Combining Calendar Information by Using Finite-State Transducers
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
An algorithm for adverbial aspect shift
COLING '08 Proceedings of the 22nd International Conference on Computational Linguistics - Volume 1
Information and Computation
IceTAL'10 Proceedings of the 7th international conference on Advances in natural language processing
Regular relations for temporal propositions
Natural Language Engineering
Aspectual shifts with and without type conflict
TbiLLC'09 Proceedings of the 8th international tbilisi conference on Logic, language, and computation
Two string-based finite-state models of the semantics of calendar expressions
FinTAL'06 Proceedings of the 5th international conference on Advances in Natural Language Processing
Finite-State temporal projection
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
TIWTE '11 Proceedings of the TextInfer 2011 Workshop on Textual Entailment
Finite-state representations embodying temporal relations
FSMNLP '11 Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing
Steedman's temporality proposal and finite automata
AC'11 Proceedings of the 18th Amsterdam colloquim conference on Logic, Language and Meaning
| Hi-index | 0.00 |
Events in natural language semantics are characterized in terms of regular languages, each string in which can be regarded as a temporal sequence of observations. The usual regular constructs (concatenation, etc.) are supplemented with superposition, inducing a useful notion of entailment, distinct from that given by models of predicate logic.