A new kind of finite-state automaton: register vector grammar

Authors:
Glenn David Blank
Affiliations:
Lehigh University, CSEE Department, Bethlehem, PA
Venue:
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Year:
1985

Citing 7
Cited 0

Transition network grammars for natural language analysis

Communications of the ACM
Lexicalized metaphors: a cognitive model in the framework of register vector semantics

Lexicalized metaphors: a cognitive model in the framework of register vector semantics
Bounded context parsing and easy learnability

ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
The representation of constituent structures for finite-state parsing

ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
Syntactic and semantic parsability

ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
Context-freeness and the computer processing of human languages

ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
On the mathematical properties of linguistic theories

ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a type inference method for Prolog programs. The new idea is to describe a superset of the success set by associating a type substitution (an assignment of sets of ground terms to variables) with each head of definite clause. ...