{"type":"ScholarlyArticle","title":"A New Kind of Finite-State Automaton: Register Vector Grammar","authors":[{"name":"Glenn D. Blank","slug":"glenn-d-blank","given":"Glenn D.","family":"Blank","affiliation":""}],"abstract":"Register Vector _ Grammar is a new kind of finite-state automaton · that iS. sensitive to context--without, of course, being contextsensitive in the sense of Chomsky hierarchy . Traditional automata are functionally simple: symbols match by identity and change by replacement . RVG is functionally complex: ternary feature vectors (e.g. +-~-~) match and change by masking (± matches but does not change any value). Functional complexity--as opposed to the computational complexity of non-finite memory--is well sui ted for modeHing multiple and discontinuous constraints. RVG is thus very good at handling the permutations and dependencies of syntax (wh-questions are explored as example). Because center-embedding in natural languages is in fact very shallCM and constrained, context-free power is not needed. RVG can thus be guaranteed to run in a small linear time, because it is FS, and yet can capture generalizations and constraints that functionally simple FS grammars cannot.","doi":null,"url":"https://ijcai.org/proceedings/1985/148","pdf":"https://ijcai.org/proceedings/1985/0148.pdf","markdown":"https://ijcai.org/proceedings/1985/148.md","bibtex":"https://ijcai.org/proceedings/1985/bibtex/148","volume":{"slug":"1985","title":"Proceedings of the Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1985","url":"https://ijcai.org/proceedings/1985/","year":1985,"location":"Los Angeles, California, USA","dates":"","editors":"Aravind Joshi","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Natural Language","track":"Natural Language","number":148,"pages":{"first":749,"last":754},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}