General context-free recognition in less than cubic time
نویسندگان
چکیده
منابع مشابه
General Context-Free Recognition in Less than Cubic Time
An algorithm for general context-free recognition is given that re3 quires less than n time asymptotically fox input strings of length n.
متن کاملAn Error Correcting Parser for Context Free Grammars that Takes Less Than Cubic Time
The problem of parsing has been studied extensively for various formal grammars. Given an input string and a grammar, the parsing problem is to check if the input string belongs to the language generated by the grammar. A closely related problem of great importance is one where the input are a string I and a grammar G and the task is to produce a string I ′ that belongs to the language generate...
متن کاملLess Than General Production System Architectures
Many of the recent expert rule-based systems [Dendra l , Mycin, AM, Pecos] have architectures that d i f fe r s igni f icant ly f rom the simple domainindependent archi tectures of "pure" product ion systems. The purpose of this paper is to explore, somewhat more systematically than has been done be fo re , the various ways in which the simplicity const ra in ts can be relaxed, and the benefits...
متن کاملQuantifiers are incrementally interpreted in context, more than less.
Language interpretation is often assumed to be incremental. However, our studies of quantifier expressions in isolated sentences found N400 event-related brain potential (ERP) evidence for partial but not full immediate quantifier interpretation (Urbach & Kutas, 2010). Here we tested similar quantifier expressions in pragmatically supporting discourse contexts (Alex was an unusual toddler. Most...
متن کاملA Cubic-Time Parsable, Lexicalized Normal Form For Context-Free Grammar That Preserves Tree Structure
Lexicalized context-free grammar (LCFG) is a tree-based formalism that makes use of both tree substitution and a restricted form of tree adjunction. Because of its use of adjunction, LCFG allows su cient freedom in the way derivations can be performed that lexicalization of context-free grammars (CFGs) is possible while preserving the structure of the trees derived by the CFGs. However, the tre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1975
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(75)80046-8