Paper: Two-Way Finite Automata And Dependency Grammar: A Parsing Method For Inflectional Free Word Order Languages

ACL ID P84-1080
Title Two-Way Finite Automata And Dependency Grammar: A Parsing Method For Inflectional Free Word Order Languages
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1984
Authors

the restrictions imposed on the head and its dependant in a given subordinate relation. Recall that a constituent consists of the heed - a word regarded as a complex of its relevant properties - and of the dependants - from zero to n (sub) constituents. The traditional parsing categories such as the (deep structure) subject, object, adverbial and adjectival attribute will be modelled as functions f: ~f ->C, where C is the set of constituents and ~)L e C" C is the domain of the function. T The domain of a function f will be defined with a kind of Boolean expression over predicates which test properties of the arguments, i.e. the regent and the potential dependant. In the analysis this relation is used to recognize and interprete an occurance of a -pair in the given relation....