Frank Morawietz


2000

pdf bib
Derivational minimalism in two regular and logical steps
Jens Michaelis | Uwe Mönnich | Frank Morawietz
Proceedings of the Fifth International Workshop on Tree Adjoining Grammar and Related Frameworks (TAG+5)

pdf bib
Chart Parsing and Constraint Programming
Frank Morawietz
COLING 2000 Volume 1: The 18th International Conference on Computational Linguistics

pdf bib
Chart Parsing as Constraint Propagation
Frank Morawietz
Proceedings of the Sixth International Workshop on Parsing Technologies

1997

pdf bib
Representing Constraints with Automata
Frank Morawietz | Tom Cornell
35th Annual Meeting of the Association for Computational Linguistics and 8th Conference of the European Chapter of the Association for Computational Linguistics

1995

pdf bib
A Unification-Based ID/LP Parsing Schema
Frank Morawietz
Proceedings of the Fourth International Workshop on Parsing Technologies

In contemporary natural language formalisms like HPSG (Pollard and Sag 1994) the ID/LP format is used to separate the information on dominance from the one on linear precedence thereby allowing significant generalizations on word order. In this paper, we define unification ID/LP grammars. But as mentioned in Seiffert (1991) there are problems concerning the locality of the information determining LP acceptability during parsing. Since one is dealing with partially specified data, the information that is relevant to decide whether the local tree under construction is LP acceptable might be instantiated further during processing. In this paper we propose a modification of the Earley/Shieber algorithm on direct parsing of ID/LP grammars. We extend the items involved to include the relevant underspecified information using it in the completion steps to ensure the acceptability of the resulting structure. Following Sikkel (1993) we define it not as an algorithm, but as a parsing schema to allow the most abstract representation.