Semantic Scholar uses AI to extract papers important to this topic.
Real-world videos of human activities exhibit temporal structure at various scales, long videos are typically composed out of… Expand We provide a simple translation of the satisfiability problem for regular grammar logics with converse into GF2, which is the… Expand Finite-state transducers are models that are being used in different areas of pattern recognition and computational linguistics… Expand Two kinds of framework for stating grammars of natural languages emerged during the 20th century. Here we call them generative… Expand This descriptive reference grammar of Nishnaabemwin (Odawa and Eastern Ojibwe), a major dialect group within contemporary Ojibwe… Expand The identifiers chosen by programmers as function names contain valuable information. They are often the starting point for… Expand The paper describes a parser of sequences of (English) part-of-speech labels which utilises a probabilistic grammar trained using… Expand Recent work has shown that recurrent neural networks have the ability to learn finite state automata from examples. In particular… Expand Abstract This paper describes two applications in speech recognition of the use of stochastic context-free grammars (SCFGs… Expand LR-regular grammars are defined similarly to Knuth's LR(k) grammars, with the following exception: arbitrarily long look-ahead is… Expand